Next Article in Journal
Pareto Optimization or Cascaded Weighted Sum: A Comparison of Concepts
Previous Article in Journal
Modeling Dynamic Programming Problems over Sequences and Trees with Inverse Coupled Rewrite Systems
Algorithms 2014, 7(1), 145-165; doi:10.3390/a7010145

The Minimum Scheduling Time for Convergecast in Wireless Sensor Networks

1,* , 2
1 Computer and Information Science, ECPI University, 1001 Omni Blvd., Newport News, VA 23606, USA 2 Computer Science Department, Texas A&M University-Texarkana, 7101 University Ave, Texarkana, TX 75503, USA 3 Department of Computing, East Tennessee State University, POB 70711, Johnson City, TN 37614, USA
* Author to whom correspondence should be addressed.
Received: 11 November 2013 / Revised: 25 February 2014 / Accepted: 25 February 2014 / Published: 17 March 2014
View Full-Text   |   Download PDF [708 KB, 18 March 2014; original version 17 March 2014]   |   Browse Figures


We study the scheduling problem for data collection from sensor nodes to the sink node in wireless sensor networks, also referred to as the convergecast problem. The convergecast problem in general network topology has been proven to be NP-hard. In this paper, we propose our heuristic algorithm (finding the minimum scheduling time for convergecast (FMSTC)) for general network topology and evaluate the performance by simulation. The results of the simulation showed that the number of time slots to reach the sink node decreased with an increase in the power. We compared the performance of the proposed algorithm to the optimal time slots in a linear network topology. The proposed algorithm for convergecast in a general network topology has 2.27 times more time slots than that of a linear network topology. To the best of our knowledge, the proposed method is the first attempt to apply the optimal algorithm in a linear network topology to a general network topology.
Keywords: convergecast; minimum scheduling time; wireless sensor networks; general topology convergecast; minimum scheduling time; wireless sensor networks; general topology
This is an open access article distributed under the Creative Commons Attribution License (CC BY) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote |
MDPI and ACS Style

Jung, C.; Lee, S.J.; Bhuse, V. The Minimum Scheduling Time for Convergecast in Wireless Sensor Networks. Algorithms 2014, 7, 145-165.

View more citation formats

Related Articles

Article Metrics

For more information on the journal, click here


[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert