On Target Coverage Problem of Angle Rotatable Directional Sensor Networks

碩士 === 亞洲大學 === 資訊工程學系碩士班 === 101 === In this thesis, we study the target coverage problem of directed sensor networks with rotatable angles. The main purpose of this problem is to maximize number of targets to be covered while minimize number of activated directional sensors. Coverage problem is we...

Full description

Bibliographic Details
Main Authors: Wu,Mao-Cheng, 吳茂成
Other Authors: Lu,Wei-Fu
Format: Others
Language:zh-TW
Published: 2013
Online Access:http://ndltd.ncl.edu.tw/handle/93871248409032455212
Description
Summary:碩士 === 亞洲大學 === 資訊工程學系碩士班 === 101 === In this thesis, we study the target coverage problem of directed sensor networks with rotatable angles. The main purpose of this problem is to maximize number of targets to be covered while minimize number of activated directional sensors. Coverage problem is well-studied for omni-directional sensors; however, it is still a challenge task for directional sensor. The directional sensor nodes used in the previous works are composed of fixed number of sensors, and the orientations of sensors are fixed. In this study, we consider the directional sensors with arbitrary sensing orientations. Our algorithm constructs sectors of sensors based on targets within the sensing distance of sensors to gain higher coverage rate and lower ratio of active sensors. To evaluate the performance of proposed algorithm, several simulations are conducted. Experimental results show that our algorithm can contribute to increase the coverage rate of targets and decrease the ratio of activated directional sensors obviously than previous algorithms, thus gain better coverage performance and longer lifetime for directed sensor networks.