Random sensory networks: a delay in analysis
Abstract
A fundamental function performed by a sensory network is the retrieval of data gathered collectively by sensor nodes. The metrics that measure the efficiency of this data collection process are time and energy. In this paper, we study via simple discrete mathematical models, the statistics of the data collection time in sensory networks. Specifically, we analyze the average minimum delay in collecting randomly located/distributed sensors data for networks of various topologies when the number of nodes becomes large. Furthermore, we analyze the impact of various parameters such as size of packet, transmission range, and channel erasure probability on the optimal time performance. Our analysis applies to directional antenna systems as well as omnidirectional ones. This paper focuses on directional antenna systems and briefly presents results on omnidirectional antenna systems. Finally, a simple comparative analysis shows the respective advantages of the two systems.
Additional Information
© 2009 IEEE. Manuscript received March 15, 2004; revised May 09, 2008; current version published March 18, 2009. This work was performed at Caltech and supported by Caltech's Lee Center for Advanced Networking. Controlled Indexing: delays; sensor fusion; wireless sensor networks. Non-controlled Indexing: channel erasure probability; data collection process; delay analysis; omnidirectional antenna systems; optimal time performance; random sensory networksAttached Files
Published - Florens2009p1342Ieee_T_Inform_Theory.pdf
Files
| Name | Size | Download all |
|---|---|---|
|
md5:40e7ebc395d165273f121b4135860c6b
|
738.3 kB | Preview Download |
Additional details
- Eprint ID
- 14373
- Resolver ID
- CaltechAUTHORS:20090608-121100170
- Lee Center for Advanced Networking, Caltech
- Created
-
2009-08-17Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field