A Distance-Vector-Based Multi-Path Routing Scheme for Static-Node-Assisted Vehicular Networks

Abstract

Vehicular Ad hoc NETworks (VANET) has been well studied for a long time as a means to exchange information among moving vehicles. As vehicular networks do not always have connected paths, vehicular networks can be regarded as a kind of delay-tolerant networks (DTNs) when the density of vehicles is not high enough. In this case, packet delivery ratio degrades significantly so that reliability of networks as an information infrastructure is hardly held. Past studies such as SADV (Static-node Assisted Data dissemination protocol for Vehicular networks) and RDV (Reliable Distance-Vector routing) showed that the assistance of low-cost unwired static nodes located at intersections, which work as routers to provide distance-vector or link-state routing functions, significantly improves the communication performance. However, they still have problems: SADV does not provide high-enough delivery ratio and RDV suffers from traffic concentration on the shortest paths. In this paper, we propose MP-RDV (Multi-Path RDV) by extending RDV with multiple paths utilization to improve performance against both of those problems. In addition, we apply a delay routing metric, which is one of the major metrics in this field, to RDV to compare performance with the traffic-volume metric, which is a built-in metric of RDV. Evaluation results show that MP-RDV achieves high load-balancing performance, larger network capacity, lower delivery delay, and higher fault tolerance against topology changes compared to RDV. As for routing metrics, we showed that the traffic-volume metric is better than the delay one in RDV because delay measurement is less stable against traffic fluctuation.

Improving Energy Efficiency of Wireless Sensor Networks through Topology Optimization

“…The sensor nodes are randomly deployed in a square sensing field to monitor, detect, and collect information on dynamic events. BS collects information gathered by the nodes to be stored or further processed as found in [18], [19]and each sensor node has a unique identification (ID), a communication radius, R, and a set of neighboring nodes defined as is the distance between the node and node . This work assumes that the n sensor nodes do not know their locations, but they are capable of estimating the distance of their neighbor nodes.…”

Energy‐efficient multipath clustering with load balancing routing protocol for wireless multimedia sensor networks

“…A multipath algorithm is discussed in Ref. [25], with a minimum latency for WSN. So, when compared the protocol to single‐path routing approaches, performance measurements such as network lifetime and disjoint multi‐path techniques have been used.…”

An Optimized Nature-Inspired Metaheuristic Algorithm for Application Mapping in 2D-NoC

“…In [ 10 ], Araki and Yoshihiro presented a multi-path reliable distance-vector routing strategy by utilizing multiple paths for the extension of reliable distance-vector routing (RDV) for the improvement of communication performance, decreased delivery delay, higher load-balancing and more substantial network capacity. In comparison to RDV, fault tolerance is also greater against the topology modifications.…”