Approximate capacity subregions of uniform multihop wireless networks

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.