Centrality based congestion controlled routing protocol for social opportunistic networks

Opportunistic networks (Oppnets) use the Store, Carry, and Forward technique for routing of messages. This technique can increase the prospects of message delivery but it is resource intensive as messages are kept in node's buffer until an appropriate next hop node is find out. This may lead to increased overhead and buffer overflow that causes congestion. In view of this, a scheme based on centrality and message parameters named as Centrality based Congestion Controlled Routing Protocol (CCCRP) has been proposed in this paper. It allows a receiver node to accept the message of a sender node whose centrality is high and to-be-sent message carries an "importance" as compared to others from a set of neighbouring sender nodes. The CCCRP is compared with Epidemic protocol in respect of messages dropped and overhead ratio parameters. Results obtained indicate that CCCRP outperforms Epidemic protocol in terms of the aforementioned parameters.

[1]  Robin Kravets,et al.  Poster abstract: understanding and controlling congestion in delay tolerant networks , 2010, MOCO.

[2]  Ari Keränen.  Opportunistic Network Environment simulator , 2008 .

[3]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[4]  Peter V. Marsden,et al.  Egocentric and sociocentric measures of network centrality , 2002, Soc. Networks.

[5]  Isaac Woungang,et al.  HBPR: History Based Prediction for Routing in Infrastructure-less Opportunistic Networks , 2013, 2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA).

[6]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[7]  Isaac Woungang,et al.  Performance evaluation of various routing protocols in Opportunistic Networks , 2011, 2011 IEEE GLOBECOM Workshops (GC Wkshps).

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

[9]  Kultida Rojviboonchai,et al.  Message dropping policy in congested social Delay Tolerant Networks , 2013, The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE).

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

[11]  Kun-Chan Lan,et al.  A Survey of Opportunistic Networks , 2008, 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008).

[12]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[13]  Isaac Woungang,et al.  GAER: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networks , 2014, The Journal of Supercomputing.

[14]  Milena Radenkovic,et al.  Decongesting Opportunistic Social-based Forwarding , 2009, 2010 Seventh International Conference on Wireless On-demand Network Systems and Services (WONS).

[15]  Milena Radenkovic,et al.  Promoting congestion control in opportunistic networks , 2010, 2010 IEEE 6th International Conference on Wireless and Mobile Computing, Networking and Communications.

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

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

[18]  Leszek Lilien,et al.  Opportunistic Networks for Emergency Applications and Their Standard Implementation Framework , 2007, 2007 IEEE International Performance, Computing, and Communications Conference.

[19]  Nisha Kandhoul,et al.  Congestion control in social opportunistic networks , 2014, 2014 International Conference on Signal Propagation and Computer Technology (ICSPCT 2014).

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

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