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
Approximate Aggregation Techniques for Sensor Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Medians and beyond: new aggregation techniques for sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Exploiting Correlated Attributes in Acquisitional Query Processing
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
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
Approximate Data Collection in Sensor Networks using Probabilistic Models
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
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
Minimum data aggregation time problem in wireless sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Efficient data aggregation in multi-hop WSNs
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Minimum-latency aggregation scheduling in wireless sensor networks under physical interference model
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Continuous data aggregation and capacity in probabilistic wireless sensor networks
Journal of Parallel and Distributed Computing
IEEE/ACM Transactions on Networking (TON)
Improved minimum latency aggregation scheduling in wireless sensor networks under the SINR model
International Journal of Sensor Networks
Compression in wireless sensor networks: A survey and comparative evaluation
ACM Transactions on Sensor Networks (TOSN)
Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks
Journal of Parallel and Distributed Computing
IEEE/ACM Transactions on Networking (TON)
An improved distributed data aggregation scheduling in wireless sensor networks
Journal of Combinatorial Optimization
Hi-index | 0.00 |
Data aggregation is an efficient primitive in wireless sensor network (WSN) applications. This paper focuses on data aggregation scheduling problem to minimize the latency. We propose an efficient distributed method that produces a collision-free schedule for data aggregation in WSNs. We prove that the latency of the aggregation schedule generated by our algorithm is at most 16R+Δ--14 time-slots. Here R is the network radius and Δ is the maximum node degree in the communication graph of the original network. Our method significantly improves the previously known best data aggregation algorithm [3], that has a latency bound of 24D+6Δ+16 time-slots, where D is the network diameter (Note that D can be as large as 2R). We conduct extensive simulations to study the practical performances of our proposed data aggregation method. Our simulation results corroborate our theoretical results and show that our algorithms perform better in practice. We prove that the overall lower-bound of latency of data aggregation under any interference model is max{log n, R} where n is the network size. We provide an example to show that the lower-bound is (approximately) tight under protocol interference model when rI=r, where rI is the interference range and r is the transmission range. We also derive the lower-bound of latency under protocol interference model when r rI r and rI ≥ 3r.