Itsik Bergel of Bar-Ilan University in Israel presents.

Abstract: We analyze and optimize the performance of distributed routing schemes in multihop wireless ad-hoc networks. We assume that the nodes are distributed according to a Poisson-Point-Process (PPP) and consider routing schemes that select the next relay based on geographical locations and local knowledge of the channel state (CSI). At the first stage we define the optimization problem and give an expression for the optimal routing metric in a network that achieves the ergodic rate density (ERD) in each link. We then use a recently published bound on the ERD, and present a low complexity, sub optimal routing metric. Both metrics are derived for the cases of single antenna and multiple antenna nodes, and are also able to locally optimize the instantaneous number of spatial streams and the precoding weights. Numerical results demonstrate that the low complexity scheme performs nearly as good as the optimal scheme, and both schemes outperform previously published schemes.

свернуть