{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:04:48Z","timestamp":1776888288493,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642157622","type":"print"},{"value":"9783642157639","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15763-9_15","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T05:48:44Z","timestamp":1282628924000},"page":"148-162","source":"Crossref","is-referenced-by-count":58,"title":["Deploying Wireless Networks with Beeps"],"prefix":"10.1007","author":[{"given":"Alejandro","family":"Cornejo","sequence":"first","affiliation":[]},{"given":"Fabian","family":"Kuhn","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"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\u2013369 (1989)","DOI":"10.1109\/SFCS.1989.63504"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/978-0-387-30165-5_30","volume-title":"Handbook of Optimization in Telecommunications","author":"B. Balasundaram","year":"2006","unstructured":"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\u2013890. Springer, Heidelberg (2006)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M.: Distributed (\u0394\u2009+\u20091)-coloring in linear (in \u0394) time. In: Proc. of the 41st ACM Symposium on Theory of Computing, STOC (2009)","DOI":"10.1145\/1536414.1536432"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M.: Deterministic distributed vertex coloring in polylogarithmic time. In: Proc. 29th ACM Symposium on Principles of Distributed Computing, PODC (2010)","DOI":"10.1145\/1835698.1835797"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Degesys, J., Nagpal, R.: Towards desynchronization of multi-hop topologies. In: Proc. 2nd IEEE Conference Self-Adaptive and Self-Organizing Systems (SASO), pp. 129\u2013138 (2008)","DOI":"10.1109\/SASO.2008.70"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1236360.1236363"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Flury, R., Wattenhofer, R.: Slotted programming for sensor networks. In: Proc. 9th Conference on Information Processing in Sensor Networks, IPSN (2010)","DOI":"10.1145\/1791212.1791216"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"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\u20132501 (2005)","DOI":"10.1109\/INFCOM.2005.1498534"},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1137\/0401044","volume":"1","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Plotkin, S.A., Shannon, G.E.: Parallel symmetry-breaking in sparse graphs. SIAM Journal on Discrete Mathematics\u00a01(4), 434\u2013446 (1988)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-3-540-27820-7_6","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"T. Herman","year":"2004","unstructured":"Herman, T., Tixeuil, S.: A distributed TDMA slot assignment algorithm for wireless sensor networks. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2004. LNCS, vol.\u00a03121, pp. 45\u201358. Springer, Heidelberg (2004)"},{"key":"15_CR11","unstructured":"Kothapalli, K., Onus, M., Scheideler, C., Schindelhauer, C.: Distributed coloring in $o(\\sqrt{\\log n})$ bit rounds. In: Proc. of 20th IEEE Parallel and Distributed Processing Symposium, IPDPS (2006)"},{"key":"15_CR12","unstructured":"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)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Kuhn, F.: Weak Graph Coloring: Distributed Algorithms and Applications. In: Proc. of 21st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA (2009b)","DOI":"10.1145\/1583991.1584032"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing, 193\u2013201 (1992)","DOI":"10.1137\/0221015"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Mecke, S.: MAC layer and coloring. In: Wagner, D., Wattenhofer, R. (eds.) Algorithms for Sensor and Ad Hoc Networks, pp. 63\u201380 (2007)","DOI":"10.1007\/978-3-540-74991-2_4"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: Coloring unstructured radio networks. In: Proc. 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 39\u201348 (2005)","DOI":"10.1145\/1073970.1073977"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Motskin, A., Roughgarden, T., Skraba, P., Guibas, L.: Lightweight coloring and desynchronization for networks. In: Proc. 28th IEEE Conference on Computer Communications, INFOCOM (2009)","DOI":"10.1109\/INFCOM.2009.5062165"},{"issue":"2","key":"15_CR18","first-page":"581","volume":"20","author":"A. Panconesi","year":"1995","unstructured":"Panconesi, A., Srinivasan, A.: On the complexity of distributed network decomposition. Journal of Algorithms\u00a020(2), 581\u2013592 (1995)","journal-title":"Journal of Algorithms"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/A:1019126406181","volume":"5","author":"S. Ramanathan","year":"1999","unstructured":"Ramanathan, S.: A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks\u00a05, 81\u201394 (1999)","journal-title":"Wireless Networks"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"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\u2013201 (2006)","DOI":"10.1145\/1132905.1132927"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"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\u2013100 (2008)","DOI":"10.1145\/1374618.1374632"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Schmid, S., Wattenhofer, R.: Algorithmic models for sensor networks. In: Proc. 14th Workshop on Parallel and Distributed Real-Time Systems, WPDRTS (2006)","DOI":"10.1109\/IPDPS.2006.1639417"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1400751.1400758"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Schneider, J., Wattenhofer, R.: Coloring unstructured wireless multi-hop networks. In: Proc. 28th ACM Symposium on Principles of Distributed Computing (PODC), pp. 210\u2013219 (2009)","DOI":"10.1145\/1582716.1582751"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Schneider, J., Wattenhofer, R.: A new technique for distributed symmetry breaking. In: Proc. 29th ACM Symposium on Principles of Distributed Computing, PODC (2010)","DOI":"10.1145\/1835698.1835760"},{"key":"15_CR26","unstructured":"USC\/ISI. Network Simulator 2 (NS2), http:\/\/www.isi.edu\/nsnam\/ns\/"},{"issue":"1","key":"15_CR27","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1093\/ietcom\/e91-b.1.322","volume":"E91-B","author":"X. Zhang","year":"2008","unstructured":"Zhang, X., Hong, J., Zhang, L., Shan, X., Li, V.O.K.: CP-TDMA: Coloring- and probability-based TDMA scheduling for wireless ad hoc networks. IEICE Transactions on Communication\u00a0E91-B(1), 322\u2013326 (2008)","journal-title":"IEICE Transactions on Communication"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15763-9_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:39:41Z","timestamp":1606167581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15763-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157622","9783642157639"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15763-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}