{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:48:46Z","timestamp":1743144526752,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020841"},{"type":"electronic","value":"9783642020858"}],"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-02085-8_25","type":"book-chapter","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T09:13:28Z","timestamp":1243934008000},"page":"343-355","source":"Crossref","is-referenced-by-count":3,"title":["Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks"],"prefix":"10.1007","author":[{"given":"Kamrul","family":"Islam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Selim G.","family":"Akl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Alzoubi, K.M., Wan, P.J., Frieder, O.: New Distributed Algorithm for Connected Dominating Set in Wireless Adhoc Networks. In: Proc. IEEE HICS (2002)","DOI":"10.1109\/JCN.2002.6596929"},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/JCN.2002.6596929","volume":"4","author":"K.M. Alzoubi","year":"2002","unstructured":"Alzoubi, K.M., Wan, P.J., Frieder, O.: Distributed Heuristics for Connected Dominating Set in Wireless Adhoc Networks. J. on Communication Networks\u00a04(1), 22\u201329 (2002)","journal-title":"J. on Communication Networks"},{"key":"25_CR3","unstructured":"Cheng, X., Huang, X., Li, D., Du, D.: Polynomial-time Approximation Scheme for Minimum Connected Dominating Set in Adhoc Wireless Networks. In: Proc. Networks (2006)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Chen, D., Mao, X., Fei, X., Xing, K., Liu, F., Song, M.: A Convex-Hull Based Algorithm to Connect the Maximal Independent Set in Unit Disk Graphs. In: Proc. Wireless Algorithms, Systems, and Applications, pp. 363\u2013370 (October 2006)","DOI":"10.1007\/11814856_35"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B. Clark","year":"1990","unstructured":"Clark, B., Colborn, C., Johnson, D.: Unit Disk Graphs. Discrete Mathematics\u00a086, 165\u2013177 (1990)","journal-title":"Discrete Mathematics"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Das, B., Bharghavan, V.: Routing in Adhoc Networks Using Minimum Connected Dominating Sets. In: Proc. ICC, pp. 376\u2013380 (1997)","DOI":"10.1109\/ICC.1997.605303"},{"issue":"3","key":"25_CR7","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/1167935.1167941","volume":"2","author":"S. Funke","year":"2006","unstructured":"Funke, S., Kesselman, A., Meyer, U., Segal, M.: A Simple Improved Distributed Algorithm for Minimum Connected Dominating Set in Unit Disk Graphs. ACM Transactions on Sensor Networks\u00a02(3), 444\u2013453 (2006)","journal-title":"ACM Transactions on Sensor Networks"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Guha, S., Khuller, S.: Approximation Algorithms for Connected Dominating Sets. Algorithmica, 374\u2013387 (1998)","DOI":"10.1007\/PL00009201"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"M. Marathe","year":"1995","unstructured":"Marathe, M., Breu, H., Hunt, H., Ravi, S., Rosenkrantz, D.: Simple Heuristics for Unit Disk Graphs. Networks\u00a025, 59\u201368 (1995)","journal-title":"Networks"},{"key":"25_CR10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia (2000)"},{"key":"25_CR11","unstructured":"Sivakumar, R., Das, B., Bharghavan, V.: Spine Routing in Adhoc Networks Using Minimum Connected Dominating Sets. In: Proc. ICC, pp. 376\u2013380 (1997)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating Sets and Neighbor Elimination Based Broadcasting Algorithms in Wireless Networks. IEEE Transactions on Parallel and Distributed Systems\u00a013(1) (January 2002)","DOI":"10.1109\/71.980024"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Wan, P., Alzoubi, K., Frieder, O.: Distributed Construction of Connected Dominating Set in Wireless Adhoc Networks. In: Proc. Infocom (2002)","DOI":"10.1109\/JCN.2002.6596929"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Wu, J., Li, H.: On Calculating Connected Dominating Sets for Efficient Routing in Adhoc Wireless Networks. In: Proc. Discrete Algorithms and Methods for Mobile Computing, pp. 7\u201314 (1999)","DOI":"10.1145\/313239.313261"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: Maximizing the Lifetime of Dominating Sets. In: Proc. WMAN (2005)","DOI":"10.1109\/IPDPS.2005.276"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Pemmaraju, S., Pirwani, I.: Energy Conservation in Wireless Sensor Networks via Domatic Partitions. In: Proc. MobiHoc (2006)","DOI":"10.1145\/1132905.1132922"},{"issue":"1","key":"25_CR17","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/S0097539700380754","volume":"32","author":"U. Feige","year":"2003","unstructured":"Feige, U., Halldorsson, M., Kortsarz, G., Srinivasan, A.: Approximating the Domatic Number. SIAM Journal of Computing\u00a032(1), 172\u2013195 (2003)","journal-title":"SIAM Journal of Computing"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Slijepcevic, S., Potkonjak, M.: Power Efficient Organization of Wireless Sensor Networks. In: Proc. Infocom (2001)","DOI":"10.1109\/ICC.2001.936985"},{"key":"25_CR19","unstructured":"Gupta, R., Walrand, J., Goldschmidt, O.: Maximal Cliques in Unit Disk Graphs: Polynomial Approximation. In: Proc. INOC Lisbon, Portugal (2005)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing in Sensor Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02085-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T21:22:17Z","timestamp":1739136137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02085-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020841","9783642020858"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02085-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}