Buffer Sizing in 802.11 Wireless Mesh Networks

Handle URI:
http://hdl.handle.net/10754/362173
Title:
Buffer Sizing in 802.11 Wireless Mesh Networks
Authors:
Jamshaid, Kamran; Shihada, Basem ( 0000-0003-4434-4334 ) ; Xia, Li; Levis, Philip
Abstract:
We analyze the problem of buffer sizing for TCP flows in 802.11-based Wireless Mesh Networks. Our objective is to maintain high network utilization while providing low queueing delays. The problem is complicated by the time-varying capacity of the wireless channel as well as the random access mechanism of 802.11 MAC protocol. While arbitrarily large buffers can maintain high network utilization, this results in large queueing delays. Such delays may affect TCP stability characteristics, and also increase queueing delays for other flows (including real-time flows) sharing the buffer. In this paper we propose sizing link buffers collectively for a set of nodes within mutual interference range called the 'collision domain'. We aim to provide a buffer just large enough to saturate the available capacity of the bottleneck collision domain that limits the carrying capacity of the network. This neighborhood buffer is distributed over multiple nodes that constitute the network bottleneck; a transmission by any of these nodes fully utilizes the available spectral resource for the duration of the transmission. We show that sizing routing buffers collectively for this bottleneck allows us to have small buffers (as low as 2 - 3 packets) at individual nodes without any significant loss in network utilization. We propose heuristics to determine these buffer sizes in WMNs. Our results show that we can reduce the end-to-end delays by 6× to 10× at the cost of losing roughly 5% of the network capacity achievable with large buffers.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Jamshaid, Kamran, Basem Shihada, Li Xia, and Philip Levis. "Buffer sizing in 802.11 wireless mesh networks." In Mobile Adhoc and Sensor Systems (MASS), 2011 IEEE 8th International Conference on, pp. 272-281. IEEE, 2011.
Publisher:
IEEE
Journal:
Mobile Adhoc and Sensor Systems (MASS), 2011 IEEE 8th International Conference on
Conference/Event name:
8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2011
Issue Date:
Oct-2011
DOI:
10.1109/MASS.2011.34
Type:
Conference Paper
Additional Links:
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6076625
Appears in Collections:
Conference Papers; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorJamshaid, Kamranen
dc.contributor.authorShihada, Basemen
dc.contributor.authorXia, Lien
dc.contributor.authorLevis, Philipen
dc.date.accessioned2015-04-09T06:11:37Zen
dc.date.available2015-04-09T06:11:37Zen
dc.date.issued2011-10en
dc.identifier.citationJamshaid, Kamran, Basem Shihada, Li Xia, and Philip Levis. "Buffer sizing in 802.11 wireless mesh networks." In Mobile Adhoc and Sensor Systems (MASS), 2011 IEEE 8th International Conference on, pp. 272-281. IEEE, 2011.en
dc.identifier.doi10.1109/MASS.2011.34en
dc.identifier.urihttp://hdl.handle.net/10754/362173en
dc.description.abstractWe analyze the problem of buffer sizing for TCP flows in 802.11-based Wireless Mesh Networks. Our objective is to maintain high network utilization while providing low queueing delays. The problem is complicated by the time-varying capacity of the wireless channel as well as the random access mechanism of 802.11 MAC protocol. While arbitrarily large buffers can maintain high network utilization, this results in large queueing delays. Such delays may affect TCP stability characteristics, and also increase queueing delays for other flows (including real-time flows) sharing the buffer. In this paper we propose sizing link buffers collectively for a set of nodes within mutual interference range called the 'collision domain'. We aim to provide a buffer just large enough to saturate the available capacity of the bottleneck collision domain that limits the carrying capacity of the network. This neighborhood buffer is distributed over multiple nodes that constitute the network bottleneck; a transmission by any of these nodes fully utilizes the available spectral resource for the duration of the transmission. We show that sizing routing buffers collectively for this bottleneck allows us to have small buffers (as low as 2 - 3 packets) at individual nodes without any significant loss in network utilization. We propose heuristics to determine these buffer sizes in WMNs. Our results show that we can reduce the end-to-end delays by 6× to 10× at the cost of losing roughly 5% of the network capacity achievable with large buffers.en
dc.publisherIEEEen
dc.relation.urlhttp://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6076625en
dc.rights© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.en
dc.titleBuffer Sizing in 802.11 Wireless Mesh Networksen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalMobile Adhoc and Sensor Systems (MASS), 2011 IEEE 8th International Conference onen
dc.conference.date17 October 2011 through 22 October 2011en
dc.conference.name8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2011en
dc.conference.locationValenciaen
dc.eprint.versionPost-printen
dc.contributor.institutionDepartment of Computer Science, Stanford University, USAen
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)en
kaust.authorJamshaid, Kamranen
kaust.authorShihada, Basemen
kaust.authorXia, Lien
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.