By Topic

A novel power-efficient broadcast routing algorithm exploiting broadcast efficiency

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Intae Kang ; Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA ; R. Poovendran

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, we present yet another novel power-efficient algorithm for broadcast routing tree construction called greedy perimeter broadcast efficiency (GPBE) algorithm. We also compare the performance of these algorithms.

Published in:

Vehicular Technology Conference, 2003. VTC 2003-Fall. 2003 IEEE 58th  (Volume:5 )

Date of Conference:

6-9 Oct. 2003