EDR: An Encounter and Distance Based Routing Protocol for Opportunistic Networks

A variety of applications and forwarding protocols have been proposed for opportunistic networks (OppNets) in the literature. However, the methodology of evaluation, testing and comparing these forwarding protocols are not standardized yet, which leads to large levels of ambiguity in performance evaluation studies. Performance results depend largely on the evaluation environment, and on the used parameters and models. More comparability in evaluation scenarios and methodologies would largely improve also the availability of protocols and the repeatability of studies, and thus would accelerate the development of this research topic. In this survey paper, we focus our attention on how various OppNets data forwarding protocols are evaluated rather than what they actually achieve. We explore the models, parameters and the evaluation environments and make observations about their scalability, realism and comparability. Finally, we deduce some best practices on how to achieve the largest impact of future evaluation studies of OppNets data dissemination/forwarding protocols.

show abstract

“…EDR [49] 2016 Encounter rates with the destination and estimated distance to the destination are used to select forwarders.…”

Section: R3 [33] 2011mentioning

confidence: 99%

Evaluating Forwarding Protocols in Opportunistic Networks: Trends, Advances, Challenges and Best Practices

et al. 2019

View full text Add to dashboard Cite

show abstract

“…The average latency and overhead ratio are also less in HBPR as compared to epidemic routing protocol. EDR EDR [27] is an Encounter and Distance based protocol that forwards the message based on a metric known as forward parameter. Forward parameter is calculated based on encounter history of nodes with destination node and on the distance of nodes from destination node.…”

Section: Background and Relatedmentioning

confidence: 99%

Establishing Reliability for Efficient Routing in Opportunistic Networks

Sharma

Kukreja

2019

SCPE

Self Cite

View full text Add to dashboard Cite

Opportunistic network (Oppnet) is a class of networks where connections between the nodes are not permanent. The nodes are continuously moving and some nodes even switch off their batteries to conserve energy. Reliable delivery of messages in Opportunistic network is one major inherent issue. It is unreliable in the sense that once the source node has forwarded its message, then it will never get to know about its status in the network like whether the message has got discarded at an intermediate node or at the destination node (due to buffer overflow) or the successful delivery of the message has taken place. This work tries to make Oppnet as much reliable as possible. It proposes a reliability protocol named as “Reliability in Oppnet” (RIO). RIO improves the routing in Oppnet and works in parallel with the existing routing protocols. It makes the source node aware about the status of message so that if an error occurs then the source node can take suitable action to resend the message. It considers the redirection error, buffer overflow error, Time Limit Exceeded (TLE), parameter problem and destination unreachable errors that may occur inside the network. RIO has been tested using ONE simulator and implemented with Spray and Wait routing protocol. Results show that the RIO with Spray and Wait protocol outperforms normal Spray and Wait protocol in terms of average message delivery probability.

show abstract

“…SOCLEER is based on routing BubbleRap [8], but it could make a node traffic load redistribution when sending messages to other intermediary nodes which were not being so much demanded. [9] proposed a routing named EDR, EDR depends on two parameters: the number of encounters with other nodes and the distance between the source node and the destination node.…”

Section: Related Workmentioning

confidence: 99%

An efficient Multi-Clusters based Routing algorithm in Mobile Opportunistic Networks

Peng¹,

Zeng²,

Li³

2018

Proceedings of the 11th EAI International Conference on Mobile Multimedia Communications

View full text Add to dashboard Cite

Mobile Opportunistic Networks (MONs) are formed by random moving nodes. In MONs, there is no fixed link between any two nodes, the node can only transfer the message based on "storage-carry-and-forwar" data transmission mode. Therefore, a key challenge is to find a routing that can provide a good message delivery performance in MONs. In this paper, we use a phenomenon in real life to design an efficient Multi-Clusters based routing algorithm MCR. At first, we described a phenomenon that most of us have circle of friends, but also exists in multiple friends circles. Then, we used the encounter history to set up building and updating mechanism for the circles. After that, the multi-clusters had been formed with these friends circles. And we used the multiclusters to design MCR and make some experiments on real mobility traces. Finally our experiments results had shown that MCR outperforms the other three routing algorithms.

show abstract

EDR: An Encounter and Distance Based Routing Protocol for Opportunistic Networks

Cited by 38 publications

References 15 publications

Evaluating Forwarding Protocols in Opportunistic Networks: Trends, Advances, Challenges and Best Practices

Evaluating Forwarding Protocols in Opportunistic Networks: Trends, Advances, Challenges and Best Practices

Establishing Reliability for Efficient Routing in Opportunistic Networks

An efficient Multi-Clusters based Routing algorithm in Mobile Opportunistic Networks

Contact Info

Product

Resources

About