101. Implementing distributed multicost routing in mobile ad hoc networks using dsr
- Author
-
Emmanouel Varvarigos, Christos Papageorgiou, and Panagiotis Kokkinos
- Subjects
Static routing ,Dynamic Source Routing ,Adaptive quality of service multi-hop routing ,Computer science ,business.industry ,Distributed computing ,ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS ,DSRFLOW ,Wireless Routing Protocol ,Optimized Link State Routing Protocol ,Link-state routing protocol ,Computer Science::Networking and Internet Architecture ,Destination-Sequenced Distance Vector routing ,business ,Computer network - Abstract
In this work we study the distributed implementation of multicost routing in mobile ad hoc networks. In contrast to single-cost routing, where each path is characterized by a scalar, in multicost routing a vector of cost parameters is assigned to each link, from which the cost vectors of the paths are calculated. These parameters are combined according to an optimization function for selecting the optimal path. Up until now the performance of multicost routing in ad hoc networks has been evaluated either at a theoretical level or by assuming that nodes are static and have full knowledge of the network topology and nodes' state. In the present paper we assess the performance of multicost routing, based on energy-related parameters, in mobile ad hoc networks by embedding its logic in the Dynamic Source Routing (DSR) algorithm, which is a well-known distributed routing algorithm. We compare the performance of the multicost-DSR algorithm to that of the original DSR algorithm under various node mobility scenarios. The results confirm that the multicost-DSR algorithm improves the performance of the network in comparison to the original DSR, by reducing energy consumption overall in the network, spreading energy consumption more uniformly across the network, and reducing the packet drop probability and delivery delay.
- Published
- 2008
- Full Text
- View/download PDF