ENERGY-EFFICIENT BROADCASTING IN WIRELESS AD HOC NETWORKS LOWER BOUNDS AND ALGORITHMS
- 1 September 2002
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Journal of Interconnection Networks
- Vol. 03 (03n04) , 149-166
- https://doi.org/10.1142/s0219265902000604
Abstract
Energy-efficient communication is critical for increasing life of power limited wireless ad hoc networks. There has been considerable interest in minimum energy broadcast operations. In this paper, we develop bounds and an algorithm for minimizing energy cost for broadcasting from any source to all other nodes in the network. Most prior work have used simpler model for energy cost for wireless communications by accounting only the analog radiation cost for transmission and ignored the fixed cost for electronics in transmission and reception circuitry in nodes. Furthermore, in a network it is possible for some node pairs not be able to communicate directly even though they are in their radio ranges due to obstacles present in the terrain of the network.Keywords
This publication has 6 references indexed in Scilit:
- A Survey of Energy Efficient Network Protocols for Wireless NetworksWireless Networks, 2001
- Approximation Algorithms for Directed Steiner ProblemsJournal of Algorithms, 1999
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- Effect of terrain on path loss in urban environments for wireless applicationsIEEE Transactions on Antennas and Propagation, 1998
- A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NPPublished by Association for Computing Machinery (ACM) ,1997
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979