Title
On the Complexity of System Throughput Derivation for Static 802.11 Networks
Abstract
The exploding popularity of 802.11 Wireless Local Area Networks (WLAN) has drawn intense research interest in the optimization of WLAN performance through channel assignment to access points (AP), AP-client association control, and transmission scheduling-we refer to any combination of the three approaches as WLAN management. No matter what degrees of freedom are enabled in WLAN management for performance optimization in a particular WLAN setting, a fundamental question is the corresponding maximum achievable system throughput. We show that for a particular network setting, the derivation of the system throughput (where system throughput is aggregate throughput of all clients or max-min throughput), for any combination of channel assignment, association control and transmission scheduling, is NP-hard and hard to approximate in polynomial time.
Year
DOI
Venue
2010
10.1109/LCOMM.2010.081910.100835
IEEE Communications Letters
Keywords
Field
DocType
Throughput,Schedules,Wireless LAN,Interference,Optimization,Aggregates,IEEE 802.11 Standards
Wireless,Code rate,Computer science,Scheduling (computing),Computer network,Communication channel,Real-time computing,Schedule,Local area network,Throughput,Channel allocation schemes
Journal
Volume
Issue
ISSN
14
10
1089-7798
Citations 
PageRank 
References 
1
0.36
9
Authors
4
Name
Order
Citations
PageRank
Gene Cheung Connie Chan11387121.82
Jeongkeun Lee2108956.72
Sung-Ju Lee33511278.11
Puneet Sharma42341188.96