{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T19:18:31Z","timestamp":1723231111634},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,9,3]],"date-time":"2009-09-03T00:00:00Z","timestamp":1251936000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s11227-009-0325-2","type":"journal-article","created":{"date-parts":[[2009,9,2]],"date-time":"2009-09-02T12:46:43Z","timestamp":1251895603000},"page":"182-195","source":"Crossref","is-referenced-by-count":2,"title":["Distributed fault tolerant computation of weakly connected dominating set in ad hoc networks"],"prefix":"10.1007","volume":"53","author":[{"given":"Zhenyu","family":"Xu","sequence":"first","affiliation":[]},{"given":"James","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Pradip K.","family":"Srimani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,3]]},"reference":[{"key":"325_CR1","doi-asserted-by":"crossref","unstructured":"Estrin D, Govindan R, Heidemann JS, Kumar S (1999) Next century challenges: scalable coordination in sensor networks. In: Mobile computing and networking, pp\u00a0263\u2013270","DOI":"10.1145\/313451.313556"},{"key":"325_CR2","volume-title":"Distributed computing: fundamentals, simulations and advanced topics","author":"H Attiya","year":"1998","unstructured":"Attiya H, Welch J (1998) Distributed computing: fundamentals, simulations and advanced topics. McGraw-Hill, New York"},{"key":"325_CR3","volume-title":"Fundamentals of domination in graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker, New York"},{"key":"325_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02278851","volume":"7","author":"S Dolev","year":"1993","unstructured":"Dolev S, Israeli A, Moran S (1993) Self-stabilization of dynamic systems assuming only read\/write atomicity. Distrib Comput 7:3\u201316","journal-title":"Distrib Comput"},{"issue":"3","key":"325_CR5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(91)90111-T","volume":"39","author":"NS Chen","year":"1991","unstructured":"Chen NS, Yu HP, Huang ST (1991) A self-stabilizing algorithm for constructing spanning trees. Inf Process Lett 39(3):147\u2013151","journal-title":"Inf Process Lett"},{"issue":"23","key":"325_CR6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1142\/S0129626492000295","volume":"2","author":"S Sur","year":"1992","unstructured":"Sur S, Srimani PK (1992) A self-stabilizing distributed algorithm to construct BFS spanning trees of a symmetric graph. Parallel Process Lett 2(23):171\u2013179","journal-title":"Parallel Process Lett"},{"issue":"9","key":"325_CR7","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1109\/12.312126","volume":"43","author":"A Arora","year":"1994","unstructured":"Arora A, Gouda M (1994) Distributed reset. IEEE Trans Comput 43(9):1026\u20131038","journal-title":"IEEE Trans Comput"},{"issue":"4","key":"325_CR8","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha S, Khuller S (1998) Approximation algorithms for connected domination sets. Algorithmica 20(4):374\u2013387","journal-title":"Algorithmica"},{"key":"325_CR9","unstructured":"Wan P-J, Alzoubi K, Frieder O (2002) Distributed construction of connected dominating set in wireless ad hoc networks. In: Proceedings of IEEE INFOCOM, vol\u00a03, June 2002, pp\u00a01597\u20131604"},{"issue":"10","key":"325_CR10","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1109\/TPDS.2004.48","volume":"15","author":"F Dai","year":"2004","unstructured":"Dai F, Wu J (2004) An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Trans Parallel Distrib Syst 15(10):908\u2013920","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"325_CR11","unstructured":"Frieder O, Alzoubi KM, Wan P-J (2003) Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks. In: 23rd IEEE international conference on distributed computing systems (ICDCS\u201903), 2003, p\u00a096"},{"key":"325_CR12","unstructured":"Dubhashi D, Mei A, Panconesi A, Radhakrishnan J, Srinivasan A (2003) Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. In: Proc 14th annual ACM-SIAM symp on discrete algorithms, 2003, pp\u00a0717\u2013724"},{"key":"325_CR13","doi-asserted-by":"crossref","unstructured":"Turau V (2007) Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler. Inf Process Lett, 88\u201393","DOI":"10.1016\/j.ipl.2007.02.013"},{"key":"325_CR14","first-page":"67","volume":"33","author":"V Swaminathan","year":"2009","unstructured":"Swaminathan V (2009) Weakly connected domination in graphs. Discrete Math 33:67\u201373","journal-title":"Discrete Math"},{"key":"325_CR15","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/j.jpdc.2007.03.001","volume":"67","author":"B Han","year":"2007","unstructured":"Han B, Jia W (2007) Clustering wireless ad hoc networks with weakly connected dominating set. J\u00a0Parallel Distrib Comput 67:727\u2013737","journal-title":"J\u00a0Parallel Distrib Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-009-0325-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-009-0325-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-009-0325-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:23:59Z","timestamp":1559384639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-009-0325-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["325"],"URL":"https:\/\/doi.org\/10.1007\/s11227-009-0325-2","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,3]]}}}