Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks

  title={Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks},
  author={Peng-Jun Wan and Gruia Calinescu and Xiang-Yang Li and Ophir Frieder},
  journal={Wireless Networks},
Energy conservation is a critical issue in ad hoc wireless networks for node and network life since the nodes are powered by batteries only. One major approach for energy conservation is to route a communication session along the route which requires the lowest total energy consumption. This optimization problem is referred to as Minimum-Energy Routing. While the minimum-energy unicast routing problem can be solved in polynomial time by shortest-path algorithms, it remains open whether the… CONTINUE READING
Highly Cited
This paper has 149 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 83 extracted citations

Computing and Combinatorics

Lecture Notes in Computer Science • 2016
View 9 Excerpts
Highly Influenced

Iterated Algorithms for the Minimum Energy Broadcast Tree Problem in Wireless Ad Hoc Networks

International Conference on Wireless Algorithms, Systems and Applications (WASA 2007) • 2007
View 4 Excerpts
Highly Influenced

Minimal Energy Broadcast for Delay-Bounded Applications in Satellite Networks

IEEE Transactions on Green Communications and Networking • 2018
View 1 Excerpt

150 Citations

Citations per Year
Semantic Scholar estimates that this publication has 150 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 10 references

atal, \A Greedy Heuristic for the Set-Covering

V. Chv
Problem",Mathematics of Operations Research, • 1979
View 3 Excerpts
Highly Influenced

Communications: Principles and Practices

T. S. Rappaport, Wireless
View 1 Excerpt

Chvátal , A greedy heuristic for the set - covering problem

P. Crescenzi Clementi, P. Penna, +3 authors R. Silvestri

Similar Papers

Loading similar papers…