{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T11:06:16Z","timestamp":1768561576665,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"S5","license":[{"start":{"date-parts":[[2018,2,3]],"date-time":"2018-02-03T00:00:00Z","timestamp":1517616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10586-018-1760-8","type":"journal-article","created":{"date-parts":[[2018,2,3]],"date-time":"2018-02-03T10:56:52Z","timestamp":1517655412000},"page":"12795-12804","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":48,"title":["Minimum connected dominating set based RSU allocation for smartCloud vehicles in VANET"],"prefix":"10.1007","volume":"22","author":[{"given":"A.","family":"Chinnasamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Sivakumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Selvakumari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Suresh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,3]]},"reference":[{"issue":"10","key":"1760_CR1","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1109\/TPDS.2004.48","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), 908\u2013920 (2004)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1760_CR2","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1109\/TPDS.2009.78","volume":"21","author":"R Misra","year":"2010","unstructured":"Misra, R., Mandal, C.: Minimum connected dominating set using a collaborative cover heuristic for ad hoc sensor networks. IEEE Trans. Parallel Distrib. Syst. 21, 292\u2013302 (2010)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1760_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3387-7","volume-title":"Topological Structure and Analysis of Interconnection Networks","author":"J Xu","year":"2001","unstructured":"Xu, J.: Topological Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"1760_CR4","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPDS.2008.81","volume":"20","author":"D Kim","year":"2009","unstructured":"Kim, D., Wu, Y., Li, Y., Zou, F., Du, D.Z.: Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Trans. Parallel Distrib. Syst. 20, 147\u2013157 (2009)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1760_CR5","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.jpdc.2009.08.007","volume":"70","author":"N Dimokas","year":"2010","unstructured":"Dimokas, N., Katsaros, D., Manolopoulos, Y.: Energy-efficient distributed clustering in wireless sensor networks. J. Parallel Distrib. Comput. 70, 371\u2013383 (2010)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"6","key":"1760_CR6","first-page":"511","volume":"4","author":"M Rai","year":"2009","unstructured":"Rai, M., Verma, S., Tapaswi, S.: A power aware minimum connected dominating set for wireless sensor networks. J. Netw. 4(6), 511\u2013519 (2009)","journal-title":"J. Netw."},{"key":"1760_CR7","doi-asserted-by":"crossref","unstructured":"Wan, P.J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: IEEE INFOCOM, pp. 1597\u20131604 (2002)","DOI":"10.1145\/513800.513820"},{"key":"1760_CR8","unstructured":"Bharghavan, V., Das, B.: Routing in ad hoc networks using minimum connected dominating set. In: Proceedings of International Conference on Communications\u201997, Montreal, Canada (1997)"},{"key":"1760_CR9","doi-asserted-by":"crossref","unstructured":"Wu, J., Li, H.L.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proceedings of the 3rd ACM International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7\u201314 (1999)","DOI":"10.1145\/313239.313261"},{"key":"1760_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/0404010","volume":"4","author":"DJ Kleitman","year":"1991","unstructured":"Kleitman, D.J., West, D.B.: Spanning trees with many leaves. SIAM J. Discret. Math. 4, 99\u2013106 (1991)","journal-title":"SIAM J. Discret. Math."},{"key":"1760_CR11","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0020-0190(81)90141-1","volume":"13","author":"JA Storer","year":"1981","unstructured":"Storer, J.A.: Constructing full spanning trees for cubic graphs. Inf. Process. Lett. 13, 8\u201311 (1981)","journal-title":"Inf. Process. Lett."},{"key":"1760_CR12","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/S0377-2217(96)00327-X","volume":"104","author":"LM Fernandes","year":"1998","unstructured":"Fernandes, L.M., Gouveia, L.: Minimal spanning trees with a constraint on the number of leaves. Eur. J. Oper. Res. 104, 250\u2013261 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"1760_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"1760_CR14","doi-asserted-by":"publisher","first-page":"6290","DOI":"10.1016\/j.tcs.2011.07.011","volume":"412","author":"H Fernau","year":"2011","unstructured":"Fernau, H., Kneis, J., Kratsch, D., Langer, A., Liedloff, M., Raible, D., Rossmanith, P.: An exact algorithm for the maximum leaf spanning tree problem. Theoret. Comput. Sci. 412, 6290\u20136302 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"1760_CR15","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20, 374\u2013387 (1998)","journal-title":"Algorithmica"},{"issue":"2","key":"1760_CR16","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00453-007-9145-z","volume":"52","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Solving connected dominating set faster than 2n. Algorithmica 52(2), 153\u2013166 (2008)","journal-title":"Algorithmica"},{"key":"1760_CR17","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/jagm.1998.0944","volume":"29","author":"H Lu","year":"1998","unstructured":"Lu, H., Ravi, R.: Approximating maximum leaf spanning trees in almost linear time. J. Algorithms 29, 132\u201341 (1998)","journal-title":"J. Algorithms"},{"issue":"13","key":"1760_CR18","doi-asserted-by":"publisher","first-page":"1931","DOI":"10.1016\/S0305-0548(02)00117-X","volume":"30","author":"T Fujie","year":"2003","unstructured":"Fujie, T.: An exact algorithm for the maximum leaf spanning tree problem. Comput. Oper. Res. 30(13), 1931\u20131944 (2003)","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"1760_CR19","doi-asserted-by":"publisher","first-page":"2405","DOI":"10.1016\/j.ins.2007.02.001","volume":"177","author":"YT Tsai","year":"2007","unstructured":"Tsai, Y.T., Lin, Y.L., Hsu, F.R.: Efficient algorithms for the minimum connected domination on trapezoid graphs. Inf. Sci. 177(12), 2405\u20132417 (2007)","journal-title":"Inf. Sci."},{"key":"1760_CR20","first-page":"181","volume":"73","author":"PC Li","year":"2010","unstructured":"Li, P.C., Toulouse, M.: Maximum leaf spanning trees for grid graphs. J. Comb. Math. Comb. Comput. 73, 181\u2013193 (2010)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"1760_CR21","unstructured":"Chen, Y.C., Syu, Y.L.: Connected dominating set of hypercubes and star graphs. In: International conference on software and computer applications, vol. 41 (2012)"},{"key":"1760_CR22","doi-asserted-by":"publisher","unstructured":"Suresh, A., Varatharajan, R.: Competent resource provisioning and distribution techniques for cloud computing environment. Cluster Comput. (2017) \nhttps:\/\/doi.org\/10.1007\/s10586-017-1293-6","DOI":"10.1007\/s10586-017-1293-6"},{"key":"1760_CR23","doi-asserted-by":"crossref","unstructured":"Aslam, B., Wang, P., Zou, C.: An economical, deployable and secure vehicular ad hoc network. In: Proc, Military Communication Conf., San Diego, CA, pp. 1\u20137 (2008)","DOI":"10.1109\/MILCOM.2008.4753588"},{"key":"1760_CR24","unstructured":"Kafsi, M., Papadimitratos, P., Doussey, O., Alpcanz, T., Hubaux, J.P.: VANET connectivity analysis. Tech. Rep., EPFL\/T-Labs, Lausanne, Switzerland (2008)"},{"key":"1760_CR25","doi-asserted-by":"crossref","unstructured":"Mohandas, B.K., Nayak, A., Naik, K., Goel, N.: ABSRP-A service discovery approach for vehicular ad-hoc networks. In: Proc. 3rd IEEE Asia-Pacific Services Computing Conf., Pisa, Italy, pp. 1590\u20131594 (2008)","DOI":"10.1109\/APSCC.2008.44"},{"key":"1760_CR26","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1145\/321832.321838","volume":"21","author":"GK Wong","year":"1974","unstructured":"Wong, G.K., Coppersmith, D.A.: A combinatorial problem related to multi module memory organization. J. Assoc. Comput. Mach. 21, 392\u2013401 (1974)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"12","key":"1760_CR27","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1109\/TCS.1985.1085667","volume":"32","author":"FT Boesch","year":"1985","unstructured":"Boesch, F.T., Wang, J.: Reliable circulant networks with minimum transmission delay. IEEE Trans. Circ. Syst. 32(12), 1286\u20131291 (1985)","journal-title":"IEEE Trans. Circ. Syst."},{"issue":"1","key":"1760_CR28","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","volume":"24","author":"JC Bermond","year":"1995","unstructured":"Bermond, J.C., Comellas, F., Hsu, D.F.: Distributed loop computer networks, a survey. J. Parallel Distrib. Comput. 24(1), 2\u201310 (1995)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"1760_CR29","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1109\/TITS.2012.2183124","volume":"13","author":"K Mershad","year":"2012","unstructured":"Mershad, K., Artail, H., Gerla, M.: We can deliver messages to far vehicles. IEEE Trans. Intell. Transp. Syst. 13(3), 1099\u20131115 (2012)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"4","key":"1760_CR30","first-page":"349","volume":"41","author":"I Rajasingh","year":"2011","unstructured":"Rajasingh, I., Rajan, B., Rajan, R.S.: Combinatorial properties of circulant networks. Int. J. Appl. Math. 41(4), 349\u2013351 (2011)","journal-title":"Int. J. Appl. Math."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-018-1760-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-1760-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-1760-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T22:16:25Z","timestamp":1574374585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-018-1760-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,3]]},"references-count":30,"journal-issue":{"issue":"S5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["1760"],"URL":"https:\/\/doi.org\/10.1007\/s10586-018-1760-8","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,3]]},"assertion":[{"value":"5 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}