在無線感測網路下覆蓋問題之研究

The Study of Coverage Problem in Wireless Sensor Networks

王偉凱(Wei-Kai Wang)

指導教授 ： 朱鴻棋

朝陽科技大學/資訊學院/網路與通訊研究所/碩士(2009年)

摘要

近年來因無線通訊與微機電技術的進步，多功能低耗電的感測器能快速發展，其中由低成本、低耗電、體積小的感測器模組與無線通訊模組組成的無線通訊網路稱為無線感測網路(Wireless Sensor Network)，其為當前重要的研究課題之一。在無線感測網路的眾多研究主題中覆蓋問題是一個基本且重要的問題。因此在本論文中，我們針對覆蓋問題提出一個兩階段之不規則佈署演算法(Two-phase Irregular Deployment Algorithm)，期以較少的感測節點數量來達成完全覆蓋，並以連續覆蓋的概念來改良兩階段不規則佈署演算法，以達到減少感測節點佈署數量的目標，同時提出巡邏點演算法(Patrol Point Algorithm)，分析在連續覆蓋中節點巡邏時間，期使各移動節點之巡邏時間能趨於一致。本研究針對各種不同節點密度下進行實驗模擬，觀察覆蓋率之變化，並利用Shadowing Model模擬實際環境，來驗證本論文所提方法之實用性。

關鍵字

覆蓋問題 ； 無線感測網路

並列摘要

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.

並列關鍵字

coverage problem ； Wireless sensor network

參考文獻

[3] M. Cardei, M. T. Thai, Y. Li and W. Wu, “Energy-Efficient Target Coverage in Wireless Sensor Network”, IEEE INFOCOM, vol. 3, pp. 1976-1984, March 2005.

[4] W. C. Ke, B. H. Liu and M. J. Tsai, “Constructing a Wireless Sensor Network to Fully Cover Critical Grids by Deploying Minimum Sensors on Grid Point is NP-Complete”, IEEE Transactions on Computers, vol. 56, pp. 710-715, May 2007.

[5] Y. Zou and K. Chakrabarty, “A Distributed Coverage- and Connectivity-Centric Technique for Selecting Active Nodes in Wireless Sensor Networks”, IEEE Transactions on Computers, vol. 54, pp. 978-991, August 2005.

[6] E. S. Biagioni and G. Sasaki, “Wireless Sensor Placement for Reliable and Efficient Data Collection”, IEEE International Conference on System Sciences, January 2003.

[7] Y. C. Wang, C. C. Hu and Y. C. Tseng, “Efficient Deployment Algorithms for Ensuring Coverage and Connectivity of Wireless Sensor Networks”, First International Conference on Wireless Internet, pp. 114-121, July 2005.