{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:40:34Z","timestamp":1737290434275,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540695066"},{"type":"electronic","value":"9783540695073"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-69507-3_18","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T17:35:58Z","timestamp":1184607358000},"page":"224-234","source":"Crossref","is-referenced-by-count":0,"title":["A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks"],"prefix":"10.1007","author":[{"given":"Orhan","family":"Dagdeviren","sequence":"first","affiliation":[]},{"given":"Kayhan","family":"Erciyes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1007\/978-3-540-27866-5_124","volume-title":"Euro-Par 2004 Parallel Processing","author":"K. Erciyes","year":"2004","unstructured":"Erciyes, K.: Cluster Based Distributed Mutual Exclusion Algorithms for Mobile Networks. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds.) Euro-Par 2004. LNCS, vol.\u00a03149, pp. 933\u2013940. Springer, Heidelberg (2004)"},{"key":"18_CR3","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":"18_CR4","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":"18_CR5","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":"18_CR6","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":"18_CR7","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":"18_CR8","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":"6","key":"18_CR9","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":"18_CR10","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 (2001)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/11751588_71","volume-title":"Computational Science and Its Applications - ICCSA 2006","author":"O. Dagdeviren","year":"2006","unstructured":"Dagdeviren, O., Erciyes, K., Cokuslu, D.: A Merging Clustering Algorithm for Mobile Ad Hoc Networks. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Lagan\u00e1, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol.\u00a03981, pp. 681\u2013690. Springer, Heidelberg (2006)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/11946441_24","volume-title":"Parallel and Distributed Processing and Applications","author":"O. Dagdeviren","year":"2006","unstructured":"Dagdeviren, O., Erciyes, K.: A distributed backbone formation algorithm for mobile ad hoc networks. In: Guo, M., Yang, L.T., Di Martino, B., Zima, H.P., Dongarra, J., Tang, F. (eds.) ISPA 2006. LNCS, vol.\u00a04330, pp. 219\u2013230. Springer, Heidelberg (2006)"},{"key":"18_CR13","volume-title":"Introduction to Graph Theory","author":"D. West","year":"2001","unstructured":"West, D.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Englewood Cliffs (2001)","edition":"2"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Chen, Y.P., Liestman, A.L.: Approximating Minimum Size Weakly-Connected Dominating Sets for Clustering Mobile Ad Hoc Networks. In: Proc. 3rd\u00a0ACM Int. Symp. Mobile Ad Hoc Net. and Comp., pp. 165\u2013172 (2002)","DOI":"10.1145\/513800.513821"},{"key":"18_CR15","volume-title":"Domination in Graphs, Advanced Topics","author":"T.W. Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs, Advanced Topics. Marcel Dekker, New York (1998)"},{"key":"18_CR16","volume-title":"Discrete and Combinatorial Mathematics. An Applied Introduction","author":"R.P. Grimaldi","year":"1999","unstructured":"Grimaldi, R.P.: Discrete and Combinatorial Mathematics. An Applied Introduction. Addison-Wesley Longman, Reading (1999)"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R.G. Gallagher","year":"1983","unstructured":"Gallagher, R.G., Humblet, P.A., Spira, P.M.: A Distributed Algorithm for Minimum-Weight Spanning Trees. ACM Transactions on Programming Languages and Systems\u00a05, 66\u201377 (1983)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Baldoni, R., Virgillito, A., Petrassi, R.: A Distributed Mutual Exclusion Algorithm for Mobile Ad-Hoc Networks. Computers and Communications, pp. 539\u2013544 (2002)","DOI":"10.1109\/ISCC.2002.1021727"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Delmastro, F.: From Pastry to CrossROAD: CROSS-Layer Ring Overlay for Ad Hoc Networks. In: Third IEEE International Conference on Pervasive Computing and Communications Workshops, pp. 60\u201364 (2005)","DOI":"10.1109\/PERCOMW.2005.38"},{"key":"18_CR20","unstructured":"Yang, C.Z.: A Token-Based h-out of-k Distributed Mutual Exclusion Algorithm for Mobile Ad Hoc Networks. In: 3rd\u00a0International Conference on Information Technology, pp. 73\u201377 (2005)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2007: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69507-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:20:26Z","timestamp":1737289226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69507-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540695066","9783540695073"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69507-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}