Florens, Cédric and Franceschetti, Massimo and McEliece, Robert J. (2004) Lower bounds on data collection time in sensory networks. IEEE Journal on Selected Areas in Communications, 22 (6). pp. 1110-1120. ISSN 0733-8716 http://resolver.caltech.edu/CaltechAUTHORS:FLOieeejsac04
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:FLOieeejsac04
Data collection, i.e., the aggregation at the user location of information gathered by sensor nodes, is a fundamental function of sensory networks. Indeed, most sensor network applications rely on data collection capabilities, and consequently, an inefficient data collection process may adversely affect the performance of the network. In this paper, 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, multiline, and tree and give corresponding optimal scheduling strategies. Furthermore, we bound the data collection time on general graph networks. Our analyses apply to networks equipped with directional or omnidirectional antennas and simple comparative results of the two systems are presented.
|Additional Information:||© Copyright 2004 IEEE. Reprinted with permission. Manuscript received July 15, 2003; revised February 1, 2004. [Posted online: 2004-08-09] This work was supported in part by the Caltech Lee Center for Advanced Networking.|
|Subject Keywords:||Data collection, delay, sensory networks|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||09 Oct 2006|
|Last Modified:||26 Dec 2012 09:05|
Repository Staff Only: item control page