Proceedings of the 9th annual international conference on Mobile computing and networking
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
A Robust Interference Model for Wireless Ad-Hoc Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Reducing interference in ad hoc networks through topology control
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
The capacity of wireless networks
IEEE Transactions on Information Theory
Forwarding capacity of an infinite wireless network
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
An upper bound on multi-hop multi-channel wireless network performance
Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
Hi-index | 0.00 |
Given a placement of wireless nodes in space and a traffic demand between pairs of nodes, can these traffic demands be supported by the resulting network? A key issue for answering this question is wireless interference between neighbouring nodes including self interference along multi-hop paths. This paper presents a generic model for sustainable network load in a multi-hop wireless network under interference constraints, and recasts this model into a multicommodity flow problem with interference constraints. Using Farkas' Lemma, we obtain a necessary and sufficient condition for feasibility of this multicommodity flow problem, leading to a tight upper bound on network throughput. Our results are illustrated by examples.