Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
The quest for security in mobile ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
SPINS: security protocols for sensor networks
Wireless Networks
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks
Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
Providing Robust and Ubiquitous Security Support for Mobile Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
The AD-MIX Protocol for Encouraging Participation in Mobile Ad Hoc Networks
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Proceedings of the 11th annual international conference on Mobile computing and networking
A Reputation-based Mechanism for Isolating Selfish Nodes in Ad Hoc Networks
MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
OURS: optimal unicast routing systems in non-cooperative wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
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
Anonymous connections and onion routing
IEEE Journal on Selected Areas in Communications
Hi-index | 0.01 |
Reputation based and credit-exchange based approaches have been studied extensively to enforce cooperation among non-cooperative nodes in wireless ad hoc networks. Most of the existing solutions are fundamentally context-based ones, which need to accurately identify selfish behaviors, securely maintain the context, and appropriately punish the selfish nodes. These requirements are extremely difficult to satisfy if not impossible. From a completely new angle, this paper proposes a context-free protocol, COFFEE, to enforce cooperation among selfish nodes, which has the ability to transmit a packet over the path successfully without the dependency on the information of other packets' transmission. Considering that every node in the network is rational, during the packet forwarding stage, if the intermediate nodes can not clearly tell whether the packet is destined to them or not, they can not simply drop the packet. Thus, in our proposed COFFEE protocol, through introducing several techniques, for any packet received by any node, the node thinks the packet could be destined to it and forwards the packet to find out the answer. Detailed analysis and performance evaluation have been conducted to demonstrate the effectiveness of the proposed protocol.