由於在VON的架構下，經由EN做搜尋動作，會有redundancy的問題產生，造成網路頻寬上的浪費，所以本篇論文則是提出一個樹狀群組廣播的搜尋機制來做改善。透過建立APSTT (All-Path Search Tree Table)，和TPT (Transfer Path Table)，使VON網路中的每個節點透過查閱TPT得知下一個訊息發送點，如此能提昇搜尋的效能，避免網路頻寬的浪費。 This paper proposed a tree-like search mechanism that based on VON to solve the redundancy problem. Voronoi-based Overlay Network (VON) is a fully distributed peer-to-peer architecture and based on the mathematical construct Voronoi diagram. In this mechanism, one server being center controller will never be needed, and users can search data more effectively by passing query message from enclosing neighbor.
By constructing APSTT (All-Path Search Table) and TPT (Transfer Path Table), every node in VON can check TPT to pass the query message. In this way, we can improve performance and reduce the loading of network bandwidth.
