An outage-aware power saving Cooperative Routing algorithm in wireless networks

In this paper emphasizing the relation between outage and power, we propose a novel cooperative routing algorithm, called Outage-aware K-shortest paths Cooperative Routing (OKCR), which minimizes the transmitted power while exploiting the merit of cooperative communication. The OKCR algorithm (i.e., inherently based on Yen´s Kshortest paths algorithm) finds the best route between the source and the destination considering particular outage probability as its constraint. The proposed algorithm nominates k different optimum routes and then selects the best possible relay in each route on the basis of performance analysis. Simulation results show that this strategy enhances power-efficiency in comparison to non-cooperative and other existing cooperative algorithms investigated in the literature by more than 50%.