Analysing social behaviour and message dissemination in human based delay tolerant network

Batabyal, Suvadip; Bhaumik, Parama

doi:10.1007/s11276-014-0790-2

Cited by 15 publications

(9 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some studies have shown that many popular mobility models, such as random waypoint, random walk, and community-based model, have such a characteristic that the pair-wise inter-contact time and contact duration are exponentially distributed or have exponential tails [Spyropoulos, Psounis and Raghavendra (2006); Batabyal and Bhaumik (2015)]. In this paper, we propose a method to estimate utility based on the hypothesis that the pair-wise inter-contact time and contact duration between nodes are independent random variables and follow exponential distribution.…”

Section: System Analysismentioning

confidence: 99%

An Application-Oriented Buffer Management Strategy in Opportunistic Networks

Li¹,

Zhang²,

Ge³

et al. 2019

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

In Opportunistic networks (ONs), buffer management is critical to improve the message exchanging efficiency due to the limited storage space and transmission bandwidth at the wireless edge. Current solutions make message scheduling and drop policy based on assumptions that messages can always been forwarded in a single contact, and all node pairs have the same contact rates. However, such ideal assumptions are invalid for realistic mobility traces of hand-held. Recent studies show that the single contact duration is limited and the mobility of nodes is heterogeneous in reality. In this paper, a buffer management strategy based on contact duration and heterogeneous mobility is proposed to improve the efficiency of buffer policy in the practical applications. We mainly focus on the minimization of the total expected delivery delay for all messages in ONs with resource constraints. Using the global network information including existing copies of message in the network, the distribution of pair-wise inter-contact time and contact duration between nodes, we develop a function to compute per-message utility which reflects the contribution of single message to the total expected delivery delay. Messages are scheduled or dropped according to their utilities. Simulation results show that our proposed strategy not only achieves lower delivery delay than mainstream strategies, but also keeps a high delivery ratio and a low network overhead.

show abstract

Section: System Analysismentioning

confidence: 99%

An Application-Oriented Buffer Management Strategy in Opportunistic Networks

Li¹,

Zhang²,

Ge³

et al. 2019

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

show abstract

“…Otherwise message is forwarded based on higher global centrality value and finally it is delivered to one of the members of its community or destination. This scheme may not work when node belongs to the community whose all members are with low global centrality value [21]. Friendship routing [18] construct friendship community using the social pressure metric which measures the quality of friendship based on their long lasting and regular contact.…”

Section: Related Workmentioning

confidence: 99%

“…As community structure changes over the time which is not considered in the existing techniques of community detection. S. Batyabal et al [21] proposed a method of community detection by exploiting the distribution of ICTs and CTs from the mobility traces. An aggregated ICTs and CTs of all node pairs follow power law distribution with exponential cut off [28][29].…”

Section: Related Workmentioning

confidence: 99%

“…But an aggregated value is not a correct measure to form a community structure which may lead to creation of false connections. S. Batyabal et al [21] proposed a technique to determine the threshold value using power law nature of CT and ICT and construct a community structure from the mobility traces. Authors also utilized these information in routing decisions and proved that it outperformed than existing schemes.…”

Section: Introductionmentioning

confidence: 99%

“…Obviously they can improve the chances of delivering the messages with minimum delivery delay but incur higher overhead due to unnecessary transmission of the message. The existing work [21] lacks applying of social based metrics to select the most appropriate relay node among the members of a community and routing protocol is implemented as multi copy scheme.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Community Detection Using Inter Contact Time and Social Characteristics Based Single Copy Routing in Delay Tolerant Networks

Gondaliya¹,

Kathiriya²

2016

IJASUC

View full text Add to dashboard Cite

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.

show abstract