在無線隨意網路中利用區域化訊息達成節能群播之研究

大多數已提出的分散式節能群播演算法，使用了區域搜尋技術來逐步改善群播路由樹。他們以最小生成樹或是最短路徑樹來做為初步的路由樹。並且藉由將樹上的某些節點更換至更適合的父節點，來減低能源的消耗。由於這些改善的步驟需要大量的訊息交換，因此這些方法並不具有可擴展性。在這篇論文中，我們提出了編組式區域化節能群播 (LEMG) 演算法，能以完全區域化的方式來進行區域搜尋。其中提出了兩個很重要的機制:編號與編組。使得我們能以很少的訊息交換來避免路由樹的連結斷開並限制訊息傳遞的深度。藉由調整參數:分組大小限制(m)與執行回合數(x)。我們可以控制進行改善步驟的時間，並且限制所有的控制訊息最多僅能傳遞 m 個節點。實驗結果顯示 LEMG 與 DMEM 的群播路由樹耗功相當。並且無論網路的大小與訊息傳遞目標節點的數量，LEMG改善步驟的訊息交換都能在有限的節點傳遞內完成。

關鍵字

節能, 路由協定, 無線隨意網路, 區域化演算法

並列摘要

Most of the proposed distributed energy-efficient multicasting algorithms are using the local search technology to refine a multicast tree iteratively. They use MST or SPT as the initial solution and improve the total power consumption by switching some tree nodes from their respective parent nodes to new corresponding parent nodes. These algorithms are not scalable because the refinement operations require heavy message exchange flows. In this paper, we propose the algorithm Localized Energy-efficient Multicast with Grouping (LEMG) for local search in fully localized fashion. Two important mechanisms are proposed: Numbering and Grouping, which avoids the disconnection with very low message overhead and limit the hops of message passing. By adjusting two parameters: group size limit m and execution round demand x, we can control the refinement time and limit all the control message passing within m hops. Our simulation shows LEMG is energy-efficient comparable to DMEM, and the refinement can be done in only limited hops of message passing no matter the network size and the number of destinations.

並列關鍵字

Energy efficiency, routing protocols, wireless ad hoc network, localized algorithm

參考文獻

[1] Sandeep K.S. Gupta Bin Wang. On maximizing lifetime of multicast trees in wireless ad hoc networks. In Pro. of the IEEE International Conference on Parallel Processing, pages 333–340, 2003.

[2] D. Simplot-Ryl F. Ingelrest and I. Stojmenovic. Optimal Transmission Radius for Energy Efficient Broadcasting Protocols in Ad Hoc and Sensor Networks. In IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,

volume 17, pages 536–547, 2006.

[3] S. Guo and O. Yang. A dynamic multicast tree reconstruction algorithm for minimum-energy multicasting in wireless ad hoc networks. In Proc. of the IEEE

International Performance Computing and Comm. Conf. (IPCCC), pages 637–642, 2004.

國際替代計量

在無線隨意網路中利用區域化訊息達成節能群播之研究

全文下載

主題瀏覽