Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy

The common belief is that localized broadcast algorithms are not able to guarantee both full delivery and a good bound on the number of transmissions. In this paper, we propose the first localized broadcast algorithm that guarantees full delivery and a constant approximation ratio to the minimum number of required transmissions in the worst case. The proposed broadcast algorithm is a self-pruning algorithm based on one round of information exchange. Using the proposed algorithm, each node determines its forwarding status in O

• Type: Journal
• Year: 2008
• Where: TC
• Authors: Majid Khabbazian, Vijay K. Bhargava
• Keywords: Algorithm, Constant Approximation Ratio, Information Technology, Maximum Node Degree, TC 2008