Transmission of multimedia contents in opportunistic networks with social selfish nodes

Abstract To share multimedia content and provide reliable communication in an intermittently connected environment, most of the existing transmission schemes of opportunistic networks are taking a class of store-carry-forward schemes to improve the delivery. However, they do not 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 help the social selfish nodes to forward messages for other nodes. In the proposed scheme, priority is given to a message according to the cooperation degree, a cache management strategy is applied, and a delivery probability is calculated to guide nodes to select the better nodes as their relays. Simulation experiments show that the proposed transmission scheme protocol is effective and outperforms the existing transmission schemes.

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

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

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

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

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

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

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

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

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

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

[11]  Thrasyvoulos Spyropoulos,et al.  An optimal joint scheduling and drop policy for Delay Tolerant Networks , 2008, 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks.

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

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

[14]  M. Gribaudo,et al.  2002 , 2001, Cell and Tissue Research.

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

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

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

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

[19]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.