Bandwidth allocation in wireless ad-hoc networks with minimum-energy consumption

Energy conservation is a critical issue in wireless multi-hop networks since the nodes are powered by batteries only. In the previous work in minimum-energy routing, the optimal routing of data flows is formulated essentially as a shortest directed path problem based on various power cost function. In this paper, we study the minimum-energy QoS routing problem using a capacitated multi-commodity flow model for the data flows in the network. Experiment results show that when the network bandwidth is very limited, it can offer a higher success rate to find a satisfactory QoS route than those protocols that only try to find a unipath.