Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
IEEE Transactions on Mobile Computing
Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing
Efficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas
IEEE Transactions on Parallel and Distributed Systems
Energy-aware multicasting in wireless ad hoc networks: A survey and discussion
Computer Communications
Some problems of directional sensor networks
International Journal of Sensor Networks
IEEE Communications Magazine
Minimum Energy Broadcast Routing in Ad Hoc and Sensor Networks with Directional Antennas
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Minimum latency data aggregation in wireless sensor network with directional antenna
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Theoretical Computer Science
Hi-index | 0.00 |
Different from omni-directional antennas, directional antennas model allows that each sensor can adjust the beam-width from 驴minto 360° 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 nnodes and a broadcast request from s, each node equips a directional antenna with at least minimum angle 驴min, find a broadcast tree rooted at sand 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].