Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
The scheduling and energy complexity of strong connectivity in ultra-wideband networks
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
The worst-case capacity of wireless sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
International Journal of Sensor Networks
Design and analysis of distributed power scheduling for data aggregation in wireless sensor networks
International Journal of Sensor Networks
In-network aggregation trade-offs for data collection in wireless sensor networks
International Journal of Sensor Networks
Energy-efficient data gathering algorithm in sensor networks with partial aggregation
International Journal of Sensor Networks
Efficient aggregation using first hop selection in WSNs
International Journal of Sensor Networks
International Journal of Sensor Networks
Minimum-latency aggregation scheduling in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
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
Improved Algorithms for Latency Minimization in Wireless Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Wireless Communication Is in APX
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Approximation algorithm for maximum lifetime in wireless sensor networks with data aggregation
International Journal of Sensor Networks
Adaptive aggregation tree transformation for energy-efficient query processing in sensor networks
International Journal of Sensor Networks
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
Connectivity problem in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Efficient algorithm for maximum lifetime many-to-one data aggregation in wireless sensor networks
International Journal of Sensor Networks
International Journal of Sensor Networks
Minimum data aggregation time problem in wireless sensor networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Distributed ($#916;+1)-coloring in the physical model
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
The capacity of wireless networks
IEEE Transactions on Information Theory
Deterministic distributed data aggregation under the SINR model
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
Wireless sensor networks are attracting much attention from the world and Minimum Latency Aggregation Scheduling MLAS has become one of the most significant fundamental problems in wireless sensor networks. However, there are few results about efficient data aggregation algorithms under the Signal-to-Interference-plus-Noise-Ratio SINR model. In this paper, we propose a centralised algorithm to aggregate data from all sources in Olog²n time slots where n is the total number of nodes. To the best of our knowledge, this is the current best result for the problem. This algorithm uses round scheduling, topology construction and non-linear power assignment as the main techniques. We give a detailed proof of correctness, also an aggregation latency analysis of the algorithm as well as the parameter constraints to achieve our result.