Implementation of Opportunistic and Scheduled Routing Algorithms for DTN based Vehicular Networks

2023

Closed access Metadata (CSL-JSON)
DOI 10.1109/lanman58293.2023.10189811
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

In this work, we evaluate the two most common routing protocols of Delay Tolerant Networks (DTNs), opportunistic and scheduled routing, for vehicular networks. We compare the feasibility of these routing protocols in terms of packet delivery ratio, delivery time, and network load using a miniature vehicular network. The mobile nodes in the network are equipped with a radio transceiver such that they exchange the data packets according to the chosen routing protocol. We observe that scheduled routing can decrease the traffic load significantly as compared to opportunistic routing, however, this comes at the cost of requiring nodes to have a contact plan.