Staff View
Association, routing and scheduling algorithms for enhancing throughput and fairness in wireless mesh networks

Descriptive

TypeOfResource
Text
TitleInfo (ID = T-1)
Title
Association, routing and scheduling algorithms for enhancing throughput and fairness in wireless mesh networks
Identifier
ETD_2983
Identifier (type = hdl)
http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000056576
Language
LanguageTerm (authority = ISO639-2); (type = code)
eng
Genre (authority = marcgt)
theses
Subject (ID = SBJ-1); (authority = RUETD)
Topic
Electrical and Computer Engineering
Subject (ID = SBJ-2); (authority = ETD-LCSH)
Topic
Computer scheduling
Subject (ID = SBJ-3); (authority = ETD-LCSH)
Topic
Routing (Computer network management)
Abstract (type = abstract)
Wireless mesh networks (WMNs) have emerged as a promising step towards the goal of ubiquitous broadband wireless access due to the ease of deployment and its low cost. Current research on WMNs aims at a number of challenges, including capacity limitation and poor fairness. In this thesis we carefully design association, routing and scheduling algorithms to enhance throughput and fairness in WMNs. The association mechanism specified by the IEEE 802.11 standard is based on the received signal strength. Employing this mechanism in WMNs may only achieve low throughput and low user transmission rates. We develop a new association framework in order to provide optimal association and network performance in WMNs. In this framework, we first propose two new access link metrics that are aware of channel condition, channel access contention as well as AP load. We then extend association mechanisms based on such metrics in a cross-layer manner taking into account information from the routing layer, in order to fit it in the operation of WMNs. We evaluate the performance of our system through simulations, and show that WMNs that use the proposed association mechanism can achieve up to 100% improvement in throughput and delay. Contention-based MAC protocols such as 802.11 greatly limit the throughput and fairness of WMNs. Significantly higher throughput and fairness are achievable if bandwidth is carefully allocated and transmissions are scheduled. To study the performance limits of WMNs, we first optimally allocate bandwidth to each data flow, jointly computing the user-router association and backbone routing solutions, such that network throughput can be maximized while certain fairness is achieved. We then focus on the integral association, single-path routing case and investigate the optimal performance of a WMN on a given tree topology. We also develop an efficient scheduling algorithm to coordinate channel access and to enforce the allocated bandwidth. Our evaluation shows that association and routing have a great impact on bandwidth allocation, namely constructing a good topology can improve throughput while enhancing fairness. Finally, multiple channel and Multiple-Input-Multiple-Output (MIMO) are two technologies being introduced into WMNs to mitigate interference and increase network capacity. Higher layer protocols need to be aware of these techniques in order to fully leverage their benefits, which makes cross-layer approach desirable. We first formulate a cross-layer optimization framework for maximizing an aggregate utility, which jointly allocates link bandwidth for data flows, and determines channel assignment and MIMO stream selection. We then present an efficient MIMO-aware scheduling algorithm called stream controlled multiple access (SCMA). SCMA determines a baseline schedule in the channel assignment stage where a set of non-interfering links are scheduled on each channel. The second stage of SCMA, link pairing, takes advantage of the performance gain of MIMO stream control. SCMA also incorporates a congestion control scheme at traffic sources to prevent the network from being overloaded. Simulation results show that the MIMO-aware scheduling algorithm leads to about 50%~100% higher throughput while preserving fairness than the MIMO-oblivious algorithm. It achieves close-to-the-optimal performance in certain scenarios.
PhysicalDescription
Form (authority = gmd)
electronic resource
Extent
ix, 104 p. : ill.
InternetMediaType
application/pdf
InternetMediaType
text/xml
Note (type = degree)
Ph.D.
Note (type = bibliography)
Includes bibliographical references
Note (type = vita)
Includes vita
Note (type = statement of responsibility)
by Lin Luo
Name (ID = NAME-1); (type = personal)
NamePart (type = family)
Luo
NamePart (type = given)
Lin
Role
RoleTerm (authority = RULIB)
author
DisplayForm
Lin Luo
Name (ID = NAME-2); (type = personal)
NamePart (type = family)
Raychaudhuri
NamePart (type = given)
Dipankar
Role
RoleTerm (authority = RULIB)
chair
Affiliation
Advisory Committee
DisplayForm
Dipankar Raychaudhuri
Name (ID = NAME-3); (type = personal)
NamePart (type = family)
Yates
NamePart (type = given)
Roy
Role
RoleTerm (authority = RULIB)
internal member
Affiliation
Advisory Committee
DisplayForm
Roy Yates
Name (ID = NAME-4); (type = personal)
NamePart (type = family)
Trappe
NamePart (type = given)
Wade
Role
RoleTerm (authority = RULIB)
internal member
Affiliation
Advisory Committee
DisplayForm
Wade Trappe
Name (ID = NAME-5); (type = personal)
NamePart (type = family)
Liu
NamePart (type = given)
Hang
Role
RoleTerm (authority = RULIB)
outside member
Affiliation
Advisory Committee
DisplayForm
Hang Liu
Name (ID = NAME-1); (type = corporate)
NamePart
Rutgers University
Role
RoleTerm (authority = RULIB)
degree grantor
Name (ID = NAME-2); (type = corporate)
NamePart
Graduate School - New Brunswick
Role
RoleTerm (authority = RULIB)
school
OriginInfo
DateCreated (qualifier = exact)
2010
DateOther (qualifier = exact); (type = degree)
2010-10
Place
PlaceTerm (type = code)
xx
RelatedItem (type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier (type = RULIB)
ETD
RelatedItem (type = host)
TitleInfo
Title
Graduate School - New Brunswick Electronic Theses and Dissertations
Identifier (type = local)
rucore19991600001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/T3GF0T70
Genre (authority = ExL-Esploro)
ETD doctoral
Back to the top

Rights

RightsDeclaration (AUTHORITY = GS); (ID = rulibRdec0006)
The author owns the copyright to this work.
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
RightsHolder (ID = PRH-1); (type = personal)
Name
FamilyName
Luo
GivenName
Lin
Role
Copyright Holder
RightsEvent (ID = RE-1); (AUTHORITY = rulib)
Type
Permission or license
DateTime
2010-10-01 15:31:01
AssociatedEntity (ID = AE-1); (AUTHORITY = rulib)
Role
Copyright holder
Name
Lin Luo
Affiliation
Rutgers University. Graduate School - New Brunswick
AssociatedObject (ID = AO-1); (AUTHORITY = rulib)
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.
Back to the top

Technical

ContentModel
ETD
MimeType (TYPE = file)
application/pdf
MimeType (TYPE = container)
application/x-tar
FileSize (UNIT = bytes)
1228800
Checksum (METHOD = SHA1)
b9512795ba5c90b75c2cd4cf1d1d4f2fc75828f0
Back to the top
Version 8.3.13
Rutgers University Libraries - Copyright ©2021