Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
BLMST: A Scalable, Power-Efficient Broadcast Algorithm for Wireless Networks
QSHINE '04 Proceedings of the First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks
Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Localized Broadcast Incremental Power Protocol for Wireless Ad Hoc Networks
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
A unified energy-efficient topology for unicast and broadcast
Proceedings of the 11th annual international conference on Mobile computing and networking
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Localized Operations for Distributed Minimum Energy Multicast Algorithm in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-aware multicasting in wireless ad hoc networks: A survey and discussion
Computer Communications
A Maximum-Residual Multicast Protocol for Large-Scale Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
An SPT-based topology control algorithm for wireless ad hoc networks
Computer Communications
Hi-index | 0.00 |
Most proposed distributed energy-efficient multicasting algorithms utilise 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 certain 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 fiows. In this paper, we propose the algorithm Localised Energy-efficient Multicast with Grouping (LEMG) features to perform a local search in a fully localised fashion. The mechanism Grouping exploits a novel idea to evaluate the power consumption cost of every node and to limit message exchange within an adjustable constant hop. Our simulation shows LEMG is comparable in energy efficiency with DMEM, while the refinement can be performed with limited hops of message passing regardless of the network size and the number of destinations.