Skip to Main Content
Employing channel state information at the network layer, an effective routing metric is obtained that minimizes the end-to-end outage probability in amplify-and-forward multihop wireless networks. A disadvantage of the routing metric obtained is that it cannot be optimized in distributed manner, i.e., it does not converge onto optimal routes. The disadvantage cannot be remedied by exhaustive search because an exhaustive search is not feasible owing to the factorial growth of the search space with the number of nodes in the network. Therefore, a new composite metric and a packet forwarding algorithm are introduced which satisfy the optimality and consistency requirements for distributed implementation. It is proved that the proposed distributed algorithm converges onto optimal paths in any network topology.