Coloring unstructured radio networks

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2005, Pages 39-48

  Moscibroda, Thomas ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Ad hoc networks; Asynchronous wake up; Coloring; Initialization; Radio network; Sensor networks

Indexed keywords

ALGORITHMS; SENSORS; TELECOMMUNICATION NETWORKS; TOPOLOGY;

AD HOC NETWORKS; RADIO NETWORKS; SENSOR NETWORKS;

RADIO COMMUNICATION;

EID: 32144462470     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073970.1073977     Document Type: Conference Paper

References (28)

1. I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. Wireless Sensor Networks: A Survey. Computer Networks Journal, 38(4):393-422, 2002.
2. th ACM Symposium on Principles of Distributed Computing (PODC), pages 98-108, 1987.
3. R. Cole and U. Vishkin. Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking. Inf. Control, 70(1):32-53, 1986.
4. th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 606-615, 2002.
5. th ACM Symposium on Principles of Distributed Computing (PODC), pages 113-121, 2000.
6. th Annual ACM Conference on Theory of Computing (STOC), pages 315-324, 1987.
7. A. V. Goldberg and S. A. Plotkin. Parallel (Δ + 1)-Coloring of Constant-degree Graphs. Information Processing Letters, 25:241-245, 1987.
8. th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 473-480. Society for Industrial and Applied Mathematics, 1998.
9. rd Hawaii International Conference on System Sciences (HICSS), page 8020. IEEE Computer Society, 2000.
10. th Annual International Conference on Computing and Combinatorics (COCOON), pages 279-289, 2002.
11. T. Jurdzinski, M. Kutylowski, and J. Zatopianski. Weak Communication in Radio Networks. In Proceedings of Euro-Par, pages 397-408, 2002.
12. th Annual International Symposium on Algorithms and Computation (ISAAC), pages 535-549, 2002.
13. S. O. Krumke, M. V. Marathe, and S. S. Ravi. Models and Approximation Algorithms for Channel Assignment in Radio Networks. Wireless Networks, 7(6):575-584, 2001.
14. th Annual European Symposium on Algorithms (ESA), pages 460-472.
15. th Annual International Conference on Mobile Computing and Networking (MOBICOM), pages 260-274, 2004.
16. N. Linial. Locality in Distributed Graph Algorithms. SIAM Journal on Computing, 21(1):193-201, 1992.
17. M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi, and D. J. Rosenkrantz. Simple Heuristics for Unit Disk Graphs. Networks, 25:59-68, 1995.
18. th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 630-635, 2001.
19. nd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), pages 137-145. ACM Press, 2001.
20. st IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS), 2004.
21. rd ACM Symp. on Principles of Distributed Computing (PODC), 2005.
22. K. Nakano and S. Olariu. Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection. IEEE Trans. Parallel Distributed Systems, 11(8):851-863, 2000.
23. K. Nakano and S. Olariu. Randomized Initialization Protocols for Radio Networks, pages 195-218, 2002.
24. A. Panconesi and R. Rizzi. Some Simple Distributed Algorithms for Sparse Networks. Distributed Computing, 14(2):97-100, 2001.
25. D. Peleg. Distributed Computing; A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications, 2000.
26. S. Ramanathan and E. L. Lloyd. Scheduling Algorithms for Multi-Hop Radio Networks. In Conference proceedings on Communications architectures & protocols (SIGCOMM), pages 211-222. ACM Press, 1992.
27. F. A. Tobagi and L. Kleinrock. Packet Switching in Radio Channels: Part II - The Hidden Terminal Problem in Carrier Sense Multiple Access and the Busy Tone Solution. COM-23(12):1417-1433, 1975.
28. th International Conference on Mobile Computing and Networking (MOBICOM), pages 221-235. ACM Press, 2001.