Energy efficient routing for connection-oriented traffic in ad-hoc wireless networks

We address the problem of routing connection-oriented traffic in wireless ad-hoc networks under minimum energy expenditures. We outline the tradeoffs that arise by the flexibility to transmit at different power levels and propose distributed algorithms on how to select connection paths relying only on local information. We propose a set of link metrics that capture network parameters and use them for the computation of shortest paths in static topologies. The performance is measured by the call blocking probability and average consumed energy. The algorithms are evaluated by a detailed simulation model and their key characteristics are discussed.