{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:11:50Z","timestamp":1794381110574,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540229247","type":"print"},{"value":"9783540278665","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27866-5_124","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T16:20:42Z","timestamp":1284654042000},"page":"933-940","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Cluster Based Distributed Mutual Exclusion Algorithms for Mobile Networks"],"prefix":"10.1007","author":[{"given":"Kayhan","family":"Erciyes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"124_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-540-24767-8_55","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2004","author":"K. Erciyes","year":"2004","unstructured":"Erciyes, K., Marshall, G.: A Cluster-based Hierarchical Routing Protocol for Mobile Networks. In: Lagan\u00e1, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol.\u00a03045, pp. 528\u2013537. Springer, Heidelberg (2004) (to appear)"},{"key":"124_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-540-24767-8_54","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2004","author":"K. Erciyes","year":"2004","unstructured":"Erciyes, K.: Distributed Mutual Exclusion Algorithms on a Ring of Clusters. In: Lagan\u00e1, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol.\u00a03045, pp. 518\u2013527. Springer, Heidelberg (2004) (to appear)"},{"key":"124_CR3","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way Partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing\u00a048, 96\u2013129 (1998)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"124_CR4","doi-asserted-by":"crossref","unstructured":"Kernighan, B., Lin, S.: An Effective Heuristic Procedure for Partitioning graphs. The Bell System Technical Journal, 291\u2013308 (1970)","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"124_CR5","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Lamport, L.: Time, Clocks and the Ordering of Events in a Distributed System. CACM\u00a021, 558\u2013565 (1978)","journal-title":"CACM"},{"issue":"2","key":"124_CR6","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/214438.214445","volume":"3","author":"M. Maekawa","year":"1985","unstructured":"Maekawa, M.: A sqrt(n) Algorithm for Mutual exclusion in Decentralized Systems. ACM Transactions on Computer Systems\u00a03(2), 145\u2013159 (1985)","journal-title":"ACM Transactions on Computer Systems"},{"issue":"1","key":"124_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K. Raymond","year":"1989","unstructured":"Raymond, K.: A Tree-based Algorithm for Distributed Mutual Exclusion. ACM Trans. Comput. Systems\u00a07(1), 61\u201377 (1989)","journal-title":"ACM Trans. Comput. Systems"},{"issue":"1","key":"124_CR8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/358527.358537","volume":"24","author":"G. Ricart","year":"1981","unstructured":"Ricart, G., Agrawala, A.: An Optimal Algorithm for Mutual Exclusion in Computer Networks. CACM\u00a024(1), 9\u201317 (1981)","journal-title":"CACM"},{"issue":"10","key":"124_CR9","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1016\/S0743-7315(02)91847-2","volume":"62","author":"W. Shu","year":"2002","unstructured":"Shu, W.: An Efficient Distributed Token-based Mutual Exclusion Algorithm with a Central Coordinator. Journal of Parallel and Distributed Processing\u00a062(10), 1602\u20131613 (2002)","journal-title":"Journal of Parallel and Distributed Processing"},{"issue":"4","key":"124_CR10","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1145\/6110.214406","volume":"3","author":"I. Susuki","year":"1985","unstructured":"Susuki, I., Kasami, T.: A Distributed Mutual Exclusion Algorithm. ACM Trans. Computer Systems\u00a03(4), 344\u2013349 (1985)","journal-title":"ACM Trans. Computer Systems"},{"issue":"1","key":"124_CR11","first-page":"33","volume":"2","author":"T. Tunali","year":"2000","unstructured":"Tunali, T., Erciyes, K., Soysert, Z.: A Hierarchical Fault-Tolerant Ring Protocol For A Distributed Real-Time System. Parallel and Distributed Computing Practices\u00a02(1), 33\u201344 (2000)","journal-title":"Parallel and Distributed Computing Practices"},{"issue":"6","key":"124_CR12","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1023\/A:1012363200403","volume":"7","author":"J.E. Walter","year":"2001","unstructured":"Walter, J.E., Welch, J.L., Vaidya, N.H.: A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks. Wireless Networks\u00a07(6), 585\u2013600 (2001)","journal-title":"Wireless Networks"},{"key":"124_CR13","unstructured":"Walter, J.E., Cao, G., Mohanty, M.: A K-way Mutual Exclusion Algorithm for Ad Hoc Wireless Networks. In: Proc. of the First Annual workshop on Principles of Mobile Computing POMC 2001 (2001)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2004 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27866-5_124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T08:30:57Z","timestamp":1589877057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27866-5_124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229247","9783540278665"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27866-5_124","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99409","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}