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
Rethinking incentives for mobile ad hoc networks
Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems
Proceedings of the 11th annual international conference on Mobile computing and networking
LARS: a locally aware reputation system for mobile ad hoc networks
Proceedings of the 44th annual Southeast regional conference
DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Detecting selective forwarding attacks in wireless sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Self-policing mobile ad hoc networks by reputation systems
IEEE Communications Magazine
Achieving cooperative spectrum sensing in wireless cognitive radio networks
ACM SIGMOBILE Mobile Computing and Communications Review
Hi-index | 0.00 |
In ad hoc networks, wireless nodes rely on each other to transmit data over multi-hops by forwarding packets. A selfish node may decide not to forward packets for other nodes to save its own resource but still use the network to send and receive data. Such a selfish behavior can degrade network performance significantly. Most existing work took observation, reputation and token based mechanisms. However observation based mechanism suffers from mobility and collusion; reputation and token based mechanisms suffer from system complexity and efficiency. In this paper, we propose One More Hop (OMH) protocol which suppresses selfish behavior from a totally new angle. Basing on the fact that the selfish but rational nodes still want to receive and send packets, if a node can not determine whether a packet is destined for it or not, it can not drop the packet. With modified routing protocol and cryptographic techniques, OMH achieves this design target. It is robust and efficient. The simulation shows that OMH works well under different network situations.