Multicost Routing over an Infinite Time Horizon in Energy and Capacity Constrained Wireless Ad-Hoc Networks

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.

• Type: Conference
• Year: 2006
• Where: EUROPAR
• Authors: Christos A. Papageorgiou, Panagiotis C. Kokkinos, Emmanouel A. Varvarigos
• Keywords: Distributed And Parallel Computing, Energy-aware Routing Algorithm, EUROPAR 2006, Maximum Throughput, Minimum-hop Algorithm