Minimum-outage unicast routing in cooperative wireless networks

We consider the problem of cooperative routing with minimum end-to-end outage in a wireless network. Only the average channel condition is available to the transmitters, therefore there is a possibility of outage on every link from source to destination. Nodes have fixed transmission power so the problem is to determine the order of nodes to transmit from the source to the destination. Each node along the way can hear and combine the two transmitters that transmit just before it. We find the optimal solution based on the Branch-Bound method and also consider some suboptimal algorithms. The simulation results show that one of the suboptimal algorithms can perform very closely to the optimal one.