The topology of ad hoc networks is critical in determining the performance of routing algorithms, capacity and lifetime of ad hoc networks. In this paper, we study the impact of different signal propagation models on topology, routing and lifetime of ad hoc networks. Moreover, we also study shortest path routing based on metrics such as distance and hopcount. Our analysis shows that shortest path routing based on hopcount leads to a better load balancing than shortest path routing based on distance. However, the lifetime of network increases when distance is used as a metric for shortest path routing.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Topology, shortest path routing and lifetime of ad hoc networks


    Contributors:
    Dhillon, S. S. (author) / Zhou, Y. (author)


    Publication date :

    2007-11-01


    Size :

    433534 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    A Distributed Shortest-Path Routing Algorithm for Transportation Systems

    Zou, B. / Hu, J. / Wang, Q. et al. | British Library Conference Proceedings | 2010


    Genetic Algorithms for Shortest Path Routing of Autonomous Gliders

    Kahveci, Nazli / Ioannou, Petros | AIAA | 2008


    Flexible Bus Routing System with Shortest Path Search Algorithm

    HONG HYUN MIN | European Patent Office | 2020

    Free access

    The Shortest Path Problem Revisited: Optimal Routing for Electric Vehicles

    Andreas Artmeier, Julian Haselmayr, Martin Leucker, Martin Sachenbacher | BASE | 2010

    Free access