Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Proceedings of the 11th annual international conference on Mobile computing and networking
Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Multiflows in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Node packings on cocomparability graphs
Operations Research Letters
Improved throughput bounds for interference-aware routing inwireless networks
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Hi-index | 0.00 |
The capacity region of multihop wireless network is involved in many capacity optimization problems. However, the membership of the capacity region is NP-complete in general, and hence the direct application of capacity region is quite limited. As a compromise, we often substitute the capacity region with a polynomial approximate capacity subregion. In this paper, we construct polynomial µ-approximate capacity subregions of multihop wireless network under either 802.11 interference model or protocol interference model in which all nodes have uniform communication radii normalized to one and uniform interference radii ρ ≥ 1. The approximation factor µ decreases with ρ in general and is smaller than the best-known ones in the literature. For example, µ = 3 when ρ ≥ 2.2907 under the 802.11 interference model or when ρ ≥ 4.2462 under the protocol interference model. Our construction exploits a nature of the wireless interference called strip-wise transitivity of independence discovered in this paper and utilize the independence polytopes of cocomparability graphs in a spatial-divide-conquer manner. We also apply these polynomial µ-approximate capacity subregions to compute µ-approximate solutions for maximum (concurrent) multiflows