DocumentCode :
2330100
Title :
Approximate Capacity Subregions of Uniform Multihop Wireless Networks
Author :
Wan, Peng-Jun ; Wang, Lixin ; Huang, Ai ; Li, Minming ; Yao, Frances
Author_Institution :
Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL, USA
fYear :
2010
fDate :
14-19 March 2010
Firstpage :
1
Lastpage :
9
Abstract :
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.
Keywords :
IEEE standards; optimisation; radio networks; telecommunication standards; 802.11 interference model; NP-complete; approximation factor; capacity optimization problems; cocomparability graphs; polynomial approximate capacity subregion; protocol interference model; spatial-divide-conquer; uniform communication radii; uniform multihop wireless networks; Algorithm design and analysis; Application software; Communications Society; Computer science; Interference; Polynomials; Processor scheduling; Scheduling algorithm; Spread spectrum communication; Wireless networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM, 2010 Proceedings IEEE
Conference_Location :
San Diego, CA
ISSN :
0743-166X
Print_ISBN :
978-1-4244-5836-3
Type :
conf
DOI :
10.1109/INFCOM.2010.5461904
Filename :
5461904
Link To Document :
بازگشت