無線行動感測網路上分散式無分割移動之通訊協定

A Distributed Partition-Free Lazy Movement Protocol for Mobile Sensor Networks

蔡錦坤(Jin-Kuen Tsai)

指導教授 ： 石貴平

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

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

摘要

無線感測網路(Wireless Sensor Networks)會因為無線感測元件(Sensors)無法工作而使得網路產生分割(Partition)，Partition將嚴重影響Coverage 的情況與Connectivity 的品質。因此，我們提出一個有效避免Partition 產生的分散式無分割移動之通訊協定(Distributed Partition-Free Lazy Movement Protocol，PLMP)，PLMP 使用具移動性的感測裝置(Mobile Sensors)以避免Partition 的產生。
PLMP主要包括「Network Initialization Phase」和「Network Maintenance Phase」二個部分。在「Network Initialization Phase」中，整個行動感測網路(Mobile Sensor Network，MSN)將以Sink為主進行網路初始化的動作，這個部分將提供未來Mobile Sensors移動方向的依據。「Network Maintenance Phase」則是應用於網路可能產生Partition時，Mobile Sensors所需移動的位置與方向之計算。當Partition可能產生時，Connectivity 較差的Mobile Sensors將利用右手法則(Right Hand Rule)方式傳送封包並蒐集相關資訊，據以計算出一個考量到區域Coverage情況的移動位置，最後再移至該處維護網路的Connectivity。另外我們在效能分析中提出二個效能指標EIn與EIc分別判斷移動位置對於WSN中Coverage與Connectivity的影響。
PLMP 具有下列特色(1) 分散式的協定；(2)有效維護網路的Connectivity；(3)盡量減少Mobile Sensors 移動的時機與次數，以減少電量的消耗。實驗模擬的結果顯示出，分散式無分割移動之通訊協定較其他相關文獻所提出之協定更能避免Partition 的產生，使所有能夠工作的Mobile Sensors 可以貢獻他們的能力，以增加WSN 的存活時間。

關鍵字

無線感測網路行動感測網路 ； 分散式無分割移動之通訊協定

並列摘要

According to the advancement of wireless technology, wireless sensor networks (WSNs) are widely adopted to many applications. Some partitions will appear in WSNs because some sensors are inactive. Partitions will reduce the coverage and weaken the connectivity of the WSN. We will provide a protocol (Distributed Partition-Free Lazy Movement Protocol, PLMP) which can prevent the appearance of partitions effectively. PLMP has some characteristics as follows:(1) It is distributed (2) It can maintain the connectivity of the WSN effectively (3)Less Number of movements.

並列關鍵字

Connectivity ； Coverage ； Partition ； Mobile Sensor

參考文獻

[2]. F. Ye, H. Luo, J. Cheng, S. Lu and L. Zhang, “A two-tier data dissemination model for large-scale wireless sensor networks,” in Proceedings of the 8th Annual International Conference on Mobile Computing and Networking

[3]. X. Ji, H. Zha, J. J. Metzner and G. Kesidis, “Dynamic cluster structure for object detection and tracking in wireless ad-hoc sensor networks,” in Proceedings of the IEEE International Conference on Communications (ICC), Jun. 2004, pp.3807-3811.

[4]. D. Tian and N. D. Georganas, “A coverage-preserving node scheduling scheme for large wireless sensor networks,” in Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications, 2002, pp. 32–41.

[6]. Z. Zhou, S. Das, and H. Gupta, “Connected K-coverage problem in sensor networks,” in Proceedings of the 13th International Conference on Computer Communications and Networks, 2004, pp. 373–378.

[8]. H. Gupta, S. R. Das, and Q. Gu, “Connected sensor cover : self-organization of sensor networks for efficient query execution,” in Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, 2003, pp.189–200.