無線感測網路中，建立具共享能力之資料收集樹是一個重要的服務功能。雖然現有研究對共享樹的建立已有許多探討，當網路中存在障礙物或是共享樹上的Sensor電力耗盡無法繼續傳送資料時，將破壞其資料收集的整合性及通訊效能，因此，本論文主要在研究下列議題：給予一已建立之共享樹，當此共享樹中產生一影響通訊的大型障礙物時，如何以分散式的技術來局部重建共享樹，使資料的收集具有高度的共享能力以達到節省耗電及延長網路生命期之目的。在本研究中，我們擬從多種避開障礙物或空洞區域的路徑中，有效率的挑選出有高度共享以減少成本的封包傳輸路徑，並以較低的成本來重建具高度共享之資料收集樹。實驗數據顯示，我們所提出維護Share Tree的機制，能有效的克服障礙區，並能維持Share Tree共享的能力、減少電量的耗費以及延長WSNs的生命週期。 Constructing a share tree from sink node to a group of data source nodes can explore the potential of data aggregation in wireless sensor networks (WSNs). In literature, there are plenty researches developing mechanisms to construct a share tree, however, most of them can not resist obstacles which might damage the constructed tree topology and thus block the data transmission. This paper proposes a disturbed mechanism, namely obstacle-free sharing tree reconstruction protocol (OFST), to locally repair the injured share tree so that the reconstructed share tree can resist obstacles and explore the data aggregation potential. For a given three disconnected subtree, the proposed OFST initially identifies the share region where all points in the region can play the role of share point for resisting the existed obstacle and exploring the data aggregation potential. Based on the concept of steiner point, a theoretical study on selecting the best share point from the share region is presented for connecting the three subtrees. Simulation results reveal that the proposed OFST protocol can effectively overcome the obstacle and explore the data aggregation potential, and hence reduce the energy consumption and prolong the network lifetime of the WSN.
