Coloring unstructured radio networks

Distributed Computing

Volumn 21, Issue 4, 2008, Pages 271-284

  Moscibroda, Thomas ^a   Wattenhofer, Roger ^b  

^a MICROSOFT RESEARCH   (United States)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; BOOLEAN FUNCTIONS; COLORING; COMPUTER NETWORKS; ELECTRIC NETWORK TOPOLOGY; FADING (RADIO); GRAPH THEORY; SENSORS; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS); WIRELESS TELECOMMUNICATION SYSTEMS;

BOUNDED INDEPENDENCE; RADIO NETWORKS;

SENSOR NETWORKS;

EID: 51649100433     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-008-0070-4     Document Type: Article

References (30)

1. Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in radio networks: an exponential gap between determinism and randomization. In: Proceedings 6th ACM Symposium on Principles of Distributed Computing (PODC), pp. 98-108 (1987)
2. Busch, C., Magdon-Ismail, M., Sivrikaya, F., Yener, B.: Contention-free MAC protocols for wireless sensor networks. In: Proceedings of the 18th Annual Conference on Distributed Computing (DISC) (2004)
3. Cole R., Vishkin U.: Deterministic coin tossing with applications to optimal parallel list ranking. Inf. Control 70(1), 32-53 (1986)
4. Farach-Colton, M., Fernandes, R., Mosteiro, M.: Bootstrapping a hop-optimal network in the weak sensor model. In: Proceedings of 13th Annual European Symposium on Algorithms (ESA), pp. 827-838 (2005)
5. Gasieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems (Extended Abstract). In: Proceedings of the 19th ACM Symposium on Principles of Distributed Computing (PODC), pp. 113-121 (2000)
6. Goldberg, A., Plotkin, S., Shannon, G.: Parallel symmetry-breaking in sparse graphs. In: Proceedings of the 19th Annual ACM Conference on Theory of Computing (STOC), pp. 315-324 (1987)
7. Goldberg A.V., Plotkin S.A.: Parallel (Δ+1)-coloring of constant-degree graphs. Inf. Process. Lett. 25, 241-245 (1987)
8. Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-efficient communication protocol for wireless microsensor networks. In: Proceedings of the 33rd Hawaii International Conference on System Sciences (HICSS), p. 8020. IEEE Computer Society (2000)
9. Jurdzinski, T., Kutylowski, M., Zatopianski, J.: Energy-efficient size approximation of radio networks with no collision detection. In: Proceedings of the 8th Annual International Conference on Computing and Combinatorics (COCOON), pp. 279-289 (2002)
10. Jurdzinski, T., Kutylowski, M., Zatopianski, J.: Weak communication in radio networks. In: Proceedings of Euro-Par, pp. 397-408 (2002)
11. Jurdzinski, T., Stachowiak, G.: Probabilistic algorithms for the wakeup problem in single-hop radio networks. In: Proceedings of 13th Annual International Symposium on Algorithms and Computation (ISAAC). Lecture Notes in Computer Science, vol. 2518, pp. 535-549 (2002)
12. Krumke S.O., Marathe M.V., Ravi S.S.: Models and approximation algorithms for channel assignment in radio networks. Wirel. Netw. 7(6), 575-584 (2001). doi: 10.1023/A:1012311216333
13. Kuhn, F., Moscibroda, T., Wattenhofer, R.: Initializing newly deployed Ad Hoc and sensor networks. In: Proceedings of 10th Annual International Conference on Mobile Computing and Networking (MOBICOM), pp. 260-274 (2004)
14. Kuhn, F., Moscibroda, T., Wattenhofer, R.: Radio network clustering from scratch. In: Proceedings of 12th Annual European Symposium on Algorithms (ESA), pp. 460-472 (2004)
15. Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the locality of bounded growth. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC) (2005)
16. Linial N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193-201 (1992)
17. Luby M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15, 1036-1053 (1986)
18. McGlynn, M.J., Borbash, S.A.: Birthday protocols for low energy deployment and flexible neighbor discovery in Ad Hoc wireless networks. In: Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking & Computing (MOBIHOC), pp. 137-145. ACM Press (2001)
19. Moscibroda, T., von Rickenbach, P., Wattenhofer, R.: Analyzing the energy-latency trade-off during the deployment of sensor networks. In: Proceedings of the 25th Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) (2006)
20. Moscibroda, T., Wattenhofer, R.: Coloring unstructured radio networks. In: Proceedings of the 17th ACM Symposium on Parallel Algorithms and Architectures (SPAA) (2005)
21. Moscibroda, T., Wattenhofer, R.: Maximal independent sets in radio networks. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC) (2005)
22. Moscibroda, T., Wattenhofer, R., Weber, Y.: Protocol design beyond graph-based models. In: Proceedings of the 5th Workshop on Hot Topics in Networks (HotNets) (2006)
23. Nakano K., Olariu S.: Energy-efficient initialization protocols for single-hop radio networks with no collision detection. IEEE Trans. Parall. Distrib. Syst. 11(8), 851-863 (2000). doi: 10.1109/71.877942
24. Nakano, K., Olariu, S.: Randomized initialization protocols for radio networks. Chapter in Handbook of Wireless Networks and Mobile Computing, pp. 195-218 (2002)
25. Panconesi A., Rizzi R.: Some simple distributed algorithms for sparse networks. Distrib. Comput. 14(2), 97-100 (2001)
26. Peleg, D.: Distributed computing: a locality-sensitive approach. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2000)
27. Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multi-hhop radio networks. In: Conference Proceedings on Communications Architectures & Protocols (SIGCOMM), pp. 211-222. ACM Press (1992). doi: 10.1145/144179.144283
28. Schneider, J., Wattenhofer, R.: A log-star distributed maximal independent set algorithm for growth-bounded graphs. In: 27th ACM Symposium on Principles of Distributed Computing (PODC), Toronto (2008)
29. Tobagi, F.A., Kleinrock, L.: Packet switching in radio channels: part II. The Hidden Terminal Problem in Carrier Sense Multiple Access and the Busy Tone Solution. COM-23(12), pp. 1417-1433 (1975)
30. Woo, A., Culler, D.E.: A transmission control scheme for media access in sensor networks. In: Proceedings of the 7th International Conference on Mobile Computing and Networking (MOBICOM), pp. 221-235. ACM Press (2001). doi: 10.1145/381677.381699