Fair packet scheduling in Wireless Mesh Networks

Handle URI:
http://hdl.handle.net/10754/348507
Title:
Fair packet scheduling in Wireless Mesh Networks
Authors:
Nawab, Faisal; Jamshaid, Kamran; Shihada, Basem ( 0000-0003-4434-4334 ) ; Ho, Pin Han
Abstract:
In this paper we study the interactions of TCP and IEEE 802.11 MAC in Wireless Mesh Networks (WMNs). We use a Markov chain to capture the behavior of TCP sessions, particularly the impact on network throughput due to the effect of queue utilization and packet relaying. A closed form solution is derived to numerically determine the throughput. Based on the developed model, we propose a distributed MAC protocol called Timestamp-ordered MAC (TMAC), aiming to alleviate the unfairness problem in WMNs. TMAC extends CSMA/CA by scheduling data packets based on their age. Prior to transmitting a data packet, a transmitter broadcasts a request control message appended with a timestamp to a selected list of neighbors. It can proceed with the transmission only if it receives a sufficient number of grant control messages from these neighbors. A grant message indicates that the associated data packet has the lowest timestamp of all the packets pending transmission at the local transmit queue. We demonstrate that a loose ordering of timestamps among neighboring nodes is sufficient for enforcing local fairness, subsequently leading to flow rate fairness in a multi-hop WMN. We show that TMAC can be implemented using the control frames in IEEE 802.11, and thus can be easily integrated in existing 802.11-based WMNs. Our simulation results show that TMAC achieves excellent resource allocation fairness while maintaining over 90% of maximum link capacity across a large number of topologies.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Fair packet scheduling in Wireless Mesh Networks 2014, 13:414 Ad Hoc Networks
Publisher:
Elsevier
Journal:
Ad Hoc Networks
Issue Date:
Feb-2014
DOI:
10.1016/j.adhoc.2013.09.002
Type:
Article
ISSN:
15708705
Additional Links:
http://linkinghub.elsevier.com/retrieve/pii/S1570870513002035
Appears in Collections:
Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorNawab, Faisalen
dc.contributor.authorJamshaid, Kamranen
dc.contributor.authorShihada, Basemen
dc.contributor.authorHo, Pin Hanen
dc.date.accessioned2015-04-06T08:38:26Zen
dc.date.available2015-04-06T08:38:26Zen
dc.date.issued2014-02en
dc.identifier.citationFair packet scheduling in Wireless Mesh Networks 2014, 13:414 Ad Hoc Networksen
dc.identifier.issn15708705en
dc.identifier.doi10.1016/j.adhoc.2013.09.002en
dc.identifier.urihttp://hdl.handle.net/10754/348507en
dc.description.abstractIn this paper we study the interactions of TCP and IEEE 802.11 MAC in Wireless Mesh Networks (WMNs). We use a Markov chain to capture the behavior of TCP sessions, particularly the impact on network throughput due to the effect of queue utilization and packet relaying. A closed form solution is derived to numerically determine the throughput. Based on the developed model, we propose a distributed MAC protocol called Timestamp-ordered MAC (TMAC), aiming to alleviate the unfairness problem in WMNs. TMAC extends CSMA/CA by scheduling data packets based on their age. Prior to transmitting a data packet, a transmitter broadcasts a request control message appended with a timestamp to a selected list of neighbors. It can proceed with the transmission only if it receives a sufficient number of grant control messages from these neighbors. A grant message indicates that the associated data packet has the lowest timestamp of all the packets pending transmission at the local transmit queue. We demonstrate that a loose ordering of timestamps among neighboring nodes is sufficient for enforcing local fairness, subsequently leading to flow rate fairness in a multi-hop WMN. We show that TMAC can be implemented using the control frames in IEEE 802.11, and thus can be easily integrated in existing 802.11-based WMNs. Our simulation results show that TMAC achieves excellent resource allocation fairness while maintaining over 90% of maximum link capacity across a large number of topologies.en
dc.publisherElsevieren
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S1570870513002035en
dc.rightsArchived with thanks to Ad Hoc Networksen
dc.titleFair packet scheduling in Wireless Mesh Networksen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalAd Hoc Networksen
dc.eprint.versionPost-printen
dc.contributor.institutionUniversity of California Santa Barbara, Santa Barbara, CA, USAen
dc.contributor.institutionUniversity of Waterloo, Waterloo, ON, Canadaen
kaust.authorJamshaid, Kamranen
kaust.authorShihada, Basemen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.