Multicost routing over an infinite time horizon in energy and capacity constrained wireless ad-hoc networks

Authors:
Christos A. Papageorgiou;Panagiotis C. Kokkinos;Emmanouel A. Varvarigos
Affiliations:
,Department of Computer Engineering and Informatics, University of Patras, Patras, Greece;Department of Computer Engineering and Informatics, University of Patras, Patras, Greece;,Department of Computer Engineering and Informatics, University of Patras, Patras, Greece
Venue:
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Year:
2006

Citing 5
Cited 2

Data networks

Data networks
Capacity of Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Energy-Aware On-Demand Routing for Mobile Ad Hoc Networks

IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Maximum lifetime routing in wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
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

Implementing distributed multicost routing in mobile ad hoc networks using dsr

Proceedings of the 6th ACM international symposium on Mobility management and wireless access
Joint multi-cost routing and power control in wireless ad hoc networks

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we study the dynamic one-to-one communication problem in energy- and capacity-constrained wireless ad-hoc networks. The performance of such networks is evaluated under random traffic generation and continuous energy recharging at the nodes over an infinite-time horizon. We are interested in the maximum throughput that can be sustained by the network with the node queues being finite and in the average packet delay for a given throughput. We propose a multicost energy-aware routing algorithm and compare its performance to that of minimum-hop routing. The results of our experiments show that generally the energy-aware algorithm achieves a higher maximum throughput than the minimum-hop algorithm. More specifically, when the network is mainly energy-constrained and for the 2-dimensional topology considered, the throughput of the proposed energy-aware routing algorithm is found to be almost twice that of the minimum-hop algorithm.