Document Type thesis Author Name Ahlehagh, Hasti URN etd-0526104-111538 Title Techniques for Communication and Geolocation using Wireless Ad hoc Networks Degree MS Department Electrical & Computer Engineering Advisors William R. Michalson, Advisor Kaveh Pahlavan, Committee Member R. James Duckworth, Committee Member Fred J. Looft, Department Head Keywords error propagation indoor channel model, localization algorithm, ad h Date of Presentation/Defense 2004-07-23 Availability unrestricted
Networks with hundreds of ad hoc nodes equipped with communication and position finding abilities are conceivable with recent advancements in technology. Methods are presented in this thesis to assess the communicative capabilities and node position estimation of mobile ad hoc networks. Specifically, we investigate techniques for providing communication and geolocation with specific characteristics in wireless ad hoc networks. The material presented in this thesis, communication and geolocation, may initially seem a collection of disconnected topics related only distantly under the banner of ad hoc networks. However, systems currently in development combining these techniques into single integrated systems. In this thesis first, we investigate the effect of multilayer interaction, including fading and path loss, on ad hoc routing protocol performance, and present a procedure for deploying an ad hoc network based on extensive simulations. Our first goal is to test the routing protocols with parameters that can be used to characterize the environment in which they might be deployed. Second, we analyze the location discovery problem in ad hoc networks and propose a fully distributed, infrastructure-free positioning algorithm that does not rely on the Global Positioning System (GPS). The algorithm uses the approximate distances between the nodes to build a relative coordinate system in which the node positions are computed in three-dimensions. However, in reconstructing three-dimensional positions from approximate distances, we need to consider error threshold, graph connectivity, and graph rigidity. We also statistically evaluate the location discovery procedure with respect to a number of parameters, such as error propagation and the relative positions of the nodes.
Browse by Author | Browse by Department | Search all available ETDs
Questions? Email email@example.com