{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T18:31:02Z","timestamp":1722537062123},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T00:00:00Z","timestamp":1428019200000},"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":["Wireless Pers Commun"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s11277-015-2548-2","type":"journal-article","created":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T13:59:56Z","timestamp":1428069596000},"page":"2187-2213","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Specific Heuristic Dedicated to a Coverage\/Tracking Bi-objective Problem for Wireless Sensor Deployment"],"prefix":"10.1007","volume":"84","author":[{"given":"Matthieu","family":"Le Berre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maher","family":"Rebai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faicel","family":"Hnaien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hichem","family":"Snoussi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,3]]},"reference":[{"key":"2548_CR1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF02574812","volume":"2","author":"M Almi\u00f1ana","year":"1994","unstructured":"Almi\u00f1ana, M., & Pastor, J. T. (1994). Two new heuristics for the location set covering problem. Top, 2, 315\u2013328.","journal-title":"Top"},{"key":"2548_CR2","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1016\/S0377-2217(96)00181-6","volume":"100","author":"M Almi\u00f1ana","year":"1997","unstructured":"Almi\u00f1ana, M., & Pastor, J. T. (1997). An adaptation of SH heuristic to the location set covering problem. European Journal of Operational Research, 100, 586\u2013593.","journal-title":"European Journal of Operational Research"},{"key":"2548_CR3","doi-asserted-by":"crossref","first-page":"2419","DOI":"10.1016\/j.comnet.2008.05.002","volume":"52","author":"IK Altinel","year":"2008","unstructured":"Altinel, I. K., Aras, N., G\u00fcney, E., & Ersoy, C. (2008). Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks. Computer Networks, 52, 2419\u20132431.","journal-title":"Computer Networks"},{"key":"2548_CR4","doi-asserted-by":"crossref","unstructured":"Andersen, T., & Tirthapura, S. (2009). Wireless sensor deployment for 3d coverage with constraints. In The 6th International Conference on Networked Sensing Systems, pp. 78\u201381.","DOI":"10.1109\/INSS.2009.5409946"},{"key":"2548_CR5","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1287\/opre.44.6.875","volume":"44","author":"E Balas","year":"1996","unstructured":"Balas, E., & Carrera, M. C. (1996). A dynamic subgradient-based branch-and-bound procedure for set covering. Operations Research, 44, 875\u2013890.","journal-title":"Operations Research"},{"key":"2548_CR6","doi-asserted-by":"crossref","first-page":"3162","DOI":"10.1016\/j.cor.2005.11.026","volume":"34","author":"J Bautista","year":"2007","unstructured":"Bautista, J., & Pereira, J. (2007). A grasp algorithm to solve the unicost set covering problem. Computers and Operations Research, 34, 3162\u20133173.","journal-title":"Computers and Operations Research"},{"key":"2548_CR7","doi-asserted-by":"crossref","unstructured":"Le Berre, M., Hnaien, F., & Snoussi, H. (2013). A multi-objective modeling of k-coverage problem under accuracy constraint. In The 5th international conference on modeling, simulation and applied optimization, pp. 1\u20136.","DOI":"10.1109\/ICMSAO.2013.6552623"},{"key":"2548_CR8","unstructured":"Le Berre, M., Rebai, M., Hnaien, F., & Snoussi, H. (2014). A bi-objective model for wireless sensor deployment considering coverage and tracking applications. Accepted for publication in the International Journal of Sensor Networks. http:\/\/www.inderscience.com\/info\/ingeneral\/forthcoming.php?jcode=ijsnet ."},{"key":"2548_CR9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","volume":"31","author":"JE Beslay","year":"1987","unstructured":"Beslay, J. E. (1987). An algorithm for set covering problem. European Journal of Operational Research, 31, 85\u201393.","journal-title":"European Journal of Operational Research"},{"key":"2548_CR10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/1520-6750(199002)37:1<151::AID-NAV3220370110>3.0.CO;2-2","volume":"37","author":"JE Beslay","year":"1990","unstructured":"Beslay, J. E. (1990). A lagrangian heuristic for the set covering problem. Naval Research Logistics, 37, 151\u2013164.","journal-title":"Naval Research Logistics"},{"key":"2548_CR11","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"JE Beslay","year":"1996","unstructured":"Beslay, J. E., & Chu, P. C. (1996). A genetic algorithm for the set covering problem. European Journal of Operational Research, 94, 392\u2013404.","journal-title":"European Journal of Operational Research"},{"key":"2548_CR12","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Toth, P., & Fischetti, M. (2000). Algorithms for the set covering problem. Annals of Operations Research, 98, 353\u2013371.","journal-title":"Annals of Operations Research"},{"key":"2548_CR13","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-0-387-71921-4_3","volume-title":"Metaheuristics: Progress in complex systems optimization","author":"M Caserta","year":"2007","unstructured":"Caserta, M. (2007). Tabu search-based metaheuristic algorithm for large-scale set covering problems. In K. F. Doerner, et al. (Eds.), Metaheuristics: Progress in complex systems optimization (pp. 43\u201363). New York: Springer."},{"key":"2548_CR14","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V. (1979). A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4, 233\u2013235.","journal-title":"Mathematics of Operations Research"},{"key":"2548_CR15","doi-asserted-by":"crossref","unstructured":"Coello Coello, C. A., & Lechuga, M. S. (2002). Mopso : A proposal for multiple objective particle swarm. In Proceedings of the 2002 Congress on Evolutionary Computation, pp. 1051\u20131056.","DOI":"10.1109\/CEC.2002.1004388"},{"key":"2548_CR16","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Agrawal, S., Pratap, A., & Meyarivan, T. (2002). A fast and elitist multi-objective genetic algorithm : Nsga-ii. IEEE Transactions on Evolutionary Computation, 6, 182\u2013197.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"2548_CR17","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1287\/mnsc.36.6.674","volume":"36","author":"ML Fisher","year":"1990","unstructured":"Fisher, M. L., & Kedia, P. (1990). Optimal solution of set covering\/partitioning problems using dual heuristics. Management Science, 36, 674\u2013688.","journal-title":"Management Science"},{"key":"2548_CR18","doi-asserted-by":"crossref","unstructured":"Fusco, G., & Gupta, H. (2009). $$\\epsilon $$ \u03f5 -net approach to sensor k-coverage. In Proceedings of the 4th international conference on wireless algorithms, systems, and applications, pp. 104\u2013114.","DOI":"10.1007\/978-3-642-03417-6_11"},{"key":"2548_CR19","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.pmcj.2008.02.001","volume":"4","author":"A Ghosh","year":"2008","unstructured":"Ghosh, A., & Das, S. K. (2008). Coverage and connectivity issues in wireless sensor networks: A survey. Pervasive and Mobile Computing, 4, 303\u2013334.","journal-title":"Pervasive and Mobile Computing"},{"key":"2548_CR20","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0377-2217(96)00161-0","volume":"101","author":"T Grossman","year":"1997","unstructured":"Grossman, T., & Wool, A. (1997). Computational experience with approximation algorithms for the set covering problem. European Journal of Operational Research, 101, 81\u201392.","journal-title":"European Journal of Operational Research"},{"key":"2548_CR21","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/S0377-2217(96)00050-1","volume":"97","author":"S Haddadi","year":"1997","unstructured":"Haddadi, S. (1997). Simple lagrangian heuristic for the set covering problem. European Journal of Operational Research, 97, 200\u2013204.","journal-title":"European Journal of Operational Research"},{"key":"2548_CR22","doi-asserted-by":"crossref","first-page":"1767","DOI":"10.1016\/j.camwa.2008.10.037","volume":"57","author":"J Chen","year":"2009","unstructured":"Chen, J., Jia, J., Chang, G., Wen, Y., & Song, J. (2009). Multi-objective optimization for coverage control in wireless sensor network with adjustable sensing radius. Computer and Mathematics with Applications, 57, 1767\u20131775.","journal-title":"Computer and Mathematics with Applications"},{"key":"2548_CR23","doi-asserted-by":"crossref","first-page":"1756","DOI":"10.1016\/j.camwa.2008.10.036","volume":"57","author":"J Jia","year":"2009","unstructured":"Jia, J., Chen, J., Chang, G., & Tan, Z. (2009). Energy efficient coverage control in wireless sensor networks based on multi-objective genetic algorithm. Computer and Mathematics with Applications, 57, 1756\u20131766.","journal-title":"Computer and Mathematics with Applications"},{"key":"2548_CR24","doi-asserted-by":"crossref","unstructured":"Jourdan, D.B., & de Weck, O.L. (2004). Layout optimization for a wireless sensor network using a multi-objective genetic algorithm. In: 2004 IEEE 59th vehicular technology conference, 2004. VTC 2004-Spring. 5:2466\u20132470.","DOI":"10.1109\/VETECS.2004.1391366"},{"key":"2548_CR25","doi-asserted-by":"crossref","unstructured":"Karp, R.M. (1972). Reducibility amnong combinatorial problems. In Complexity of computer computations, pp. 85\u2013103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"2548_CR26","doi-asserted-by":"crossref","first-page":"2209","DOI":"10.1016\/j.comnet.2011.03.004","volume":"55","author":"WC Ke","year":"2011","unstructured":"Ke, W. C., Liu, B. H., & Tsai, M. J. (2011). The critical-square-grid coverage problem in wireless sensor networks is np-complete. Computer Networks, 55, 2209\u20132220.","journal-title":"Computer Networks"},{"key":"2548_CR27","doi-asserted-by":"crossref","first-page":"4117","DOI":"10.1016\/j.asoc.2011.02.031","volume":"11","author":"A Konstantinidis","year":"2011","unstructured":"Konstantinidis, A., & Yang, K. (2011). A multi-objective energy efficient dense deployment in wireless sensor networks using a hybrid problem specific moea\/d. Applied Soft Computing, 11, 4117\u20134134.","journal-title":"Applied Soft Computing"},{"key":"2548_CR28","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1016\/j.comnet.2009.08.010","volume":"54","author":"A Konstantinidis","year":"2010","unstructured":"Konstantinidis, A., Yang, K., Zhang, Q., & Zeinalipour-Yazti, D. (2010). A multi-objective evolutionay algorithm for the deployment and power assignment problem in wireless sensor networks. Computer Networks, 54, 960\u2013976.","journal-title":"Computer Networks"},{"key":"2548_CR29","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1016\/j.ejor.2005.09.028","volume":"176","author":"G Lan","year":"2007","unstructured":"Lan, G., DePuy, G. W., & Whitehouse, G. E. (2007). An effective and simple heuristic for the set covering problem. European Journal of Operational Research, 176, 1387\u20131403.","journal-title":"European Journal of Operational Research"},{"key":"2548_CR30","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/TSMCC.2010.2103310","volume":"42","author":"JY Lee","year":"2012","unstructured":"Lee, J. Y., Seok, J.-H., & Lee, J.-J. (2012). Multiobjective optimization approach for sensor arrangement in a complex indoor environment. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Applications and Reviews, 42, 174\u2013186.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B: Applications and Reviews"},{"key":"2548_CR31","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0377-2217(94)90401-4","volume":"79","author":"FB Lopes","year":"1994","unstructured":"Lopes, F. B., & Lorena, L. A. (1994). Surrogate heirstic for set covering problems. European Journal of Operational Research, 79, 138\u2013150.","journal-title":"European Journal of Operational Research"},{"key":"2548_CR32","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1109\/TSMCB.2009.2026633","volume":"40","author":"E Masazade","year":"2010","unstructured":"Masazade, E., Varshney, P. K., & Sendur, G. K. (2010). A multiobjective optimization approach to obtain decision thresholds for distributed detection in wireless sensor networks. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics, 40, 444\u2013457.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics"},{"key":"2548_CR33","unstructured":"Oh, S.C., Tan, C.H., Kong, F.W., Tan, Y.S., Ng, K.H., Ng, G.W., & Tai, K. (2007). Multiobjective optimization of sensor network deployment by a genetic algorithm. In The IEEE congress on evolutionary computation, pp. 3917\u20133921."},{"key":"2548_CR34","doi-asserted-by":"crossref","unstructured":"Pampara, G., & Engelbrecht, A.P. (2011). Binary artificial bee colony optimization. In The IEEE symposium on swarm intelligence, pp. 1\u20138.","DOI":"10.1109\/SIS.2011.5952562"},{"key":"2548_CR35","unstructured":"Pessoa, L. S., Resende, M. G. C., & Ribeiro, C. C. (2010). A hybrid lagrangean heuristic with grasp and path-relinking for set k-covering. Technical report, AT&T Labs Research."},{"key":"2548_CR36","doi-asserted-by":"crossref","unstructured":"Rebai, M., Khoukhi, I., Snoussi, H., & Hnaien, F. (2013). Linear models for the total coverage problem in wireless sensor networks. In: The 5th international conference on modeling, simulation and applied optimization, pp. 1\u20134.","DOI":"10.1109\/ICMSAO.2013.6552637"},{"key":"2548_CR37","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1016\/j.cie.2010.02.011","volume":"58","author":"Z-G Ren","year":"2010","unstructured":"Ren, Z.-G., Feng, Z.-R., Ke, L.-J., & Zhang, Z.-J. (2010). New ideas for applying ant colony optimization to the set covering problem. Computers & Industrial Engineering, 58, 774\u2013784.","journal-title":"Computers & Industrial Engineering"},{"key":"2548_CR38","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/opre.17.3.455","volume":"17","author":"R Roth","year":"1969","unstructured":"Roth, R. (1969). Computer solutions to minimum cover problems. Operations Research, 17, 455\u2013465.","journal-title":"Operations Research"},{"key":"2548_CR39","volume-title":"Art gallery theorems and algorithms","author":"JO Rourke","year":"1987","unstructured":"Rourke, J. O. (1987). Art gallery theorems and algorithms. Oxford: Oxford University Press."},{"key":"2548_CR40","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1016\/S0305-0548(01)00026-0","volume":"29","author":"M Solar","year":"2002","unstructured":"Solar, M., Parada, V., & Urrutia, R. (2002). A parallel genetic algorithm to solve the set covering problem. Computers & Operations Research, 29, 1221\u20131235.","journal-title":"Computers & Operations Research"},{"key":"2548_CR41","doi-asserted-by":"crossref","first-page":"1028","DOI":"10.1109\/TMC.2010.216","volume":"10","author":"X Wang","year":"2011","unstructured":"Wang, X., & Wang, S. (2011). Hierarchical deployment optimization for wireless sensor networks. IEEE Transactions on Mobile Computing, 10, 1028\u20131041.","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"2548_CR42","unstructured":"Wei, L.-C., Kang, C.-W., & Chen, J.-H. (2009). A force-driven evolutionary approach for multi-objective 3d differentiated sensor network deployment. In The IEEE 6th international conference on mobile adhoc and sensor systems, pp. 983\u2013988."},{"key":"2548_CR43","doi-asserted-by":"crossref","unstructured":"Wu, Y., Li, M., Cai, Z., & Zhu, E. (2008). A distributed algorithm to approximate node-weighted minimum $$\\alpha $$ \u03b1 -connected ( $$\\theta $$ \u03b8 , k)-coverage in dense sensor networks. In Proceedings of the 2nd annual international workshop on frontiers in algorithmics, pp. 221\u2013232.","DOI":"10.1007\/978-3-540-69311-6_24"},{"key":"2548_CR44","unstructured":"Ye, F., Zhong, G., Cheng, J., Lu, S., & Zhang, L. (2003). Peas: A robust energy conserving protocol for long-lived sensor networks. In Proceedings of the 23rd international conference on distributed computing systems, pp. 28\u201337."},{"key":"2548_CR45","first-page":"89","volume":"1","author":"H Zhang","year":"2005","unstructured":"Zhang, H., & Hou, J. C. (2005). Maintaining sensing coverage and connectivity in large sensor networks. Ad-hoc and Sensor Wireless Networks, 1, 89\u2013124.","journal-title":"Ad-hoc and Sensor Wireless Networks"},{"key":"2548_CR46","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/j.jnca.2011.11.016","volume":"35","author":"C Zhu","year":"2011","unstructured":"Zhu, C., Zheng, C., Shu, L., & Han, G. (2011). A survey on coverage and connectivity issues in wireless sensor networks. Journal of Network and Computer Applications, 35, 619\u2013632.","journal-title":"Journal of Network and Computer Applications"},{"key":"2548_CR47","unstructured":"Zitzler, E., & Thiele, L. (1998). An evolutionary algorithm for multiobjective optimization: The strength pareto approach. In Technical Report 43, Computer Engineering and Networks Laboratory (TIK), Swiss Federal Institute of Technology (ETH), Zurich."}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-015-2548-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-015-2548-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-015-2548-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T21:33:56Z","timestamp":1566509636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-015-2548-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,3]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["2548"],"URL":"https:\/\/doi.org\/10.1007\/s11277-015-2548-2","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,3]]}}}