Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
| Hi-index | 0.00 |
Routing protocols for mobile ad hoc networks (MANETs) have been an active area of research for the last decade, with many very interesting potential as well as actual applications, in the military, rescue and commercial fields. Currently emerging standard routing protocols for MANETs do not perform well in the presence of nodes that intentionally drop data traffic but otherwise behave correctly with respect to control messages. In this paper, we address the problem of coping with the presence of such nodes in networks that use a proactive routing protocol. The solution, based on the principle of flow conservation, is purely protocolar and does not rely on any specific underlying OSI layer 1 or 2 technology. In addition, it is well suited for integration into existing proactive routing protocols for ad hoc networks, since it can use existing control messages and does not require any synchronization between the nodes. The method, once implemented in an actual routing protocol, proves to increase the ratio of successfully delivered data packets significantly.