Type
Text
Type
Dissertation
Advisor
Gu, Xianfeng | Gao, Jie , Das, Samir | Hong, Sangjin.
Date
2012-05-01
Keywords
Computer science | Approximate Algorithm, Computational Geometry, Distributed Algorithm, Routing, Spanner, Wireless Sensor Networks
Department
Department of Computer Science
Language
en_US
Source
This work is sponsored by the Stony Brook University Graduate School in compliance with the requirements for completion of degree.
Identifier
http://hdl.handle.net/11401/71048
Publisher
The Graduate School, Stony Brook University: Stony Brook, NY.
Format
application/pdf
Abstract
With the rapid development of large-scale wireless sensor networks in the past few years, we expect the embedded sensors to be integrated smoothly with other mobile embedded devices. In this dissertation, we consider the following model of a hybrid network with both static and mobile nodes. There are pervasive static sensor nodes embedded in the environment to gather real-time data. The mobile nodes can be either robots with controlled mobility to aid the network operation and repair dysfunctional network components, or users of the sensor network that demand real-time knowledge gathered by the sensor nodes, or robots/users that use the sensor network as a communication infrastructure, or a mixture of the above. The specific scenarios include, but are not limited to, online resource management and allocation, maintaining group communication and coordination of mobile agents, and efficient and resilient routing schemes. To solve these problems, we introduce a framework to manage the efficient and highly selective information flow between the sensor nodes and the mobile nodes. This framework involves the following components: ?? We extract a hierarchical well separated tree (HST) to approximate the shortest path metric of the static sensor network. ?? With the HST, we allow spontaneous, distributed matching between users that may emerge anywhere and the resources available in the network. ?? We also show that in the same framework, we can coordinate mobile users by maintaining an approximate minimum Steiner tree with modest communication cost. ?? By using two or multiple HSTs, we also show how to support low-stretch routing that is also resilient to in-transit link failures. In addition to the above HST framework, we develop the compact conformal map for greedy routing in wireless mobile sensor networks. The map is only dependent on the network domain and is independent of the network connectivity. This is the first practical solution for using virtual coordinates for greedy routing in a sensor network and could be easily extended to the case of a mobile network. | 198 pages
Recommended Citation
Zhou, Dengpan, "Distributed Algorithms for Online Coordination in Wireless Sensor Networks" (2012). Stony Brook Theses and Dissertations Collection, 2006-2020 (closed to submissions). 255.
https://commons.library.stonybrook.edu/stony-brook-theses-and-dissertations-collection/255