Minimum-energy broadcast routing in wireless multi-hop networks

Song Guo, O. Yang

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

4 Citations (Scopus)

Abstract

Energy conservation is a critical issue in wireless multi-hop networks since the nodes are powered by batteries only. One major metric for energy conservation is to route a communication session along the routes which requires the lowest total energy consumption. In this paper, based on the concepts of virtual relay, we present a constraint formulation for the minimum-energy broadcast routing problem in terms of mixed integer linear programming (MIP). Moreover the model extends its analytical capability into more general scenarios in asymmetric networks, where few studies have addressed the broadcast routing problem before. The experiment results show that in a typical multi-hop network with node less than 50, optimal solution can be always solved in a timely manner, and save up to 30% power consumption compared to the most efficient heuristic algorithm BIP known so far.
Original languageEnglish
Title of host publication22nd IEEE International Performance, Computing, and Communications Conference, IPCCC 2003 - Conference Proceedings
PublisherIEEE
Pages273-280
Number of pages8
Volume2003-January
ISBN (Electronic)0780378938
DOIs
Publication statusPublished - 1 Jan 2003
Externally publishedYes
Event22nd IEEE International Performance, Computing, and Communications Conference, IPCCC 2003 - Phoenix, United States
Duration: 9 Apr 200311 Apr 2003

Conference

Conference22nd IEEE International Performance, Computing, and Communications Conference, IPCCC 2003
Country/TerritoryUnited States
CityPhoenix
Period9/04/0311/04/03

ASJC Scopus subject areas

  • Engineering(all)

Cite this