COFFEE: A Context-Free Protocol for Stimulating Data Forwarding in Wireless Ad Hoc Networks

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.

[1]  Paul F. Syverson,et al.  Anonymous connections and onion routing , 1998, IEEE J. Sel. Areas Commun..

[2]  Jiejun Kong,et al.  Providing robust and ubiquitous security support for mobile ad-hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[3]  Elizabeth M. Belding-Royer,et al.  The AD-MIX protocol for encouraging participation in mobile ad hoc networks , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[4]  Claus-Peter Schnorr,et al.  Efficient signature generation by smart cards , 2004, Journal of Cryptology.

[5]  R. Srikant,et al.  DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks , 2007, MobiCom '07.

[6]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Refik Molva,et al.  Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks , 2002, Communications and Multimedia Security.

[8]  Pars Mutaf Pocket Bluff : A cooperation enforcing scheduled pocket switching protocol , 2004 .

[9]  Jean-Pierre Hubaux,et al.  The quest for security in mobile ad hoc networks , 2001, MobiHoc '01.

[10]  Xiang-Yang Li,et al.  OURS: optimal unicast routing systems in non-cooperative wireless networks , 2006, MobiCom '06.

[11]  Sheng Zhong,et al.  On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques , 2005, MobiCom '05.

[12]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[13]  Luiz A. DaSilva,et al.  A reputation-based mechanism for isolating selfish nodes in ad hoc networks , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[14]  Sasikanth Avancha,et al.  Security for Sensor Networks , 2004 .

[15]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[16]  Fan Wu,et al.  On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks , 2007, MobiCom '07.

[17]  Jean-Pierre Hubaux,et al.  Nuglets: a Virtual Currency to Stimulate Cooperation in Self-Organized Mobile Ad Hoc Networks , 2001 .

[18]  Paolo Santi,et al.  COMMIT: a sender-centric truthful and energy-efficient routing protocol for ad hoc networks with selfish nodes , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.