Staff View
Robustness in ad hoc networks

Descriptive

TitleInfo
Title
Robustness in ad hoc networks
Name (type = personal)
NamePart (type = family)
Liu
NamePart (type = given)
Ying
NamePart (type = date)
1984-
DisplayForm
Ying Liu
Role
RoleTerm (authority = RULIB)
author
Name (type = personal)
NamePart (type = family)
Trappe
NamePart (type = given)
Wade
DisplayForm
Wade Trappe
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
chair
Name (type = personal)
NamePart (type = family)
Lindqvist
NamePart (type = given)
Janne
DisplayForm
Janne Lindqvist
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Zhang
NamePart (type = given)
Yanyong
DisplayForm
Yanyong Zhang
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Kaya
NamePart (type = given)
Aliye Ozge
DisplayForm
Aliye Ozge Kaya
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
outside member
Name (type = corporate)
NamePart
Rutgers University
Role
RoleTerm (authority = RULIB)
degree grantor
Name (type = corporate)
NamePart
School of Graduate Studies
Role
RoleTerm (authority = RULIB)
school
TypeOfResource
Text
Genre (authority = marcgt)
theses
OriginInfo
DateCreated (qualifier = exact)
2017
DateOther (qualifier = exact); (type = degree)
2017-10
CopyrightDate (encoding = w3cdtf); (qualifier = exact)
2017
Place
PlaceTerm (type = code)
xx
Language
LanguageTerm (authority = ISO639-2b); (type = code)
eng
Abstract (type = abstract)
Investigating the resilience of wireless network is critical since a network is susceptible to many types disturbances, ranging from natural (e.g. wind, building, hill, mobility) to adversarial (e.g. jamming, eavesdropping, denial of service). The notion of network resilience describes a network's ability to recover its structure should damages occur when one or more terminals are shut down or whenever sensitive information is compromised due to impersonating adversaries. This thesis addresses the following three problems related to the reduction of robustness in an ad hoc network: (1) The backtracking problem in overlay networking, which occurs during packet delivery. This condition forces a packet to traverse an extended distance due to the lack of network-layer information being fully shared with the overlay routing functions. With the presence of backtracking, the packet delivery error rate increases in relation with the traversal distance; (2) The black hole problem, which is characterized by the network being punctured, such as is caused by a jammer emitting format-compliant packets in an attempt to overflow a legitimate node's buffer. As a consequence, targeted nodes are segregated from the rest of network; (3) The reduced connectivity problem, which results from a repetitive jamming attack where the weakest link or node is selected by the jammer to be attacked. In this thesis, the first problem is solved by redesigning an overlay routing protocol to be aware of the geographical location of cluster heads. The overlay hash table is re-organized in an order based on distance. The second problem is solved in two different ways: First, a method is presented that locates the jammer's approximate position. Reinforcement learning is applied at each node to learn the possible position of the jammer. The node's judgment is propagated by the routing protocol to interactively exchange the belief about the attacker's position. Second, a power control approach that is being used by wireless nodes is presented that adjusts the transmission power dynamically according to the Fiedler value, which is inferred from topology information carried inherently in the Optimized Link State Routing (OLSR) Protocol. By varying the radio range, packet flows can bypass the jamming area after topology transformation, making the network more resilient. The third problem is approached by developing a better mathematical understanding of connectivity when facing interference, which is achieved by analyzing the achievable throughput based on connectivity. A metric that measures the throughput and weighted throughput connectivity is introduced. Then, the connectivity issue under a jamming attack is solved by applying stochastic game theory to analyze the utility of connectivity and the interactive behaviors of both the jammer and the scanner. An optimal scanning strategy is designed to defend against repetitive jamming attacks involving different intents, and to strengthen the network connectivity at the same time.
Subject (authority = RUETD)
Topic
Electrical and Computer Engineering
RelatedItem (type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier (type = RULIB)
ETD
Identifier
ETD_8336
PhysicalDescription
Form (authority = gmd)
electronic resource
InternetMediaType
application/pdf
InternetMediaType
text/xml
Extent
1 online resource (xv, 138 p. : ill.)
Note (type = degree)
Ph.D.
Note (type = bibliography)
Includes bibliographical references
Subject (authority = ETD-LCSH)
Topic
Ad hoc networks (Computer networks)
Note (type = statement of responsibility)
by Ying Liu
RelatedItem (type = host)
TitleInfo
Title
School of Graduate Studies Electronic Theses and Dissertations
Identifier (type = local)
rucore10001600001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/T33B638K
Genre (authority = ExL-Esploro)
ETD doctoral
Back to the top

Rights

RightsDeclaration (ID = rulibRdec0006)
The author owns the copyright to this work.
RightsHolder (type = personal)
Name
FamilyName
Liu
GivenName
Ying
Role
Copyright Holder
RightsEvent
Type
Permission or license
DateTime (encoding = w3cdtf); (qualifier = exact); (point = start)
2017-09-09 19:54:09
AssociatedEntity
Name
Ying Liu
Role
Copyright holder
Affiliation
Rutgers University. School of Graduate Studies
AssociatedObject
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.
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top

Technical

RULTechMD (ID = TECHNICAL1)
ContentModel
ETD
OperatingSystem (VERSION = 5.1)
windows xp
CreatingApplication
Version
1.4
DateCreated (point = end); (encoding = w3cdtf); (qualifier = exact)
2017-09-12T17:45:30
DateCreated (point = end); (encoding = w3cdtf); (qualifier = exact)
2017-09-12T17:45:30
ApplicationName
Acrobat Distiller 9.3.2 (Windows)
Back to the top
Version 8.5.5
Rutgers University Libraries - Copyright ©2024