Energy efficient all-to-all broadcast in all-wireless networks

  • Authors:
  • Doina Bein;S. Q. Zheng

  • Affiliations:
  • Department of Computer Science, University of Texas at Dallas, P.O. Box 830688, Richardson, TX 75083-0688, USA;Department of Computer Science, University of Texas at Dallas, P.O. Box 830688, Richardson, TX 75083-0688, USA

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2010

Quantified Score

Hi-index 0.07

Visualization

Abstract

All-to-all broadcast is a communication pattern in which every node initiates a broadcast. In this paper, we investigate the problem of building a unique cast tree of minimum total energy, which we call Minimum Unique Cast (MUC) tree, to be used for all-to-all broadcast. The MUC tree is unoriented and unrooted. We study three known heuristics for the minimum-energy broadcast problem: the Broadcast Incremental Power (BIP) algorithm, the Wireless Multicast Advantage-conforming Minimum Spanning Tree (WMA-conforming MST) algorithm, and the Iterative Maximum-Branch Minimization (IMBM) algorithm. Experimental results conducted on various types of networks are reported. We show that neither of these methods is best overall for building all-to-all broadcast trees.