{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:22Z","timestamp":1759638022822,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540499909"},{"type":"electronic","value":"9783540499916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11945529_30","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T12:18:52Z","timestamp":1164629932000},"page":"425-439","source":"Crossref","is-referenced-by-count":10,"title":["Self-stabilizing Wireless Connected Overlays"],"prefix":"10.1007","author":[{"given":"Vadim","family":"Drabkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roy","family":"Friedman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Gradinariu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Alzoubi, K., Peng-Jun, W., Frieder, O.: Weakly connected dominating sets and sparse spanners in wireless adhoc networks. In: ICDCS 2003 Proceedings of the 23rd International Conference on Distributed Computing Systems, pp. 96\u2013104 (2003)","key":"30_CR1","DOI":"10.1109\/ICDCS.2003.1203456"},{"doi-asserted-by":"crossref","unstructured":"Ankur, J., Gupta, A.: A distributed self-stabilizing algorithm for finding a connected dominating set in a graph. In: PDCAT 2005 (2005)","key":"30_CR2","DOI":"10.1109\/PDCAT.2005.10"},{"unstructured":"Dai, F., Wu, J.: Distributed dominant pruning in ad hoc networks. In: Proceedings of ICC 2003 (2003)","key":"30_CR3"},{"doi-asserted-by":"crossref","unstructured":"Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: ICC (1), pp. 376\u2013380 (1997)","key":"30_CR4","DOI":"10.1109\/ICC.1997.605303"},{"doi-asserted-by":"crossref","unstructured":"Das, B., Sivakumar, R., Bharghavan, V.: Routing in ad hoc networks using a spine. In: ICCCN, pp. 34\u201341 (1997)","key":"30_CR5","DOI":"10.1109\/ICCCN.1997.623288"},{"unstructured":"Datta, A.K., Gradinariu, M., Linga, P., Raipan-Parv\u00e9de, P.: Self-stabilizing query covers in sensor networks. In: SRDS (2005)","key":"30_CR6"},{"unstructured":"Datta, A.K., Gradinariu, M., Patel, R.: Optimal self* query region covers in sensor networks. In: ISPAN (2005)","key":"30_CR7"},{"unstructured":"Datta, A.K., Gradinariu, M., Patel, R.: Dominating-sets based self-stabilizing minimum query covers in sensor networks. Technical Report 1803, IRISA\/Universite Rennes 1 (2006)","key":"30_CR8"},{"issue":"11","key":"30_CR9","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self stabilizing systems in spite of distributed control. Communications of the Association of the Computing Machinery\u00a017(11), 643\u2013644 (1974)","journal-title":"Communications of the Association of the Computing Machinery"},{"key":"30_CR10","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 (2000)"},{"doi-asserted-by":"crossref","unstructured":"Drabkin, V., Friedman, R., Gradinariu, M.: Self-stabilizing wireless connected overlay. Technical report, LIP6, Universite Paris 6 (2006)","key":"30_CR11","DOI":"10.1007\/11945529_30"},{"doi-asserted-by":"crossref","unstructured":"Friedman, R., Gradinariu, M., Simon, G.: Locating cache proxies in manets. In: MobiHoc 2004 Proceedings of the Thifth ACM International Symposium on Mobile Ad Hoc Networking and Computing (2004)","key":"30_CR12","DOI":"10.1145\/989459.989482"},{"issue":"9","key":"30_CR13","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/32.92911","volume":"17","author":"M.G. Gouda","year":"1991","unstructured":"Gouda, M.G., Herman, T.: Adaptive programming. IEEE Trans. Software Eng.\u00a017(9), 911\u2013921 (1991)","journal-title":"IEEE Trans. Software Eng."},{"unstructured":"Gradinariu, M., Tixeuil, S.: Self-stabilizing vertex coloring of arbitrary graphs. In: Proceedings of OPODIS 2000, STUDIA INFORMATICA, pp. 55\u201370 (2000)","key":"30_CR14"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-27820-7_6","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"T. Herman","year":"2004","unstructured":"Herman, T., Tixeuil, S.: A distributed TDMA slot assignment algorithm for wireless sensor networks. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2004. LNCS, vol.\u00a03121, pp. 45\u201358. Springer, Heidelberg (2004)"},{"unstructured":"Ingelrest, F., Simplot-Ryl, D., Stojmenovic, I.: Smaller connected dominating sets in ad hoc and sensor networks based on coverage by two-hop neighbors. Technical report, Institut National De Recherche En Informatique Et En Automatique (April 2005)","key":"30_CR16"},{"doi-asserted-by":"crossref","unstructured":"Kakugawa, H., Masuzawa, T.: A self-stabilizing minimal dominating set algorithm with safe convergence. In: IEEE Parallel and Distributed Processing Synmposium (IPDPS 2006) (2006)","key":"30_CR17","DOI":"10.1109\/IPDPS.2006.1639550"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-540-30566-8_41","volume-title":"Parallel and Distributed Processing and Applications","author":"H. Liu","year":"2004","unstructured":"Liu, H., Pan, Y., Cao, J.: An improved distributed algorithm for connected dominating sets in wireless ad hoc networks. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds.) ISPA 2004. LNCS, vol.\u00a03358, pp. 340\u2013351. Springer, Heidelberg (2004)"},{"unstructured":"Peng-Jun, W., Alzoubi, K., Frieder, O.: Distributed construction of connected dominating sets in wireless adhoc networks. In: INFOCOM 2002 Proceedings of the Conference on Computer Communications (2002)","key":"30_CR19"},{"doi-asserted-by":"crossref","unstructured":"Theoleyre, F., Valois, F.: About the self-stabilization of a virtual topology for self-organization in ad hoc networks. In: Self-Stabilizing Systems, pp. 214\u2013228 (2005)","key":"30_CR20","DOI":"10.1007\/11577327_15"},{"issue":"9","key":"30_CR21","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/TPDS.2002.1036062","volume":"13","author":"J. Wu","year":"2002","unstructured":"Wu, J.: Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links. IEEE Transactions on Parallel and Distributed Systems\u00a013(9), 866\u2013881 (2002)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"doi-asserted-by":"crossref","unstructured":"Wu, J., Gao, M., Stojmenovic: On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. In: Proc. of the 30th International Conference on Parallel Processing (ICPP 2001), pp. 346\u2013353 (2001)","key":"30_CR22","DOI":"10.1109\/ICPP.2001.952080"},{"doi-asserted-by":"crossref","unstructured":"Wu, J., Li, H.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proc. of the 3th Int. Workshop on Discrete Algothrithms and Methods for MOBILE Computing and Communications (DialM 1999), pp. 7\u201314 (1999)","key":"30_CR23","DOI":"10.1145\/313239.313261"},{"doi-asserted-by":"crossref","unstructured":"Xu, Z., Hedetniemi, S.T., Goddard, W., Srimani, P.K.: A synchronous self-stabilizing minimal domination protocol in an arbitrary network graph. In: IWDC 2003 (2003)","key":"30_CR24","DOI":"10.1007\/978-3-540-24604-6_3"},{"unstructured":"Das, S., Zhou, Z., Gupta, H.: Fault tolerant connected sensor cover with variable sensing and transmission. SECON (2005)","key":"30_CR25"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11945529_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T04:37:16Z","timestamp":1736656636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11945529_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540499909","9783540499916"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11945529_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}