{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:11:42Z","timestamp":1725570702464},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176524"},{"type":"electronic","value":"9783642176531"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17653-1_6","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T05:50:47Z","timestamp":1291614647000},"page":"79-82","source":"Crossref","is-referenced-by-count":5,"title":["Self-stabilizing (k,r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Larsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippas","family":"Tsigas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1007\/978-3-642-03869-3_57","volume-title":"Euro-Par 2009","author":"E. Caron","year":"2009","unstructured":"Caron, E., Datta, A.K., Depardon, B., Larmore, L.L.: A self-stabilizing k-clustering algorithm using an arbitrary metric. In: Sips, H., Epema, D., Lin, H.-X. (eds.) Euro-Par 2009. LNCS, vol.\u00a05704, pp. 602\u2013614. Springer, Heidelberg (2009)"},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/978-1-4613-0223-0","volume-title":"Clustering Algorithms for Ad Hoc Wireless Networks","author":"Y.P. Chen","year":"2004","unstructured":"Chen, Y.P., Liestman, A.L., Liu, J.: Clustering Algorithms for Ad Hoc Wireless Networks, vol.\u00a02, ch. 7, pp. 154\u2013164. Nova Science Publishers, Bombay (2004)"},{"key":"6_CR3","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S. Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. MIT Press, Cambridge (March 2000)"},{"issue":"6-7","key":"6_CR4","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.tcs.2008.10.006","volume":"410","author":"S. Dolev","year":"2009","unstructured":"Dolev, S., Tzachar, N.: Empire of colonies: Self-stabilizing and self-organizing distributed algorithm. Theoretical Computer Science\u00a0410(6-7), 514\u2013532 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"6-7","key":"6_CR5","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.tcs.2008.10.009","volume":"410","author":"C. Johnen","year":"2009","unstructured":"Johnen, C., Nguyen, L.H.: Robust self-stabilizing weight-based clustering algorithm. Theoretical Computer Science\u00a0410(6-7), 581\u2013594 (2009)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Larsson, A., Philippas, T.: Self-stabilizing (k, r)-clustering in wireless ad-hoc networks with multiple paths. Technical report, Chalmers University of Technology (2010)","key":"6_CR6","DOI":"10.1007\/978-3-642-17653-1_6"},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/j.adhoc.2006.01.005","volume":"5","author":"M.A. Spohn","year":"2007","unstructured":"Spohn, M.A., Garcia-Luna-Aceves, J.J.: Bounded-distance multi-clusterhead formation in wireless ad hoc networks. Ad Hoc Networks\u00a05(4), 504\u2013530 (2007)","journal-title":"Ad Hoc Networks"},{"doi-asserted-by":"crossref","unstructured":"Sun, K., Peng, P., Ning, P., Wang, C.: Secure distributed cluster formation in wireless sensor networks. In: ACSAC 2006, Washington, DC, USA, pp. 131\u2013140. IEEE Computer Society, Los Alamitos (2006)","key":"6_CR8","DOI":"10.1109\/ACSAC.2006.46"},{"key":"6_CR9","first-page":"83","volume-title":"MobiHoc 2008","author":"Y. Wu","year":"2008","unstructured":"Wu, Y., Li, Y.: Construction algorithms for k-connected m-dominating sets in wireless sensor networks. In: MobiHoc 2008, pp. 83\u201390. ACM, New York (2008)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17653-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T20:51:46Z","timestamp":1559854306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17653-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176524","9783642176531"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17653-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}