Coordinated data aggregation in wireless sensor networks using the Omega failure detector
Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Latency constrained aggregation in sensor networks
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Supporting asynchronous update for distributed data cubes
Journal of Network and Computer Applications
Fault-tolerant aggregator election and data aggregation in wireless sensor networks
International Journal of Communication Networks and Distributed Systems
Journal of Parallel and Distributed Computing
Latency-constrained aggregation in sensor networks
ACM Transactions on Algorithms (TALG)
Optimal stochastic policies for distributed data aggregation in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
A scalable and dynamic data aggregation aware routing protocol for wireless sensor networks
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Dynamic timeout for data aggregation in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 19th High Performance Computing Symposia
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
| Hi-index | 0.00 |
The most important issue in Wireless Sensor Networks is energy consumption. To this end, many networking schemes attempt to minimize the amount of data transmitted by using data aggregation. This trades off data freshness for a savings in energy, because reports from sensor nodes that arrive at an aggregating node may have to be held there for some period of time before being reported so that additional reports may reach the aggregator from slower nodes. We propose to use an intelligent timer and some high-level knowledge of the network to implement an efficient aggregation timing control protocol. Our protocol aims to dynamically change the data aggregation period according to the aggregation quality. A request from the data sink will include the maximum latency for a certain number of reports. If this number of reports can be returned in less time than the maximum, then the maximum time will not be reached. If, however, the specified number of responses can be returned in anywhere between zero-time (instantaneous) and the maximum latency, the timing scheme will find the minimum aggregation period that satisfies the sink's request.