{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:44:03Z","timestamp":1725533043936},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024801"},{"type":"electronic","value":"9783642024818"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02481-8_9","type":"book-chapter","created":{"date-parts":[[2009,6,5]],"date-time":"2009-06-05T21:18:06Z","timestamp":1244236686000},"page":"58-66","source":"Crossref","is-referenced-by-count":2,"title":["A Group k-Mutual Exclusion Algorithm for Mobile Ad Hoc Networks"],"prefix":"10.1007","author":[{"given":"Ousmane","family":"Thiare","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Naimi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Walter, J., Welch, J., Vaidya, N.: A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks. In: Dial M for Mobility Workshop, Dallas TX, 15 p. (1998)"},{"key":"9_CR2","unstructured":"Walter, J., Cao, G., Mohanty, M.: A k-Mutual Exclusion Algorithm for Ad Hoc Wireless Networks. In: Proceedings of the first annual Workshop on Principle of Mobile Computing (POMC 2001) (2001)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Malpani, N., Welch, J.L., Vaidya, N.H.: Leader Election Algorithms for Mobile Ad Hoc Networks. In: Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications(PODC 1999), pp. 96\u2013103 (2000)","DOI":"10.1145\/345848.345871"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1006\/jpdc.1995.1025","volume":"25","author":"Y.-C. Tseng","year":"1995","unstructured":"Tseng, Y.-C.: Detecting termination by Weight-Throwing in a Faulty Distributed System. Journal of Parallel and Distributed Computing\u00a025, 7\u201315 (1995)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Joung, Y.-J.: Asynchronous group mutual exclusion (extended abstract). In: 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 51\u201360 (1998)","DOI":"10.1145\/277697.277706"},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/TCOM.1981.1094876","volume":"C-29","author":"E. Gafni","year":"1981","unstructured":"Gafni, E., Bertsekas, D.: Distributed algorithms for generating loop-free in networks with frequently changing topology. IEEE Transactions on Communication\u00a0C-29(1), 11\u201318 (1981)","journal-title":"IEEE Transactions on Communication"},{"key":"9_CR7","unstructured":"Walter, J.E., Kini, S.: Mutual exclusion on multihop wireless networks. Texas A&M Univ., College Station, TX 77843-3112, TR97-014, December 9 (1997)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Bulgannawar, S., Vaidya, N.H.: A distributed k-mutual exclusion algorithm. In: Proc. of the 15 th IEEE International Conference on Distributed Computing Systems, pp. 153\u2013160 (1995)","DOI":"10.1109\/ICDCS.1995.500014"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0020-0190(01)00164-8","volume":"80","author":"Y.-I. Chang","year":"2001","unstructured":"Chang, Y.-I., Chen, B.-H.: A generalized grid quorum strategy for k-mutual exclusion algorithm. Information Processing Letters\u00a080, 205\u2013212 (2001)","journal-title":"Information Processing Letters"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Fisher, M., Lynch, N., Burns, J., Borodin, A.: Ressource allocation with immunity to limited process failure. In: Proc. 20th Annual Symposium on Foundations of Computer Science, pp. 234\u2013254 (1979)","DOI":"10.1109\/SFCS.1979.37"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Hadzilacos, V.: A note on group mutual exclusion. In: Proc. of the 20th ACM SIGACT-SIGOPS Symposium on Principles on Distribued Computing (2001)","DOI":"10.1145\/383962.383997"},{"issue":"2","key":"9_CR12","first-page":"222","volume":"21","author":"C.A.R. Hoare","year":"1997","unstructured":"Hoare, C.A.R.: Communicating sequential processes. CACM\u00a021(2), 222\u2013228 (1997)","journal-title":"CACM"},{"key":"9_CR13","unstructured":"Jiang, J.-R.: A group mutual exclusion algorithm for ad hoc mobile networks. In: Proc. of the 6th International Conference on Computer Science and Informatics, pp. 266\u2013270 (2002)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-45414-4_2","volume-title":"Distributed Computing","author":"Y.-J. Joung","year":"2001","unstructured":"Joung, Y.-J.: Quorum-based algorithms for group mutual exclusion. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, p. 16. Springer, Heidelberg (2001)"},{"issue":"7","key":"9_CR15","doi-asserted-by":"publisher","first-page":"145","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(7), 145\u2013159 (1978)","journal-title":"CACM"},{"key":"9_CR16","unstructured":"Manabe, Y., Aoyagi, S.: A distributed k-mutual exclusion using k-coterie. IEICE Technical Report, 93\u2013143 (1993)"},{"issue":"2","key":"9_CR17","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 Trans. Comput. Syst.\u00a03(2), 145\u2013159 (1985)","journal-title":"ACM Trans. Comput. Syst."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Makki, K., Banta, P., Been, K., Pissinou, N., Park, E.: A token based distributed k mutual exclusion algorithm. In: Proc. of the IEEE Symposium on Parallel and distributed Processing, pp. 408\u2013411 (1992)","DOI":"10.1109\/SPDP.1992.242717"},{"issue":"1","key":"9_CR19","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/358527.358537","volume":"24","author":"G. Ricart","year":"1981","unstructured":"Ricart, G., Agrawala, A.K.: An optimal algorithm for mutual exclusion algorithm in computer networks. CACM\u00a024(1), 9\u201317 (1981)","journal-title":"CACM"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Vidyasankar, K.: A highly concurrent group l-mutual exclusion algorithm. In: Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC 2002) (2002)","DOI":"10.1145\/571842.571846"},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0020-0190(02)00355-1","volume":"85","author":"K. Vidyasankar","year":"2003","unstructured":"Vidyasankar, K.: A simple group mutual l-exclusion algorithm. Information Process Letters\u00a085(2), 79\u201385 (2003)","journal-title":"Information Process Letters"},{"issue":"2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1109\/12.565603","volume":"48","author":"J.-R. Jiang","year":"1997","unstructured":"Jiang, J.-R., Huang, S.-T., Kuo, Y.-C.: Cohorts structures for fault-tolerant k entries to a critical section. IEEE Transactions on Computers\u00a048(2), 222\u2013228 (1997)","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02481-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T14:27:59Z","timestamp":1558362479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02481-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024801","9783642024818"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02481-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}