The Study of Coverage Problem in Wireless Sensor Networks

• Main Authors: Wei-Kai Wang, 王偉凱
• Other Authors: Hung-Chi Chu
• Format: Others
• Language: zh-TW
• Published: 2009
• Online Access: http://ndltd.ncl.edu.tw/handle/20997665863350516688

碩士 === 朝陽科技大學 === 網路與通訊研究所 === 97 === As the fast progress of communication and MEMS techniques, the multi-functional sensing devices can be created with low power-consumption. These sensing devices with low cost, low power–consumption and small size can be formed as a wireless sensor network. It is one of the important subjects for research. Coverage problem is a basic and important problem in wireless sensor network. We specialize in coverage problem and proposes two-phase irregular deployment algorithm in this paper. The goal of the propose method is having less sensor node to cover blanket working area, and then the improving at of two-phase Irregular Deployment Algorithm with concept of sweep coverage is also proposed. Reducing the number of sensor nodes in deployment stage is the goal of our method. We also propose the PPA (Patrol Point Algorithm) and analyze the moving time or moving period in sweep coverage. The goal of PPA is to keep the moving time of mobile nodes with unanimity. In simulation some kinds of network environments are considered to show the system effecting in coverage rate and number of sensor nodes. Utilize Shadowing Model to show that our method can be worked in real environment.