Two distributed algorithms DMMT-OA and DMMT-DA have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. The experimental results have shown their superior performance than other centralized algorithms; however, their theoretical performance in terms of approximation ratio is still unknown. In this paper, we use graph theoretic approach to derive the approximation ratio for both algorithms. Furthermore, we have discovered by the first time that both ratios are bounded by a constant number. © IFIP International Federation for Information Processing 2007.
CITATION STYLE
Guo, S., Yang, O., & Leung, V. (2007). Analytical performance evaluation of distributed multicast algorithms for directional communications in WANETs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4479 LNCS, pp. 1153–1156). Springer Verlag. https://doi.org/10.1007/978-3-540-72606-7_102
Mendeley helps you to discover research relevant for your work.