TY - JOUR
T1 - A Reliable and Efficient Encounter-Based Routing Framework for Delay/Disruption Tolerant Networks
AU - Cao, Yue
AU - Wang, Ning
AU - Sun, Zhili
AU - Cruickshank, Haitham
PY - 2015/7
Y1 - 2015/7
N2 - 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.
AB - 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.
KW - Routing Framework
KW - VSNs
KW - VANETs
U2 - 10.1109/JSEN.2015.2410297
DO - 10.1109/JSEN.2015.2410297
M3 - Article
VL - 15
SP - 4004
EP - 4018
JO - IEEE Sensors Journal
JF - IEEE Sensors Journal
SN - 1530-437X
IS - 7
ER -