Effective social-context based message delivery using ChitChat in sparse delay tolerant networks

McGeehan, Douglas; Madria, Sanjay; Lin, Dan

doi:10.1007/s10619-019-07274-x

Cited by 7 publications

(2 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…for taking routing decisions. A hybrid technique, which combines meeting history statistics along with social interests of nodes may result in better routing, decisions as shown in ChitChat protocol [33]. Using a single social-metric in the algorithm often leads to delay in delivery because of the unpredictable network graph of a DTN.…”

Section: Discussion and Scope For Future Workmentioning

confidence: 99%

A Comprehensive Survey of Social Based Routing for Delay Tolerant Networks

Jain¹,

Vn²

2021

Preprint

View full text Add to dashboard Cite

Delay-tolerant networks (DTN) is an approach to deal with scarce network connectivity found in sparse mobile ad-hoc networks (MANETs) which makes the problem of routing messages a challenging task. DTNs have find their usefulness in many challenging environments such as tactical networks, underwater sensor networks, wildlife monitoring, disaster recovery etc. Pocket Switched Networks (PSNs) have emerged as a new application of the delay tolerant networks where network nodes are computing devices carried by humans. Hence, the study of how humans interact in their day-to-day life, the places they visit frequently, the people they meet frequently, the social groups in which they participate on regular basis etc. can help improve routing process in PSNs. This type of routing inspired from the way humans interact with each other is referred to as social based routing and had been a recent topic of research in the field of DTNs. This paper presents a comprehensive survey of the various social-based algorithms that have been designed for Delay Tolerant Networks.

show abstract

Section: Discussion and Scope For Future Workmentioning

confidence: 99%

A Comprehensive Survey of Social Based Routing for Delay Tolerant Networks

Jain¹,

Vn²

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…The mobile communication devices can be regarded as the nodes in the opportunistic social networks, and the nodes can choose the adjacent node as the next station of message transmission [5][6][7]. Opportunistic social networks have been widely used in interplanetary networks [8], field tracking [9], disaster rescue [10], and networks in underdeveloped areas [11].…”

Section: Introductionmentioning

confidence: 99%

Modified Data Delivery Strategy Based on Stochastic Block Model and Community Detection in Opportunistic Social Networks

Gou

2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

The nodes in the opportunistic network make up communities according to the relevance between them. Some of the structural characteristics of an opportunistic network can be reflected by the structure of the communities that exist in the network. Therefore, finding community from the network is of great significance for people to better study, use, and transform the network. The overlap of communities is considered to be an important feature of communities. Almost all community discovery algorithms were based on nonoverlapping communities in the past. A node in a nonoverlapping community belongs to only one community. However, there are overlapping and interrelated characteristics between communities, so it is not in line with the actual environment of the network. As a result, the previous algorithms have many shortcomings in the face of practical application scenarios, coupled with the limitation of the computing capacity of mobile devices; data transmission for low delay and the low energy consumption is difficult to meet the requirements. In the study, we formulate the problem of dividing nodes into several communities in the opportunistic social network as how to build communities dynamically according to weight distribution. Then, we propose a modified data delivery strategy based on stochastic block model and community detection (DDBSC). The simulation results show that, compared with other algorithms in the experiments, the strategy proposed in this paper exhibits good performance in terms of overhead, energy consumption, and delivery rate.

show abstract