Several solutions for energy-efficient broadcasting, mostly centralized, have been proposed with directional antennas. However, such globalized protocols are not suitable for ad hoc networks, because each node needs a full knowledge of the topology. Recently, a localized algorithm, called DRBOP, using one-to-one communication model has been proposed. It uses RNG graphs, which can be locally computed by each node. However, for energy consumption reasons, it can be useful to reach more than one neighbor at a time. In this paper, we propose an efficient protocol which uses both one-to-one and one-to-many communication models. First, we present a variant of DRBOP efficient for sparse networks, based on LMST graph which is a local adaptation of minimal spanning tree. Then, a one-to-many protocol efficient for dense networks is proposed. From these two algorithms we derive an adaptive protocol which is shown to be efficient for both sparse and dense networks. © IFIP International Federation for Information Processing 2004.
CITATION STYLE
Cartigny, J., Simplot-Ryl, D., & Stojmenovic, I. (2004). An Adaptive Localized Scheme for Energy-Efficient Broadcasting in Ad Hoc Networks with Directional Antennas. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3260, 399–413. https://doi.org/10.1007/978-3-540-30199-8_33
Mendeley helps you to discover research relevant for your work.