Approximation algorithms for multicast routing in ad hoc wireless networks

  • Authors:
  • Deying Li;Qinghua Zhu

  • Affiliations:
  • Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, Beijing, China 100872;Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, Beijing, China 100872

  • Venue:
  • Journal of Combinatorial Optimization
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Energy efficient multicast problem is one of important issues in ad hoc networks. In this paper, we address the energy efficient multicast problem for discrete power levels in ad hoc wireless networks. The problem of our concern is: given n nodes deployed over 2-D plane and each node v has l(v) transmission power levels and a multicast request (s,D) (clearly, when D is V驴{s}, the multicast request is a broadcast request), how to find a multicast tree rooted at s and spanning all destinations in D such that the total energy cost of the multicast tree is minimized. We first prove that this problem is NP-hard and it is unlikely to have an approximation algorithm with performance ratio 驴lnn(驴