Distributed fair scheduling for Wireless Mesh Networks using IEEE 802.11

Cited 0 time in webofscience Cited 21 time in scopus
  • Hit : 822
  • Download : 662
DC FieldValueLanguage
dc.contributor.authorLee, Janghwan-
dc.contributor.authorYoon, Hyunsoo-
dc.contributor.authorYeom, Ikjun-
dc.date.accessioned2011-03-22T09:05:41Z-
dc.date.available2011-03-22T09:05:41Z-
dc.date.issued2010-11-
dc.identifier.citationIEEE Transactions on Vehicular Technology, Vol.59, No.9en
dc.identifier.issn0018-9545-
dc.identifier.urihttp://hdl.handle.net/10203/22897-
dc.description.abstractIn 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 multichannelWMNs. 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 hroughput.en
dc.language.isoen_USen
dc.publisherIEEEen
dc.subjectFairnessen
dc.subjectIEEE 802.11en
dc.subjectwireless mesh network(WMN)en
dc.titleDistributed fair scheduling for Wireless Mesh Networks using IEEE 802.11en
dc.typeArticleen
dc.identifier.doi10.1109/TVT.2010.2076319-

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0