No abstract

No abstract

Abstract-Vehicular ad hoc networks (VANETs) are going to be an important communication infrastructure in our life. Because of high mobility and frequent link disconnection, it becomes quite challenging to establish a robust multi-hop path that helps packet delivery from the source to the destination. This paper presents a multi-hop routing protocol, called MURU, that is able to find robust paths in urban VANETs to achieve high end-to-end packet delivery ratio with low overhead. MURU tries to minimize the probability of path breakage by exploiting mobility information of each vehicle in VANETs. A new metric called expected disconnection degree (EDD) is used to select the most robust path from the source to the destination. MURU is fully distributed and does not incur much overhead, which makes MURU highly scalable for VANETs. The design is sufficiently justified through theoretical analysis and the protocol is evaluated with extensive simulations. Simulation results demonstrate that MURU significantly outperforms existing ad hoc routing protocols in terms of packet delivery ratio, packet delay and control overhead.

Abstract-The development of efficient quality of service (QoS) routing algorithms in a high-speed network environment is a very important and at the same time very difficult task due to the need to provide divergent services with multiple QoS requirements. Recently heuristic algorithms based on Lagrange relaxation techniques have been proposed to resolve the contradiction between the time complexity and the quality of solution. In this paper, we investigate the performance of two heuristic algorithms, LR DCLC and NR DCLC, for the delay-constrained least-cost (DCLC) routing problem. Algorithm LR DCLC is based on linear relaxation, while algorithm NR DCLC, which is proposed in this paper, is based on nonlinear relaxation. A large number of simulations demonstrate that even though both algorithms have very good performance, NR DCLC can obtain much better solutions than LR DCLC by running Dijkstra's algorithm on average a few more times, especially in the case when the optimal solutions are hard to find.

Abstract-Vehicular ad hoc networks (VANETs) are going to be an important communication infrastructure in our life. Because of high mobility and frequent link disconnection, it becomes quite challenging to establish a robust multi-hop path that helps packet delivery from the source to the destination. This paper presents a multi-hop routing protocol, called MURU, that is able to find robust paths in urban VANETs to achieve high end-to-end packet delivery ratio with low overhead. MURU tries to minimize the probability of path breakage by exploiting mobility information of each vehicle in VANETs. A new metric called expected disconnection degree (EDD) is used to select the most robust path from the source to the destination. MURU is fully distributed and does not incur much overhead, which makes MURU highly scalable for VANETs. The design is sufficiently justified through theoretical analysis and the protocol is evaluated with extensive simulations. Simulation results demonstrate that MURU significantly outperforms existing ad hoc routing protocols in terms of packet delivery ratio, packet delay and control overhead.