Minimum outage cooperative routing in wireless networks

In multihop wireless networks ?wireless broadcast advantage? can be utilized in order to both exploit all the useful signal in wireless environment and decrese outage probability by utilizing spatial diversity. We propose cooperative unicast and broadcast algorithms in wireless networks. Objective of this work is to minimize end-to-end outage probability so we use outage probability as a performance metric. Nodes have fixed transmission power. We consider the problem of finding the optimal set and order of transmitters that minimizes the overall outage probability in a wireless fading channel. The receiving nodes are able to combine all the previous transmission sand achieve better receive SNR. We find the optimal solution based on the branch&bound method. Also we consider some suboptimal algorithms. The simulation results and the numerical evaluations show that some suboptimal algorithms perform very close to routing with branch&bound method, the optimal one.