Page 1 |
Save page Remove page | Previous | 1 of 128 | Next |
|
small (250x250 max)
medium (500x500 max)
large ( > 500x500)
Full Resolution
All (PDF)
|
This page
All
Subset |
RECONFIGURATION IN SENSOR NETWORKS
by
Karthik Dantu
A Dissertation Presented to the
FACULTY OF THE USC GRADUATE SCHOOL
UNIVERSITY OF SOUTHERN CALIFORNIA
In Partial Fulfillment of the
Requirements for the Degree
DOCTOR OF PHILOSOPHY
(COMPUTER SCIENCE)
May 2010
Copyright 2010 Karthik Dantu
Object Description
| Title | Reconfiguration in sensor networks |
| Author | Dantu, Karthik |
| Author email | dkkarthik@gmail.com; dantu@usc.edu |
| Degree | Doctor of Philosophy |
| Document type | Dissertation |
| Degree program | Computer Science |
| School | Viterbi School of Engineering |
| Date defended/completed | 2010-01-19 |
| Date submitted | 2010 |
| Restricted until | Unrestricted |
| Date published | 2010-02-15 |
| Advisor (committee chair) | Sukhatme, Gaurav S. |
| Advisor (committee member) |
Govindan, Ramesh Krishnamachari, Bhaskar |
| Abstract | To be practical, sensor networks need to adapt to changes in their environment. This thesis explores reconfiguration in sensor networks to endow them with greater adaptability. We study functional reconfiguration in static networks, and spatial reconfiguration in networks with limitedmobility and networks whose constituent nodes are highly mobile.; In static sensor networks, reconfiguration can be thought of as the ability to dynamically reconfigure nodes in the network to perform different functions over time. We study a tiered sensor network where the roles of microserver and sensor are dynamically assigned. We propose a framework for redesigning services by partitioning the workload in a distributed fashion among the microservers. We apply this distribution formulation to connectivity-based localization and show that it converges to within 10% of the centralized solution in ten iterations. We also show a similar formulation for flow-based routing.; In mobile sensor networks, one potential means of reconfiguration is the ability of the network to reposition its nodes using controlled mobility in service of a particular objective. We address the problem of improving connectivity in a robot network by proposing an algorithm for autonomous reconfiguration that causes an initially connected network to be transformed into a biconnected network. First, we show that the robot network biconnectivity problem is NP-hard. We propose a heuristic that uses bearing-only measurements of node neighbors to achieve biconnectivity. Simulations and experiments suggest that this algorithm performs well even when the bearing measurements are coarse (errors up to 30 degrees have little impact on the outcome). As a practical matter, we describe a novel technique to obtain such bearing measurements from commodity radios on simple robots. The biconnectivity algorithm requires a stable connected network. However, experiments reveal that the routing protocol (in our case OLSR) does not necessarily produce routes that are persistent in time. We conjecture that providing location and direction cues improves route stability in robot networks. Test results bear this out - route switches decrease by up to 20% when the routing protocol is given position and directional cues. |
| Keyword | sensor networks; mobile sensor networks; robot networks; embedded systems; wireless sensor networks; mobile systems |
| Language | English |
| Part of collection | University of Southern California dissertations and theses |
| Publisher (of the original version) | University of Southern California |
| Place of publication (of the original version) | Los Angeles, California |
| Publisher (of the digital version) | University of Southern California. Libraries |
| Provenance | Electronically uploaded by the author |
| Type | texts |
| Legacy record ID | usctheses-m2851 |
| Rights | Dantu, Karthik |
| Repository name | Libraries, University of Southern California |
| Repository address | Los Angeles, California |
| Repository email | http://www.usc.edu/isd/libraries/services/ask_a_librarian/email/ |
| Filename | etd-Dantu-3495 |
| Archival file | uscthesesreloadpub_Volume29/etd-Dantu-3495.pdf |
Description
| Title | Page 1 |
| Full text | RECONFIGURATION IN SENSOR NETWORKS by Karthik Dantu A Dissertation Presented to the FACULTY OF THE USC GRADUATE SCHOOL UNIVERSITY OF SOUTHERN CALIFORNIA In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY (COMPUTER SCIENCE) May 2010 Copyright 2010 Karthik Dantu |
Comments
Post a Comment for Page 1
