CLSWeb Main
Caltech Library System
Electronic Theses
                  About | Browse | Search | Caltech Student Instructions

Florens, Cedric (2004-05-03) Data collection and distribution in sensory networks. http://resolver.caltech.edu/CaltechETD:etd-05312004-205111


Type of Document Dissertation
Author Florens, Cedric
Author's Email Address florens AT systems.caltech.edu
URN etd-05312004-205111
Persistent URL http://resolver.caltech.edu/CaltechETD:etd-05312004-205111
Title Data collection and distribution in sensory networks
Degree PhD
Option Electrical Engineering
Advisory Committee
Advisor Name Title
Robert J. McEliece Committee Chair
Babak Hassibi Committee Member
Jehoshua Bruck Committee Member
Polly Estabrook Committee Member
Steven Low Committee Member
Keywords
  • sensory networks
  • data collection
Date of Defense 2004-05-03
Availability restricted
Abstract
The deployment of large-scale, low-cost, low-power, multifunctional sensory networks brings forward numerous and diverse research challenges. Critical to the design of systems that must operate under extreme resource constraints, the understanding of the fundamental performance limits of sensory networks is a research topic of particular importance. This thesis examines, in this respect, an essential function of sensory networks, viz., data collection, that is, the aggregation at the user location of information gathered by sensor nodes.

In the first part of this dissertation we study, via simple discrete mathematical models, the time performance of the data collection and data distribution tasks in sensory networks. Specifically, we derive the minimum delay in collecting sensor data for networks of various topologies such as line, multi-line, tree and give corresponding optimal scheduling strategies assuming that the amount of data observed at each node is finite and known at the beginning of the data collection phase. Furthermore, we bound the data collection time on general graph networks.

In the second part of this dissertation we take the view that the amount of data collected at a node is random and study the statistics of the data collection time. Specifically, we analyze the average minimum delay in collecting randomly located/distributed sensor data for networks of various topologies when the number of nodes becomes large. Furthermore, we analyze the impact of various parameters such as lack of synchronization, size of packet, transmission range, and channel packet erasure probability on the optimal time performance. Our analysis applies to directional antenna systems as well as omnidirectional ones. We conclude our study with a simple comparative analysis showing the respective advantages of the two systems.

Files
  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
[campus] mythesis.pdf 602.53 Kb 00:02:47 00:01:26 00:01:15 00:00:37 00:00:03
[campus] mythesis.ps 1.21 Mb 00:05:37 00:02:53 00:02:31 00:01:15 00:00:06
[campus] indicates that a file or directory is accessible from the campus network only and must not be distributed to non-campus persons.

Browse All Available ETDs by ( Author | Option )

If you have more questions or technical problems, please Contact the Caltech Library System.