A constraint formulation for minimum-energy multicast routing in wireless multihop ad-hoc networks

Authors:
Song Guo;Oliver Yang
Affiliations:
School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, Canada;School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, Canada
Venue:
Wireless Networks
Year:
2006

Citing 8
Cited 3

Power-aware routing in mobile ad hoc networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Algorithms for energy-efficient multicasting in static ad hoc wireless networks

Mobile Networks and Applications
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues

Proceedings of the 8th annual international conference on Mobile computing and networking
Power-Aware Localized Routing in Wireless Networks

IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
On Minimum-Energy Broadcasting in All-Wireless Networks

LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Guest Editorial Network Support for Multipoint Communication

IEEE Journal on Selected Areas in Communications
Multipoint communication: a survey of protocols, functions, and mechanisms

IEEE Journal on Selected Areas in Communications
The core-assisted mesh protocol

IEEE Journal on Selected Areas in Communications

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

Computer Communications
Bandwidth-guaranteed multicast in multi-channel multi-interface wireless mesh networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Minimum power multicasting in wireless networks under probabilistic node failures

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Energy conservation is a critical issue in wireless multihop ad-hoc networks, which have nodes powered by batteries only. One major metric for energy conservation is to route a communication session along the routes that require the lowest total energy consumption. To do this, we introduce in this paper a new concept called Virtual Relay. Based on this new concept, we present a constraint formulation for the minimum-energy multicast routing problem in terms of mixed integer linear programming. Experiment results show that in a typical multihop ad-hoc network with 50 nodes, the optimal solutions can always be solved in a timely manner, and it also provides a way to evaluate the realistic performance of different heuristic algorithms.