{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T16:03:17Z","timestamp":1774454597098,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T00:00:00Z","timestamp":1698710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T00:00:00Z","timestamp":1698710400000},"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":["J Supercomput"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s11227-023-05721-2","type":"journal-article","created":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T15:02:38Z","timestamp":1698764558000},"page":"6946-6964","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Distributed homology-based algorithm for solving Set k-Cover problem in heterogeneous directional sensor networks"],"prefix":"10.1007","volume":"80","author":[{"given":"Marzieh","family":"Varposhti","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,31]]},"reference":[{"key":"5721_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3309665","volume":"52","author":"M Fiaz","year":"2019","unstructured":"Fiaz M, Mahmood A, Javed S, Jung SK (2019) Handcrafted and deep trackers: recent visual object tracking approaches and trends. ACM Comput Surv: CSUR 52:1\u201344","journal-title":"ACM Comput Surv: CSUR"},{"key":"5721_CR2","doi-asserted-by":"crossref","unstructured":"Abrams Z, Goel A, Plotkin S (2004) Set k-Cover algorithms for energy efficient monitoring in wireless sensor networks. In: Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks, pp 424\u2013432","DOI":"10.1145\/984622.984684"},{"key":"5721_CR3","doi-asserted-by":"publisher","first-page":"3620","DOI":"10.1109\/TNET.2016.2531688","volume":"24","author":"Z Zhang","year":"2016","unstructured":"Zhang Z, Willson J, Lu Z, Wu W, Zhu X, Du D-Z (2016) Approximating maximum lifetime k-coverage through minimizing weighted k-cover in homogeneous wireless sensor networks. IEEE\/ACM Trans Netw 24:3620\u20133633","journal-title":"IEEE\/ACM Trans Netw"},{"key":"5721_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1049\/iet-wss.2011.0085","volume":"2","author":"M Ashouri","year":"2012","unstructured":"Ashouri M, Zali Z, Mousavi S, Hashemi MR (2012) New optimal solution to disjoint set K-coverage for lifetime extension in wireless sensor networks. IET Wirel Sens Syst 2:31\u201339","journal-title":"IET Wirel Sens Syst"},{"key":"5721_CR5","doi-asserted-by":"publisher","first-page":"173402","DOI":"10.1007\/s11704-022-1781-6","volume":"17","author":"B Liu","year":"2023","unstructured":"Liu B, Yuan M, You H (2023) A hybrid-order local search algorithm for set k-cover problem in wireless sensor networks. Front Comput Sci 17:173402","journal-title":"Front Comput Sci"},{"key":"5721_CR6","doi-asserted-by":"crossref","unstructured":"Slijepcevic S, Potkonjak M (2001) Power efficient organization of wireless sensor networks. In: ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No. 01CH37240), pp 472\u2013476","DOI":"10.1109\/ICC.2001.936985"},{"key":"5721_CR7","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1142\/S021926590200063X","volume":"3","author":"M Cardei","year":"2002","unstructured":"Cardei M, MacCallum D, Cheng MX, Min M, Jia X, Li D et al (2002) Wireless sensor networks with energy efficient organization. J Interconnect Netw 3:213\u2013229","journal-title":"J Interconnect Netw"},{"key":"5721_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1109\/JCN.2019.000005","volume":"21","author":"R Elhabyan","year":"2019","unstructured":"Elhabyan R, Shi W, St-Hilaire M (2019) Coverage protocols for wireless sensor networks: review and future directions. J Commun Netw 21:45\u201360","journal-title":"J Commun Netw"},{"key":"5721_CR9","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/s12065-020-00374-z","volume":"13","author":"MK Singh","year":"2020","unstructured":"Singh MK (2020) Discovery of redundant free maximum disjoint Set-k-Covers for WSN life enhancement with evolutionary ensemble architecture. Evol Intell 13:611\u2013630","journal-title":"Evol Intell"},{"key":"5721_CR10","doi-asserted-by":"publisher","first-page":"107473","DOI":"10.1016\/j.asoc.2021.107473","volume":"108","author":"MB Dowlatshahi","year":"2021","unstructured":"Dowlatshahi MB, Rafsanjani MK, Gupta BB (2021) An energy aware grouping memetic algorithm to schedule the sensing activity in WSNs-based IoT for smart cities. Appl Soft Comput 108:107473","journal-title":"Appl Soft Comput"},{"key":"5721_CR11","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1109\/TCYB.2017.2731598","volume":"48","author":"C-C Liao","year":"2017","unstructured":"Liao C-C, Ting C-K (2017) A novel integer-coded memetic algorithm for the set k-cover problem in wireless sensor networks. IEEE Trans Cybern 48:2245\u20132258","journal-title":"IEEE Trans Cybern"},{"key":"5721_CR12","doi-asserted-by":"publisher","first-page":"72261","DOI":"10.1109\/ACCESS.2020.2988368","volume":"8","author":"J Li","year":"2020","unstructured":"Li J, Luo Z, Xiao J (2020) A hybrid genetic algorithm with bidirectional mutation for maximizing lifetime of heterogeneous wireless sensor networks. IEEE Access 8:72261\u201372274","journal-title":"IEEE Access"},{"key":"5721_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s11277-014-2004-8","volume":"80","author":"MF Abdulhalim","year":"2015","unstructured":"Abdulhalim MF, Attea BA (2015) Multi-layer genetic algorithm for maximum disjoint reliable set covers problem in wireless sensor networks. Wirel Pers Commun 80:203\u2013227","journal-title":"Wirel Pers Commun"},{"key":"5721_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/B978-0-12-801538-4.00012-4","volume-title":"Bio-inspired computation in telecommunications","author":"Z-H Zhan","year":"2015","unstructured":"Zhan Z-H, Zhang J (2015) Bio-inspired computation for solving the optimal coverage problem in wireless sensor networks: a binary particle swarm optimization approach. In: Yang XS, Chien SF, Ting TO (eds) Bio-inspired computation in telecommunications. Elsevier, Amsterdam, pp 263\u2013285"},{"key":"5721_CR15","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1109\/TCYB.2017.2691772","volume":"48","author":"C Sun","year":"2017","unstructured":"Sun C (2017) A time variant log-linear learning approach to the SET K-COVER problem in wireless sensor networks. IEEE Trans Cybern 48:1316\u20131325","journal-title":"IEEE Trans Cybern"},{"key":"5721_CR16","doi-asserted-by":"publisher","first-page":"2313","DOI":"10.1109\/TSMC.2021.3049580","volume":"52","author":"C Sun","year":"2021","unstructured":"Sun C, Wang X, Qiu H, Sun W, Zhou Q (2021) Toward refined Nash equilibria for the SET K-COVER problem via a memorial mixed-response algorithm. IEEE Trans Syst Man Cybern Syst 52:2313\u20132323","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"5721_CR17","doi-asserted-by":"publisher","first-page":"65604","DOI":"10.1109\/ACCESS.2018.2871963","volume":"6","author":"W Yan","year":"2018","unstructured":"Yan W, Cao M, Wu Y, Zhang J (2018) Greedy game algorithms for solving Set k-Cover problem in HWSNs. IEEE Access 6:65604\u201365619","journal-title":"IEEE Access"},{"key":"5721_CR18","doi-asserted-by":"publisher","first-page":"1522","DOI":"10.1109\/TIM.2011.2181781","volume":"61","author":"Q Wang","year":"2012","unstructured":"Wang Q, Yan W, Shen Y (2012) N-person card game approach for solving Set k-Cover problem in wireless sensor networks. IEEE Trans Instrum Meas 61:1522\u20131535","journal-title":"IEEE Trans Instrum Meas"},{"key":"5721_CR19","volume-title":"Algebraic topology","author":"A Hatcher","year":"2002","unstructured":"Hatcher A (2002) Algebraic topology. Cambridge Univ. Press, Cambridge"},{"key":"5721_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9475-4","volume-title":"Basic concepts of algebraic topology","author":"FH Croom","year":"1978","unstructured":"Croom FH (1978) Basic concepts of algebraic topology. Springer, New York"},{"key":"5721_CR21","unstructured":"Goldberg TE (2002) Combinatorial Laplacians of simplicial complexes. B.S. thesis, Bard College, New York"},{"key":"5721_CR22","volume-title":"Differential forms in algebraic topology","author":"R Bott","year":"1995","unstructured":"Bott R, Tu L (1995) Differential forms in algebraic topology. Springer, New York"},{"key":"5721_CR23","unstructured":"Muhammad A, Egerstedt M (2006) Control using higher order Laplacians in network topologies. In: Proceedings of the 17th International Symposium on Mathematical Theory of Networks and Systems, Kyoto, Japan, pp 1024\u20131038"},{"key":"5721_CR24","unstructured":"Boyd S, Xiao L, Mutapcic A (2003) Subgradient methods. Lecture notes of EE392o, Stanford University, Autumn Quarter, vol 2004, pp 2004\u20132005"},{"key":"5721_CR25","unstructured":"Nemirovskij AS, Yudin DB (1983) Problem complexity and method efficiency in optimization. Wiley-Interscience Series in Discrete Mathematics, John Wiley & Sons, New York"},{"key":"5721_CR26","unstructured":"Xu Y, Winter J, Lee W-C (2004) Prediction-based strategies for energy saving in object tracking sensor networks. In: International Conference on Mobile Data Management, Berkeley, CA"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05721-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05721-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05721-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T14:08:38Z","timestamp":1710511718000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05721-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,31]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["5721"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05721-2","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2740554\/v1","asserted-by":"object"}]},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,31]]},"assertion":[{"value":"11 October 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that she has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}