{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:25:01Z","timestamp":1742963101281,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642453458"},{"type":"electronic","value":"9783642453465"}],"license":[{"start":{"date-parts":[[2013,12,13]],"date-time":"2013-12-13T00:00:00Z","timestamp":1386892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,12,13]],"date-time":"2013-12-13T00:00:00Z","timestamp":1386892800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-45346-5_16","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T12:33:16Z","timestamp":1386851596000},"page":"217-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks"],"prefix":"10.1007","author":[{"given":"Christine","family":"Markarian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schubert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,13]]},"reference":[{"key":"16_CR1","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., Colbourn, C., Johnson, D.: Unit disk graphs. Discrete Math. 86, 165\u2013177 (1990)","journal-title":"Discrete Math."},{"key":"16_CR2","unstructured":"Dubhashi, D., Mei, A., Panconesi, A., Radhakrishnan, J., Srinivasan, A.: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. In: Symposium on Discrete Algorithms (SODA), pp. 717\u2013724 (2003)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Wan, P., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: IEEE International Conference on Computer Communications (Infocom) (2002)","DOI":"10.1145\/513800.513820"},{"key":"16_CR4","first-page":"63","volume":"3","author":"J Wu","year":"2001","unstructured":"Wu, J., Li, H.: A dominating-set-based routing scheme in ad hoc wireless networks. Telecommun. Syst. J. 3, 63\u201384 (2001)","journal-title":"Telecommun. Syst. J."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Alzoubi, K.M., Wan, P.J., Frieder, O.: New distributed algorithm for connected dominating set in wireless ad hoc networks. In: Hawaii International Conference System Sciences (2002)","DOI":"10.1145\/513800.513820"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Funke, S., Kesselman, A., Meyer, U., Segal, M.: A simple improved distributed algorithm for minimum CDS in unit disk graphs. In: Wireless and Mobile Computing, Networking and Communications (WiMob) (2005)","DOI":"10.1145\/1167935.1167941"},{"key":"16_CR7","first-page":"158","volume-title":"LATIN 2008. LNCS","author":"J Czyzowicz","year":"2008","unstructured":"Czyzowicz, J., Dobrev, S., Fevens, T., Gonz\u00e1lez-Aguilar, H., An, H.-C., Opatrny, J., Urrutia, J.: Local algorithms for dominating and connected dominating sets of unit disk graphs with location aware nodes. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 158\u2013169. Springer, Heidelberg (2008)"},{"key":"16_CR8","first-page":"385","volume-title":"DISC 2006. LNCS","author":"A Czygrinow","year":"2006","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M.: Distributed approximation algorithms in unit-disk graphs. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 385\u2013398. Springer, Heidelberg (2006)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Schneider, J., Wattenhofer, R.: A log* distributed maximal independent set algorithm for growth-bounded graphs. In: Principles of Distributed Computing (PODC) (2008)","DOI":"10.1145\/1400751.1400758"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Markarian, C., Abu-Khzam, F.: A degree-based heuristic for strongly connected dominating-absorbent sets in wireless ad-hoc networks. In: Innovations in Information Technology (IIT) (2012)","DOI":"10.1109\/INNOVATIONS.2012.6207732"},{"issue":"9","key":"16_CR11","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/TPDS.2002.1036062","volume":"13","author":"J Wu","year":"2002","unstructured":"Wu, J.: An extended dominating-set-based routing in ad hoc wireless networks with unidirectional links. IEEE Trans. Parallel Distrib. Syst. 13(9), 866\u2013881 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"10","key":"16_CR12","first-page":"902","volume":"15","author":"F Dai","year":"2004","unstructured":"Dai, F., Wu, J.: An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Trans. Parallel Distrib. Syst. 15(10), 902\u2013920 (2004)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Park, M.A., Willson, J., Wang, C., Thai, M., Wu, W., Farago, A.: A dominating and absorbent set in a wireless adhoc network with different transmission ranges. In: Mobile Ad hoc Networking and Computing (MobiHoc), pp. 22\u201331 (2007)","DOI":"10.1145\/1288107.1288111"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1016\/j.tcs.2008.09.058","volume":"410","author":"D Li","year":"2009","unstructured":"Li, D., Duc, H., Wan, P.: Construction of strongly connected dominating sets in asymmetric multihop wireless networks. Theor. Comput. Sci. 410, 661\u2013669 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR15","volume-title":"Theory, Algorithms, and Applications","author":"R Tiwari","year":"2011","unstructured":"Tiwari, R., Thai, M.T.: On enhancing fault tolerance of virtual backbone in a wireless sensor network with unidirectional links sensors. In: Boginski, V.L., Commander, C.W., Pardalos, P.M., Ye, Y. (eds.) Theory, Algorithms, and Applications. Springer, New York (2011)"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Tiwari, R., Mishra, T., Li, Y.: k-strongly connected dominating and absorbing set in wireless ad hoc networks with unidirectional links. In: Wireless Algorithm, Systems and Applicaitons (WASA) , pp. 103\u2013112 (2007)","DOI":"10.1109\/WASA.2007.25"},{"issue":"4","key":"16_CR17","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"key":"16_CR18","first-page":"394407","volume":"5218","author":"C Lenzen","year":"2008","unstructured":"Lenzen, C., Wattenhofer, R.: Leveraging Linials locality limit. Distrib. Comput. 5218, 394407 (2008)","journal-title":"Distrib. Comput."},{"issue":"7","key":"16_CR19","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TMC.2007.1034","volume":"6","author":"M Thai","year":"2007","unstructured":"Thai, M., Wang, F., Liu, D., Zhu, S., Du, D.: Connected dominating sets in wireless networks with different transmission ranges. Mobile Comput. 6(7), 721\u2013730 (2007)","journal-title":"Mobile Comput."},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Raei, H., Sarram, M., Adibniya, F.: Distributed algorithm for connected dominating sets in wireless sensor networks with different transmission ranges. In: Telecommunications, pp. 337\u2013342 (2008)","DOI":"10.1109\/ISTEL.2008.4651324"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Raei, H., Fathi, M., Akhhlaghi, A., Ahmadipoor, B.: A new distributed algorithm for virtual backbone in wireless sensor networks with different transmission ranges. Computer Systems and Applications, pp. 983\u2013988 (2009)","DOI":"10.1109\/AICCSA.2009.5069451"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Raei, H., Sarram, M., Salimi, B., Adibnya, F.: Energy-aware distributed algorithm for virtual backbone in wireless sensor networks. In: Innovations in Information Technology, pp. 435\u2013439 (2008)","DOI":"10.1109\/INNOVATIONS.2008.4781762"},{"key":"16_CR23","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11610113_2","volume-title":"APWeb 2006. LNCS","author":"D-Z Du","year":"2006","unstructured":"Du, D.-Z., Thai, M.T., Li, Y., Liu, D., Zhu, S.: Strongly connected dominating sets in wireless sensor networks with unidirectional links. In: Zhou, X., Li, J., Shen, H.T., Kitsuregawa, M., Zhang, Y. (eds.) APWeb 2006. LNCS, vol. 3841, pp. 13\u201324. Springer, Heidelberg (2006)"},{"issue":"9","key":"16_CR24","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/TMC.2008.22","volume":"7","author":"M Thai","year":"2008","unstructured":"Thai, M., Tiwari, R., Du, D.: On construction of virtual backbone in wireless adhoc networks with unidirectional links. Mobile Comput. 7(9), 1098\u20131109 (2008)","journal-title":"Mobile Comput."},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Kassaei, H., Narayanan, L.: A new algorithm for backbone formation in ad hoc wireless networks of nodes with different transmission ranges. In: Wireless and Mobile Computing(WiMob), pp. 83\u201390 (2010)","DOI":"10.1109\/WIMOB.2010.5644866"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Jia, L., Rajaraman, R., Suel, T.: An efficient distributed algorithm for constructing small dominating sets. In: Principles of Distributed Computing, pp. 3342 (2001)","DOI":"10.1007\/s00446-002-0078-0"},{"issue":"2","key":"16_CR27","doi-asserted-by":"crossref","first-page":"525540","DOI":"10.1137\/S0097539793260763","volume":"28","author":"S Rajagopalan","year":"1998","unstructured":"Rajagopalan, S., Vazirani, V.: Primal-dual RNC approximation algorithms for (multi)set (multi)cover and covering integer programs. SIAM J. Comput. 28(2), 525540 (1998)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45346-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T21:01:29Z","timestamp":1675803689000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-45346-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,13]]},"ISBN":["9783642453458","9783642453465"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45346-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013,12,13]]},"assertion":[{"value":"13 December 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}