無線感測網路之覆蓋範圍空區再覆蓋演算法; Coverage Hole Recovery Algorithms for Wireless Sensor Networks

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Electrical Engineering > Electronic Thesis & Dissertation > Item 987654321/10378

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/10378

Title:	無線感測網路之覆蓋範圍空區再覆蓋演算法;Coverage Hole Recovery Algorithms for Wireless Sensor Networks
Authors:	蘇建中;Chien-Chung Su
Contributors:	電機工程研究所
Keywords:	覆蓋空洞;無線感測網路;移動;mobility;coverage hole;wireless sensor network
Date:	2009-07-17
Issue Date:	2009-09-22 12:14:34 (UTC+8)
Publisher:	國立中央大學圖書館
Abstract:	最大化感測覆蓋面積在無線感測網路(WSNs)是其中一項重要的討論議題。在無線感測網路中，感測器被隨機佈署在監測區域或耗盡能量後死亡，而造成覆蓋空區(coverage hole)的產生。在一個具移動特性的感測網路中，感測器可以藉由移動(mobility)的方式達到重新佈署的目的。因此，在這篇研究中，我們提出一個經由具移動特性的感測器去減少覆蓋空區。研究的目標在於利用少數量的移動感測器增加感測面積，並且移動的距離限制在1-hop 與移動後感測器的最高k-coverage 不會被增加。 Maximizing sensing coverage area is one of the important issues in the wireless sensor networks. In wireless sensor network, sensor nodes are deployed randomly in the monitoring region or died after consuming the energy, such that coverage holes may be created. In a sensor network with movement facilities, sensor nodes can be moved redeployment. Therefore, we present a algorithm to decrease the coverage hole by mobility nodes in this paper. The goals are increasing coverage areas through smaller mobility of sensor nodes such that mobility distance is limited within 1-hop, and kh-coverage of the nodes are not increased.
Appears in Collections:	[Graduate Institute of Electrical Engineering] Electronic Thesis & Dissertation

Files in This Item:

File	Size	Format

社群 sharing

Loading...