Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
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
Algorithmic aspects of capacity in wireless networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proceedings of the 11th annual international conference on Mobile computing and networking
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
| Hi-index | 0.00 |
End-to-end throughput θsd is the maximum amount of data that can be successfully delivered from source s to sink d across a given network in unit time. Determining θsd is essential to understanding the network limit and is of important value to network design and evaluation. In the past few years, the problem of computing θsd in multihop wireless networks has been extensively studied in the literature. It has been shown that this problem is NP-hard in general and various approaches have been proposed to compute approximate solutions. In this paper, we study one side of the problem, computing the upperbound of θsd. We present a general solution framework based on linear program LP$(\mathcal{F})$, where $\mathcal{F}$ is an arbitrary set of link sets. We show each choice of $\mathcal{F}$ corresponds to an upperbound of θsd and identify several good choice of $\mathcal{F}$ based on the notions of clique and congestion. The tightness of these clique and congestion based upperbounds are evaluated by simulation.