Minimum-energy broadcast routing in static ad hoc wireless networks

By Pengjun Wan, Gruia Calinescu, Xiangyang Li, Ophir Frieder. Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), 2001

418 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/5fcce1691be6b1821b3ba0116f43ced34bf3f4d1

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

In Computer Networks and Communications

Citations in the corpus

Asynchronous wakeup for ad hoc networks (2003, background): “Several research efforts [15, 22] also consider the issue of energy-efficient unicast/multicast/broadcast routing from the perspective of power control.”
Connected K-coverage problem in sensor networks (2004, background): “Connectivity is also a fundamental issue in wireless ad hoc environment, and many schemes have been proposed to address the issue of energy efﬁciency while maintaining connectivity in the network topology ([6], [7], [8]).”
Routing Mechanisms for Mobile Ad Hoc Networks Based on the Energy Drain Rate (2003, neutral): “Various works on power-aware protocols have appeared recently, see [4], [5], [6], [7], [8], [9], [ 10 ], [11].”
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues (2002, background): “Another difficulty with BIP is that it is not obvious how to distribute it, and according to the authors of BIP and the authors in [24] the development of distributed algorithms is the major challenge considering the minimum energy broadcast.”