Approximation algorithms for longest-lived directional multicast communications in WANETs

Authors:
Song Guo;Oliver Yang;Victor Leung
Affiliations:
The University of British Columbia, Vancouver, BC, Canada;University of Ottawa, Ottawa, ON, Canada;The University of British Columbia, Vancouver, BC, Canada
Venue:
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Year:
2007

Citing 3
Cited 4

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
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

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

IEEE Transactions on Wireless Communications
A distributed algorithm for min-max tree and max-min cut problems in communication networks

IEEE/ACM Transactions on Networking (TON)
Minimum latency data aggregation in wireless sensor network with directional antenna

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Approximation algorithms for minimum latency data aggregation in wireless sensor networks with directional antenna

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their performance has been studied by simulations; however, their theoretical performance in terms of approximation ratio is still unknown. In this paper, we use the graph theoretic approach, by the first time, to derive the upper bound of the approximation ratio in an analytical expression for these algorithms. We have also discovered that these upper bounds are finite numbers. Based on this analysis and some key observations, we present a new distributed constant-factor approximation algorithm in order to achieve a higher performance. This effort is validated by our simulation studies.