{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:16:47Z","timestamp":1760242607885,"version":"build-2065373602"},"reference-count":59,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T00:00:00Z","timestamp":1513123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>Energy-efficient clustering and routing are well known optimization problems in the study of Wireless Sensor Network (WSN) lifetime extension. In this paper, we propose an intelligent hybrid optimization algorithm based on a Set Cover approach to create clusters, and min-cost max-flow for routing (SCMC) to increase the lifetime of WSNs. In our method we used linear programming (LP) to model the WSN optimization problem. This model considers minimizing the energy for all nodes in each set cover (cluster), and then minimizing the routing energy between the nodes and the base station through intermediate nodes, namely cluster heads. To evaluate the performance of our scheme, extensive simulations were conducted with different scenarios. The results show that the set cover approach combined with the min-cost max-flow algorithm reduces energy consumption and increases the network\u2019s lifetime and throughput.<\/jats:p>","DOI":"10.3390\/fi9040095","type":"journal-article","created":{"date-parts":[[2017,12,14]],"date-time":"2017-12-14T04:30:55Z","timestamp":1513225855000},"page":"95","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["SCMC: An Efficient Scheme for Minimizing Energy in WSNs Using a Set Cover Approach"],"prefix":"10.3390","volume":"9","author":[{"given":"Ahmed","family":"Mahlous","sequence":"first","affiliation":[{"name":"Computer Science Department, Prince Sultan University, Riyadh 11586, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2017,12,13]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.procs.2015.07.399","article-title":"Comparison of Energy Efficient Data Collection Techniques in Wireless Sensor Network","volume":"57","author":"Rohankar","year":"2015","journal-title":"Procedia Comput. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1016\/j.jksuci.2016.08.001","article-title":"A survey on energy efficient coverage protocols in wireless sensor networks","volume":"29","author":"More","year":"2017","journal-title":"J. King Saud Univ. Comput. Inf. Sci."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Touati, Y., Ali-Ch\u00e9rif, A., and Daachi, B. (2017). Routing Information for Energy Management in WSNs. Energy Management in Wireless Sensor Networks, Elsevier.","DOI":"10.1016\/B978-1-78548-219-9.50003-5"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/S1005-8885(16)60044-4","article-title":"Energy aware hierarchical cluster-based routing protocol for WSNs","volume":"23","author":"Wang","year":"2016","journal-title":"J. China Univ. Posts Telecommun."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.eswa.2017.09.008","article-title":"Optimizing K-coverage of mobile WSNs","volume":"92","author":"Elhoseny","year":"2018","journal-title":"Expert Syst. Appl."},{"key":"ref_6","unstructured":"Obaidat, M., and Nicopolitidis, P. (2016). Chapter 15\u2014Optimization classification and techniques of WSNs in smart grid. Smart Cities and Homes, Morgan Kaufmann."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.engappai.2014.04.009","article-title":"Energy efficient clustering and routing algorithms for wireless sensor networks: Particle swarm optimization approach","volume":"33","author":"Kuila","year":"2014","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.protcy.2012.05.025","article-title":"Energy-aware Cluster Head Selection Using Particle Swarm Optimization and Analysis of Packet Retransmissions in WSN","volume":"4","author":"Singh","year":"2012","journal-title":"Procedia Technol."},{"key":"ref_9","first-page":"54","article-title":"Energy efficient algorithm for swarmed sensors networks","volume":"5","author":"Obaidy","year":"2015","journal-title":"Sustain. Comput. Inf. Syst."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.compeleceng.2016.03.002","article-title":"Particle swarm optimization for maximizing lifetime of wireless sensor networks","volume":"51","author":"Azharuddin","year":"2016","journal-title":"Comput. Electr. Eng."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1504\/IJSNET.2014.066788","article-title":"Maximum WSN coverage in environments of heterogeneous path loss","volume":"16","author":"Mortazavi","year":"2014","journal-title":"Int. J. Sens. Netw."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1504\/IJES.2015.072362","article-title":"A low energy consumption WSN node","volume":"7","author":"Peng","year":"2015","journal-title":"Int. J. Embed. Syst."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1504\/IJSNET.2016.074280","article-title":"Fault-tolerant multi-path routing protocol for WSN based on HEED","volume":"20","author":"Zhou","year":"2016","journal-title":"Int. J. Sens. Netw."},{"key":"ref_14","first-page":"470","article-title":"Q-Coverage Maximum Connected Set Cover (QC-MCSC) Heuristic for Connected Target Problem in Wireless Sensor Network","volume":"15","author":"Gupta","year":"2015","journal-title":"Glob. J. Comput. Sci. Technol."},{"key":"ref_15","first-page":"1668","article-title":"Analysis and Comparison of Wireless Sensor Networks Coverage Algorithms","volume":"5","author":"Jain","year":"2014","journal-title":"Int. J. Comput. Sci. Inf. Technol."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1007\/s11277-014-2159-3","article-title":"A multi-objective disjoint set covers for reliable lifetime maximization of wireless sensor networks","volume":"81","author":"Attea","year":"2015","journal-title":"Wirel. Pers. Commun."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1767","DOI":"10.1016\/j.camwa.2008.10.037","article-title":"Multi-objective optimization for coverage control in wireless sensor network with adjustable sensing radius","volume":"57","author":"Jia","year":"2009","journal-title":"Comput. Math. Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/S1007-0214(11)70066-9","article-title":"Reliable and Energy Efficient Target Coverage for Wireless Sensor Networks","volume":"16","author":"Ji","year":"2011","journal-title":"Tsinghua Sci. Technol."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"232","DOI":"10.14257\/ijca.2015.8.2.24","article-title":"Greedy Algorithms for Target Coverage Lifetime Management Problem in Wireless Sensor Networks","volume":"8","author":"Diop","year":"2015","journal-title":"Int. J. Control Autom."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1078","DOI":"10.1016\/j.adhoc.2007.10.003","article-title":"Location-Unaware coverage in wireless sensor networks","volume":"6","author":"Younis","year":"2008","journal-title":"Ad Hoc Netw."},{"key":"ref_21","first-page":"733","article-title":"Maximum Set Covers Based Energy Conservation Scheme in Wireless Sensor Networks","volume":"21","author":"Yao","year":"2014","journal-title":"Tech. Gaz."},{"key":"ref_22","unstructured":"Cardei, M., Thai, M.T., Li, Y., and Wu, W. (2005, January 13\u201317). Energy-efficient target coverage in wireless sensor networks. Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2005), Miami, FL, USA."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Liu, L., Hu, B., Miao, H., Li, H., Li, L., and Zhao, Q. (2009, January 22\u201326). Achieving Energy Conservation, Coverage and Connectivity Requirements in Wireless Sensor Networks. Proceedings of the 29th IEEE International Conference on Distributed Computing Systems Workshops, Montreal, QC, Canada.","DOI":"10.1109\/ICDCSW.2009.19"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"4578","DOI":"10.1007\/s11227-015-1558-x","article-title":"Distributed lifetime coverage optimization protocol in wireless sensor networks","volume":"71","author":"Idrees","year":"2015","journal-title":"J. Supercomput."},{"key":"ref_25","unstructured":"Belghith, O.B., and Sbita, L. (2015, January 16\u201319). Extending the network lifetime of wireless sensor networks using fuzzy logic. Proceedings of the IEEE 12th International Multi-Conference on Systems, Signals & Devices, Mahdia, Tunisia."},{"key":"ref_26","unstructured":"Handy, M.J., Haase, M., and Timmermann, D. (2002, January 9\u201311). Low energy adaptive clustering hierarchy with deterministic cluster-head selection. Proceedings of the 4th International Workshop on Mobile and Wireless Communications Network, Stockholm, Sweden."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-7373(75)80002-2","article-title":"An experiment in linguistic synthesis with a fuzzy logic controller","volume":"7","author":"Mamdani","year":"1975","journal-title":"Int. J. Man-Mach. Stud."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1016\/j.adhoc.2009.10.003","article-title":"Solving coverage problems in wireless sensor networks using cover sets","volume":"8","author":"Zorbas","year":"2010","journal-title":"Ad Hoc Netw."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.3724\/SP.J.1004.2008.01157","article-title":"Efficient cover set selection in wireless sensor networks","volume":"34","author":"Jia","year":"2008","journal-title":"Acta Autom. Sin."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_31","first-page":"1147","article-title":"Multi-Objective Set Cover Problem for Reliable and Efficient Wireless Sensor Networks","volume":"56","author":"Attea","year":"2015","journal-title":"Iraqi J. Sci."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","article-title":"Unit disk graphs","volume":"86","author":"Clark","year":"1990","journal-title":"Discret. Math."},{"key":"ref_33","first-page":"45","article-title":"Powers of a Graph and Associated Graph Labeling","volume":"2","author":"Purohit","year":"2010","journal-title":"Int. J. Comput. Netw. Secur."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1504\/IJMIC.2010.032359","article-title":"Find the maximum k-disjoint coverage sets in WSN using genetic algorithm","volume":"9","author":"Jia","year":"2010","journal-title":"Int. J. Model. Identif. Control"},{"key":"ref_35","first-page":"51","article-title":"Adaptive clustering and routing using fuzzy decision model in WSN","volume":"6","author":"Prabakaran","year":"2015","journal-title":"Int. J. Mob. Netw. Des. Innov."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1504\/IJSCC.2012.050810","article-title":"Elongation of WSN lifetime using a centralised clustering technique","volume":"4","author":"Ali","year":"2012","journal-title":"Int. J. Syst. Control Commun."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Miller, R.E., and Thatcher, J.W. (1972). Reducibility among Combinatorial Problems. Complexity of Computer Computations, Plenum.","DOI":"10.1007\/978-1-4684-2001-2"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"3520","DOI":"10.1016\/j.cor.2005.03.030","article-title":"Experimental analysis of approximation algorithms for the vertex cover and set covering problems","volume":"33","author":"Gomes","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1016\/j.ejor.2005.09.028","article-title":"An effctive and simple heuristic for the set covering problem","volume":"176","author":"Lan","year":"2007","journal-title":"Europ. J. Oper. Res."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.tcs.2004.08.013","article-title":"A greedy approximation for minimum connected dominating sets","volume":"32","author":"Ruan","year":"2004","journal-title":"Theor. Comput. Sci."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Bilal, N., Galinier, P., and Guibault, F. (2013). A New Formulation of the Set Covering Problem for Metaheuristic Approaches. Int. Sch. Res. Not., 1\u201310.","DOI":"10.1155\/2013\/203032"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"40","DOI":"10.14569\/IJARAI.2015.040607","article-title":"A Heuristic Approach for Minimum Set Cover Problem","volume":"4","author":"Akhter","year":"2015","journal-title":"Int. J. Adv. Res. Artif. Intell."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Xu, Y., Heidemann, J., and Estrin, D. (2001, January 16\u201321). Geography-informed energy conservation for Ad Hoc routing. Proceedings of the 7th Annual International Conference on Mobile Computing and Networking, Rome, Italy.","DOI":"10.1145\/381677.381685"},{"key":"ref_44","unstructured":"Heinzelman, W. (2000). Application Specific Protocol Architectures for Wireless Networks. [Ph.D. Thesis, Massachusetts Institute of Technology (MIT)]."},{"key":"ref_45","first-page":"8033","article-title":"Performance Analysis of Energy Dissipation in WSNs Using Multi-Chain PEGASIS","volume":"5","author":"Prajapat","year":"2014","journal-title":"Int. J. Comput. Sci. Inf. Technol."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Acharya, A., Seetharam, A., Bhattacharyya, A., and Naskar, M.K. (2009, January 3\u20136). Balancing energy dissipation in data gathering wireless sensor networks using ant colony optimization. Proceedings of the International Conference on Distributed Computing and Networking, Hyderabad, India.","DOI":"10.1007\/978-3-540-92295-7_52"},{"key":"ref_47","unstructured":"Lindsey, S., and Raghavendra, C.S. (2001, January 9\u201316). PEGASIS: Power Efficient Gathering in Sensor Information Systems. Proceedings of the IEEE ICC, Big Sky, MT, USA."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/959060.959072","article-title":"Power efficient data gathering and aggregation in wireless sensor networks","volume":"32","author":"Tan","year":"2003","journal-title":"ACM SIGMOD Rec."},{"key":"ref_49","unstructured":"(2017, December 09). How Can I Start for Calculating Energy Dissipation in WSN? ResearchGate. Available online: https:\/\/www.researchgate.net\/post\/How_can_I_start_for_calculating_energy_dissipation_in_WSN."},{"key":"ref_50","unstructured":"Heinzelman, W., Chandrakasan, A., and Balakrishna, H. (2000, January 7). Energy-Efficient Communication Protocol for Wireless Microsensor Networks. Proceedings of the 33rd Hawaii International Conference on System Sciences, Maui, HI, USA."},{"key":"ref_51","unstructured":"Ahuja, R., Magnanti, T., and Orlin, J. (1993). Network Flows, Prentice Hall."},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., and Tarjan, R.E. (1987, January 25\u201327). Solving minimum-cost flow problems by successive approximation. Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, New York, NY, USA.","DOI":"10.1145\/28395.28397"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/moor.13.1.99","article-title":"An almost linear-time algorithm for graph realization","volume":"13","author":"Bixby","year":"1988","journal-title":"Math. Oper. Res."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF01585705","article-title":"Finding minimum-cost flows by double scaling","volume":"53","author":"Ahuja","year":"1992","journal-title":"Math. Program."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1287\/opre.41.2.338","article-title":"A faster strongly polynomial minimum cost flow algorithm","volume":"41","author":"Orlin","year":"1993","journal-title":"Oper. Res."},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1080\/10556788.2014.895828","article-title":"Minimum-cost flow algorithms: An experimental evaluation","volume":"30","year":"2015","journal-title":"Opt. Methods Softw."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02614365","article-title":"A polynomial time primal network simplex algorithm for minimum cost flows","volume":"78","author":"Orlin","year":"1997","journal-title":"Math. Program."},{"key":"ref_58","unstructured":"(MATLAB: R2017b, 2017). MATLAB: R2017b."},{"key":"ref_59","first-page":"562","article-title":"A Multi-Objective Model for Optimizing Network lifetime in Wireless Sensor Network","volume":"14","author":"Tounsi","year":"2016","journal-title":"Int. J. Comput. Sci. Inf. Secur."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/9\/4\/95\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:53:53Z","timestamp":1760208833000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/9\/4\/95"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,13]]},"references-count":59,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2017,12]]}},"alternative-id":["fi9040095"],"URL":"https:\/\/doi.org\/10.3390\/fi9040095","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2017,12,13]]}}}