Impact of Network Density on Data Aggregation in Wireless Sensor Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
TiNA: a scheme for temporal coherency-aware in-network aggregation
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Wireless Communications & Mobile Computing - Special Issue on Ad Hoc Wireless Networks
Fast distributed algorithm for convergecast in ad hoc geometric radio networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Distributed Minimal Time Convergecast Scheduling in Wireless Sensor Networks
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Efficient interference-aware TDMA link scheduling for static wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Dynamic Conflict-free Query Scheduling for Wireless Sensor Networks
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
An improved approximation algorithm for data aggregation in multi-hop wireless sensor networks
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Minimum data aggregation time problem in wireless sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Minimum latency data aggregation in the physical interference model
Computer Communications
International Journal of Sensor Networks
An efficient algorithm for scheduling sensor data collection through multi-path routing structures
Journal of Network and Computer Applications
| Hi-index | 0.02 |
Data aggregation is a primitive communication task in wireless sensor networks (WSNs). In this paper, we study designing data aggregation schedules under the Protocol Interference Model for answering queries. Given a network consisting of a set of nodes V distributed in a two-dimensional plane, we address different kinds of queries in this paper. First and foremost, we consider a single one-off query which requires a subset of source nodes V′ ⊆ V to send data to a distinguished sink node, we propose a delay-efficient algorithm that produces a collision-free schedule and theoretically prove that the delay achieved by our algorithm is nearly a small constant factor of the optimum. We further extend our discussion to the multiple one-off queries case and periodic query case and propose our data aggregation scheduling algorithms respectively with theoretical performance analysis.