Community-based Message Opportunistic Transmission

A Mobile Social Networks (MSN) is a kind of opportunistic network, which is composed of numerous mobile nodes with social characteristic. By now, the prevalent community-based routing algorithms mainly choose the optimal social characteristic node to forward messages, however they rarely consider the effects of community distribution on mobile nodes and time-varying characteristics of network. These algorithms usually lead to a high consumption of network resources and a low successful delivery ratio if they are used directly in mobile social networks. In order to solve this problem, we build a time-varying community-based network model, and propose a community-aware message opportunistic transmission algorithm (CMOT) in this paper. For inter-community messages transmission, the CMOT chooses an optimal community path by comparing the community transmission probability. In local communities, messages are forwarded according to the encounter probability between nodes. The simulation results show that, in comparison with classical routing algorithms, such as PRoPHET, MaxProp, Spray and Wait, and CMTS, the CMOT can improve the successful delivery ratio of messages and reduce network overhead obviously.

[1]  Kazem Jahanbakhsh,et al.  Social-Greedy: a socially-based greedy routing algorithm for delay tolerant networks , 2010, MobiOpp '10.

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

[3]  Pan Hui,et al.  How Small Labels Create Big Improvements , 2006, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[4]  Yu-Chee Tseng,et al.  Measuring air quality in city areas by vehicular wireless sensor networks , 2011, J. Syst. Softw..

[5]  Cecilia Mascolo,et al.  CAR: Context-Aware Adaptive Routing for Delay-Tolerant Mobile Networks , 2009, IEEE Transactions on Mobile Computing.

[6]  Yongjian Yang,et al.  Overview of Routing Algorithm in Pocket Switched Networks , 2014, 2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications.

[7]  Vinton G. Cerf,et al.  Delay-Tolerant Networking Architecture , 2007, RFC.

[8]  Sun Limin,et al.  A Message Transmission Scheme for Community-Based Opportunistic Network , 2009 .

[9]  Jie Wu,et al.  Homing spread: Community home-based multi-copy routing in mobile social networks , 2013, 2013 Proceedings IEEE INFOCOM.

[10]  Pan Hui,et al.  How Small Labels Create Big Improvements , 2007, PerCom Workshops.

[11]  Pan Hui,et al.  Pocket Switched Networks: Real-world mobility and its consequences for opportunistic forwarding , 2005 .

[12]  Gian Paolo Rossi,et al.  Bus switched networks: An ad hoc mobile platform enabling urban-wide communications , 2012, Ad Hoc Networks.

[13]  Cauligi S. Raghavendra,et al.  Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[14]  Wei Huang,et al.  Spray and wait routing based on position prediction in opportunistic networks , 2011, 2011 3rd International Conference on Computer Research and Development.

[15]  Kang Chen,et al.  SMART: Lightweight distributed Social Map based Routing in Delay Tolerant Networks , 2012, 2012 20th IEEE International Conference on Network Protocols (ICNP).

[16]  Yu Wang,et al.  Social and location based routing in delay tolerant networks , 2013 .

[17]  Jie Wu,et al.  Analysis of a Hypercube-Based Social Feature Multipath Routing in Delay Tolerant Networks , 2013, IEEE Transactions on Parallel and Distributed Systems.

[18]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[19]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[20]  Boleslaw K. Szymanski,et al.  Friendship Based Routing in Delay Tolerant Mobile Social Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[21]  Jie Wu,et al.  An Efficient Prediction-Based Routing in Disruption-Tolerant Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

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

[23]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[24]  Timur Friedman,et al.  Evaluating MobySpace-based routing strategies in delay-tolerant networks , 2007, Wirel. Commun. Mob. Comput..

[25]  Mostafa H. Ammar,et al.  PeopleRank: Social Opportunistic Forwarding , 2010, 2010 Proceedings IEEE INFOCOM.

[26]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[27]  Pablo Rodriguez,et al.  Fair Routing in Delay Tolerant Networks , 2009, IEEE INFOCOM 2009.

[28]  Jie Wu,et al.  Community-Aware Opportunistic Routing in Mobile Social Networks , 2014, IEEE Transactions on Computers.