Sharing spray and wait routing algorithm in opportunistic networks

Derakhshanfard, Nahideh; Sabaei, Masoud; Rahmani, Amir Masoud

doi:10.1007/s11276-015-1105-y

Cited by 32 publications

(13 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, node X does not make a decision on whether it is the best path to forward the data packet through the Y forwarding node. Typical algorithms include Epidemic, 9 Spray and Wait, 10 and Spray and Focus. 11 Based on the Epidemic algorithm, Chancay-Garcı´a et al 12 considered that the amount of transmitted information is limited by the transmission speed and contact time and proposed an epidemic extension protocol called Xpread.…”

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

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

show abstract

“…In order to address the overhead problem in Epidemic routing, the Prophet algorithm and the Spray and Wait algorithm were proposed. In these algorithms, the total number of message copies is limited to a certain range, or message forwarding is carried out when a certain condition is met.…”

Section: Related Workmentioning

confidence: 99%

An Efficient location‐aware routing approach in opportunistic networks

Wang

et al. 2020

IEEJ Transactions Elec Engng

View full text Add to dashboard Cite

An opportunistic network is a kind of self‐organizing network that makes use of the encountering opportunities to realize short‐distance wireless communication. Because of the intermittent connectivity between nodes and dynamic network topology, how to devise a reliable and efficient routing approach has become a challenging issue. However, the periodic update mechanism of the node's location information in the existing works costs too much. To address this issue, we propose a location‐aware opportunistic routing (LAOR) approach. In the the proposed LAOR, we first establish a location‐aware prediction model based on the Markov process to predict the node's next location. Then we devise a decision‐making scheme of message forwarding to select the desired relay nodes based on the node's delivery probability. In addition, we introduce a dynamic buffer management strategy to determine the message priority. Finally, we validate the effectiveness of our proposed model and the high efficiency of the LAOR approach. Simulation results demonstrate that the proposed LAOR outperforms the existing Epidemic, Prophet, history‐based prediction routing, and location prediction‐based forwarding for routing using Markov chain algorithms in terms of delivery ratio, overhead ratio, and the number of messages dropped. © 2020 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

show abstract

“…Secondly, we have compared our Softwarecast proposal with a multi-copy version of Softwarecast (MC-Softwarecast in the figures). In this case, messages are not being routed following single-copy routing algorithm but a multi-copy one similar to Spray and Wait [13] in binary mode: messages define an initial number of copies (L = 2) and, when being forwarded to other nodes, half of their Softwarecast messages are forwarded to the contacted node (one copy since L = 2). These multi-copy Softwarecast messages, when being forwarded, follow a strategy similar to the Marriage Problem [16] explained in Section 4 with v * 1 = 40/e = 14.7: messages are not considered for delivery before being forwarded to 15 nodes and after the 15th contacted node the message is delivered to the first node whose retrieved value is bigger than all of the precedents.…”

Section: Comparing To Traditional Approachesmentioning

confidence: 99%

Softwarecast: A code-based delivery Manycast scheme in heterogeneous and Opportunistic Ad Hoc Networks

2017

View full text Add to dashboard Cite

In the context of Opportunistic Ad Hoc Networking paradigms, group communication schemes (Manycast) are difficult to conduct. In this article, we propose a general delivery scheme for Manycast group communications based on mobile code. Our proposal extends network addressing by moving from the static header field paradigm to a software codebased addressing scheme. We allow messages to be delivered using built-in software codes that consider application-defined, context-aware or history-based information. Additionally, we allow messages to carry a delivery state that permits them to perform refined delivery-decision-making methods. As a consequence of this scheme, we have found that new group communication schemes, besides the traditional ones, may be beneficial to improve the network performance and to provide new functionalities to emerging scenarios like intermittently connected networks of heterogeneous physical objects. We present an application of this scheme to solve, following an analytical delivery method, the problem of sending a message to k and only k nodes of a heterogeneous and opportunistic network scenario that fit best a given criterion. We show, using simulations, that our proposal performs better than traditional approaches. Finally, to show that our proposal is feasible, we present an implementation of our proposal in a real Opportunistic Ad Hoc network, a DTN network, compatible with the de facto standard Bundle Protocol.

show abstract

Sharing spray and wait routing algorithm in opportunistic networks

Cited by 32 publications

References 35 publications

Activity-based routing algorithm in opportunistic mobile social networks

Activity-based routing algorithm in opportunistic mobile social networks

An Efficient location‐aware routing approach in opportunistic networks

Softwarecast: A code-based delivery Manycast scheme in heterogeneous and Opportunistic Ad Hoc Networks

Contact Info

Product

Resources

About