Secure routing in wireless sensor networks: Attacks and countermeasures

Proceedings of the 1st IEEE International Workshop on Sensor Network Protocols and Applications, SNPA 2003

Volumn , Issue , 2003, Pages 113-127

  Karlof, C ^a   Wagner, D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithm design and analysis; Intelligent networks; Peer to peer computing; Portable computers; Proposals; Routing protocols; Sensor systems; Temperature sensors; Wireless communication; Wireless sensor networks

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; INTELLIGENT NETWORKS; MICROCOMPUTERS; NETWORK PROTOCOLS; NETWORK ROUTING; PEER TO PEER NETWORKS; ROUTING PROTOCOLS; TEMPERATURE SENSORS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

ALGORITHM DESIGN AND ANALYSIS; PEER-TO-PEER COMPUTING; PORTABLE COMPUTERS; PROPOSALS; SENSOR SYSTEMS; WIRELESS COMMUNICATIONS;

NETWORK SECURITY;

EID: 84942426861     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SNPA.2003.1203362     Document Type: Conference Paper

References (45)

1. Y.-C. Hu, A. Perrig, and D. B. Johnson, "Wormhole detection in wireless ad hoc networks," Department of Computer Science, Rice University, Tech. Rep. TR01-384, June 2002.
2. J. R. Douceur, "The Sybil Attack," in 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), March 2002.
3. J. Hill, R. Szewczyk, A. Woo, S. Hollar, D. Culler, and K. Pister, "System architecture directions for networked sensors," in Proceedings of ACM ASPLOS IX, November 2000.
4. V. D. Park and M. S. Corson, "A highly adaptive distributed routing algorithm for mobile wireless networks," in IEEE INFOCOM '97, 1997, pp. 1405-1413.
5. C. Perkins and E. Royer, "Ad-hoc on-demand distance vector routing," in MILCOM '97 panel on Ad Hoc Networks, 1997.
6. D. B. Johnson and D. A. Maltz, "Dynamic source routing in ad hoc wireless networks," in Mobile Computing, Imielinski and Korth, Eds. Kluwer Academic Publishers, 1996, vol. 353.
7. C. Perkins and P. Bhagwat, "Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers," in ACM/SIGCOMM'94 Conference on Communications Architectures, Protocols and Applications, 1994, pp. 234-244.
8. L. Zhou and Z. Haas, "Securing ad hoc networks," IEEE Network Magazine, vol. 13, no. 6, November/December 1999.
9. F. Stajano and R. J. Anderson, "The resurrecting duckling: Security issues for ad-hoc wireless networks," in Seventh International Security Protocols Workshop, 1999, pp. 172-194.
10. J. Hubaux, L. Buttyan, and S. Capkun, "The quest for security in mobile ad hoc networks," in Proceedings of the ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC 2001), 2001.
11. J. Kong, P. Zerfos, H. Luo, S. Lu, and L. Zhang, "Providing robust and ubiquitous security support for mobile ad-hoc networks," in ICNP, 2001, pp. 251-260.
12. M. G. Zapata, "Secure ad-hoc on-demand distance vector (SAODV) routing," IETF MANET Mailing List, Message-ID: 3BC17B40.BBF52E09@nokia.com, Available at ftp://manet.itd.nrl.navy.mil/pub/manet/2001-10.mail, October 8, 2001.
13. H. Luo, P. Zefros, J. Kong, S. Lu, and L. Zhang, "Self-securing ad hoc wireless networks," in Seventh IEEE Symposium on Computers and Communications (ISCC '02), 2002.
14. J. Binkley and W. Trost, "Authenticated ad hoc routing at the link layer for mobile systems," Wireless Networks, vol. 7, no. 2, pp. 139-145, 2001.
15. B. Dahill, B. N. Levine, E. Royer, and C. Shields, "A secure routing protocol for ad-hoc networks," Electrical Engineering and Computer Science, University of Michigan, Tech. Rep. UM-CS-2001-037, August 2001.
16. J. Kong, H. Luo, K. Xu, D. L. Gu, M. Gerla, and S. Lu, "Adaptive security for multi-layer ad-hoc networks," Special Issue of Wireless Communications and Mobile Computing, Wiley Interscience Press, 2002.
17. Y.-C. Hu, D. B. Johnson, and A. Perrig, "SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks," in Proceedings of the 4th IEEE Workshop on Mobile Computing Systems and Applications (WMCSA 2002), June 2002, pp. 3-13.
18. Y.-C. Hu, A. Perrig, and D. B. Johnson, "Ariadne: A secure on-demand routing protocol for ad hoc networks," Department of Computer Science, Rice University, Tech. Rep. TR01-383, December 2001.
19. S. Basagni, K. Herrin, E. Rosti, and D. Bruschi, "Secure pebblenets," in ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2001), October 2001, pp. 156-163.
20. P. Papadimitratos and Z. Haas, "Secure routing for mobile ad hoc networks," in SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), January 2002.
21. S. Marti, T. J. Giuli, K. Lai, and M. Baker, "Mitigating routing misbehavior in mobile ad hoc networks," in Sixth annual ACM/IEEE Internation Conference on Mobile Computing and Networking, 2000, pp. 255-265.
22. S. Buchegger and J.-Y. L. Boudec, "Nodes bearing grudges: Towards routing security, fairness, and robustness in mobile ad hoc networks," in Proceedings of the Tenth Euromicro Workshop on Parallel, Distributed and Network-based Processing. Canary Islands, Spain: IEEE Computer Society, January 2002, pp. 403-410.
23. A. Perrig, R. Szewczyk, V. Wen, D. Culler, and J. Tygar, "SPINS: Security protocols for sensor networks," in Proceedings of Mobile Networking and Computing 2001, 2001.
24. Castro and Liskov, "Practical byzantine fault tolerance," in OSDI: Symposium on Operating Systems Design and Implementation. USENIX Association, Co-sponsored by IEEE TCOS and ACM SIGOPS, 1999.
25. A. Banerjea, "A taxonomy of dispersity routing schemes for fault tolerant real-time channels," in Proceedings of ECMAST, vol. 26, May 1996, pp. 129-148.
26. K. Ishida, Y. Kakuda, and T. Kikuno, "A routing protocol for finding two node-disjoint paths in computer networks," in Internation Conference on Network Protocols, November 1992, pp. 340-347.
27. Y. Xu, J. Heidemann, and D. Estrin, "Geography-informed energy conservation for ad hoc routing," in Proceedings of the Seventh Annual ACM/IEEE International Conference on Mobile Computing and Networking, 2001.
28. B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, "Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks," ACM Wireless Networks Journal, vol. 8, no. 5, September 2002.
29. C. Intanagonwiwat, R. Govindan, and D. Estrin, "Directed diffusion: A scalable and robust communication paradigm for sensor networks," in Proceedings of the Sixth Annual International Conference on Mobile Computing and Networks (MobiCOM '00), August 2000.
30. D. Ganesan, R. Govindan, S. Shenker, and D. Estrin, "Highly-resilient, energy-efficient multipath routing in wireless sensor networks," Mobile Computing and Communications Review, vol. 4, no. 5, October 2001.
31. Y. Yu, R. Govindan, and D. Estrin, "Geographical and energy aware routing: A recursive data dissemination protocol for wireless sensor networks," University of California at Los Angeles Computer Science Department, Tech. Rep. UCLA/CSD-TR-01-0023, May 2001.
32. B. Karp and H. T. Kung, "GPSR: greedy perimeter stateless routing for wireless networks," in Mobile Computing and Networking, 2000, pp. 243-254.
33. F. Ye, A. Chen, S. Lu, and L. Zhang, "A scalable solution to mininum cost forwarding in large sensor networks," in Tenth Internation Conference on Computer Communications and Networks, 2001, pp. 304-309.
34. W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-efficient communication protocol for wireless microsensor networks," in 33rd Annual Hawaii International Conference on System Sciences, 2000, pp. 3005-3014.
35. D. Braginsky and D. Estrin, "Rumour routing algorithm for sensor networks," in First ACM International Workshop on Wireless Sensor Networks and Applications, 2002.
36. D. Ganesan, B. Krishnamachari, A. Woo, D. Culler, D. Estrin, and S. Wicker, "An empirical study of epidemic algorithms in large scale multihop wireless networks," Intel Research, Tech. Rep. IRB-TR-02-003, March 2002.
37. J. Kulik, W. R. Heinzelman, and H. Balakrishnan, "Negotiation-based protocols for disseminating information in wireless sensor networks," Wireless Networks, vol. 8, no. 2-3, pp. 169-185, 2002.
38. M.-J. Lin, K. Marzullo, and S. Masini, "Gossip versus deterministic flooding: Low message overhead and high reliability for broadcasting on small networks, Tech. Rep. CS1999-0637, 18, 1999.
39. L. Li, J. Halpern, and Z. Haas, "Gossip-based ad hoc routing," in IEEE Infocom 2002, 2002.
40. F. Ye, S. Lu, and L. Zhang, "GRAdient broadcast: A robust, long-live large sensor network," University of California at Los Angeles Computer Science Department, Tech. Rep., 2001.
41. D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, "Next century challenges: Scalable coordination in sensor networks," in 5th annual ACM/IEEE International Conference on Mobile Computing and Networking, 1999, pp. 263-270.
42. A. Manjeshwar and D. Agrawal, "TEEN: A routing protocol for enhanced effeciency in wireless sensor networks," in 1st International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing, 2001.
43. S. Lindsey and C. Raghavendra, "PEGASIS: Power-efficient gathering in sensor information systems," in IEEE Aerospace Conference, March 2002.
44. Y. Xu, J. Heidemann, and D. Estrin, "Energy conservation by adaptive clustering for ad-hoc networks," in Poster Session of MobiHoc 2002, 2002.
45. Y. X. et al., "Adaptive energy-conserving routing for multihop ad hoc networks," USC/ISI, Research Report TR-2000-527, October 2000.