A transmission scheme for opportunistic networks with social selfish nodes

Opportunistic Networks aim to provide reliable communications in an intermittently connected environment. Most of the existing transmission schemes are taking a class of store-carry-forward schemes to improve the delivery. However, they don't take the social selfish nodes into consideration. To deal with the unpredictability in connections and uncooperative behaviors in the nodes, this paper proposes a transmission scheme to make the social selfish nodes cooperate in forwarding messages for other nodes. In the proposed scheme, a priority is given to a message according to the cooperation degree, a cache management scheme is applied, and a delivery probability is calculated to guide nodes to select the better nodes as its relay. Simulation experiments show that the proposed routing protocol is effective and outperforms the existing routing solutions.

[1]  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).

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

[3]  Yin Zhang,et al.  Incentive-aware routing in DTNs , 2008, 2008 IEEE International Conference on Network Protocols.

[4]  Richard E. Hansen,et al.  Prioritized epidemic routing for opportunistic networks , 2007, MobiOpp '07.

[5]  Paolo Santi,et al.  The Effects of Node Cooperation Level on Routing Performance in Delay Tolerant Networks , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[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]  Jean-Yves Le Boudec,et al.  Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.

[8]  S. Keshav,et al.  Practical security for disconnected nodes , 2005, 1st IEEE ICNP Workshop on Secure Network Protocols, 2005. (NPSec)..

[9]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[10]  Levente Buttyán,et al.  Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks , 2003, Mob. Networks Appl..

[11]  Qinghua Li,et al.  Routing in Socially Selfish Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[12]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[13]  Zhide Chen,et al.  Incentive mechanism for selfish nodes in wireless sensor networks based on evolutionary game , 2011, Comput. Math. Appl..

[14]  Eitan Altman,et al.  Non-cooperative Forwarding in Ad-Hoc Networks , 2005, NETWORKING.

[15]  Ioannis Stavrakakis,et al.  On the Effects of Cooperation in DTNs , 2007, 2007 2nd International Conference on Communication Systems Software and Middleware.

[16]  Vito Latora,et al.  Selfishness, Altruism and Message Spreading in Mobile Social Networks , 2009, IEEE INFOCOM Workshops 2009.

[17]  Eytan Adar,et al.  Free Riding on Gnutella , 2000, First Monday.