An Optimal Task Scheduling Algorithm in Wireless Sensor Networks
Keywords:wireless sensor networks, divisible load theory, multi-round task scheduling
AbstractSensing tasks should be allocated and processed among sensor nodes in minimum times so that users can draw useful conclusions through analyzing sensed data. Furthermore, finishing sensing task faster will benefit energy saving, which is critical in system design of wireless sensor networks. To minimize the execution time (makespan) of a given task, an optimal task scheduling algorithm (OTSA-WSN) in a clustered wireless sensor network is proposed based on divisible load theory. The algorithm consists of two phases: intra-cluster task scheduling and inter-cluster task scheduling. Intra-cluster task scheduling deals with allocating different fractions of sensing tasks among sensor nodes in each cluster; inter-cluster task scheduling involves the assignment of sensing tasks among all clusters in multiple rounds to improve overlap of communication with computation. OTSA-WSN builds from eliminating transmission collisions and idle gaps between two successive data transmissions. By removing performance degradation caused by communication interference and idle, the reduced finish time and improved network resource utilization can be achieved. With the proposed algorithm, the optimal number of rounds and the most reasonable load allocation ratio on each node could be derived. Finally, simulation results are presented to demonstrate the impacts of different network parameters such as the number of clusters, computation/communication latency, and measurement/communication speed, on the number of rounds, makespan and energy consumption.
V. Bharadwaj, D. Ghose, T. G.ROBERTAZZI, Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems. Cluster Computing, vol.6, No.1, pp.7-18, 2003. http://dx.doi.org/10.1023/A:1020958815308
M. Moges, T.G. Robertazzi, Wireless Sensor Networks: Scheduling for Measurement and Data Reporting. IEEE Transactions on Aerospace and Electronic Systems, Vol.42, No.1, pp.327- 340, 2006. http://dx.doi.org/10.1109/TAES.2006.1603426
H. LIU, X. YUAN, M. Moges, An Efficient Task Scheduling Method for Improved Network Delay in Distributed Sensor Networks. In Proceedings of TridentCom 2007, Orlando, FL, USA, 1-8, 2007.
H. LIU, J. SHEN, X. YUAN, M. Moges, Performance Analysis of Data Aggregation in Wireless Sensor Mesh Networks, In Proceedings of Earth & Space 2008, Akron, OH, USA, 1-8, 2008.
C. Kijeung, T. G. Robertazzi, Divisible Load Scheduling in Wireless Sensor Networks with Information Utility Performance. In Proceedings of IPCCC 2008, Austin, Texas, USA, 9-17, 2008.
Z. ZENG, A. LIU, D. LI, A Highly Efficient DAG Task Scheduling Algorithm for Wireless Sensor Networks, In Proceedings of ICYCS 2008,Zhang Jia Jie, Hunan, China, 570-575, 2008.
J. LIN, W. XIAO, F. L. Lewis, Energy-Efficient Distributed Adaptive Multisensor Scheduling for Target Tracking in Wireless Sensor Networks. IEEE Transactions on Instrumentation and Measurement, Vol.58, No.6, pp.1886 - 1896, 2009. http://dx.doi.org/10.1109/TIM.2008.2005822
Y. Yang, R. Van, Der, K, H. Casanova, Multiround Algorithms for Scheduling Divisible Loads. IEEE Trans on Parallel and Distributed Systems, Vol.16, No.11, pp.1092-1102, 2005. http://dx.doi.org/10.1109/TPDS.2005.139
C. Yeim-Kuan, W. Jia-Hwa, C. Chi-Yeh, C. Chih-Ping, Improved Methods for Divisible Load Distribution on k-Dimensional Meshes Using Multi-Installment. IEEE Transactions on Parallel and Distributed Systems, Vol.18, No.11, pp. 1618-1629,2007. http://dx.doi.org/10.1109/TPDS.2007.1103
W. Heinzelman, A. Chandrakasan, An Application-specifid Protocol Architecture for Wireless Microsensor Networks. IEEE Transaction on Wireless Communications, Vol.1, No.4, pp. 660-670, 2002. http://dx.doi.org/10.1109/TWC.2002.804190
X. Tang, J. Xu, Optimizing Lifetime for Continuous Data Aggregation With Precision Guarantees in Wireless Sensor Networks. IEEE/ACM Transactions on Networking, Vol.16, No.4, pp. 904 - 917,2008. http://dx.doi.org/10.1109/TNET.2007.902699
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.