Distributed Algorithms for Online Coordination in Wireless Sensor Networks

dc.contributor.advisorGao, Jie , Das, Samiren_US
dc.contributor.authorZhou, Dengpanen_US
dc.contributor.otherDepartment of Computer Scienceen_US
dc.date.accessioned2013-05-22T17:35:55Z
dc.date.available2013-05-22T17:35:55Z
dc.date.issued1-May-12en_US
dc.date.submitted12-Mayen_US
dc.description198 pg.en_US
dc.description.abstractWith 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.en_US
dc.description.advisorAdvisor(s): Gao, Jie ; Das, Samir. Committee Member(s): Gu, Xianfeng ; Hong, Sangjin.en_US
dc.description.sponsorshipStony Brook University Libraries. SBU Graduate School in Department of Computer Science. Charles Taber (Dean of Graduate School).en_US
dc.formatElectronic Resourceen_US
dc.identifierZhou_grad.sunysb_0771E_10928en_US
dc.identifier.urihttp://hdl.handle.net/1951/59939
dc.language.isoen_USen_US
dc.mimetypeApplication/PDFen_US
dc.publisherThe Graduate School, Stony Brook University: Stony Brook, NY.en_US
dc.subject.lcshComputer scienceen_US
dc.subject.otherApproximate Algorithm, Computational Geometry, Distributed Algorithm, Routing, Spanner, Wireless Sensor Networksen_US
dc.titleDistributed Algorithms for Online Coordination in Wireless Sensor Networksen_US
dc.typeDissertationen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Zhou_grad.sunysb_0771E_10928.pdf
Size:
6.02 MB
Format:
Adobe Portable Document Format