A Novel Power-Efficient Broadcast Routing Algorithm Exploiting Broadcast Efficiency

Abstract

It has been shown that the problem of finding a broadcast routing tree with minimum total transmit power is NP-hard. Hence, developing a heuristic power-efficient algorithm is crucial. The seminal work in this area is the well-known Broadcast Incremental Power (BIP) algorithm with a recent addition called Embedded Wireless Multicast Advantage (EWMA) algorithm. In this paper, the authors present yet another novel power-efficient algorithm for broadcast routing tree construction called Greedy Perimeter Broadcast Efficiency (GPBE) algorithm. They also compare the performance of these algorithms.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2003
Accession Number
ADA459890

Entities

People

  • Intae Kang
  • Radha Poovendran

Organizations

  • University of Washington

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Antennas
  • Boundaries
  • Computational Complexity
  • Directional Antennas
  • Efficiency
  • Electrical Engineering
  • Engineering
  • Gain
  • Information Operations
  • Iterations
  • Mathematics
  • Network Topology
  • Networks
  • Simulations
  • Topology
  • Wireless Networks

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Operations Research