Energy Efficient Broadcast Routing in Ad Hoc Sensor Networks with Directional Antennas

Different from omni-directional antennas, directional antennas model allows that each sensor can adjust the beam-width from theta(min) to 360 degrees and steer the antenna orientation to any desired direction [1], [2]. In this paper, we discuss the energy efficient broadcast problem with the directional antenna model in ad hoc sensor networks. The problem of our concern is: given n nodes and a broadcast request from s, each node equips a directional antenna with at least minimum angle theta(min), find a broadcast tree rooted at s and spanning all other nodes, in which each submitting node selects its propagation area, such that the total energy cost of the broadcast tree is minimized. We propose a greedy algorithm for this problem, and extensive simulation results have demonstrated the performance of our algorithm is more efficient than D-BIP algorithm [2].