A better heuristic for orthogonal graph drawings
Computational Geometry: Theory and Applications
Message Multicasting in Heterogeneous Networks
SIAM Journal on Computing
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Detailed models for sensor network simulations and their impact on network performance
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
WONS '05 Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services
Minimum-latency aggregation scheduling in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Prediction Based Mobile Data Aggregation in Wireless Sensor Network
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive 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
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Minimum-Latency Schedulings for Group Communications in Multi-channel Multihop Wireless Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Order-optimal data collection in wireless sensor networks: delay and capacity
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
On maximizing the throughput of convergecast in wireless sensor networks
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
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
Approaching the optimal schedule for data aggregation in wireless sensor networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Efficient algorithm for maximum lifetime many-to-one data aggregation in wireless sensor networks
International Journal of Sensor Networks
Aggregation convergecast scheduling in wireless sensor networks
Wireless Networks
Minimum latency data aggregation in wireless sensor network with directional antenna
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Modeling aggregation convergecast scheduling using constraints
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Minimum multicast time problem in wireless sensor networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
A real-time data aggregation method for fault-tolerant wireless sensor networks
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Minimum-time aggregation scheduling in duty-cycled wireless sensor networks
Journal of Computer Science and Technology - Special issue on Natural Language Processing
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
A fault tolerant approach for data aggregation in wireless sensor networks
Proceedings of the International Conference on Advances in Computing, Communications and Informatics
Minimum latency aggregation scheduling for arbitrary tree topologies under the SINR model
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Efficient scheduling for periodic aggregation queries in multihop sensor networks
IEEE/ACM Transactions on Networking (TON)
International Journal of Sensor Networks
Delay-efficient data aggregation scheduling in duty-cycled wireless sensor networks
Proceedings of the 2012 ACM Research in Applied Computation Symposium
Constant-approximation for optimal data aggregation with physical interference
Journal of Global Optimization
Efficient data aggregation scheduling in wireless sensor networks with multi-channel links
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
Theoretical Computer Science
IEEE/ACM Transactions on Networking (TON)
Improved minimum latency aggregation scheduling in wireless sensor networks under the SINR model
International Journal of Sensor Networks
MC-MLAS: Multi-channel Minimum Latency Aggregation Scheduling in Wireless Sensor Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks
Journal of Parallel and Distributed Computing
An efficient algorithm for scheduling sensor data collection through multi-path routing structures
Journal of Network and Computer Applications
IEEE/ACM Transactions on Networking (TON)
An improved distributed data aggregation scheduling in wireless sensor networks
Journal of Combinatorial Optimization
Personal and Ubiquitous Computing
| Hi-index | 0.01 |
Wireless sensor networks promise a new paradigm for gathering data via collaboration among sensors spreading over a large geometrical region. Many real-time applications impose stringent delay requirements and ask for time-efficient schedules of data aggregations in which sensed data at sensors are combined at intermediate sensors along the way towards the data sink. The Minimum Data Aggregation Time (MDAT) problem is to find the schedule that routes data appropriately and has the shortest time for all requested data to be aggregated to the data sink. In this paper we study the MDAT problem with uniform transmission range of all sensors. We assume that, in each time round, data sent by a sensor reaches exactly all sensors within its transmission range, and a sensor receives data if it is the only data that reaches the sensor in this time round. We first prove that this problem is NP-hard even when all sensors are deployed a grid and data on all sensors are required to be aggregated to the data sink. We then design a (Δ–1)-approximation algorithm for MDAT problem, where Δ equals the maximum number of sensors within the transmission range of any sensor. We also simulate the proposed algorithm and compare it with the existing algorithm. The obtained results show that our algorithm has much better performance in practice than the theoretically proved guarantee and outperforms other algorithm.