research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Inproceedings
Entered by:chita
TitleImplementing Distributed Multicost Routing in Mobile Ad Hoc Networks using DSR
Bibtex cite IDRACTI-RU1-2008-19
Booktitle 6th ACM International Workshop on Mobility Management and Wireless Access(MOBIWAC 2008)
Year published 2008
Pages 35-42
Organization Mobiwac 2008
Note submitted to the 6th ACM International Workshop on Mobility Management and Wireless Access
In this work we study the implementation of multicost rout- ing in a distributed way in wireless mobile ad hoc networks. In contrast to traditional single-cost routing, where each path is characterized by a scalar, in multicost routing a vector of cost parameters is assigned to each network link, from which the cost vectors of candidate paths are calcu- lated. These parameters are combined in various optimiza- tion functions, corresponding to different routing algorithms, for selecting the optimal path. Up until now the performance of multicost and multi-constrained routing in wireless 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 fully distributed routing algorithm. We use simulations to compare the performance of the multicost-DSR algorithm to that of the original DSR algorithm and examine their behavior 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 algorithm in terms of energy efficiency. The multicost-DSR algorithm enhances the performance of the network not only by reducing energy consumption overall in the network, but also by spreading energy consumption more uniformly across the network, pro longing the network lifetime and reducing the packet drop probability. Furthermore the delay suffered by the packets reaching their destination for the case of the multicost-DSR algorithm is shown to be lower than in the case of the orig inal DSR algorithm.
Papageorgiou, Christos
Kokkinos, Panagiotis
Varvarigos, Emmanouel
MOBIWAC.pdf (main file)
Publication ID459