Traffic congestion distribution in social opportunistic networks

Social opportunistic networks (SONs) are delay-tolerant mobile ad hoc networks that exploit human mobility to carry messages between disconnected parts of the network. Humans tend to move in a way that is influenced by their social relations and social-aware routing protocols therefore use social properties of nodes, e.g. social ranking (popularity), as the routing metrics. These protocols favour more popular nodes as better relays for message transfers. Due to the non-uniform distribution of node popularity in SONs, this forwarding heuristic leads the routing to direct most of the traffic through a few most-popular nodes. Traffic congestion therefore results in these hub nodes. To date, a set of congestion control strategies have been proposed in opportunistic networks and most of them were developed by assuming that traffic congestion is distributed randomly in the network. In SONs, however, traffic congestion is most likely to occur in a few hub nodes. In this paper, we present an analysis of traffic congestion distribution in SONs. We initially survey state-of-the-art congestion control strategies in opportunistic networks. Subsequently, we investigate traffic congestion distribution in a real-life SON when a social-aware routing algorithm is applied in the network. We first discuss node popularity distribution in this human network. Using simulation, we furthermore show that node traffic congestion, identified with buffer/storage saturation leading to message drops, occurs frequently in the hub nodes. We also identify that node's total received traffic increases exponentially with the linear increase of the node popularity. We finally discuss a strategy for designing a congestion control algorithm in SONs.

[1]  Serge Fdida,et al.  SIMPS: Using Sociology for Personal Mobility , 2006, IEEE/ACM Transactions on Networking.

[2]  Bambang Soelistijanto,et al.  Transfer Reliability and Congestion Control Strategies in Opportunistic Networks: A Survey , 2014, IEEE Communications Surveys & Tutorials.

[3]  K. Goh,et al.  Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.

[4]  Wing Cheong Lau,et al.  Forwarding and Replication Strategies for DTN with Resource Constraints , 2007, 2007 IEEE 65th Vehicular Technology Conference - VTC2007-Spring.

[5]  Thrasyvoulos Spyropoulos,et al.  A complex network analysis of human mobility , 2011, 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[6]  Christophe Diot,et al.  Social Pocket Switched Networks , 2009, IEEE INFOCOM Workshops 2009.

[7]  Vijay Erramilli,et al.  Forwarding in opportunistic networks with resource constraints , 2008, CHANTS '08.

[8]  Anders Lindgren,et al.  Evaluation of Queueing Policies and Forwarding Strategies for Routing in Intermittently Connected Networks , 2006, 2006 1st International Conference on Communication Systems Software & Middleware.

[9]  Joan Triay,et al.  From Delay-Tolerant Networks to Vehicular Delay-Tolerant Networks , 2012, IEEE Communications Surveys & Tutorials.

[10]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[11]  You Xiaohu,et al.  A Novel Congestion Control Strategy in Delay Tolerant Networks , 2010, 2010 Second International Conference on Future Networks.

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

[13]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[14]  Milena Radenkovic,et al.  Framework for utility driven congestion control in delay tolerant opportunistic networks , 2011, 2011 7th International Wireless Communications and Mobile Computing Conference.

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

[16]  Marco Conti,et al.  Multihop Ad Hoc Networking: The Reality , 2007, IEEE Communications Magazine.

[17]  Alex Pentland,et al.  Reality mining: sensing complex social systems , 2006, Personal and Ubiquitous Computing.

[18]  Mads Haahr,et al.  Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs , 2009, IEEE Transactions on Mobile Computing.

[19]  Pan Hui,et al.  Distinct types of hubs in human dynamic networks , 2008, SocialNets '08.

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

[21]  Mohan Kumar,et al.  Opportunities in Opportunistic Computing , 2010, Computer.

[22]  Robin Kravets,et al.  Retiring Replicants: Congestion Control for Intermittently-Connected Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[23]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2011 .