Tradeoffs between knowledge and time of communication in geometric radio networks

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2001, Pages 59-66

  Dessmark, A ^a   Pelc, A ^a  

^a LUND INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Broadcasting; Deterministic; Distributed; Knowledge; Radio network

Indexed keywords

ALGORITHMS; GRAPH THEORY; RADIO SYSTEMS; RADIO TRANSMITTERS; TELECOMMUNICATION NETWORKS;

GEOMETRIC RADIO NETWORKS (GRN);

RADIO BROADCASTING;

EID: 0034818769     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/378580.378590     Document Type: Conference Paper

References (21)

1. A lower bound for radio broadcast
2. A tradeoff between information and communication in broadcast protocols
3. On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomization
4. Lower bounds for the broadcast problem in mobile radio networks
5. On broadcasting in radio networks - Problem analysis and protocol design
6. Tree based broadcasting in multihop radio networks
7. Deterministic broadcasting in unknown radio networks
8. Deterministic radio broadcasting
9. Fast broadcasting and gossiping in radio networks
10. Faster broadcasting in unknown radio networks
11. The impact of knowledge on broadcasting time in radio networks
12. Methods and problems of communication in usual networks
13. Broadcast in radio networks
14. A perspective on multiaccess channels
15. A survey of gossiping and broadcasting in communication networks
16. Dissemination of information in interconnection networks (broadcasting and gossiping)
17. Fault-tolerant broadcasting in radio networks
18. An Ω(D log(N/D)) lower bound for broadcast in radio networks
19. Broadcasting on [0, L]
20. A new model for scheduling packet radio networks