2015
DOI: 10.1109/jsen.2015.2410297
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
24
0

Year Published

2017
2017
2018
2018

Publication Types

Select...
4
4

Relationship

3
5

Authors

Journals

citations
Cited by 39 publications
(24 citation statements)
references
References 35 publications
0
24
0
Order By: Relevance
“…Considering the heterogeneous nodal mobility, replicating message copies [22] to a better qualified (L − 1) nodes has been investigated. To expedite delivery via topological utility metric, EBSR [9] further relays (without generating additional copies) a message copy with (C M = 1) copy ticket. Based on geographic utility metric and underlying map topology, GeoSpray [23] (via underlying map topology) calculates the Nearest Point (NP) to destination to guide message relay.…”
Section: B Relaying Messages With Limiting Copy Numbersmentioning
confidence: 99%
See 2 more Smart Citations
“…Considering the heterogeneous nodal mobility, replicating message copies [22] to a better qualified (L − 1) nodes has been investigated. To expedite delivery via topological utility metric, EBSR [9] further relays (without generating additional copies) a message copy with (C M = 1) copy ticket. Based on geographic utility metric and underlying map topology, GeoSpray [23] (via underlying map topology) calculates the Nearest Point (NP) to destination to guide message relay.…”
Section: B Relaying Messages With Limiting Copy Numbersmentioning
confidence: 99%
“…Note that GeoSpray limits the number of copies a message can be replicated. Besides, EBRR [9] and EBSR [9] are topological routing schemes proposed for VSNs comprising heterogeneous 7 Compared with data message, the ACK message is with quite small size that only contains nodal ID (like a "string"). Therefore, the bandwidth and buffer space consumed by ACK can be ignored.…”
Section: F Performance Evaluationmentioning
confidence: 99%
See 1 more Smart Citation
“…• Referring to previous analysis on opportunistic encounter [24], the time until EV encounters any one of M buses, is given by…”
Section: ) Pull Modementioning
confidence: 99%
“…These protocols employ three-way handshake and NACKs to ensure reliability [21,22,23], and divide code images into pages to enable pipelining. Deluge is the default dissemination protocol in TinyOS [24].…”
Section: Structureless Disseminationmentioning
confidence: 99%