Making Nodes Cooperative: A Secure Incentive Mechanism for Message Forwarding in DTNs

In traditional Delay Tolerant Networks (DTNs), the nodes can take advantage of intermittent contact opportunities to forward messages. However, in noncooperative DTNs, the nodes may be selfish and reluctant to cooperate with each other in message forwarding. Therefore, it is necessary to motivate the nodes to cooperate with each other in such DTNs. The previously proposed incentive mechanisms have obvious limitations such as the security vulnerability. To resolve such kind of drawbacks, in this paper we propose two credit-based rewarding schemes, called earliest path singular rewarding scheme and earliest path cumulative rewarding scheme respectively, to ensure the nodes truthfully forward the messages. The proposed rewarding schemes are incentive compatible. They also ensure that the payment for each delivered message is upper bounded. Furthermore, the proposed rewarding schemes can prevent selfish nodes from having malicious behaviors. Simulations based on the real trace are conducted to illustrate the effectiveness of the proposed rewarding schemes.

[1]  Igor N. Kovalenko,et al.  Asymmetric Cryptographic Algorithms , 2003 .

[2]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SimuTools.

[3]  Md. Yusuf Sarwar Uddin,et al.  RELICS: In-network realization of incentives to combat selfishness in DTNs , 2010, The 18th IEEE International Conference on Network Protocols.

[4]  Mun Choon Chan,et al.  MobiCent: a Credit-Based Incentive System for Disruption Tolerant Network , 2010, 2010 Proceedings IEEE INFOCOM.

[5]  Qi He,et al.  SORI: a secure and objective reputation-based incentive scheme for ad-hoc networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[6]  Sheng Zhong,et al.  Stimulating Cooperation in Vehicular Ad Hoc Networks: A Coalitional Game Theoretic Approach , 2011, IEEE Transactions on Vehicular Technology.

[7]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[8]  Jie Wu,et al.  Thwarting Blackhole Attacks in Disruption-Tolerant Networks using Encounter Tickets , 2009, IEEE INFOCOM 2009.

[9]  Xiang-Yang Li,et al.  Hidden information and actions in multi-hop wireless ad hoc networks , 2008, MobiHoc '08.

[10]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[12]  Xiaodong Lin,et al.  SMART: A Secure Multilayer Credit-Based Incentive Scheme for Delay-Tolerant Networks , 2009, IEEE Transactions on Vehicular Technology.

[13]  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.