An adaptive multiple spray-and-wait routing algorithm based on social circles in delay tolerant networks

Wu, Libing; Cao, Shuqin; Chen, Yanjiao; Cui, Jianqun; Chang, Yanan

doi:10.1016/j.comnet.2021.107901

Cited by 25 publications

(16 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this sort of algorithm requires each node to have an ample buffer space, and in actual applications, it cannot guarantee that each node has sufficient network resources, resulting in poor data transmission effects. The spray and wait algorithm [39] is improved based on the epidemic algorithm. In the spray phase, the source node forwards the cached information to neighboring relay nodes.…”

Section: Related Workmentioning

confidence: 99%

“…This tool can obtain the movement trajectory of nodes by controlling the movement of nodes and then record various details of the information transmission process. Also, this research will simulate three classic routing algorithms: spray and wait [39], DEFS (direction entropy-based forwarding scheme) [36], and SECM (status estimation and cache management algorithm) [37] and evaluate the advantages and disadvantages of UADT through comparison. A brief introduction of the algorithm is as follows:…”

Section: Simulationmentioning

confidence: 99%

“…Spray and wait [39]: In the spray phase, the algorithm forwards the information to neighboring nodes by flooding. If no available node is found, the information is directly copied to the target node in the Wait phase.…”

Section: Simulationmentioning

confidence: 99%

See 2 more Smart Citations

Routing Algorithm Based on User Adaptive Data Transmission Scheme in Opportunistic Social Networks

Liu

Luo

et al. 2021

Electronics

View full text Add to dashboard Cite

With the rapid popularization of 5G communication and internet of things technologies, the amount of information has increased significantly in opportunistic social networks, and the types of messages have become more and more complex. More and more mobile devices join the network as nodes, making the network scale increase sharply, and the tremendous amount of datatransmission brings a more significant burden to the network. Traditional opportunistic social network routing algorithms lack effective message copy management and relay node selection methods, which will cause problems such as high network delay and insufficient cache space. Thus, we propose an opportunistic social network routing algorithm based on user-adaptive data transmission. The algorithm will combine the similarity factor, communication factor, and transmission factor of the nodes in the opportunistic social network and use information entropy theory to adaptively assign the weights of decision feature attributes in response to network changes. Also, edge nodes are effectively used, and the nodes are divided into multiple communities to reconstruct the community structure. The simulation results show that the algorithm demonstrates good performance in improving the information transmission’s success rate, reducing network delay, and caching overhead.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Simulationmentioning

confidence: 99%

See 1 more Smart Citation

Routing Algorithm Based on User Adaptive Data Transmission Scheme in Opportunistic Social Networks

Liu

Luo

et al. 2021

Electronics

View full text Add to dashboard Cite

show abstract

“…In order to improve the delivery rate of the spray and wait algorithm, Derakhshanfard 14 proposed an Erlang-based buffer management and routing algorithm, which considered the probability of message delivery and buffer when selecting relay nodes and allocating tokens sent to nodes status and message delivery time. Also, taking into account the difference in node forwarding capabilities, Wu et al 15 proposed a spray strategy based on social circles. Under the premise of not fixing the initial number of copies, they selectively spray messages multiple times during the waiting phase to determine the appropriate number of redundant message copies.…”

Section: Routing Algorithm Based On Opportunistic Forwardingmentioning

confidence: 99%

Activity-based routing algorithm in opportunistic mobile social networks

Zhang

Liu

Chen³

et al. 2021

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In opportunistic mobile social networks, nodes are clustered according to their interests or hobbies and take part in different activities regularly. We delve into the temporal and spatial mobility characteristics of network nodes and put forward an activity-based message opportunistic forwarding algorithm. The main idea of the algorithm is that we choose different message forwarding methods according to the situation of nodes participating in activities. If the source node and the destination node are both attend in the same activities, we select the best relay node which has the biggest delivery probability. While the source node and the destination node are not in the same activities at the same time, we need to find the optimal path which owns highest indirect delivery probability, and messages will be transmitted through the optimal path. The simulation results show that the proposed routing algorithm can not only improve the successful delivery ratio of messages but also reduce the network delay and the network overhead obviously, in comparison with the classical opportunistic routing algorithms, such as community-aware message opportunistic transmission algorithm, community-based message transmission scheme algorithm, PRoPHET, Epidemic algorithm, and interest characteristic probability prediction algorithm.

show abstract

“…Social-based routing [17] has motivated multiple works that incorporate interpreted social information about the nodes to optimize the traffic in opportunistic scenarios [18]. Aspects such as the social and contacts graph [19], the community concept [20], the centrality degree [21], and the common interests have become relevant for these algorithms [22]. Thus, this multi-hop routing seeks to benefit from real-world relations to achieve a better performance in the network [14].…”

Section: Introductionmentioning

confidence: 99%

Improving Delivery Probability in Mobile Opportunistic Networks with Social-Based Routing

Jesús-Azabal

García-Alonso²,

Soares³

et al. 2022

Electronics

View full text Add to dashboard Cite

There are contexts where TCP/IP is not suitable for performing data transmission due to long delays, timeouts, network partitioning, and interruptions. In these scenarios, mobile opportunistic networks (MONs) are a valid option, providing asynchronous transmissions in dynamic topologies. These architectures exploit physical encounters and persistent storage to communicate nodes that lack a continuous end-to-end path. In recent years, many routing algorithms have been based on social interactions. Smartphones and wearables are in vogue, applying social information to optimize paths between nodes. This work proposes Refine Social Broadcast (RSB), a social routing algorithm. RSB uses social behavior and node interests to refine the message broadcast in the network, improving the delivery probability while reducing redundant data duplication. The proposal combines the identification of the most influential nodes to carry the information toward the destination with interest-based routing. To evaluate the performance, RSB is applied to a simulated case of use based on a realistic loneliness detection methodology in elderly adults. The obtained delivery probability, latency, overhead, and hops are compared with the most popular social-based routers, namely, EpSoc, SimBet, and BubbleRap. RSB manifests a successful delivery probability, exceeding the second-best result (SimBet) by 17% and reducing the highest overhead (EpSoc) by 97%.

show abstract

An adaptive multiple spray-and-wait routing algorithm based on social circles in delay tolerant networks

Cited by 25 publications

References 19 publications

Routing Algorithm Based on User Adaptive Data Transmission Scheme in Opportunistic Social Networks

Routing Algorithm Based on User Adaptive Data Transmission Scheme in Opportunistic Social Networks

Activity-based routing algorithm in opportunistic mobile social networks

Improving Delivery Probability in Mobile Opportunistic Networks with Social-Based Routing

Contact Info

Product

Resources

About