General Algorithms for Construction of Broadcast and Multicast Trees with Applications to Wireless Networks

In this paper, we introduce algorithms for constructing broadcasting and multicasting trees. These algorithms are general because they may be used for tree cost functions that are of arbitrary form. Thus, essentially the same algorithmic procedures are used for different tree cost functions. We eval...

Full description

Saved in:
Bibliographic Details
Published inJournal of communications and networks Vol. 7; no. 3; pp. 263 - 277
Main Author Nguyen Gam D
Format Journal Article
LanguageKorean
Published 한국통신학회 01.09.2005
Subjects
Online AccessGet full text
ISSN1229-2370
1976-5541

Cover

More Information
Summary:In this paper, we introduce algorithms for constructing broadcasting and multicasting trees. These algorithms are general because they may be used for tree cost functions that are of arbitrary form. Thus, essentially the same algorithmic procedures are used for different tree cost functions. We evaluate the effectiveness of the general algorithms by applying them to different cost functions that are often used to model wired and wireless net­works. Besides providing a unifying framework for dealing with many present and future tree-construction applications, these algorithms typically outperform some existing algorithms that are specifically designed for energy-aware wireless networks. These general algorithms perform well at the expense of higher computational complexity. They are centralized algorithms, requiring the full network information for tree construction. Thus, we also present variations of these general algorithms to yield other algorithms that have lower complexity and distributed implementation.
Bibliography:KISTI1.1003/JNL.JAKO200504840805945
G704-000784.2005.7.3.003
ISSN:1229-2370
1976-5541