Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Reputation-based framework for high integrity sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
A quantitative trust establishment framework for reliable data packet delivery in MANETs
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
Towards designing a trusted routing solution in mobile ad hoc networks
Mobile Networks and Applications
On the Practical and Security Issues of Batch Content Distribution Via Network Coding
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks
Proceedings of the second ACM conference on Wireless network security
An algebraic watchdog for wireless network coding
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Capacity of byzantine agreement: summary of recent results
Proceedings of the 2010 ACM workshop on Wireless of the students, by the students, for the students
| Hi-index | 0.00 |
We consider the problem of misbehavior detection in wireless networks. A commonly adopted approach is to exploit the broadcast nature of the wireless medium, where nodes monitor their downstream neighbors locally using overheard messages. We call such nodes the Watchdogs.We propose a lightweight misbehavior detection scheme which integrates the idea of watchdogs and error detection coding.We show that even if the watchdog can only observe a fraction of packets, by choosing the error detection code properly, an attacker can be detected with high probability while achieving throughput arbitrarily close to optimal. Such properties reduce the incentive for the attacker to attack. We then consider the problem of locating the misbehaving node and propose a simple protocol, which locates the misbehaving node with high probability. The protocol requires exactly two watchdogs per unreliable relay node.