Abstract
Wireless mobile ad hoc stations have limited battery capacity. One major performance metric used to evaluate broadcast and multicast trees is the lowest total energy consumption. We extend our previous work by presenting a more general study from broadcast to multicast case, since the multicast tree obtained by pruning some broadcast tree does not give good performance once the multicast group sizes is small. In this paper, we present a constraint formulation in terms of MILP (Mixed Integer Linear Programming), which can be used for an optimal solution of the minimum-energy multicast problem in wireless ad hoc networks with omni-directional antennas. The experiment results show that an optimal solution of the MEM problem using our MILP model can always be obtained in a timely manner for moderately sized networks typically with 50 nodes.
| Original language | English |
|---|---|
| Pages (from-to) | 3989-3993 |
| Number of pages | 5 |
| Journal | IEEE Vehicular Technology Conference |
| Volume | 60 |
| Issue number | 6 |
| Publication status | Published - 1 Dec 2004 |
| Externally published | Yes |
| Event | 2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall: Wireless Technologies for Global Security - Los Angeles, CA, United States Duration: 26 Sept 2004 → 29 Sept 2004 |
Keywords
- Minimum-energy routing
- Mixed integer linear programming
- Multicast
- Wireless ad hoc networks
ASJC Scopus subject areas
- Computer Science Applications
- Applied Mathematics
- Electrical and Electronic Engineering
