Abstract:
With a new way of thinking about organizing sensor networks, we demonstrate that we can more easily deploy and program these networks to solve a variety of different problems. We describe sensor networks that can analyze and actuate distributed phenomena without a central coordinator. Previous implementations of sensor networks have approached the problem from the perspective of centralized reporting of distributed events. By contrast, we create a system that allows users to infer the global state from within the sensor network itself, rather than by accessing an outside, central middleware layer. This is accomplished via dynamic creation of clusters of nodes based on application or intent, rather than proximity. The data collected and returned by these clusters is returned directly to the inquirer at his current location. By creating this Distributed-in/Distributed-out (DiDo) system that bypasses a middleware layer, our networks have the principal advantage of being easily configurable and deployable. We show that a system with this structure can solve path problems in a random graph. These graph problems are directly applicable to real-life applications such as discovering escape routes for people in a building with changing pathways. We show that the system is scalable, as reconfiguration requires only local communication.(cont.) To test our assumptions, we build a suite of applications to create different deployment scenarios that model the physical world and set up simulations that allow us to measure performance. Finally, we create a set of simple primitives that serve as a high-level organizing protocol. These primitives can be used to solve different problems with distributed sensors, regardless of the underlying network protocols. The instructions provided by the sensors result in tangible performance improvements when the sensors' instructions are directed to agents within a simulated physical world.
Description:
Thesis (Ph. D.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2006.Includes bibliographical references (p. 155-165).
