Distributed multi-broadcast in unknown radio networks

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2001, Pages 255-263

  Clementi, A E F ^a   Monti, A ^a   Silvestri, R ^a  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK PROTOCOLS; PROBABILITY DISTRIBUTIONS; RADIO BROADCASTING; RADIO RECEIVERS; RADIO TRANSMITTERS; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

DETERMINISTIC DISTRIBUTED PROTOCOLS; DISTRIBUTED MULTIBROADCAST; MULTIHOP SYNCHRONOUS RADIO NETWORKS; RADIO NETWORKS; RANDOMIZED DISTRIBUTED PROTOCOLS;

RADIO STATIONS;

EID: 0034776380     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/383962.384040     Document Type: Conference Paper

References (21)

1. A lower bound for radio broadcast
2. On the time-complexity of broadcast operations in multi-hop radio networks: An exponential gap between determinism and randomization
3. Multiple communication in multi-hop radio networks
4. Lower bounds for the broadcast problem in mobile radio networks
5. Deterministic restriction on circuit complexity
6. Deterministic broadcasting in unknown radio networks
7. Deterministic radio broadcasting
8. Fast broadcasting and gossiping in radio networks
9. Selective families, superimposed codes, and broadcasting in unknown radio networks
10. 3 n)-time
11. A survey of superimposed code theory
12. Families of finite sets in which no set is covered by the union of r others
13. A note on counting very different sequences
14. A perspective on multiaccess channels
15. Non-adaptive hypergeometric group testing
16. Deterministic superimposed coding with application to pattern matching
17. Nonrandom binary superimposed codes
18. An Ω(D log(n/D)) lower bound for broadcast in radio networks
19. Aloha packet system with and without slots and capture
20. Deterministic sampling - A new technique for fast pattern matching