Minimum Energy Broadcast Routing in Ad Hoc and Sensor Networks with Directional Antennas

Authors:
Zheng Li;Deying Li
Affiliations:
Key Laboratory of Data Engineering and Knowledge Engineering, Renmin University of China, MOE, and School of Information, Renmin University of China, Beijing, China 100872;Key Laboratory of Data Engineering and Knowledge Engineering, Renmin University of China, MOE, and School of Information, Renmin University of China, Beijing, China 100872
Venue:
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Year:
2009

Citing 6
Cited 0

Approximation algorithms for directed Steiner problems

Journal of Algorithms
On the performance of ad hoc networks with beamforming antennas

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks

IEEE Transactions on Mobile Computing
Minimum-Energy Multicast in Wireless Ad Hoc Networks with Adaptive Antennas: MILP Formulations and Heuristic Algorithms

IEEE Transactions on Mobile Computing
Efficient Broadcasting in Ad Hoc Wireless Networks Using Directional Antennas

IEEE Transactions on Parallel and Distributed Systems
Energy Efficient Broadcast Routing in Ad Hoc Sensor Networks with Directional Antennas

WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss minimum energy broadcast routing with directional antennas in ad hoc and sensor networks. We assume that the network consists of sensor nodes whose antennas are Switched beam directional antennas. The problem of our concern is: given a set V with n nodes and each node v i has l (i ) transmission directions (i.e. the antenna sectors) and a broadcast request sourced at s , how to find a broadcast tree rooted at s and spanning all nodes in V such that the total energy is minimized. This problem involves with the choice of transmitting nodes and their transmission directions , which is NP-hard. We propose a |V |-approximation algorithm and one heuristic for the problem. Extensive simulations have demonstrated the efficiency of our algorithms.