Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
An on-demand secure routing protocol resilient to byzantine failures
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
Using Conservation of Flow as a Security Mechanism in Network Protocols
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Stimulating cooperation in self-organizing mobile ad hoc networks
Mobile Networks and Applications
An advanced signature system for OLSR
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Sustaining cooperation in multi-hop wireless networks
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Detecting disruptive routers: a distributed network monitoring approach
IEEE Network: The Magazine of Global Internetworking
A routing protocol suitable for backhaul access in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Currently emerging standard routing protocols for MANETs do not perform well in presence of malicious nodes that intentionally drop data traffic but otherwise behave correctly with respect to control messages of the routing protocol. In this paper, we address the problem of coping with the presence of such nodes in networks that use a linkstate routing protocol. The solution, based on the verification of the principle of flow conservation, is purely protocolar and does not rely on any specific underlying OSI layer 1 or 2 technical feature. In addition, it is well suited for integration into existing link-state routing protocols for ad hoc networks, by using existing periodic control messages and by not requiring any clock synchronization between the nodes. The method, once implemented in an actual routing protocol, proves to increase the ratio of successfully delivered data packets significantly.