Improving the Coverage of the Randomized Scheduling Algorithm for Wireless Sensor Networks

• Main Authors: Yi-Ting Chen, 陳翊挺
• Other Authors: Jenn-Wei Lin
• Format: Others
• Language: zh-TW
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/87197204805533431174

碩士 === 輔仁大學 === 資訊工程學系 === 95 === Randomized scheduling is a well-known sensor scheduling algorithm for saving energy. In this algorithm, sensor nodes are divided into several working subsets to perform the sensing task in turn. Due to not activating all sensor nodes, coverage holes might exist in each working subset. To improve the coverage performance of the randomized scheduling algorithm, this paper presents a distributed approach. For efficiently eliminating the coverage holes, the distributed approach is divided into two stages: field partition and coverage improvement. In these two stages, the problems required to be handled can be mapped to two existing geometry problems: Voronoi polygon construction and circle covering. We also modify the well-known algorithms of the two geometry problems to be applicable for the proposed distributed approach. The time complexity analysis of the proposed distributed approach is with the polynomial time. Finally, simulation results demonstrate that the proposed approach is effective in the sensing coverage.