Algorithms for energy-efficient multicasting in static ad hoc wireless networks
Mobile Networks and Applications
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
On Minimum-Energy Broadcasting in All-Wireless Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Multicast time maximization in energy constrained wireless networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Minimum-power multicast routing in static ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Energy-aware multicasting in wireless ad hoc networks: A survey and discussion
Computer Communications
EURASIP Journal on Wireless Communications and Networking
Approximation algorithms for longest-lived directional multicast communications in WANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
International Journal of Sensor Networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
HiPC'08 Proceedings of the 15th international conference on High performance computing
Distributed approximation algorithms for longest-lived multicast in WANETs with directional antennas
IEEE Transactions on Wireless Communications
Fully localised energy-efficient multicast in large-scale wireless ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
Hi-index | 0.00 |
We consider the problem of maximizing the multicast lifetime in multihop wireless networks in which each node is static and has limited energy, bandwidth, memory, and computation capabilities. Unlike most multicast algorithms that use centralized greedy algorithms, our algorithm can construct a global optimal maximum lifetime multicast tree in a distributed manner. It has a low complexity of O(λu) for both memory and computation requirements at each node u, where λu is the degree of node u. The simulation results have shown that it has an expected linear communication complexity under different network sizes and multicast group sizes. This means that our distributed algorithm is also scalable in terms of communication overhead and it is very useful for large-scale energy and bandwidth constrained multihop wireless networks like sensor networks.