On the Complexity of System Throughput Derivation for Static 802.11 Networks

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 211
  • Download : 0
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.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2010-10
Language
English
Article Type
Article
Citation

IEEE COMMUNICATIONS LETTERS, v.14, no.10, pp.906 - 908

ISSN
1089-7798
DOI
10.1109/LCOMM.2010.081910.100835
URI
http://hdl.handle.net/10203/198339
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0