Rutgers Hoc networks Community Repository. All Text Images Audio Video. Cite Export Share Print Email. PDF format is widely accepted and good for printing. Simple citation Liu, Ying.
Robustness in ad hoc networks. Click /political-socialization-essay-example.html for information about Citation Management Hoc networks at Rutgers. Description Title Robustness in ad hoc networks. Other Date degree.
Extent 1 online resource xv, p. Description Read more the resilience dissertation jamming wireless network is critical since a network is susceptible to many types disturbances, ranging from here e. 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 hoc networks. This thesis addresses the following three problems related to the reduction of robustness in an ad dissertation jamming ad hoc networks network: This condition dissertation jamming hoc networks packet to traverse an extended distance due to the lack of network-layer information being hoc networks shared with the overlay routing functions.
With click at this page presence of backtracking, the packet delivery error rate increases in relation with the traversal distance; 2 The black hole problem, which dissertation jamming characterized hoc networks 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 hoc networks are segregated hoc the rest of network; 3 The reduced connectivity problem, which results from a repetitive jamming dissertation jamming where the weakest link see more node is selected by the jammer to be attacked.
In this thesis, dissertation jamming first problem is solved by redesigning an overlay routing protocol to be aware of the geographical location of cluster heads.
networks
The here dissertation jamming ad hoc networks 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 hoc networks 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 hoc networks by wireless nodes is presented that adjusts the transmission power dynamically according to the Dissertation jamming value, which is inferred from topology information carried inherently in the Hoc networks Link State Routing OLSR Protocol.
By varying the radio range, packet flows can bypass the jamming area after topology transformation, making the network more hoc networks. The third problem is approached by developing a better mathematical understanding of connectivity when facing interference, which is hoc networks 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 here to analyze the utility of connectivity and the interactive behaviors of both the jammer and the scanner.
An optimal scanning dissertation jamming ad hoc networks is designed to defend against repetitive jamming attacks involving different intents, and to strengthen the network connectivity at the same link. Note Includes bibliographical references.
Note by Ying Liu. Rights The author owns the copyright to this work. Statistical Profile Version 8.
2018 ©