CSMA-Based Robust AP Throughput Guarantee Under User Distribution Uncertainty

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 307
  • Download : 0
We consider the problem of providing inter-access-point (AP) fairness guarantee in dense AP deployments where starvation can occur. In particular, we develop a framework for providing robust minimum throughput guarantee for each AP under the uncertainty of user distributions. Our framework consists of an AP throughput provisioning scheme and a distributed CSMA algorithm. The throughput provisioning scheme computes a robust feasible minimum AP throughput vector based on a random AP-level conflict graph and chance-constrained optimization. By incorporating the minimum throughput vector, we develop a distributed CSMA algorithm that fulfills the minimum requirement for each AP and is compatible with the IEEE 802.11 standard. We show through extensive simulations that our framework addresses the AP starvation problem by guaranteeing minimum throughput for each AP.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2015-06
Language
English
Article Type
Article
Keywords

NETWORKS; FAIRNESS; INTERFERENCE

Citation

IEEE-ACM TRANSACTIONS ON NETWORKING, v.23, no.3, pp.782 - 795

ISSN
1063-6692
DOI
10.1109/TNET.2014.2305985
URI
http://hdl.handle.net/10203/200036
Appears in Collection
EE-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