Power efficient routing trees for ad hoc wireless networks using directional antenna

Authors:
Fei Dai;Qing Dai;Jie Wu
Affiliations:
Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL 33431, USA;Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL 33431, USA;Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL 33431, USA
Venue:
Ad Hoc Networks
Year:
2005

Citing 3
Cited 3

Introduction to Algorithms

Introduction to Algorithms
Minimum-energy broadcasting in static ad hoc wireless networks

Wireless Networks
Minimum energy mobile wireless networks

IEEE Journal on Selected Areas in Communications

Energy-aware multicasting in wireless ad hoc networks: A survey and discussion

Computer Communications
Energy efficient multicast routing in ad hoc wireless networks

Computer Communications
Minimum-energy broadcast and multicast in wireless networks: An integer programming approach and improved heuristic algorithms

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In ad hoc wireless networks, nodes are typically powered by batteries. Therefore saving energy has become a very important objective, and different algorithms have been proposed to achieve power efficiency during the routing process. Directional antenna has been used to further decrease transmission energy as well as to reduce interference. In this paper, we discuss five algorithms for routing tree construction that take advantage of directional antenna, i.e., Reverse-Cone-Pairwise (RCP), Simple-Linear (SL), Linear-Insertion (LI), Linear-Insertion-Pairwise (LIP), and a traditional approximation algorithm for the travelling salesman problem (TSP). Their performances are compared through a simulation study.