The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—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 <tmath>(1+2\ln(n-1))</tmath>. Extensive simulations have been conducted and the results have demonstrated the efficiency of the proposed algorithms.</p>
Ad hoc wireless networks, energy efficient, broadcast routing, heuristic algorithm.

D. Li, H. Liu and X. Jia, "Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks," in IEEE Transactions on Mobile Computing, vol. 3, no. , pp. 144-151, 2004.
96 ms
(Ver 3.3 (11022016))