메뉴 건너뛰기




Volumn , Issue , 2006, Pages 13-22

Achieving privacy in mesh networks

Author keywords

Mesh networks; Privacy

Indexed keywords

CHANNEL CAPACITY; INFORMATION DISSEMINATION; NETWORK MANAGEMENT; ROUTING ALGORITHMS; WIRELESS NETWORKS;

EID: 34547484913     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1180345.1180348     Document Type: Conference Paper
Times cited : (41)

References (30)
  • 2
    • 0242440348 scopus 로고    scopus 로고
    • J. Jangeun and M.L. Sichitiu, The nominal capacity of wireless mesh networks, In IEEE Wireless Communications, 10 of 5, pages 8-14, Oct. 2003.
    • J. Jangeun and M.L. Sichitiu, The nominal capacity of wireless mesh networks, In IEEE Wireless Communications, volume 10 of 5, pages 8-14, Oct. 2003.
  • 3
    • 24144489900 scopus 로고    scopus 로고
    • Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
    • A. Raniwala, K. Gopalan, and T. Chiueh, Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks, SIGMOBILE Mobile Comput. Commun. Rev., 8(2), 2004.
    • (2004) SIGMOBILE Mobile Comput. Commun. Rev , vol.8 , Issue.2
    • Raniwala, A.1    Gopalan, K.2    Chiueh, T.3
  • 4
    • 1642289265 scopus 로고    scopus 로고
    • Mesh wireless networking
    • Oct.-Nov
    • K. Rayner, Mesh wireless networking, Communications Engineer, 1(5):44-47, Oct.-Nov. 2003.
    • (2003) Communications Engineer , vol.1 , Issue.5 , pp. 44-47
    • Rayner, K.1
  • 5
  • 6
    • 14244254122 scopus 로고    scopus 로고
    • url
    • IEEE Std 802.11b-1999, url = http://standards.ieee.org/getieee802/ 802.11.html.
    • IEEE Std 802.11b-1999
  • 7
    • 0019532104 scopus 로고
    • Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms
    • D. L. Chaum, Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms, Communications of the ACM, 24(2):84-88, 1981.
    • (1981) Communications of the ACM , vol.24 , Issue.2 , pp. 84-88
    • Chaum, D.L.1
  • 15
    • 34547399878 scopus 로고    scopus 로고
    • RFC, url
    • OPSF Version 2, RFC, url = http://www.faqs.org/rfcs/rfc2328.html.
    • OPSF Version 2
  • 17
    • 0000629443 scopus 로고    scopus 로고
    • Dynamic Source Routing in Ad Hoc Wireless Networks
    • D. Johnson and D. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks, in Proc. of ACM SIGCOMM, 1996.
    • (1996) Proc. of ACM SIGCOMM
    • Johnson, D.1    Maltz, D.2
  • 18
    • 84961572484 scopus 로고    scopus 로고
    • Y.-C. Hu, D. B. Johnson, and A. Perrig, SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks, in Proc. of the 4 IEEE WMCSA 2002, June 2002, pp. 3-13. Submitted for publication.
    • Y.-C. Hu, D. B. Johnson, and A. Perrig, SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks, in Proc. of the 4 IEEE WMCSA 2002, June 2002, pp. 3-13. Submitted for publication.
  • 19
    • 0036957315 scopus 로고    scopus 로고
    • Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks
    • Y.-C. Hu, D. B. Johnson, and A. Perrig, Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks, in Proc. of MOBICOM'02, 2002.
    • (2002) Proc. of MOBICOM'02
    • Hu, Y.-C.1    Johnson, D.B.2    Perrig, A.3
  • 26
    • 25844443821 scopus 로고    scopus 로고
    • Anonymous Communications in Mobile Ad Hoc Networks
    • Y. Zhang, W. Liu, and W. Luo, Anonymous Communications in Mobile Ad Hoc Networks, in Proceedings of INFOCOM, 2005.
    • (2005) Proceedings of INFOCOM
    • Zhang, Y.1    Liu, W.2    Luo, W.3
  • 28
    • 22944492132 scopus 로고    scopus 로고
    • AO2P: Ad hoc On-demand Position-based Private Routing Protocol
    • X. Wu and B. Bhargava, AO2P: Ad hoc On-demand Position-based Private Routing Protocol, IEEE Transactions on Mobile Computing, Vol. 4, No. 4, Pages 335-348, 2005.
    • (2005) IEEE Transactions on Mobile Computing , vol.4 , Issue.4 , pp. 335-348
    • Wu, X.1    Bhargava, B.2
  • 29
    • 0023861309 scopus 로고
    • The Dining Cryptographers Problem: Unconditional Sender and Receipient Untraceability
    • D. Chaum, The Dining Cryptographers Problem: Unconditional Sender and Receipient Untraceability, Journal of Cryptography, Vol. 24, No. 2, Pages 65-75, 1988.
    • (1988) Journal of Cryptography , vol.24 , Issue.2 , pp. 65-75
    • Chaum, D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.