{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:04:47Z","timestamp":1758272687966},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2009,3]]},"abstract":"<jats:p> In this paper, we study the connected r-hop k-dominating set problem in wireless networks. We propose two algorithms for the problem. We prove that algorithm I for UDG has (2r + 1)<jats:sup>3<\/jats:sup> approximate ratio for k \u2264 (2r + 1)<jats:sup>2<\/jats:sup> and (2r + 1)((2r + 1)<jats:sup>2<\/jats:sup> + 1)-approximate ratio for k &gt; (2r + 1)<jats:sup>2<\/jats:sup>. And algorithm II for any undirected graph has (2r + 1) ln (\u0394<jats:sub>r<\/jats:sub>) approximation ratio, where \u0394<jats:sub>r<\/jats:sub> is the largest cardinality among all r-hop neighborhoods in the network. The simulation results show that our algorithms are efficient. <\/jats:p>","DOI":"10.1142\/s1793830909000087","type":"journal-article","created":{"date-parts":[[2009,4,8]],"date-time":"2009-04-08T04:55:25Z","timestamp":1239166525000},"page":"45-57","source":"Crossref","is-referenced-by-count":28,"title":["MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS"],"prefix":"10.1142","volume":"01","author":[{"given":"DEYING","family":"LI","sequence":"first","affiliation":[{"name":"Key Laboratory of Data Engineering and Knowledge Engineering, Renmin University of China, MOE, China"},{"name":"School of Information, Renmin University of China, Beijing, China"}]},{"given":"LIN","family":"LIU","sequence":"additional","affiliation":[{"name":"Key Laboratory of Data Engineering and Knowledge Engineering, Renmin University of China, MOE, China"},{"name":"School of Information, Renmin University of China, Beijing, China"}]},{"given":"HUIQIANG","family":"YANG","sequence":"additional","affiliation":[{"name":"Key Laboratory of Data Engineering and Knowledge Engineering, Renmin University of China, MOE, China"},{"name":"School of Information, Renmin University of China, Beijing, China"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2004.41"},{"key":"rf5","volume-title":"Ad Hoc Netw.","author":"Li X.-Y.","year":"2003"},{"key":"rf11","first-page":"785","volume":"47","author":"Pai S.","journal-title":"Comput. Netw."},{"key":"rf12","first-page":"505","volume":"5","author":"Spohn M. A.","journal-title":"Ad Hoc Networks"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.378"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009201"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1002\/net.10097"},{"key":"rf18","first-page":"49","volume":"358","author":"Thai M. T.","journal-title":"Theor. Comput. Sci."},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.04.035"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830909000087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:17:21Z","timestamp":1565129841000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830909000087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":9,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2009,3]]}},"alternative-id":["10.1142\/S1793830909000087"],"URL":"https:\/\/doi.org\/10.1142\/s1793830909000087","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3]]}}}