LoboVault Home

A hierarchical group model for programming sensor networks

LoboVault

Please use this identifier to cite or link to this item: http://hdl.handle.net/1928/7635

A hierarchical group model for programming sensor networks

Show full item record

Title: A hierarchical group model for programming sensor networks
Author: Horey, James
Advisor(s): Maccabe, Arthur
Committee Member(s): Forrest, Stephanie
Bridges, Patrick
Shu, Wei Wennie
Department: University of New Mexico. Dept. of Computer Science
Subject: sensor networks
programming models
spreadsheets
privacy and anonymity
LC Subject(s): Sensor networks
Sensor networks--Programming.
Degree Level: Doctoral
Abstract: A hierarchical group model that decouples computation from hardware can characterize and aid in the construction of sensor network software with minimal overhead. Future sensor network applications will move beyond static, homogeneous deployments to include dynamic, heterogeneous elements. These sensor networks will also gain new users, including casual users who will expect intuitive interfaces to interact with sensor networks. To address these challenges, a new computational model and a system implementing the model are presented. This model ensures that computations can be readily reassigned as sensor nodes are introduced or removed. The model includes methods for communication to accommodate these dynamic elements. This dissertation presents a detailed description and design of a computational model that resolves these challenges using a hierarchical group mechanism. In this model, computation is tasked to logical groups and split into collective and local components that communicate hierarchically. Local computation is primarily used for data production and publishes data to the collective computation. Similarly, collective computation is primarily used for data aggregation and pushes results back to the local computation. Finally, the model includes data-processing functions interposed between local and collective functions that are responsible for data conversion. This dissertation also presents implementations and applications of the model. Implementations include Kensho, a C-based implementation of the hierarchical group model, that can be used for a variety of user applications. Another implementation, Tables, presents a spreadsheet-inspired view of the sensor network that takes advantage of hierarchical groups for both computation and communication. Users are able to specify both local and collective functions that execute on the sensor network via the spreadsheet interface. Applications of the model are also explored. One application, FUSN, provides a set of methods for constructing filesystem-based interfaces for sensor networks. This demonstrates the general applicability of the model as applied to sensor network programming and management interfaces. Finally, the model is applied to a novel privacy algorithm to demonstrate that the model isn't strictly limited to programming interfaces.
Graduation Date: December 2008
URI: http://hdl.handle.net/1928/7635


Files in this item

Files Size Format View
dissertation_with_blank_sig.pdf 2.157Mb PDF View/Open

This item appears in the following Collection(s)

Show full item record

UNM Libraries

Search LoboVault


Browse

My Account