The Minimum Scheduling Time for Convergecast in Wireless Sensor Networks

Algorithms

Changyong Jung(Andrew)²  Suk Jin Lee¹ 

[1] Computer Science Department, Texas A&M University-Texarkana, 7101 University Ave, Texarkana, TX 75503, USA; E-Mail:;Computer and Information Science, ECPI University, 1001 Omni Blvd., Newport News, VA 23606, USA

关键词: convergecast;    minimum scheduling time;    wireless sensor networks;    general topology;   

DOI  :  10.3390/a7010145

来源: mdpi

【 摘 要 】

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.

【 授权许可】

CC BY   
© 2014 by the authors; licensee MDPI, Basel, Switzerland.