On Minimum-Energy Broadcasting in All-Wireless Networks

  • Authors:
  • Fulu Li;Ioanis Nikolaidis

  • Affiliations:
  • -;-

  • Venue:
  • LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the construction of the source-initiated (one-to-all) wireless broadcast tree to minimize the totalrequired power for a given source node, a group ofintended destination node and a given propagationconstant, i.e., the power attenuation constant ë.TheMinimum-Energy Broadcasting (MEB) problem hasreceived much attention recently due to the two mainchallenges of mobile communication: the limitedbandwidth of wireless network and the limited powerupply of mobile unit.In a limited-bandwidthenvironment, push-based technique, i.e., broadcastchemes, appear to be a very effective way to allowmobile unit to share the broadcast data on air.In alimited-energy environment, energy-efficientcommunication architectures and techniques areessential.The MEB problem was presented in [6,7 ],however, its computational complexity remain unknown.In this paper, we first give an insight analysis on theMEB problem and prove the NP-hardness of thisproblem.We then present an efficient heuristic calledIterative Maximum-Branch Minimization (IMBM) toapproximate the construction of the minimum-energybroadcast tree, which fully utilize the wirelessbroadcast advantage and demonstrate betterperformance compared with the related approaches.Due to the power-efficient way of the construction of thebroadcast tree, the lifetime of the network can bemaximized.