Compound Constructions of Broadcast Networks

13 years 10 months ago

Download www.cs.auckland.ac.nz

Compound methods have been shown to be very e ective in the construction of broadcast graphs. Compound methods generate a large broadcast graph by combining multiple copies of a broadcast graph G using the structure of another broadcast graph H. Node deletion is also allowed in some of these methods. The subset of connecting nodes of G has been de

Michael J. Dinneen, Jose A. Ventura, Mark C. Wilso

Real-time Traffic

Broadcast Graph | Center Nodes | Compound Method | DAM 1999 |

claim paper

» A Fast Broadcast Tree Construction in MultiRate Wireless Mesh Networks

» Fast Construction of Broadcast Scheduling and Gossiping in Dynamic Ad Hoc Networks

» Maximum lifetime broadcasting in wireless networks

» On the Construction of EnergyEfficient Broadcast and Multicast Trees in Wireless Networks

» Constructing minimumenergy broadcast trees in wireless ad hoc networks

» Optimal Coding Strategies for Bidirectional Broadcast Channels Under Channel Uncertainty

» MultipleInput MultipleOutput Gaussian Broadcast Channels With Common and Confidential Mess...

» Algebraic Constructions of Efficient Broadcast Networks

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	DAM
Authors	Michael J. Dinneen, Jose A. Ventura, Mark C. Wilson, Golbon Zakeri

Comments (0)

Sciweavers

Compound Constructions of Broadcast Networks

Broadcast Graph | Center Nodes | Compound Method | DAM 1999 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers