Minimum-Energy Multicast in Wireless Ad Hoc Networks with Adaptive Antennas: MILP Formulations and Heuristic Algorithms
Issue No. 04 - April (2006 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2006.48
Song Guo , IEEE
Oliver Yang , IEEE
In this paper, we consider wireless ad hoc networks that use adaptive antennas and have limited energy resources. To explore the advantages of power saving offered by the use of adaptive antennas, we consider the case of source initiated multicast traffic. We present a constraint formulation for the MEM (Minimum-Energy Multicast) problem in terms of MILP (Mixed Integer Linear Programming) for wireless ad hoc networks. An optimal solution to the MEM problem using our MILP model can always be obtained in a timely manner for moderately sized networks. In addition to the theoretical effort, we also present two polynomial-time heuristic algorithms called RB-MIDP and D-MIDP to handle larger networks for which the MILP model may not be computationally efficient. The experimental results show that our algorithms compare well with other proposals discussed in this paper.
Wireless ad hoc networks, minimum-energy routing, multicast algorithm, mixed integer linear programming, adaptive antenna, tree construction.
O. Yang and S. Guo, "Minimum-Energy Multicast in Wireless Ad Hoc Networks with Adaptive Antennas: MILP Formulations and Heuristic Algorithms," in IEEE Transactions on Mobile Computing, vol. 5, no. , pp. 333-346, 2006.