Minimum-energy multicast routing in static wireless ad hoc networks

Song Guo; Oliver W. Yang

Minimum-energy multicast routing in static wireless ad hoc networks

Song Guo^*, Oliver W. Yang

^*Corresponding author for this work

Research output: Contribution to journal › Conference article published in journal › peer-review

13 Citations (Scopus)

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 - 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

Cite this

@article{b4e13cb5f1d749839d30bf89fe4c4db5,

title = "Minimum-energy multicast routing in static wireless ad hoc networks",

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.",

keywords = "Minimum-energy routing, Mixed integer linear programming, Multicast, Wireless ad hoc networks",

author = "Song Guo and Yang, \{Oliver W.\}",

year = "2004",

language = "English",

volume = "60",

pages = "3989--3993",

journal = "IEEE Vehicular Technology Conference",

issn = "1550-2252",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "6",

note = "2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall: Wireless Technologies for Global Security ; Conference date: 26-09-2004 Through 29-09-2004",

}

TY - JOUR

T1 - Minimum-energy multicast routing in static wireless ad hoc networks

AU - Guo, Song

AU - Yang, Oliver W.

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

KW - Minimum-energy routing

KW - Mixed integer linear programming

KW - Multicast

KW - Wireless ad hoc networks

UR - https://www.scopus.com/pages/publications/17144363616

M3 - Conference article published in journal

AN - SCOPUS:17144363616

SN - 1550-2252

VL - 60

SP - 3989

EP - 3993

JO - IEEE Vehicular Technology Conference

JF - IEEE Vehicular Technology Conference

IS - 6

T2 - 2004 IEEE 60th Vehicular Technology Conference, VTC2004-Fall: Wireless Technologies for Global Security

Y2 - 26 September 2004 through 29 September 2004

ER -

Minimum-energy multicast routing in static wireless ad hoc networks

Abstract

Keywords

Other files and links

Fingerprint

Cite this