메뉴 건너뛰기




Volumn 53, Issue 9, 2009, Pages 1512-1529

Privacy-aware routing in sensor networks

Author keywords

Location privacy; Security; Sensor networks; Traceback

Indexed keywords

ADVERSARY MODELS; ENERGY CONSTRAINTS; LOCATION PRIVACY; MAX-MIN; MESSAGE DELIVERIES; MESSAGE FLOWS; MESSAGE ROUTING; PERFORMANCE BOUNDS; RANDOM SCHEDULES; ROUTING SCHEMES; SECURITY; SENSOR NETWORK APPLICATIONS; SIMULATION RESULTS; SOURCE-LOCATION PRIVACIES; TRACEBACK;

EID: 67349099926     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2009.02.002     Document Type: Article
Times cited : (84)

References (36)
  • 1
    • 0034539015 scopus 로고    scopus 로고
    • C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in: MOBICOM, Boston, MA, August 2000.
    • C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in: MOBICOM, Boston, MA, August 2000.
  • 2
    • 67349172373 scopus 로고    scopus 로고
    • B. Karp, H. Kung, Greedy perimeter stateless routing, in: MOBICOM, 2000.
    • B. Karp, H. Kung, Greedy perimeter stateless routing, in: MOBICOM, 2000.
  • 4
    • 0012578438 scopus 로고    scopus 로고
    • Gradient broadcast: A robust, long-live large sensor network
    • Tech. Report, Computer Science Department, UCLA
    • F. Ye, S. Lu, L. Zhang, Gradient broadcast: a robust, long-live large sensor network, in: Tech. Report, Computer Science Department, UCLA, 2001.
    • (2001)
    • Ye, F.1    Lu, S.2    Zhang, L.3
  • 6
    • 27944449345 scopus 로고    scopus 로고
    • P. Kamat, Y. Zhang, W. Trappe, C. Ozturk, Enhancing source-location privacy in sensor network routing, in: ICDCS, Columbus, Ohio, June 2005.
    • P. Kamat, Y. Zhang, W. Trappe, C. Ozturk, Enhancing source-location privacy in sensor network routing, in: ICDCS, Columbus, Ohio, June 2005.
  • 8
    • 51349086896 scopus 로고    scopus 로고
    • M. Shao, Y. Yang, S. Zhu, G. Cao, Towards statistically strong source anonymity for sensor networks, in: IEEE INFOCOM, Phoenix, AZ, April 2008.
    • M. Shao, Y. Yang, S. Zhu, G. Cao, Towards statistically strong source anonymity for sensor networks, in: IEEE INFOCOM, Phoenix, AZ, April 2008.
  • 9
    • 0019532104 scopus 로고
    • Untraceable electronic mail, return addresses and digital pseudonyms
    • D. Chaum, Untraceable electronic mail, return addresses and digital pseudonyms, Communications of the ACM (CACM) 24(2) (1981) 84-88.
    • (1981) Communications of the ACM (CACM) , vol.24 , Issue.2 , pp. 84-88
    • Chaum, D.1
  • 14
    • 0030644696 scopus 로고    scopus 로고
    • I. Goldberg, D. Wagner, E.A. Brewer, Privacy-enhancing technologies for the internet, in: IEEE COMPCON, February 1997.
    • I. Goldberg, D. Wagner, E.A. Brewer, Privacy-enhancing technologies for the internet, in: IEEE COMPCON, February 1997.
  • 15
    • 67349135475 scopus 로고    scopus 로고
    • M. Wright, M. Adler, B. Levine, C. Shields, An analysis of the degradation of anonymous protocols, in: Proceedings of the ISOC Symposium Network and Distributed System Security (NDSS), February 2002, pp. 38-50, outstanding Paper Award. [Online]. Available: .
    • M. Wright, M. Adler, B. Levine, C. Shields, An analysis of the degradation of anonymous protocols, in: Proceedings of the ISOC Symposium Network and Distributed System Security (NDSS), February 2002, pp. 38-50, outstanding Paper Award. [Online]. Available: .
  • 17
    • 26444574670 scopus 로고    scopus 로고
    • C. Karlof, N. Sastry, D. Wagner, Tinysec: a link layer security architecture for wireless sensor networks, in: SENSYS, Baltimore, MD, November 2004.
    • C. Karlof, N. Sastry, D. Wagner, Tinysec: a link layer security architecture for wireless sensor networks, in: SENSYS, Baltimore, MD, November 2004.
  • 18
    • 24944474308 scopus 로고    scopus 로고
    • A pairwise key pre-distribution scheme for wireless sensor networks
    • W. Du, J. Deng, A pairwise key pre-distribution scheme for wireless sensor networks, in: ACM CCS, 2003.
    • (2003) ACM CCS
    • Du, W.1    Deng, J.2
  • 19
    • 0038341106 scopus 로고    scopus 로고
    • A key-management scheme for distributed sensor networks
    • November
    • L. Eschenauer, V. Gligor, A key-management scheme for distributed sensor networks, in: ACM CCS, November 2002.
    • (2002) ACM CCS
    • Eschenauer, L.1    Gligor, V.2
  • 20
    • 3042822764 scopus 로고    scopus 로고
    • Establishing pairwise keys in distributed sensor networks
    • Washington, DC, October
    • D. Liu, P. Ning, Establishing pairwise keys in distributed sensor networks, in: ACM CCS, Washington, DC, October 2003.
    • (2003) ACM CCS
    • Liu, D.1    Ning, P.2
  • 21
    • 25844435733 scopus 로고    scopus 로고
    • H. Chan, A. Perrig, Pike: peer intermediaries for key establishment in sensor networks, in: INFOCOM, Miami, FL, March 2005.
    • H. Chan, A. Perrig, Pike: peer intermediaries for key establishment in sensor networks, in: INFOCOM, Miami, FL, March 2005.
  • 27
    • 27944485356 scopus 로고    scopus 로고
    • X. Fu, Y. Zhu, B. Graham, R. Bettati, W. Zhao, On flow marking attacks in wireless anonymous communication networks, in: ICDCS, 2005, pp. 493-503.
    • X. Fu, Y. Zhu, B. Graham, R. Bettati, W. Zhao, On flow marking attacks in wireless anonymous communication networks, in: ICDCS, 2005, pp. 493-503.
  • 28
    • 4544367290 scopus 로고    scopus 로고
    • C. Ozturk, Y. Zhang, W. Trappe, Source-location privacy for networks of energy-constrained sensors, in: WSTFEUS, 2004.
    • C. Ozturk, Y. Zhang, W. Trappe, Source-location privacy for networks of energy-constrained sensors, in: WSTFEUS, 2004.
  • 29
    • 0015955981 scopus 로고
    • Disjoint paths in a network
    • Suurballe J. Disjoint paths in a network. Network 4 (1974) 125-145
    • (1974) Network , vol.4 , pp. 125-145
    • Suurballe, J.1
  • 30
    • 0021441708 scopus 로고
    • A quick method for finding shortest pairs of disjoint paths
    • Suurballe J., and Tarjan R. A quick method for finding shortest pairs of disjoint paths. Network 14 (1984) 325-336
    • (1984) Network , vol.14 , pp. 325-336
    • Suurballe, J.1    Tarjan, R.2
  • 31
    • 0030691639 scopus 로고    scopus 로고
    • Optimal physical diversity algorithms and survivable networks
    • IEEE, Washington, DC, USA
    • Bhandari R. Optimal physical diversity algorithms and survivable networks. ISCC (1997), IEEE, Washington, DC, USA
    • (1997) ISCC
    • Bhandari, R.1
  • 32
    • 23044468851 scopus 로고    scopus 로고
    • Finding minimum energy disjoint paths in wireless ad-hoc networks
    • Srinivas A., and Modiano E. Finding minimum energy disjoint paths in wireless ad-hoc networks. Wireless Network 11 (2005) 401-417
    • (2005) Wireless Network , vol.11 , pp. 401-417
    • Srinivas, A.1    Modiano, E.2
  • 33
    • 8344283535 scopus 로고    scopus 로고
    • R. Andersen, F. Chung, A. Sen, G. Xue, On disjoint path pairs with wavelength continuity constraint in wdm networks, in: INFOCOM, 2004.
    • R. Andersen, F. Chung, A. Sen, G. Xue, On disjoint path pairs with wavelength continuity constraint in wdm networks, in: INFOCOM, 2004.
  • 34
    • 33748053069 scopus 로고    scopus 로고
    • Interference-aware topology control and qos routing in multi-channel wireless mesh networks
    • J. Tang, G. Xue, W. Zhang, Interference-aware topology control and qos routing in multi-channel wireless mesh networks, in: ACM MobiHoc, 2005.
    • (2005) ACM MobiHoc
    • Tang, J.1    Xue, G.2    Zhang, W.3


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