Enabling delay-tolerant communications for partially connected vehicular ad hoc networks

Sevimli, Kadri Kaan; Soytürk, Müjdat

doi:10.1504/ijahuc.2012.050264

Cited by 3 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this case, there is no way to determine how long vehicles will keep carrying messages when delivering messages in DTN nature. The pioneer work in [35] proposing approaches for the delivery of IPv6 packets in a DTN nature in partially connected networks could be referred for this concern.…”

Section: Further Discussionmentioning

confidence: 99%

A Reliable and Efficient Encounter-Based Routing Framework for Delay/Disruption Tolerant Networks

et al. 2015

View full text Add to dashboard Cite

Abstract-This article addresses Delay/Disruption Tolerant Networking (DTN) routing under a highly dynamic scenario, envisioned for communication in Vehicular Sensor Networks (VSNs) suffering from intermittent connection. Here, we focus on the design of a high level routing framework, rather than the dedicated encounter prediction. Based on an analyzed utility metric to predict nodal encounter, our proposed routing framework considers the following three cases: 1) Messages are efficiently replicated to a better qualified candidate node, based on the analysed utility metric related to destination. 2) Messages are conditionally replicated if the node with a better utility metric has not been met. 3) Messages are probabilistically replicated if the information in relation to destination is unavailable in the worst case. With this framework in mind, we propose two routing schemes covering two major technique branches in literature, namely Encounter-Based Replication Routing (EBRR) and Encounter-Based Spraying Routing (EBSR). Results under the scenario applicable to VSNs show that, in addition to achieving high delivery ratio for reliability, our schemes are more efficient in terms of a lower overhead ratio. Our core investigation indicates that apart from what information to use for encounter prediction, how to deliver messages based on the given utility metric is also important.

show abstract

Section: Further Discussionmentioning

confidence: 99%

A Reliable and Efficient Encounter-Based Routing Framework for Delay/Disruption Tolerant Networks

et al. 2015

View full text Add to dashboard Cite

show abstract

“…The basic assumption on stable end-to-end path of routing protocols is invalid. Many real-world network scenarios fall into this paradigm, such as vehicular ad hoc networks [2], sensor networks for wildlife tracking and habitat monitoring [3], pocket switched networks [4], and mobile social networks [5].…”

Section: Introductionmentioning

confidence: 99%

Mobility Similarity-Based Routing in Buffer-Limited Delay Tolerant Networks

Liu

Huang

Wang

et al. 2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In delay tolerant networks (DTNs), multiple-copy routing is often adopted to improve the probability of successful message delivery but causes more traffic loads. The excessive increase in multiple messages copies often exhausts the network resources and deteriorates its performance significantly. To solve this problem, a mobility similarity-based routing (SBR) algorithm is proposed in this paper. On one hand, destination similarity is used to help the message carrier node find the appropriate relay nodes with the higher opportunity to meet the destination node in order to improve the delivery ratio. On the other hand, carrier similarity is adopted to avoid sending the same copy to the nodes with mobility similarity so as to reduce the number of message copies. Furthermore, inspired by the law of diminishing marginal utility in economics, a buffer management scheme based on the message transmission status is proposed. Experimental results show that the proposed SBR routing algorithm combined with the buffer management scheme can improve the delivery ratio and has the lower overhead ratio compared to other routing algorithms.

show abstract

Performance analysis of epidemic routing in DTNs with limited forwarding times and selfish nodes

Deng

Huang

2013

IJAHUC

View full text Add to dashboard Cite

Enabling delay-tolerant communications for partially connected vehicular ad hoc networks

Cited by 3 publications

References 21 publications

A Reliable and Efficient Encounter-Based Routing Framework for Delay/Disruption Tolerant Networks

A Reliable and Efficient Encounter-Based Routing Framework for Delay/Disruption Tolerant Networks

Mobility Similarity-Based Routing in Buffer-Limited Delay Tolerant Networks

Performance analysis of epidemic routing in DTNs with limited forwarding times and selfish nodes

Contact Info

Product

Resources

About