Energy Efficient Multi-Hop Polling in Clusters of Two-Layered Heterogeneous Sensor Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
On communication models for algorithm design in networked sensor systems: A case study
Pervasive and Mobile Computing
Spatio-temporal sampling rates and energy efficiency in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Rate vs. buffer size: greedy information gathering on the line
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Minimum-latency gossiping in multi-hop wireless networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
The Distributed Wireless Gathering Problem
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Gathering with Minimum Delay in Tree Sensor Networks
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Improved bounds for data-gathering time in sensor networks
Computer Communications
Minimizing Average Flow Time in Sensor Data Gathering
Algorithmic Aspects of Wireless Sensor Networks
Collision-free path coloring with application to minimum-delay gathering in sensor networks
Discrete Applied Mathematics
A data collection protocol for real-time sensor applications
Pervasive and Mobile Computing
Minimum Delay Data Gathering in Radio Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Random sensory networks: a delay analysis
IEEE Transactions on Information Theory
Bursty wideband relay networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Throughput and delay analysis of two-tier slotted Aloha
WOCC'09 Proceedings of the 18th international conference on Wireless and Optical Communications Conference
Throughput performance evaluation of two-tier TDMA for sensor networks
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Real-time data gathering in sensor networks
Discrete Applied Mathematics
Time optimal gathering in sensor networks
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Bursty relay networks in low-SNR regimes
IEEE Transactions on Communications
The distributed wireless gathering problem
Theoretical Computer Science
Rate vs. buffer size--greedy information gathering on the line
ACM Transactions on Algorithms (TALG)
Minimizing flow time in the wireless gathering problem
ACM Transactions on Algorithms (TALG)
Optimal time data gathering in wireless networks with omni-directional antennas
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Optimally fast data gathering in sensor networks
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Optimal gathering in radio grids with interference
Theoretical Computer Science
Interference-free scheduling with bounded delay in cluster-tree wireless sensor networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
IEEE/ACM Transactions on Networking (TON)
On Sample-Path Optimal Dynamic Scheduling for Sum-Queue Minimization in Forests
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.13 |
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.