A new modified spray and wait routing algorithm for heterogeneous delay tolerant network

Sisodiya, Shikha; Sharma, Pankaj; Tiwari, Sandeep

doi:10.1109/i-smac.2017.8058298

Cited by 7 publications

(8 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This algorithm has high packet delivery ratio, but its routing overhead is also high. Reference [18] proposed a multi-copy routing algorithm, the Spray and Wait algorithm. The Spray and wait algorithm divides the forwarding process for information into two steps.…”

Section: Related Workmentioning

confidence: 99%

An Effective Data Transmission Algorithm Based on Social Relationships in Opportunistic Mobile Social Networks

Yan

Chen

et al. 2018

Algorithms

View full text Add to dashboard Cite

Abstract:With the popularization of mobile communication equipment, human activities have an increasing impact on the structure of networks, and so the social characteristics of opportunistic networks become increasingly obvious. Opportunistic networks are increasingly used in social situations. However, existing routing algorithms are not suitable for opportunistic social networks, because traditional opportunistic network routing does not consider participation in human activities, which usually causes a high ratio of transmission delay and routing overhead. Therefore, this research proposes an effective data transmission algorithm based on social relationships (ESR), which considers the community characteristics of opportunistic mobile social networks. This work uses the idea of the faction to divide the nodes in the network into communities, reduces the number of inefficient nodes in the community, and performs another contraction of the structure. Simulation results show that the ESR algorithm, through community transmission, is not only faster and safer, but also has lower transmission delay and routing overhead compared with the spray and wait algorithm, SCR algorithm and the EMIST algorithm.

show abstract

Section: Related Workmentioning

confidence: 99%

An Effective Data Transmission Algorithm Based on Social Relationships in Opportunistic Mobile Social Networks

Yan

Chen

et al. 2018

Algorithms

View full text Add to dashboard Cite

show abstract

“…However, there are a lot of message copies in the network, which will consume many network resources. Sisodiya et al [29] proposed a flood routing algorithm, that is, spray and wait algorithm, which divides the information forwarding process into two steps. e first step is to copy the message and the transmission process is in the second step.…”

Section: Related Workmentioning

confidence: 99%

Efficient Data Transmission for Community Detection Algorithm Based on Node Similarity in Opportunistic Social Networks

Xiaokaiti

Qian

2021

Complexity

View full text Add to dashboard Cite

With the rapid development of 5G era, the number of messages on the network has increased sharply. The traditional opportunistic networks algorithm has some shortcomings in processing data. Most traditional algorithms divide the nodes into communities and then perform data transmission according to the divided communities. However, these algorithms do not consider enough nodes’ characteristics in the communities’ division, and two positively related nodes may divide into different communities. Therefore, how to accurately divide the community is still a challenging issue. We propose an efficient data transmission strategy for community detection (EDCD) algorithm. When dividing communities, we use mobile edge computing to combine network topology attributes with social attributes. When forwarding the message, we select optimal relay node as transmission according to the coefficients of channels. In the simulation experiment, we analyze the efficiency of the algorithm in four different real datasets. The results show that the algorithm has good performance in terms of delivery ratio and routing overhead.

show abstract

“…Its disadvantage is that the demand for network resources is too large. The spray and wait algorithm [23] is divided into two phases: spray and wait. In the spray phase, the source node injects a fixed number of message copies into the network and then enters the wait phase.…”

Section: The Proposed Socially-ignorant Routing Algorithmmentioning

confidence: 99%

A Comprehensive Multi-Scenario Routing Algorithm Based on Fuzzy Control Theory in Opportunistic Social Network

Chen

et al. 2020

Symmetry

View full text Add to dashboard Cite

With the flourishing of big data and the 5G era, the amount of data to be transmitted in the communication process is increasing, and end-to-end communication in traditional social networks has been unable to meet the current communication needs. Therefore, in order to improve the success rate of data forwarding, social networks propose that the sender of the message should reasonably choose the next hop node. However, existing routing and forwarding algorithms do not take into account nodes that are live in different scenarios, and the applicable next hop node metrics are also different. These algorithms only consider the forwarding preferences of the nodes during working hours and do not consider the forwarding preferences of the nodes during non-working hours. We propose a routing algorithm based on fuzzy decision theory, which aims at a more accurate decision on selecting the next hop. A routing and forwarding algorithm based on fuzzy decision is proposed in this paper. This algorithm symmetrical divides scenes in opportunistic social networks into working time and non-working time according to real human activity. In addition, metrics are designed symmetrically for these two scenarios. Simulation results demonstrate that, in the best case, the proposed scheme presents an average delivery ratio of 0.95 and reduces the average end-to-end delay and average overhead compared with the epidemic routing algorithm, the EIMSTalgorithm, the ICMT algorithm, and the FCNSalgorithm.

show abstract

A new modified spray and wait routing algorithm for heterogeneous delay tolerant network

Cited by 7 publications

References 10 publications

An Effective Data Transmission Algorithm Based on Social Relationships in Opportunistic Mobile Social Networks

An Effective Data Transmission Algorithm Based on Social Relationships in Opportunistic Mobile Social Networks

Efficient Data Transmission for Community Detection Algorithm Based on Node Similarity in Opportunistic Social Networks

A Comprehensive Multi-Scenario Routing Algorithm Based on Fuzzy Control Theory in Opportunistic Social Network

Contact Info

Product

Resources

About