Local Sensing Strategies based on Voronoi Polygons for Area Coverage Problems in Wireless Sensor Networks

• Main Authors: Chieh-Cheng Tseng, 曾傑晟
• Other Authors: Chi-Ming Huang
• Format: Others
• Language: zh-TW
• Published: 2010
• Online Access: http://ndltd.ncl.edu.tw/handle/79107537861607577751

碩士 === 玄奘大學 === 資訊科學學系碩士班 === 98 === Wireless Sensor Networks compose a large number of sensors as well as some sinks. They have related applications on military, biological monitoring, and even medical care. Generally, a sensor detects or senses a circular area whose radius is its sensing range. When the number and density of sensors is large enough, the sensing area coverage will be easily complete. But the sensing area overlapping problem becomes serious. And this will result in bad energy consumption in the networks. On the other hand, when the number and density of sensors is small, the sensing area overlapping problem is relieved. But it causes many areas undetected. In this paper, we utilize directional sensing equipment to define the area which is closer to the detecting sensor than the other sensors. That is the Voronoi polygon with respect to the detected sensor. Based on the polygon, we propose two sensing or detecting strategies (line-shaped and circle-shaped sensing) to cover the whole environment and reduce the sensing overlapping to minimize energy consumption. The whole strategies are conducted locally. Good area coverage and area overlapping rate are obtained in our experiments.