Distributed approximation algorithms for longest-lived multicast in WANETs with directional antennas

Authors:
Song Guo;Victor Leung;Xiaohong Jiang
Affiliations:
School of Computer Science and Engineering, The University of Aizu, Aizu-Wakamatsu, Fukushima, Japan;Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, BC, Canada;School of Systems Information Science, Future University Hakodate, Hakodate, Hokkaido, Japan
Venue:
IEEE Transactions on Wireless Communications
Year:
2010

Citing 6
Cited 0

Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues

Proceedings of the 8th annual international conference on Mobile computing and networking
Energy-Aware Wireless Networking with Directional Antennas: The Case of Session-Based Broadcasting and Multicasting

IEEE Transactions on Mobile Computing
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)
A scalable distributed multicast algorithm for lifetime maximization in large-scale resource-limited multihop wireless networks

Proceedings of the 2006 international conference on Wireless communications and mobile computing
Approximation algorithms for longest-lived directional multicast communications in WANETs

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the lifetime optimization problem for multicasting in wireless ad hoc networks, in which each node is equipped with a directional antenna and has limited energy supplies. Several distributed algorithms proposed recently are especially beneficial to a resource-constrained wireless ad hoc network. In this paper, we propose a new distributed algorithm and investigate its theoretical performance compared to existing distributed algorithms. We use a graph theoretic approach to obtain the upper bound of the approximation ratio for a group of distributed algorithms. In particular, the derived upper bound in a closed form for each algorithm provides a sufficient condition to determine if the obtained solutions can reach optimum. Both theoretical and experimental performance analysis show that the new algorithm outperforms other proposals in terms of providing long-lived multicast tree.