A performance guaranteed distributed multicast algorithm for long-lived directional communications in WANETs

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. In this paper, we propose a new distributed algorithm, whose performance in terms of providing long-lived multicast tree is guaranteed by our theoretical analysis. We prove that its approximation ratio is bounded by a finite number. In particular, the derived upper bound in a closed form shows that the algorithm can achieve global optimal in some cases. The real performance of this new proposed algorithm is also evaluated using simulation studies and the experimental results show that it outperforms other distributed algorithms. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Guo, S., Guo, M., & Leung, V. (2008). A performance guaranteed distributed multicast algorithm for long-lived directional communications in WANETs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5374 LNCS, pp. 439–450). Springer Verlag. https://doi.org/10.1007/978-3-540-89894-8_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free