Persistent Link:
http://hdl.handle.net/10150/203439
Title:
Efficient Geometric Algorithms for Wireless Networks
Author:
Sankararaman, Swaminathan
Issue Date:
2011
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
Wireless communications has a wide range of applications including cellular telephones, wireless networking and security systems. Typical systems work through radio frequency communication and this is heavily dependent on the geographic characteristics of the environment. This dissertation discusses the application of geometric optimization in wireless networks where the communication \links" are not static but may be dynamically changing. We show how to exploit the geometric properties of these networks to model their behavior. In the first part of the dissertation, we consider the problem of interference-aware routing in Multi-channel mesh networks employing directional antennas to improve spatial throughput. In such networks, optimal routes are paths with a channel assignment for the links such that the path and link bandwidths are the same. We develop a method to perform topology control while taking into account interference by constructing a spanner; a sub-network containing O(n= θ) links, where n is the network size and θ is a tunable parameter, such that path costs increase by at most a constant factor. In second part, we study the problem of base-station positioning in Sensor Net- works such that we achieve energy-efficient data transmission from the sensors. Given the battery limitations of the sensors, our objective is to maximize the network lifetime. First, we present efficient algorithms for computing a transmission scheme given a fixed base-station and also provide a distributed implementation. Next, we present efficient algorithms for the problem of locating the base-station and simultaneously finding a transmission scheme. We compare our algorithms with linear-programming based algorithms through simulations. In the third part, we study strategies for managing friendly jammers to create virtual barriers preventing eavesdroppers from tapping sensitive RFID communication. Our scheme precludes the use of encryption. Applications domains include (i) privacy of inventory management systems, (ii) credit card communications, (iii) secure communication in any wireless networks without encryption. By carefully managing jammers producing noise, we show how to degrade the signal at eavesdroppers sufficiently, without jeopardizing network performance. We present algorithms targeted towards optimizing the number and power of jammers. Experimental simulations back up our results.
Type:
text; Electronic Dissertation
Keywords:
Computer Science
Degree Name:
Ph.D.
Degree Level:
doctoral
Degree Program:
Graduate College; Computer Science
Degree Grantor:
University of Arizona
Advisor:
Efrat, Alon

Full metadata record

DC FieldValue Language
dc.language.isoenen_US
dc.titleEfficient Geometric Algorithms for Wireless Networksen_US
dc.creatorSankararaman, Swaminathanen_US
dc.contributor.authorSankararaman, Swaminathanen_US
dc.date.issued2011-
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractWireless communications has a wide range of applications including cellular telephones, wireless networking and security systems. Typical systems work through radio frequency communication and this is heavily dependent on the geographic characteristics of the environment. This dissertation discusses the application of geometric optimization in wireless networks where the communication \links" are not static but may be dynamically changing. We show how to exploit the geometric properties of these networks to model their behavior. In the first part of the dissertation, we consider the problem of interference-aware routing in Multi-channel mesh networks employing directional antennas to improve spatial throughput. In such networks, optimal routes are paths with a channel assignment for the links such that the path and link bandwidths are the same. We develop a method to perform topology control while taking into account interference by constructing a spanner; a sub-network containing O(n= θ) links, where n is the network size and θ is a tunable parameter, such that path costs increase by at most a constant factor. In second part, we study the problem of base-station positioning in Sensor Net- works such that we achieve energy-efficient data transmission from the sensors. Given the battery limitations of the sensors, our objective is to maximize the network lifetime. First, we present efficient algorithms for computing a transmission scheme given a fixed base-station and also provide a distributed implementation. Next, we present efficient algorithms for the problem of locating the base-station and simultaneously finding a transmission scheme. We compare our algorithms with linear-programming based algorithms through simulations. In the third part, we study strategies for managing friendly jammers to create virtual barriers preventing eavesdroppers from tapping sensitive RFID communication. Our scheme precludes the use of encryption. Applications domains include (i) privacy of inventory management systems, (ii) credit card communications, (iii) secure communication in any wireless networks without encryption. By carefully managing jammers producing noise, we show how to degrade the signal at eavesdroppers sufficiently, without jeopardizing network performance. We present algorithms targeted towards optimizing the number and power of jammers. Experimental simulations back up our results.en_US
dc.typetexten_US
dc.typeElectronic Dissertationen_US
dc.subjectComputer Scienceen_US
thesis.degree.namePh.D.en_US
thesis.degree.leveldoctoralen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineComputer Scienceen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorEfrat, Alonen_US
dc.contributor.committeememberBarnard, Kobusen_US
dc.contributor.committeememberMorrison, Claytonen_US
dc.contributor.committeememberRamasubramanian, Srinivasanen_US
dc.contributor.committeememberEfrat, Alonen_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.