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

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.