Heuristic Routing Algorithms for Minimum Energy Cooperative Multi-hop Wireless Networks

Inhalt:
We investigate the minimum energy routing problem in cooperative multi-hop networks, where a single source communicates to a single destination assisted by several multi-hop relays that can accumulate information from retransmissions. Solving the minimum sum transmitter power problem for a multi-hop network implies finding the optimal resource allocation and transmission order (path). We address this problem by first deriving the path weight function which returns the minimum energy for given path. This function is found to admit a useful duality property which, basically, let us to define two recursive computations of the path weight using the intermediate path weights to each relay, either from the source (forward) or from the destination (backward). We propose new heuristics path discovering algorithms that make use of the duality property and are based on Dijkstra’s algorithm.