Inherent security of routing protocols in ad-hoc and sensor networks

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2007, Pages 1273-1278

  Roosta, Tanya ^a   Pai, Sameer ^b   Chen, Phoebus ^a   Sastry, Shankar ^a   Wicker, Stephen ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b School of Operations Research and Industrial Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SINGLE-PATH ROUTING; WIRELESS AD-HOC NETWORKS;

AD HOC NETWORKS; SECURITY OF DATA; SET THEORY; WIRELESS SENSOR NETWORKS;

ROUTING PROTOCOLS;

EID: 39349109631     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2007.245     Document Type: Conference Paper

References (15)

1. Y.-C. Hu, A. Perrig, and D. B. Johnson, "Ariadne: A secure on-demand routing protocol for ad hoc networks," Wireless Networks, 2005.
2. C. Hartung, J. Balasalle, and R. Han, "Node compromise in sensor networks: The need for secure systems," Department of Computer Science University of Colorado at Boulder, Tech. Rep., 2005.
3. J. N. Al-Karaki and A. E. Kamal, "Routing techniques in wireless sensor networks: A survey," IEEE Wireless Communications, 2004.
4. W. Weber, J. Rabaey, and E. Aarts, Eds., Ambient Intelligence. Springer-Verlag, 2005, ch. TinyOS: An Operating System for Sensor Networks.
5. A. Woo, T. Tong, and D. Culler, "Taming the under-lying challenges of reliable multihop routing in sensor networks," in SenSys, 2003.
6. G. Toile, "A network management system for wireless sensor networks," Master's thesis, Univ. of California, Berkeley 2005.
7. T. Roosta and S. Sastry, "Probabilistic geographic routing protocol for ad hoc and sensor networks," in International Workshop on Wireless Ad-hoc Networks (IWWAN), 2005.
8. S. D. Servetto and G. Barrenechea, "Constrained random walks on random graphs: Routing algorithms for large scale wireless sensor networks," in 1st ACM International Workshop on Wireless Sensor Networks and Applications, 2002.
9. Y. Ganjali and A. Keshavarzian, "Load balancing in ad hoc networks: Single-path routing vs. multi-path routing," in INFOCOM, 23rd Annual Joint Conference of the IEEE Computer and Communications Societies, 2004.
10. V. A. Kaustov, E. Litvak, and I. Ushakov, "The computational effectiveness of reliability estimates by the method of nonedge-intersecting chains and cuts," Soviet Journal on Computing and Systems Science, 1986.
11. S. Arora, H. Lee, and R. Thurimella, "Algorithms for finding disjoint paths in mobile networks."
12. P. Papadimitratos, Z. J. Haas, and E. G. Sirer, "Path set selection in mobile ad hoc networks," in MobiHoc '02: Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing, 2002.
13. C. L. Barrett, S. J. Eidenbenz, L. Kroc, M. Marathe, and J. P. Smith, "Parametric probabilistic sensor network routing," in WSNA '03: Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications, 2003.
14. Y. Sasson, D. Cavin, and A. Schiper, "Probabilistic broadcast for flooding in wireless mobile ad hoc networks," in Proceedings of IEEE Wireless Communications and Networking (WCNC), 2003.
15. th IEEE International Conference on Distributed Computing Systems, 2005.