On the probability of finding non-interfering paths in wireless multihop networks

Authors:
S. Waharte;R. Boutaba
Affiliations:
David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada;David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada
Venue:
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Year:
2008

Citing 4
Cited 2

Probability and statistics

Probability and statistics
On the minimum node degree and connectivity of a wireless multihop network

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
On the impact of alternate path routing for load balancing in mobile ad hoc networks

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
A survey on sensor networks

IEEE Communications Magazine

Analysis of Multiple Attempt Multipath Routing for mobile ad hoc networks

International Journal of Ad Hoc and Ubiquitous Computing
Local heuristic for the refinement of multi-path routing in wireless mesh networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multipath routing can improve system performance of capacity-limited wireless networks through load balancing. However, even with a single source and destination, intra-flow and inter-flow interference can void any performance improvement. In this paper, we show that establishing non-interfering paths can, in theory, leverage this issue. In practice however, finding non-interfering paths can be quite complex. In fact, we demonstrate that the problem of finding two non-interfering paths for a single source-destination pair is NP-complete. Therefore, an interesting problem is to determine if, given a network topology, non-interfering multipath routing is appropriate. To address this issue, we provide an analytic approximation of the probability of finding two non-interfering paths. The correctness of the analysis is verified by simulations.