Interference aware multi-path routing in wireless networks
Aravind B. Mohanoor, Sridhar Radhakrishnan, Venkatesh Sarangan · 2008
We can improve the end-to-end throughput between a sender and receiver in a wireless network using multiple paths which do not interfere with each other. Given that the problem of finding such paths is computationally hard, the paper focuses on finding multiple paths which may have interference between them, but still are able to obtain the maximum possible throughput. It is achieved by observing that the pattern of interference is more important than the number of interfering links. The nature of path sets with non-destructive interference is discussed and based on these observations, combinatorial techniques for finding interference aware disjoint paths in a wireless network are presented. Simulation results indicate that the proposed solutions achieve throughputs that are significantly higher than the established theoretical results.