Routing Optimization in Vehicular Networks: A New Approach Based on Multiobjective Metrics and Minimum Spanning Tree

Abstract

Recently, distributed mobile wireless computing is becoming a very important communications paradigm, due to its flexibility to adapt to different mobile applications. As many other distributed networks, routing operations assume a crucial importance in system optimization, especially when considering dense urban areas, where interference effects cannot be neglected. In this paper a new routing protocol for VANETs and a new scheme of multichannel management are proposed. In particular, an interferenceaware routing scheme, for multiradio vehicular networks, wherein each node is equipped with a multichannel radio interface is investigated. NS-2 has been used to validate the proposed Multiobjective routing protocol (MO-RP) protocol in terms of packet delivery ratio, throughput, end-to-end delay, and overhead.

A Parallel Approach to Solve Minimum Spanning Tree Problem in Network Routing

“…The base paper by YÁÑEZ-MÁRQUEZ et al [15] applies Borvuka's algorithm for the computation of minimum spanning trees on explicitly defined input graphs and to adapt it to the implicit setting.…”

“…[16] algorithm and successfully implemented it on an ad hoc wireless network. The existing schemes in this approach tend to converge to a route comprised of a minimum spanning tree [15].They show that in a network with n randomly placed nodes, each node should be connected to the nearest neighbors in order to guarantee connectivity. [15] III.…”

“…The existing schemes in this approach tend to converge to a route comprised of a minimum spanning tree [15].They show that in a network with n randomly placed nodes, each node should be connected to the nearest neighbors in order to guarantee connectivity. [15] III. PROBLEM FORMULATION AND DESCRIPTION Graphs are a powerful tool for representing information and MST can be interpreted in different ways depending on what the graph represents.…”

Reliable Multicast Routing Protocol For DTN Based Vehicular Ad Hoc Networks

“…However in CMED protocol [4] minimum delay multicast tree is used in the Contention-based relaying and implicit acknowledgment strategies. The MO-RP [5] focused on the new multi-objective metric, which combines co-channel interference, link duration probability, and End-to-End delay. In The Motion Vector Algorithm (MOVE) [7] for V2R VANET considers sparse network where prior prediction must be made for rare opportunistic routing.…”

Breaking the Vehicular Wireless Communications Barriers: Vertical Handover Techniques for Heterogeneous Networks

“…The weigths need to be callibrated properly; they can be calculated in real time at the MIIS server based on the information gathered from the vehicles, and also from any other network entity, as long as such functionality relies on the MIIS service of the IEEE 802.21 standard; such information includes the geolocation, availability and state of the network, and whether or not the vehicle had just performed a handover. That collected data provides the information needed to calculate the weights in a centralized manner but the decision-making process is performed at the vehicle's OBU, distributed in the sense that vehicles will make the decision based upon their own profiles and requirements, as the distrubuted solution applied by Fazio et al [29].…”