Distributed Energy-Efficient Cooperative Routing in Wireless Networks

Recently, cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing powerefficient routing algorithms. Most of the existing cooperationbased routing algorithms are implemented by finding a shortestpath route first. As such, these routing algorithms do not fully exploit the merits of cooperative communications at the physical layer. In this paper, we propose a cooperation-based routing algorithm, namely, Minimum Power Cooperative Routing (MPCR) algorithm, which makes full use of the cooperative communications while constructing the minimum-power route. The MPCR algorithm constructs the minimum-power route as a cascade of the minimum-power single-relay building blocks from the source to the destination. Hence, any distributed shortestpath algorithm can be utilized to find the optimal route with polynomial complexity, while guaranteeing certain throughput. We show that the MPCR algorithm can ach...

• Type: Conference
• Year: 2007
• Where: GLOBECOM
• Authors: Ahmed S. Ibrahim, Zhu Han, K. J. Ray Liu
• Keywords: Communications, Cooperationbased Routing Algorithms, Cooperative Routing, GLOBECOM 2007, Routing Algorithms