On the complexity of system throughput derivation for static 802.11 networks

Authors:
Gene Cheung;Jeongkeun Lee;Sung-Ju Lee;Puneet Sharma
Affiliations:
National Institute of Informatics, Hitotsubashi, Tokyo, Japan;Hewlett-Packard Laboratories;Hewlett-Packard Laboratories;Hewlett-Packard Laboratories
Venue:
IEEE Communications Letters
Year:
2010

Citing 5
Cited 0

Zero knowledge and the chromatic number

Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Impact of interference on multi-hop wireless network performance

Proceedings of the 9th annual international conference on Mobile computing and networking
Fairness and load balancing in wireless LANs using association control

Proceedings of the 10th annual international conference on Mobile computing and networking
Efficient interference-aware TDMA link scheduling for static wireless networks

Proceedings of the 12th annual international conference on Mobile computing and networking
Performance analysis of the IEEE 802.11 distributed coordination function

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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 maxmin throughput), for any combination of channel assignment, association control and transmission scheduling, is NP-hard and hard to approximate in polynomial time.