Optimal and Suboptimal Routing Based on Partial CSI in Wireless Ad-hoc Networks

Yiftach Richter, I. Bergel

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


In this paper, 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, suboptimal routing metric. Numerical results demonstrate that the low complexity scheme performs nearly as good as the optimal scheme.
Original languageAmerican English
Title of host publication2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)
StatePublished - 2015

Bibliographical note

Place of conference:Sweden


Dive into the research topics of 'Optimal and Suboptimal Routing Based on Partial CSI in Wireless Ad-hoc Networks'. Together they form a unique fingerprint.

Cite this