Deploying wireless networks with beeps

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6343 LNCS, Issue , 2010, Pages 148-162

  Cornejo, Alejandro ^a   Kuhn, Fabian ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF LUGANO   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICALLY OPTIMAL; CARRIER SENSING; COMMUNICATION MODELS; COMPLEX PROBLEMS; CONSTANT DEGREE GRAPHS; CONTINUOUS MODELS; DISCRETE MODELS; DYNAMIC NETWORK; GLOBAL STRUCTURE; HIGH PROBABILITY; INTERVAL COLORING; LAS VEGAS ALGORITHMS; LIMITED COMMUNICATION; LOWER BOUNDS; NEIGHBORING NODES; RADIO NETWORKS; RANDOMIZED ALGORITHMS; SYNCHRONIZED CLOCKS; TIME ALGORITHMS; VERTEX COLORING;

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION THEORY;

COLORING;

EID: 78649891058     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15763-9_15     Document Type: Conference Paper

References (27)

1. Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.A.: Network decomposition and locality in distributed computation. In: Proc. of 30th Symposium on Foundations of Computer Science (FOCS), pp. 364-369 (1989)
2. Balasundaram, B., Butenko, S.: Graph domination, coloring and cliques in telecommunications. In: Resende, M.G.C., Pardalos, P.M. (eds.) Handbook of Optimization in Telecommunications, pp. 865-890. Springer, Heidelberg (2006)
3. Barenboim, L., Elkin, M.: Distributed (Δ + 1)-coloring in linear (in Δ) time. In: Proc. of the 41st ACM Symposium on Theory of Computing, STOC (2009)
4. Barenboim, L., Elkin, M.: Deterministic distributed vertex coloring in polylogarithmic time. In: Proc. 29th ACM Symposium on Principles of Distributed Computing, PODC (2010)
5. Degesys, J., Nagpal, R.: Towards desynchronization of multi-hop topologies. In: Proc. 2nd IEEE Conference Self-Adaptive and Self-Organizing Systems (SASO), pp. 129-138 (2008)
6. Degesys, J., Rose, I., Patel, A., Nagpal, R.: Desync: self-organizing desynchronization and TDMA on wireless sensor networks. In: Proc. 6th Conference on Information Processing in Sensor Networks (IPSN), p. 20 (2007)
7. Flury, R., Wattenhofer, R.: Slotted programming for sensor networks. In: Proc. 9th Conference on Information Processing in Sensor Networks, IPSN (2010)
8. Gandham, S., Dawande, M., Prakash, R.: Link scheduling in sensor networks: Distributed edge coloring revisited. In: Proc. of 24th IEEE Conference on Computer Communications (INFOCOM), pp. 2492-2501 (2005)
9. Goldberg, A.V., Plotkin, S.A., Shannon, G.E.: Parallel symmetry-breaking in sparse graphs. SIAM Journal on Discrete Mathematics 1(4), 434-446 (1988)
10. Herman, T., Tixeuil, S.: A distributed TDMA slot assignment algorithm for wireless sensor networks. In: Proc. of 1st Int. Workshop on Algorithmic Aspects of Wireless Sensor Networks, pp. 45-58 (2004)
11. Kothapalli, K., Onus, M., Scheideler, C., Schindelhauer, C.: Distributed coloring in o(√log n) bit rounds. In: Proc. of 20th IEEE Parallel and Distributed Processing Symposium, IPDPS (2006)
12. Kuhn, F.: Local multicoloring algorithms: Computing a nearly-optimal TDMA schedule in constant time. In: Proc. of 26th Symp. on Theoretical Aspects of Computer Science, STACS (2009)
13. Kuhn, F.: Weak Graph Coloring: Distributed Algorithms and Applications. In: Proc. of 21st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA (2009)
14. Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing, 193-201 (1992)
15. Mecke, S.: MAC layer and coloring. In: Wagner, D., Wattenhofer, R. (eds.) Algorithms for Sensor and Ad Hoc Networks, pp. 63-80 (2007)
16. Moscibroda, T., Wattenhofer, R.: Coloring unstructured radio networks. In: Proc. 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 39-48 (2005)
17. Motskin, A., Roughgarden, T., Skraba, P., Guibas, L.: Lightweight coloring and desynchronization for networks. In: Proc. 28th IEEE Conference on Computer Communications, INFOCOM (2009)
18. Panconesi, A., Srinivasan, A.: On the complexity of distributed network decomposition. Journal of Algorithms 20(2), 581-592 (1995)
19. Ramanathan, S.: A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks 5, 81-94 (1999)
20. Rhee, I., Warrier, A., Min, J., Xu, L.: DRAND: Distributed randomized TDMA scheduling for wireless ad-hoc networks. In: 7th ACM Symp. on Mobile Ad Hoc Networking and Computing (MOBIHOC), pp. 190-201 (2006)
21. Scheideler, C., Richa, A., Santi, P.: An o(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model. In: Proc. 9th ACM Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), pp. 91-100 (2008)
22. Schmid, S., Wattenhofer, R.: Algorithmic models for sensor networks. In: Proc. 14th Workshop on Parallel and Distributed Real-Time Systems, WPDRTS (2006)
23. Schneider, J., Wattenhofer, R.: A log-star distributed maximal independent set algorithm for growth-bounded graphs. In: Proc. of 27th ACM Symposium on Principles of Distributed Computing, PODC (2008)
24. Schneider, J., Wattenhofer, R.: Coloring unstructured wireless multi-hop networks. In: Proc. 28th ACMSymposium on Principles of Distributed Computing (PODC), pp. 210-219 (2009)
25. Schneider, J.,Wattenhofer, R.: A new technique for distributed symmetry breaking. In: Proc. 29th ACM Symposium on Principles of Distributed Computing, PODC (2010)
26. USC/ISI. Network Simulator 2 (NS2), http://www.isi.edu/nsnam/ns/
27. Zhang, X., Hong, J., Zhang, L., Shan, X., Li, V.O.K.: CP-TDMA: Coloring- and probabilitybased TDMA scheduling for wireless ad hoc networks. IEICE Transactions on Communication E91-B(1), 322-326 (2008)