在無線感測網路中具省電與充電考量之邊界覆蓋與d-陷阱覆蓋技術

Barrier Coverage and d-Trap Coverage Mechanisms for Energy Efficient WSNs

方畢經慧(Jing-Huei Fang Bi)

指導教授 ： 郭經華

淡江大學/工學院/資訊工程學系碩士班/碩士(2014年)

https://doi.org/10.6846/TKU.2014.00913

摘要

近年來，邊界覆蓋(Barrier Coverage)在無線感測網路中是很重要且受到廣泛討論的問題。本論文所運作的場景為國邊界上已先佈下許多固定式感測器且感測器皆有太陽能充電的能力。由於感測器工作耗電後，需要進行太陽能充電，因此，感測器的排程與合作式監控將決定感測器在國邊界上的防衛能力。本論文擬設計一分散式排程技術，透過太陽能充電機制使網路永續運作。所謂d-Trap Coverage意指監控範圍中允許直徑不大於d的空洞產生。這樣的應用可大量的節省感測器電量或硬體成本。本論文針對一個已佈建的感測網路，提出一個感測器輪流醒睡的分散式排程技術，使場景中每個感測器皆可以輪流休息和工作，相較於現有的d-Trap coverage研究，本論文的貢獻如下。首先，感測器因電量不足而無法撐過一個醒睡週期時，將使空洞大於預設的限制值，因此，本論文提出感測器醒睡排程技術，以有效維護d-Trap coverage之要求並將空洞所造成的感測風險平均分散於場景中。

關鍵字

邊界覆蓋 ； 太陽能 ； 排程 ； 分散式 ； 無線感測網路 ； 感測器 ； 電量 ； 覆蓋空洞 ； Trap coverage

並列摘要

In wireless sensors, trap coverage has recently been proposed as a tradeoff between the availability of sensor nodes and sensing performance. A d-trap coverage is referred to the network where the diameter of each existing hole should be smaller than d. The d-trap offers an efficient framework to tackle the challenge of limited resources in large scale sensor networks. Currently, existing works only studied the network formation for the desired trap coverage. However, how to efficiently schedule sensor nodes between active and sleep modes to satisfy the constraint of trap coverage and prolong the network lifetime is still an open issue. This paper presents an efficient working schedule for d-trap coverage, aiming to satisfy the constraint of trap coverage and prolong the network lifetime. In simulation, the proposed algorithm outperforms the existing works in terms of the number of working sensors, reaming energy ratio, and network lifetime.

並列關鍵字

Barrier coverage ； Energy harvesting ； Scheduling ； Distributed ； Wireless sensor network ； Sensor ； Energy ； Coverage hole ； Trap coverage

參考文獻

[1]J. He and H. Shi, “Finding barriers with minimum number of sensors in wireless sensor networks,” The 2010 IEEE International Conference on Communications (IEEE ICC), South Africa, May 2010.

[2]G. Yang and D. Qiao, “Multi-Round Sensor Deployment for Guaranteed Barrier Coverage,” The 2010 IEEE Conference on Computer Communications (IEEE INFOCOM), San Diego, March 2010.

[5]C. Y. Chang, C. Y. Lin, C. Y. Hsieh and Y. J. Ho, “Patrolling Mechanisms for Disconnected Targets in Wireless Mobile Data Mules Networks,” The 2011 IEEE International Conference on Parallel Processing (IEEE ICPP), Taiwan, September 2011.

[6]C. Liu, K. Wu, Y. Xiao, and B. Sun, “Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 6, June 2006, pp. 562–575.

[7]Z. Yun, X. Bai, D. Xuan, T. H. Lai, and W. Jia, “Optimal Deployment Patterns for Full Coverage and k-Connectivity (k ≤ 6) Wireless Sensor Networks,” IEEE/ACM Transactions on Networking, vol. 18, no. 3, June 2010, pp. 934–947.