Attacks and Defenses of Routing Mechanisms in Ad Hoc and Sensor Networks

An ad hoc or a sensor network is composed of a collection of wireless nodes. A node can only communicate with other nodes within its limited transmission range. To facilitate communication between two nodes without a direct communication link, routing protocols must be developed to support multi-hop communication. Although many routing protocols have been proposed for ad hoc and sensor networks, most of them assume that other nodes are trustable and thus do not consider the security and attack issues. To assure a source node of finding a route to its destination, most routing protocols try to invite all available nodes to participate in the routing mechanism. This provides a lot of opportunities for attackers to destroy the routing mechanism. In this chapter, we briefly introduce some existing routing protocols, discuss the weaknesses of these protocols and possible types of attacks, and provide a comprehensive survey of recent research on defense approaches to these attacks.

[1]  Xiaoyan Hong,et al.  Scalable routing protocols for mobile ad hoc networks , 2002, IEEE Netw..

[2]  Albert Levi,et al.  Sensor wars: detecting and defending against spam attacks in wireless sensor networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[3]  Tohru Kikuno,et al.  A routing protocol for finding two node-disjoint paths in computer networks , 1995, Proceedings of International Conference on Network Protocols.

[4]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[5]  A. Laouiti,et al.  Optimized link state routing protocol for ad hoc networks , 2001, Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century..

[6]  Elaine Shi,et al.  The Sybil attack in sensor networks: analysis & defenses , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[7]  Dharma P. Agrawal,et al.  Routing security in wireless ad hoc networks , 2002, IEEE Commun. Mag..

[8]  Sushil Jajodia,et al.  LEAP+: Efficient security mechanisms for large-scale distributed sensor networks , 2006, TOSN.

[9]  Devika Subramanian,et al.  An efficient multipath forwarding method , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[10]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[11]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[12]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[13]  H. Chris Tseng,et al.  Sinkhole intrusion indicators in DSR MANETs , 2004, First International Conference on Broadband Networks.

[14]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[15]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[16]  Mario Gerla,et al.  Fisheye state routing: a routing scheme for ad hoc wireless networks , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[17]  Yih-Chun Hu,et al.  SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks , 2003, Ad Hoc Networks.

[18]  Anthony Ephremides,et al.  A distributed routing algorithm for mobile wireless networks , 1995, Wirel. Networks.

[19]  Yih-Chun Hu,et al.  Packet leashes: a defense against wormhole attacks in wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[20]  Richard G. Ogier,et al.  A reliable, efficient topology broadcast protocol for dynamic networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[21]  Hugo Krawczyk,et al.  HMAC: Keyed-Hashing for Message Authentication , 1997, RFC.

[22]  Chai-Keong Toh,et al.  Associativity-Based Routing for Ad Hoc Mobile Networks , 1997, Wirel. Pers. Commun..

[23]  Haiyun Luo,et al.  Self-securing ad hoc wireless networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[24]  Yu-Chee Tseng,et al.  GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks , 2001, Telecommun. Syst..

[25]  Hisashi Kobayashi,et al.  Highly secure and efficient routing , 2004, IEEE INFOCOM 2004.

[26]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[27]  C. Karlof,et al.  Secure routing in wireless sensor networks: attacks and countermeasures , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[28]  Adrian Perrig,et al.  Security and Privacy in Sensor Networks , 2003, Computer.

[29]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[30]  Dawn Xiaodong Song,et al.  Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..

[31]  Yih-Chun Hu,et al.  Rushing attacks and defense in wireless ad hoc network routing protocols , 2003, WiSe '03.

[32]  Tomasz Imielinski,et al.  GeoCast—geographic addressing and routing , 1997, MobiCom '97.

[33]  Virgil D. Gligor,et al.  A key-management scheme for distributed sensor networks , 2002, CCS '02.

[34]  Yih-Chun Hu,et al.  Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks , 2005, Wirel. Networks.