Congestion‐aware message forwarding in delay tolerant networks: a community perspective

In delay tolerant networks, most of the existing message forwarding algorithms prefer to deliver messages to the nodes with a higher popularity or centrality in the hope of maximizing the delivery ratio or minimizing the end‐to‐end delay. This forwarding scheme is prone to cause unfair load distribution and further lead to network congestion, overlooked in the previous work. In this paper, we discuss the network congestion from a community perspective and take it into account the design of message forwarding algorithms. We first put forward a novel distributed community detection approach, which could track the evolution of communities. Based on the identified communities, we develop a congestion avoidance mechanism to divert the load away from the congested areas to the alternative custodians and further present a congestion‐aware message forwarding algorithm where messages can avoid being transmitted to the congested nodes. We finally evaluate the effectiveness of distributed community detection and congestion‐aware message forwarding through the extensive real‐trace driven simulations. Copyright © 2015 John Wiley & Sons, Ltd.

[1]  Song Guo,et al.  CACC: A context-aware congestion control approach in smartphone networks , 2014, IEEE Communications Magazine.

[2]  Feng Li,et al.  Heterogeneous wireless access technology and its impact on forming and maintaining friendship through mobile social networks , 2012, Int. J. Commun. Syst..

[3]  Jie Wu,et al.  Hypercube-Based Multipath Social Feature Routing in Human Contact Networks , 2014, IEEE Transactions on Computers.

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

[5]  Grenville J. Armitage,et al.  A survey of techniques for internet traffic classification using machine learning , 2008, IEEE Communications Surveys & Tutorials.

[6]  Claudio E. Palazzi,et al.  Social‐aware delay tolerant networking for mobile‐to‐mobile file sharing , 2012, Int. J. Commun. Syst..

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

[8]  Ke Xu,et al.  A Survey of Social-Aware Routing Protocols in Delay Tolerant Networks: Applications, Taxonomy and Design-Related Issues , 2014, IEEE Communications Surveys & Tutorials.

[9]  Yonggang Wen,et al.  Skeleton construction in mobile social networks: Algorithms and applications , 2014, 2014 Eleventh Annual IEEE International Conference on Sensing, Communication, and Networking (SECON).

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

[11]  Elena Pagani,et al.  CRAWDAD dataset unimi/pmtr (v.2008-12-01) , 2008 .

[12]  Mianxiong Dong,et al.  Quality-of-Experience (QoE) in Emerging Mobile Social Networks , 2014, IEICE Trans. Inf. Syst..

[13]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[14]  Longxiang Yang,et al.  Comparison of average symbol error rate and optimal power allocation for two-way opportunistic relaying with amplify-and-forward protocol , 2014, Int. J. Commun. Syst..

[15]  Song Guo,et al.  A multi-attribute decision making approach to congestion control in delay tolerant networks , 2014, 2014 IEEE International Conference on Communications (ICC).

[16]  Ke Xu,et al.  Distribution of inter-contact time: An analysis-based on social relationships , 2013, Journal of Communications and Networks.

[17]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

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

[19]  Song Guo,et al.  Social-Aware Relay Node Selection in Delay Tolerant Networks , 2013, 2013 22nd International Conference on Computer Communication and Networks (ICCCN).

[20]  Martin Mauve,et al.  A survey on congestion control for mobile ad hoc networks , 2007, Wirel. Commun. Mob. Comput..

[21]  Jie Wu,et al.  LocalCom: A Community-based Epidemic Forwarding Scheme in Disruption-tolerant Networks , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[22]  Christophe Diot,et al.  Dissemination in opportunistic social networks: the role of temporal communities , 2012, MobiHoc '12.

[23]  Pan Hui,et al.  Distributed community detection in delay tolerant networks , 2007, MobiArch '07.

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

[25]  Helen D. Karatza,et al.  Real-time performance evaluation of asynchronous time division traffic-aware and delay-tolerant scheme in ad hoc sensor networks , 2010 .

[26]  Haitham S. Cruickshank,et al.  Approach-and-Roam (AaR): A Geographic Routing Scheme for Delay/Disruption Tolerant Networks , 2014, IEEE Transactions on Vehicular Technology.

[27]  Ping Li,et al.  Trust mechanisms in wireless sensor networks: Attack analysis and countermeasures , 2012, J. Netw. Comput. Appl..

[28]  Milena Radenkovic,et al.  Congestion aware data dissemination in social opportunistic networks , 2011, MOCO.

[29]  Martin Mauve,et al.  A survey on congestion control for mobile ad hoc networks: Research Articles , 2007 .

[30]  Mianxiong Dong,et al.  MMCD: Cooperative Downloading for Highway VANETs , 2015, IEEE Transactions on Emerging Topics in Computing.

[31]  Keqiu Li,et al.  Optimal methods for coordinated enroute web caching for tree networks , 2005, TOIT.