Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

TC
2008

favoriteEmaildiscussreport

89views Information Technology» more TC 2008»

Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy

13 years 4 months ago

Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy

Download www.ece.ubc.ca

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

Majid Khabbazian, Vijay K. Bhargava

Real-time Traffic

Algorithm | Constant Approximation Ratio | Information Technology | Maximum Node Degree | TC 2008 |

claim paper

Related Content

» Weathering the Storm Managing Redundancy and Security in Ad Hoc Networks

» Adaptive gossip protocols Managing security and redundancy in dense ad hoc networks

» On Reducing Broadcast Transmission Cost and Redundancy in Ad Hoc Wireless Networks Using D...

» On Multihop Broadcast over Adaptively DutyCycled Wireless Sensor Networks

» Efficient broadcast for wireless ad hoc networks with a realistic physical layer

» Topology Control and Geographic Routing in Realistic Wireless Networks

» Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks

» Selfstabilizing byzantine agreement

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2008
Where	TC
Authors	Majid Khabbazian, Vijay K. Bhargava

Comments (0)