Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks

  • Authors:
  • Deying Li;Xiaohua Jia;Hai Liu

  • Affiliations:
  • -;-;-

  • Venue:
  • IEEE Transactions on Mobile Computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Abstract--In this paper, we discuss energy efficient broadcast in ad hoc wireless networks. The problem of our concern is: Given an ad hoc wireless network, find a broadcast tree such that the energy cost of the broadcast tree is minimized. Each node in the network is assumed to have a fixed level of transmission power. We first prove that the problem is NP-hard and propose three heuristic algorithms, namely, shortest path tree heuristic, greedy heuristic, and node weighted Steiner tree-based heuristic, which are centralized algorithms. The approximation ratio of the node weighted Steiner tree-based heuristic is proven to be (1+2\ln(n-1)). Extensive simulations have been conducted and the results have demonstrated the efficiency of the proposed algorithms.