Approximation algorithm for minimal convergecast time problem in wireless sensor networks

Authors:
Weiping Shang;Pengjun Wan;Xiaodong Hu
Affiliations:
Department of Mathematics, Zhengzhou University, Zhengzhou, China 450052;Department of Computer Science, Illinois Institute of Technology, Chicago, USA 60616;Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, China 100190
Venue:
Wireless Networks
Year:
2010

Citing 8
Cited 2

The Impact of Data Aggregation in Wireless Sensor Networks

ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
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)
Radial Coordination for Convergecast in Wireless Sensor Networks

LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
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
Reliable bursty convergecast in wireless sensor networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Minimum-Energy Multicast in Wireless Ad Hoc Networks with Adaptive Antennas: MILP Formulations and Heuristic Algorithms

IEEE Transactions on Mobile Computing
Performance of multichannel wireless ad hoc networks

International Journal of Wireless and Mobile 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 wireless sensor network with directional antenna

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Approximation algorithms for minimum latency data aggregation in wireless sensor networks with directional antenna

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider how to collect data from sensors deployed in the Euclidean plane in a time-efficient way. We assume that all sensors could adjust their transmission ranges and aggregate data received from other sensors. We adopt a collision-free transmission model using proper schedules for data transmission. We study the problem of finding the schedule under which data from all sensors could be transmitted to the data sink in the minimal time. We propose an approximation algorithm for this NP-hard problem whose performance ratio is bounded by a constant. This significantly improves the existing approximation algorithm that does not have a constant performance ratio.