Wireless Networks

, Volume 16, Issue 5, pp 1345–1353

Approximation algorithm for minimal convergecast time problem in wireless sensor networks


DOI: 10.1007/s11276-009-0207-9

Cite this article as:
Shang, W., Wan, P. & Hu, X. Wireless Netw (2010) 16: 1345. doi:10.1007/s11276-009-0207-9


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.


Convergecast Latency Wireless sensor networks Approximation algorithm 

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Department of MathematicsZhengzhou UniversityZhengzhouChina
  2. 2.Department of Computer ScienceIllinois Institute of TechnologyChicagoUSA
  3. 3.Institute of Applied MathematicsChinese Academy of SciencesBeijingChina

Personalised recommendations