{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:32:16Z","timestamp":1767339136722,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T00:00:00Z","timestamp":1606089600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T00:00:00Z","timestamp":1606089600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s11277-020-07982-z","type":"journal-article","created":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T19:11:50Z","timestamp":1606158710000},"page":"2423-2439","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Efficient Energy Aware Semigraph-Based Total Edge Domination Routing Algorithm in Wireless Sensor Networks"],"prefix":"10.1007","volume":"117","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3398-8302","authenticated-orcid":false,"given":"T. Suriya","family":"Praba","sequence":"first","affiliation":[]},{"given":"S.","family":"Saravanan","sequence":"additional","affiliation":[]},{"given":"T.","family":"Sethukarasi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,23]]},"reference":[{"issue":"01","key":"7982_CR1","doi-asserted-by":"publisher","first-page":"18","DOI":"10.4236\/wsn.2011.31003","volume":"3","author":"HY Zhou","year":"2011","unstructured":"Zhou, H. Y., Luo, D. Y., Gao, Y., & Zuo, D. C. (2011). Modeling of node energy consumption for wireless sensor networks. Wireless Sensor Network, 3(01), 18\u201323.","journal-title":"Wireless Sensor Network"},{"key":"7982_CR2","unstructured":"Lin, S., Zhang, J., Zhou, G., Gu, L., Stankovic, J. A., & He, T. ( 2006). Adaptive Transmission Power Control for Wireless Sensor Networks. In Proceedings of Fourth International Conference on Embedded Networked Sensor Systems (pp. 223\u2013236)."},{"issue":"2","key":"7982_CR3","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPDS.2008.74","volume":"20","author":"D Kim","year":"2009","unstructured":"Kim, D., Wu, Y., Li, Y., Zou, F., & Du, D. Z. (2009). Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 20(2), 147\u2013157.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"7982_CR4","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.procs.2015.07.190","volume":"56","author":"D Fu","year":"2015","unstructured":"Fu, D., Han, L., Liu, L., Gao, Q., & Feng, Z. (2015). An efficient centralized algorithm for connected dominating set on wireless networks. Procedia Computer Science, 56, 162\u2013167.","journal-title":"Procedia Computer Science"},{"key":"7982_CR5","unstructured":"Asgarnezhad, R., & Torkestani, J. A. (2011). Connected dominating set problem and its application to wireless sensor networks. In\u00a0The First International Conference on Advanced Communications and Computation, INFOCOMP (pp. 46\u201351)."},{"issue":"1","key":"7982_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.jpdc.2011.07.002","volume":"72","author":"J Yu","year":"2012","unstructured":"Yu, J., Wang, N., & Wang, G. (2012). Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks. Journal of Parallel and Distributed Computing, 72(1), 35\u201347.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"6","key":"7982_CR7","doi-asserted-by":"publisher","first-page":"297","DOI":"10.14257\/ijfgcn.2016.9.6.28","volume":"9","author":"X Qian","year":"2016","unstructured":"Qian, X., et al. (2016). A wireless sensor network clustering algorithm based on hypergraph. International Journal of Future Generation Communication and Networking, 9(6), 297\u2013312.","journal-title":"International Journal of Future Generation Communication and Networking"},{"issue":"3","key":"7982_CR8","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1007\/s11277-017-5185-0","volume":"99","author":"S Saravanan","year":"2018","unstructured":"Saravanan, S., Poovazhaki, R., & Shanker, N. R. (2018). Cluster Topology in WSN with SCPS for QoS. Wireless Personal Communications, 99(3), 1295\u20131314.","journal-title":"Wireless Personal Communications"},{"issue":"1","key":"7982_CR9","first-page":"200","volume":"1","author":"M Yavad","year":"2009","unstructured":"Yavad, M., Rishiwal, V., Arora, G., & Makka, S. (2009). Modified minimum connected dominating set formation for wireless Adhoc networks. Journal of computing, 1(1), 200\u2013203.","journal-title":"Journal of computing"},{"issue":"7","key":"7982_CR10","doi-asserted-by":"publisher","first-page":"1703201","DOI":"10.1177\/155014771703201","volume":"12","author":"D Fu","year":"2016","unstructured":"Fu, D., et al. (2016). A Greedy Algorithm on constructing the minimum connected dominating set in wireless network. International Journal of Distributed Sensor Networks, 12(7), 1703201.","journal-title":"International Journal of Distributed Sensor Networks"},{"key":"7982_CR11","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/j.comnet.2007.10.004","volume":"52","author":"T Chang","year":"2008","unstructured":"Chang, T., Wang, K., & Hsieh, Y. (2008). A color theory based energy efficient routing algorithm for mobile wireless sensor networks. International Journal of Computer Networks and Communications, 52, 531\u2013541.","journal-title":"International Journal of Computer Networks and Communications"},{"key":"7982_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.jpdc.2010.05.008","volume":"71","author":"B Yin","year":"2011","unstructured":"Yin, B., Shi, H., & Shang, Y. (2011). An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks. Journal of Parallel and Distributed Computing, 71, 27\u201339.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"7982_CR13","first-page":"1164","volume":"12","author":"S Balaji","year":"2013","unstructured":"Balaji, S., Kannan, K., & Venkatakrishnan, Y. B. (2013). Total dominating set based algorithm for connected dominating set in Ad hoc wireless networks. WSEAS Transactions on Mathematics, 12, 1164\u20131172.","journal-title":"WSEAS Trans. Mathematics"},{"key":"7982_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.adhoc.2016.02.003","volume":"42","author":"JP Mohanty","year":"2016","unstructured":"Mohanty, J. P., Mandal, C., Reade, C., & Das, A. (2016). Construction of minimum connected dominating set in wireless sensor networks using pseudo dominating set. Ad Hoc Networks, 42, 61\u201373.","journal-title":"Ad Hoc Networks"},{"key":"7982_CR15","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.procs.2015.07.190","volume":"56","author":"D Fu","year":"2015","unstructured":"Fu, D., et al. (2015). An efficient centralized algorithm for connected dominating set on wireless networks. Procedia Computer Science, 56, 162\u2013167.","journal-title":"Procedia Computer Science"},{"key":"7982_CR16","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.comnet.2017.05.017","volume":"123","author":"JP Mohanty","year":"2017","unstructured":"Mohanty, J. P., Mandal, C., & Reade, C. (2017). Distributed construction of minimum connected dominating set in wireless sensor network using two-hop information. Computer Networks, 123, 137\u2013152.","journal-title":"Computer Networks"},{"key":"7982_CR17","unstructured":"Haynes, T. W., Hedetniemi, S. T., & Slater, P. J. (1998). Fundamentals of domination in graphs. New York: Marcel Dekker."},{"issue":"10","key":"7982_CR18","doi-asserted-by":"publisher","first-page":"1601","DOI":"10.1109\/TPDS.2011.30","volume":"22","author":"L Ding","year":"2011","unstructured":"Ding, L., Wu, W., Willson, J., Du, H., Lee, W., & Du, D.-Z. (2011). Efficient algorithms for topology control problem with routing cost constraints in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 22(10), 1601\u20131609.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"7982_CR19","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S1571-0653(04)00548-7","volume":"15","author":"SS Kamath","year":"2003","unstructured":"Kamath, S. S., & Bhat, R. S. (2003). Domination in Semigraphs. Electronic Notes in Discrete Mathematics, 15, 106\u2013111.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"7982_CR20","unstructured":"Sampathkumar, E. (2000). Semigraphs and their applications, Report on the DST Project."},{"key":"7982_CR21","unstructured":"Hedetniemi, S. T., & Mitchell, S., (1977). Edge domination in trees. In\u00a0Proc. 8th SE Conf. Combin., Graph Theory and Computing, Congr. Numer (vol. 19, pp. 489\u2013509)."},{"key":"7982_CR22","unstructured":"Kulli V. R., & Sigarakanti S. C. (1988) The connected edge domination number of a graph, Technical Report 8801, Dept Math. Gulbarga University"},{"issue":"4","key":"7982_CR23","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha, S., & Khuller, S. (1998). Approximation algorithms for connected dominating sets. Algorithmica, 20(4), 374\u2013387.","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"7982_CR24","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2004.08.013","volume":"329","author":"L Ruan","year":"2004","unstructured":"Ruan, L., Du, H., Jia, X., Wu, W., Li, Y., & Ko, K. I. (2004). A greedy approximation for minimum connected dominating sets. Theoretical Computer Science., 329(1\u20133), 325\u2013330.","journal-title":"Theoretical Computer Science."},{"key":"7982_CR25","doi-asserted-by":"publisher","unstructured":"Suriya Praba, T., Sethukarasi, T., & Saravanan, S. (2019). Energy measure semigraph-based connected edge domination routing algorithm in wireless sensor networks. Mobile Information Systems. https:\/\/doi.org\/10.1155\/2019\/4761304.","DOI":"10.1155\/2019\/4761304"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-020-07982-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-020-07982-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-020-07982-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T11:04:54Z","timestamp":1669719894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-020-07982-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,23]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["7982"],"URL":"https:\/\/doi.org\/10.1007\/s11277-020-07982-z","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"type":"print","value":"0929-6212"},{"type":"electronic","value":"1572-834X"}],"subject":[],"published":{"date-parts":[[2020,11,23]]},"assertion":[{"value":"11 November 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}