Statistically Optimal Routing Scheme in Multihop Wireless Ad-Hoc Networks

In this paper, we propose a novel distributed routing scheme in multihop wireless adhoc networks. We assume that the nodes are distributed according to a Poisson-Point-Process (PPP), and employ stochastic-geometric tools to derive a novel routing metric. The proposed Statistically-Optimal (SO) scheme, works in a decentralized manner in which the next relay selection exploits knowledge on the geographical location of each possible relay and on the instantaneous channel gain (fading diversity). The SO scheme maximizes the expected routing performance metric given the channel gains to the potential relays and their locations. Simulations results demonstrate that the SO scheme outperforms previously published schemes, and achieve performance which is close to the upper bound on ALOHA performance. Furthermore, the implementation of the suggested SO scheme is very simple, and the metric evaluation requires only minimal computations.