Malicious node detection in ad-hoc wireless networks

Advances in wireless communications and the proliferation of mobile computing devices has led to the rise of a new type of computer network: the ad-hoc wireless network. Ad-hoc networks are characterized by a lack of fixed infrastructure, which give ad-hoc networks a great deal of flexibility, but also increases the risk of security problems. In wired networks, key pieces of network infrastructure are secured to prevent unauthorized physical access and tampering. Network administrators ensure that everything is properly configured and are on-hand to fix problems and deal with intrusions. In contrast, the nodes in an ad-hoc network are responsible for routing and forwarding data in the network, and there are no network administrators to handle potential problems. This makes an ad-hoc network more vulnerable to a misconfigured, faulty, or compromised node. We propose a means for a node in an ad-hoc network to detect and handle these malicious nodes by comparing data available to the routing protocol, such as cached routes in Dynamic Source Routing, ICMP messages, and transport layer information, such as TCP timeouts. This data can then be used along with network probes to isolate the malicious node.

[1]  M. Jiang,et al.  Cluster based routing protocol (CBRP) , 1999 .

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

[3]  Heejo Lee,et al.  On the effectiveness of probabilistic packet marking for IP traceback under denial of service attack , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[5]  Jean-Yves Le Boudec,et al.  Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks , 2002, Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing.

[6]  Frank Stajano,et al.  The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks , 1999, Security Protocols Workshop.

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

[8]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[9]  Dharma P. Agrawal,et al.  A novel authentication scheme for ad hoc networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

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

[11]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

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