Routing protocols for inter-vehicular networks: A comparative study in high-mobility and large obstacles environments

    Authors

    Y. H. Ho; A. H. Ho;K. A. Hua

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    Comput. Commun.

    Keywords

    inter-vehicular network; mobile ad hoc network; performance comparison; routing protocol; mobility; AD HOC NETWORKS/; Computer Science, Information Systems; Engineering, Electrical &; Electronic; Telecommunications

    Abstract

    An ad hoc network is composed of mobile nodes without the presence of a fixed infrastructure. Communications among nodes are accomplished by forwarding data packets for each other, on a hop-by-hop basis along the current connection to the destination node. In particular, vehicle-to-vehicle communications have been studied, in recent years, to improve driver safety. As more of such applications of high-mobility ad hoc networks emerge, it is critical that the routing protocol employed is capable of efficiently coping with the high-frequency of broken links (i.e., robust with respect to high-mobility). This paper presents a comprehensive comparative study in a city environment of eight representative routing protocols for wireless mobile ad hoc networks and inter-vehicular networks developed in recent years. In a city environment, communication protocols need adapt fast moving nodes (e.g., vehicles on streets) and large obstacles (e.g., office buildings). In this paper, we elaborate upon extensive simulation results based on various network scenarios, and discuss the strengths and weaknesses of these techniques with regard to their support for highly mobile nodes. (C) 2007 Elsevier B.V. All rights reserved.

    Journal Title

    Computer Communications

    Volume

    31

    Issue/Number

    12

    Publication Date

    1-1-2008

    Document Type

    Article

    Language

    English

    First Page

    2767

    Last Page

    2780

    WOS Identifier

    WOS:000258367900002

    ISSN

    0140-3664

    Share

    COinS