Spatial Uncertainty in Mobile and Sensor Networks
| dc.contributor.advisor | Zheng, Rong | |
| dc.contributor.committeeMember | Gao, Jie | |
| dc.contributor.committeeMember | Huang, Stephen | |
| dc.contributor.committeeMember | Johnson, Olin | |
| dc.contributor.committeeMember | Shi, Weidong | |
| dc.creator | Vu, Khuong 1983- | |
| dc.date.accessioned | 2014-03-13T21:40:50Z | |
| dc.date.available | 2014-03-13T21:40:50Z | |
| dc.date.created | December 2012 | |
| dc.date.issued | 2012-12 | |
| dc.date.updated | 2014-03-13T21:40:56Z | |
| dc.description.abstract | Sensor networks have risen in importance in last several years. They have been deployed for several tasks, such as monitoring volcanoes, monitoring buildings and infrastructures, detecting enemy instrution in military, etc... Sensor location plays an important role in network quality. It has impact on different aspects, i.e., network connectivity, network coverage to name a few. However, exact sensor locations are rarely achieved. In the one hand, sensors may be misplaced during operations. On the other hand, sensor locations are kept uncertain due to privacy concerns. This raises the need for investigating sensor networks with the presence of sensor location uncertainty. This dissertation provides an analysis on sensor networks with the presence of uncertainty. First, we investigate network coverage and target localization and tracking using binary proximity sensors under sensor location uncertainty. A deterministic, polynomial-time algorithm is devised to compute the minimum sensing range for guaranteed coverage. Furthermore, algorithms are proposed for target localization and measurement model for target tracking in sensor networks. The approaches are based on the high order maximum Voronoi diagram of disks in the plane. Next, we study privacy in spatial queries. In contrast to sensor location uncertainty, uncertainty is introduced to spatial queries to protect user information. Essentially, the querying user is grouped with other users to form a cloak for which spatial queries are made, instead of a single query location. In this disseration, a framework for user identity privacy in $k$-nearest queries is proposed, in which we devise a $k$-anonymous, locality-preserving cloaking algorithm. Cloaks are also used in spatial skyline queries, which leads to different domination relationships. The disseration proposes geometric algorithms for spatial skyline queries with user location uncertainty. In addition, the fuzzy domination relationship in spatial skyline queries is investigated. Our work opens up new directions in spatial skyline queries with uncertainty. | |
| dc.description.department | Computer Science, Department of | |
| dc.format.digitalOrigin | born digital | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/10657/565 | |
| dc.language.iso | eng | |
| dc.rights | The author of this work is the copyright owner. UH Libraries and the Texas Digital Library have their permission to store and provide access to this work. Further transmission, reproduction, or presentation of this work is prohibited except with permission of the author(s). | |
| dc.subject | Sensor network | |
| dc.subject | Mobile network | |
| dc.subject | Uncertainty | |
| dc.subject | Skyline query | |
| dc.subject | Spatial skyline query | |
| dc.subject | Computational geometry | |
| dc.subject | Privacy | |
| dc.subject | Location-based service | |
| dc.subject.lcsh | Computer science | |
| dc.title | Spatial Uncertainty in Mobile and Sensor Networks | |
| dc.type.dcmi | Text | |
| dc.type.genre | Thesis | |
| thesis.degree.college | College of Natural Sciences and Mathematics | |
| thesis.degree.department | Computer Science, Department of | |
| thesis.degree.discipline | Computer Science | |
| thesis.degree.grantor | University of Houston | |
| thesis.degree.level | Doctoral | |
| thesis.degree.name | Doctor of Philosophy |