Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks

Authors:
Weifa Liang
Affiliations:
IEEE
Venue:
IEEE Transactions on Mobile Computing
Year:
2006

Citing 11
Cited 23

A nearly best-possible approximation algorithm for node-weighted Steiner trees

Journal of Algorithms
Power-aware routing in mobile ad hoc networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Improved methods for approximating node weighted Steiner trees and connected dominating sets

Information and Computation
A new approach to the design and analysis of peer-to-peer mobile networks

Wireless Networks
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
A Survey of Energy Efficient Network Protocols for Wireless Networks

Wireless Networks
Constructing minimum-energy broadcast trees in wireless ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Algorithmic aspects of topology control problems for ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues

Proceedings of the 8th annual international conference on Mobile computing and networking
Resource management in energy-limited, bandwidth-limited, transceiver-limited wireless networks for session-based multicasting

Computer Networks: The International Journal of Computer and Telecommunications Networking
Minimum energy disjoint path routing in wireless ad-hoc networks

Proceedings of the 9th annual international conference on Mobile computing and networking

Online Multicasting for Network Capacity Maximization in Energy-Constrained Ad Hoc Networks

IEEE Transactions on Mobile Computing
Dynamic multi-resolution data dissemination in storage-centric wireless sensor networks

Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Energy efficient multicast routing in ad hoc wireless networks

Computer Communications
Multicast routing in mobile ad hoc networks by using a multiagent system

Information Sciences: an International Journal
Ant-based distributed constrained steiner tree algorithm for jointly conserving energy and bounding delay in ad hoc multicast routing

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Adaptive two-way uniform partition for multicast routing problem with separate paths in ad hoc networks

Expert Systems with Applications: An International Journal
The investigation of delay-constrained multicasting with minimum-energy consumption in static ad hoc wireless networks

International Journal of Ad Hoc and Ubiquitous Computing
Minimum-energy all-to-all multicasting in wireless ad hoc networks

IEEE Transactions on Wireless Communications
Energy-aware online routing with QoS constraints in multi-rate wireless ad hoc networks

Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Interference and power constrained broadcast and multicast routing in wireless ad hoc networks using directional antennas

Computer Communications
Minimum-energy multicast tree in cognitive radio networks

Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Maximizing multicast call acceptance rate in multi-channel multi-interface wireless mesh networks

IEEE Transactions on Wireless Communications
Scalable multicasting in energy aware mobile backbone based wireless ad hoc networks

MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Approximation algorithms for multicast routing in ad hoc wireless networks

Journal of Combinatorial Optimization
The min-power multicast problems in wireless ad hoc networks: a parameterized view

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Approximation algorithms for minimum energy multicast routing with reception cost in wireless sensor networks

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Minimum power multicast algorithms for wireless networks with a Lagrangian relaxation approach

Wireless Networks
Load-balanced Multicast Tree Routing in Multi Channel Multi Radio Wireless Mesh Networks Using a New Cost Function

Wireless Personal Communications: An International Journal
Broadcasting in multi-radio multi-channel wireless networks using simplicial complexes

Wireless Networks
Minimum energy multicast/broadcast routing with reception cost in wireless sensor networks

Theoretical Computer Science
Duty-cycle-aware minimum-energy multicasting in wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
An exponential improvement on the MST heuristic for minimum energy broadcasting in ad hoc wireless networks

IEEE/ACM Transactions on Networking (TON)
Parameterized complexity of Min-power multicast problems in wireless ad hoc networks

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A wireless ad hoc network consists of mobile nodes that are equipped with energy-limited batteries. As mobile nodes are battery-operated, an important issue in such a network is to minimize the total power consumption for each operation. Multicast is one of fundamental operations in any modern telecommunication network including wireless ad hoc networks. Given a multicast request consisting of a source node and a set of destination nodes, the problem is to build a minimum-energy multicast tree for the request such that the total transmission power consumption in the tree is minimized. Since the problem in a symmetric wireless ad hoc network is NP-complete, we instead devise an approximation algorithm with provable approximation guarantee. The approximation of the solution delivered by the proposed algorithm is within a constant factor of the best-possible approximation achievable unless P = NP.