Distributed Fair Scheduling for Wireless Mesh Networks Using IEEE 802.11

Cited 18 time in webofscience Cited 0 time in scopus
  • Hit : 377
  • Download : 0
In IEEE-802.11-based wireless mesh networks (WMNs), unfair bandwidth sharing may arise, because the carrier sense multiple access with collision avoidance protocol is designed to provide per-station fairness only in one hop. As the hop count from a mobile client to the gateway node increases, the throughput of the node drastically decreases. In this paper, we propose a fair bandwidth allocation scheme for multiradio multichannel WMNs. This scheme provides fair bandwidth sharing among the nodes in a WMN, regardless of their hop distance from the gateway node. To achieve fairness, we first estimate the number of active nodes attached to each router and calculate the effective weights of routers based on the estimation. Then, we differentiate their contention window using their weights. For this method, we derive a multihop packet collision model. The proposed scheme is fully distributed and does not require any global information. Through an extensive simulation study, we show that our scheme ensures per-node fairness without loss of the total aggregate throughput.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2010-11
Language
English
Article Type
Article
Keywords

PERFORMANCE

Citation

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, v.59, no.9, pp.4467 - 4475

ISSN
0018-9545
DOI
10.1109/TVT.2010.2076319
URI
http://hdl.handle.net/10203/97067
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 18 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0