Fully Localized Energy-efficient Multicast in Large-Scale Wireless Ad Hoc Networks

Abstract

Most of the proposed distributed energyefficient 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 Energyefficient Multicast with Grouping (LEMG) features doing local search in a fully localized fashion. The mechanism Grouping exploits a novel idea to evaluate the power consumption cost of every node and limit the message passing within a adjustable constant hop. Our simulation shows LEMG is energy-efficient comparable to DMEM, and the refinement can be done in only limited hops of message passing regardless of the network size and the number of destinations.