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.
Topology, shortest path routing and lifetime of ad hoc networks
2007-11-01
433534 byte
Conference paper
Electronic Resource
English
A Distributed Shortest-Path Routing Algorithm for Transportation Systems
British Library Conference Proceedings | 2010
|Flexible Bus Routing System with Shortest Path Search Algorithm
European Patent Office | 2020
|The Shortest Path Problem Revisited: Optimal Routing for Electric Vehicles
BASE | 2010
|