Increasing Packet Delivery Ratio in DSR by Link Prediction
HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9 - Volume 9
TPBDSR: A New DSR-Based Energy Saving Routing in MANET
ICCNMC '03 Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing
Node-disjointness-based multipath routing for mobile ad hoc networks
PE-WASUN '04 Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Energy-Aware Routing in Wireless Ad-Hoc Networks
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
Multi-constrained soft-QoS provisioning in wireless sensor networks
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Comparing tcp and udp performance in manets using multipath enhanced versions of dsr and dymo
Proceedings of the 4th ACM workshop on Performance evaluation of wireless ad hoc, sensor,and ubiquitous networks
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Simulating mission critical mobile ad hoc networks
Proceedings of the 4th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Modeling human mobility in obstacle-constrained ad hoc networks
Ad Hoc Networks
| Hi-index | 0.00 |
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.