Fully Localized Energy-Efficient Multicast in Wireless Ad Hoc Network
Date Issued
2009
Date
2009
Author(s)
Huang, Tse-Han
Abstract
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.
Subjects
Energy efficiency, routing protocols, wireless ad hoc network, localized algorithm
SDGs
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-98-R96922141-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):d1cb7ea512776f508a1730a496887783