Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
A delay constrained distributed multicast routing algorithm
ICCC '95 Proceedings of the 12th international conference on computer communication on Information highways : for a smaller world and better living: for a smaller world and better living
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Introduction to Algorithms
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
A Distributed Multicast Routing Algorithm for Real-Time Applications in Wide Area Networks
ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
Ad hoc multicast routing algorithm with swarm intelligence
Mobile Networks and Applications
Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Minimum-cost multicast over coded packet networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Self-organization in communication networks: principles and design paradigms
IEEE Communications Magazine
IEEE Network: The Magazine of Global Internetworking
Learning from the cell life-cycle: a self-adaptive paradigm
ECSA'10 Proceedings of the 4th European conference on Software architecture
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
International Journal of Parallel Programming
| Hi-index | 0.00 |
The minimum-energy multicast tree problem aims to construct a multicast tree rooted at the source node and spanning all the destination nodes such that the sum of transmission power at non-leaf nodes is minimized. However, aggressive power assignment at non-leaf nodes, although conserving more energy, results in multicast trees that suffer from higher hop count and jeopardizes delay-sensitive applications, signifying a clear tradeoff between energy efficiency and delay. This article formulates these issues as a constrained Steiner tree problem, and describes a distributed constrained Steiner tree algorithm, which jointly conserves energy and bounds delay for multicast routing in ad hoc networks. In particular, the proposed algorithm concurrently constructs a constrained Steiner tree, performs transmission power assignment at non-leaf nodes, and strives to minimize the sum of transmission power of non-leaf nodes, subject to the given maximum hop count constraint. Simulation results validate the effectiveness and reveal the characteristics of the proposed algorithm.