92 search results - page 1 / 19 » Compound Constructions of Broadcast Networks |
DAM
1999
13 years 5 months ago
1999
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 b...
EUROCRYPT
2007
Springer
13 years 9 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— One of the wireless mesh network’s important features is each node can support more than one transmission rate. However, few previous literatures on the broadcast tree constr...
IMCSIT
2010
13 years 3 months ago
2010
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
AICCSA
2005
IEEE
13 years 11 months ago
2005
IEEE
We consider the problem of broadcasting messages in a wireless energy-limited network so as to maximize network lifetime. An O(e log e) algorithm to construct a broadcast tree tha...