COMMUNITY DETECTION USING INTER CONTACT TIME AND SOCIAL CHARACTERISTICS BASED SINGLE COPY ROUTING IN DELAY TOLERANT NETWORKS

Delay Tolerant Networks (DTNs) where the node connectivity is opportunistic and end-to-end path between any pair of source and destination is not guaranteed most of the time. Hence the messages are transferred from source to destination via intermediate nodes on hop to hop basis using store-carry-forward paradigm. Due to quick advancement in hand held devices such as smart phone and laptop with support of wireless communication interface carried by human being, it is possible in coming days to use DTNs for message dissemination without setting up infrastructure. The routing task becomes challenging in DTNs due to intermittent network connectivity and the connection opportunity arises only when node comes in transmission range of each other. The performance of the routing protocols depend on the selection of appropriate relay node which can deliver the message to final destination in case of source and destination do not meet at all. Many social characteristics are exhibited by the human being like friendship, community, similarity and centrality which can be exploited by the routing protocol in order to take the forwarding decisions. Literature shows that by using these characteristics, the performance of DTN routing protocols have been improved in terms of delivery probability. The existing routing schemes used community detection using aggregated contact duration and contact frequency which does not change over the time period. We propose community detection through Inter Contact Time (ICT) between node pair using power law distribution where the members of community are added and removed dynamically. We also considered single copy of each message in entire network to reduce the network overhead. The proposed routing protocol named Social Based Single Copy Routing (SBSCR) selects the suitable relay node from the community members only based on the social metrics such as similarity and friendship together. ICTs show power law nature in human mobility which is used to detect the community structure at each node. A node maintains its own community and social metrics such as similarity and friendship with other nodes. Whenever node has to select the relay node then it selects from its community with higher value of social metric. The simulations are conducted using ONE simulator on the real traces of campus and conference environments. SBSCR is compared with existing schemes and results show that it outperforms in terms of delivery probability and delivery delay with comparable overhead ratio.

[1]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[2]  Kyunghan Lee,et al.  On the Levy-Walk Nature of Human Mobility , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[3]  Thrasyvoulos Spyropoulos,et al.  Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing , 2010, 2010 Proceedings IEEE INFOCOM.

[4]  Lingyun Jiang,et al.  A Sociability-Based Spray and Forward Scheme for Opportunistic Network , 2013, Int. J. Distributed Sens. Networks.

[5]  Andrea Vitaletti,et al.  Routing protocols for delay tolerant networks: a quantitative evaluation , 2012, PM2HW2N '12.

[6]  Suvadip Batabyal,et al.  Analysing social behaviour and message dissemination in human based delay tolerant network , 2015, Wirel. Networks.

[7]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

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

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

[10]  Jean-Yves Le Boudec,et al.  Power Law and Exponential Decay of Intercontact Times between Mobile Devices , 2010, IEEE Trans. Mob. Comput..

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

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

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

[14]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

[15]  Mads Haahr,et al.  The challenges of disconnected delay-tolerant MANETs , 2010, Ad Hoc Networks.

[16]  Charles E. Perkins,et al.  Ad Hoc Networking , 2001 .

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

[18]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[19]  Jean-Yves Le Boudec,et al.  Power Law and Exponential Decay of Intercontact Times between Mobile Devices , 2007, IEEE Transactions on Mobile Computing.

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

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

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

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

[24]  Ying Zhu,et al.  A Survey of Social-Based Routing in Delay Tolerant Networks: Positive and Negative Social Effects , 2013, IEEE Communications Surveys & Tutorials.

[25]  Albert-László Barabási,et al.  Understanding individual human mobility patterns , 2008, Nature.

[26]  Hongyi Wu,et al.  A survey on analytic studies of Delay-Tolerant Mobile Sensor Networks , 2007, Wirel. Commun. Mob. Comput..

[27]  Esther Jennings,et al.  Delay and Disruption Tolerant Networking MACHETE Model , 2011 .

[28]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.