Energy efficient randomised communication in unknown AdHoc networks

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2007, Pages 250-259

  Berenbrink, Petra ^a   Hu, Zengjian ^a   Cooper, Colin ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Ad hoc networks; Broadcasting; Energy efficiency; Gossiping; Randomized algorithms

Indexed keywords

ALGORITHMS; BROADCASTING; ENERGY EFFICIENCY; ENERGY UTILIZATION; OPTIMAL SYSTEMS;

GOSSIPING ALGORITHM; RANDOM NETWORKS; RANDOMIZED ALGORITHMS;

AD HOC NETWORKS;

EID: 35248850711     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1248377.1248419     Document Type: Conference Paper

References (25)

1. William Aiello, Fan Chung and Linyuan Lu. A random graph model for massive graphs, Proc. 32nd ACM Symposium on Theory of Computing (STOC), Portland, Oregon, USA, pp. 171-180, 2000.
2. Noga, Alon, Amotz Bar-Noy, Nathan Linial and David Peleg. A Lower Bound for Radio Broadcast. Journal of Computer and System Sciences, vol. 43, num. 2, pp. 290-298, 1991.
3. Reuven Bar-Yehuda, Oded Goldreich and Alon Itai. On the Time-Complexity of Broadcast in Multi-hop Radio Networks, An Exponential Gap Between Determinism and Randomization. Journal of Computer and System Sciences vol. 45, num. 1, pp. 104-126, 1992.
4. Reuven Bar-Yehuda and Amos Israeli and Alon Itai. Multiple Communication in Multihop Radio Networks.. SIAM J. Comput., vol. 22, num. 4, pp. 875-887, 1993.
5. Belá Bollobás. The diameter of random graphs. IEEE Transaction on Information Theory, vol. 36, num. 2, pp. 285-288, 1990.
6. Bogdan S. Chlebus, Dariusz R. Kowalski and Mariusz A. Rokicki. Average-Time Complexity of Gossiping in Radio Networks. Proc 13th Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 253-267, 2006.
7. Marek Chrobak, Leszek Gasieniec and Wojciech Rytter. Fast Broadcasting and Gossiping in Radio Networks. Proc. 41st Annual IEEE Symposium on Foundations of Computer Science. (FOCS), Redondo Beach, CA, USA, pp. 575-581, 2000.
8. Marek Chrobak and Leszek Gasieniec and Wojciech Rytter. A Randomized Algorithm for Gossiping in Radio Networks. Proc 7th Annual International Computing and Combinatorics Conference (COCOON), pp. 483-492. 2001.
9. Fan Chung and Linyuan Lu. The diameter of random sparse graphs. Adv. in Appl. Math, vol. 26, num. 4, pp. 257-279, 2001.
10. Andrea E. F. Clementi, Angelo Monti and Riccardo Silvestri. Selective families, superimposed codes, and broadcasting on unknown radio networks. Proc. 12th A CM Symposium on Discrete Algorithms (SODA), Washington, D.C., USA, pp. 709-718, 2001.
11. Artur Czumaj and Wojciech Rytter. Broadcasting Algorithms in Radio Networks with Unknown Topology. Journal of Algorithms, vol. 60, num. 2, pp. 115-143, 2006.
12. Robert Elsässer and Leszek Gasieniec. Radio Communication on random graphs. Proc. 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Las Vagas, NV, USA, pp. 309-315, 2005.
13. R. Elsässer. On the Communication Complexity of Randomized Broadcasting in Random-like Graphs. Proc. 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Cambridge, Massachussetts, USA, pp. 148-157, 2006.
14. Wendi Rabiner Heinzelman, Joanna Kulik and Hari Balakrishnan. Adaptive Protocols for Information Dissemination in Wireless Sensor Networks. Proc. 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM), Seattle, WA, USA, pp. 174-185, 1999.
15. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc and Andrzej Pelc. Power Consumption in Packet Radio Networks (Extended Abstract). Proc. 14th Symposium on Theoretical Aspects of Computer Science (STACS), Hansestadt Lübeck, Germany, pp. 363-374, 1997.
16. Dariusz R. Kowalski and Andrzej Pelc. Deterministic Broadcasting Time in Radio Networks of Unknown Topology. Proc. 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), Vancouver, BC, Canada, pp. 63-72, 2002.
17. Dariusz R. Kowalski and Andrzej Pelc. Broadcasting in undirected ad hoc radio networks. Proc 24th Symposium on Principles of Distributed Computing (PODC), Boston, Massachusetts, USA, pp. 73-82, 2003.
18. Eyal Kushilevitz and Yishay Mansour. An Ω(D log(n/D))) Lower Bound for Broadcast in Radio Networks. SIAM Journal on Computing, vol. 27, num. 3, pp. 702-712, 1998.
19. Ding Liu and Manoj Prabhakaran. On Randomized Broadcasting and Gossiping in Radio Networks. Proc 8th Annual International Computing and Combinatorics Conference (COCOON), Singapore, pp. 340-349, 2002.
20. Linyuan Lu. The diameter of random massive graphs. Proc. 12th ACM Symposium on Discrete Algorithms (SODA), Washington, D.C., USA, pp. 912-921, 2001.
21. Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein and Wei Hong. TAG: A Tiny Aggregation Service for Ad-Hoc Sensor Networks. Proc. 5th Symposium on Operating Systems Design and Implementation (OSDI), Boston, MA, USA, pp. 131-146, 2002.
22. S. Muthu Muthukrishnan and Gopal Pandurangan. The Bin-covering Technique for Thresholding Random Geometric Graph Properties. Proc. 16th ACM-SIAM symposium on Discrete algorithms (SODA), Vancouver, BC, Canada, pp. 989-998, 2005.
23. Rajeev Motwani and Probhakar Rhaghavan. Randomized Algorithms. Cambridge Press, 1995.
24. Michael Mitzenmacher and Eli Upfal. Probability and Computing Cambridge Press, 2005.
25. 1.5) deterministic gossiping algorithm for radio networks, algorithmica, vol. 36, num. 1, pp. 93-96, 2003.