無線行動感測網路中分散式目標物巡邏機制之研究

Patrolling Mechanisms for Distributed Targets in Mobile Wireless Sensor Networks

黃宇菁(Yu-Ching Hwang)

指導教授 ： 鄭建富 ； 張志勇

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

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

摘要

目標物覆蓋(Target Coverage)問題在無線感測網路中一直受到廣泛的討論，然而，在過去的研究中，大都假設目標物間相互連結，但在實際的環境中，目標物可能分散於許多不連續區域中，導致過去的研究無法達到理想的目標。本論文提出一Distributed Partitioning and Cooperating Mechanism for Target Patrolling Tasks in Disconnected Wireless Sensor Networks機制，考慮目標物(Target Points)分散於許多不連續區域的場景，針對多個行動資料收集站(Mobile Sink)之移動路徑進行分工與規劃，使Mobile Sinks能利用最有效率的巡邏收集分散於網路中的目標物資訊，此外，為了避免Mobile Sink工作量的不平衡，本論文依據巡邏迴圈效率以及Mobile Sink數量將目標物群組化以及平衡Mobile Sinks之配置，除了於目標物群組內建置有效率的目標物巡邏迴圈外，亦根據目標物間不同的距離及權重適當的調整Mobile Sink之速度，使目標物擁有固定的監控資訊更新週期，並藉此達到降低移動成本及穩定的資料取樣頻率。

關鍵字

目標物覆蓋 ； 行動資料收集站 ； 協同工作 ； 分群 ； 工作平衡 ； 無線感測網路

並列摘要

Target coverage problem has been one of the most widely dicussed issues in Wireless Sensor Networks(WSNs). Most of the previous researches assume that target points are near to each other and can be easily connected. However, in the actual enviroments, target points may be scattered in several disconnected areas. This paper proposes a Distributed Partitioning and Cooperating Mechanism(DPCM) for patrolling the target points which might be scattered in several disconnected areas. The proposed DPCM partitions the targets that are far away with each other into different groups, constructs a path for each group as well as allocates mobile sinks to the constructed paths. The contributions of the proposed DPCM is that the overall length of the constructed paths can be as short as possible and the workload of each mobile sink can be balanced. In addition, each mobile sink further controls its speed such that the user defined patrolling frequency for each target can be satisfied. Performance studies reveal that the proposed DPCM outperforms existing works in terms of the decreasing the Mobile Sink’s workload, shorten the target point’s monitoring interval and reduce the total monitoring length.

並列關鍵字

Target Coverage ； Mobile Sink ； Cooperative ； Clustering ； Balance Workload ； WMSNs

參考文獻

[1] 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.

[2] 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.

[3] J. He and H. Shi, “Finding Barriers with Minimum Number of Sensors in Wireless Sensor Networks,” IEEE ICC, 2010.

[4] G. Yang and D. Qiao, “Multi-Round Sensor Deployment for Guaranteed Barrier Coverage,” IEEE INFOCOM, 2010.

[5] R. W. Pazzi, D. Zhang, A. Boukerche, and L. Mokdad, “E-TRAIL: Energy-Efficient Trail-Based Data Dissemination Protocol for Wireless Sensor Networks with Mobile Sinks,” IEEE ICC, 2011.