Abstract
One of the fundamental problems in randomly deployed sensor networks is enhancing the network lifetime while providing full area coverage. The problem is more challenging when location information is not available. Scheduling the activities of sensor nodes in a way that each point of the area of interest is covered by at least one sensor node is a promising way when a smaller set of sensor nodes is scheduled autonomously. The autonomous sleep scheduling of sensor nodes can be efficiently achieved based on the topological properties of the sensor network in a distributed fashion. In this paper, we address the problem of autonomously scheduling of sensor nodes to provide full area coverage in wireless sensor networks, even when location information is unavailable. The goal is to prolong the network lifetime. The proposed method is based on homology. The idea is autonomous selection of the minimum number of active sensors with the highest level of energy based on the properties of the simplicial complex of the network. We formulate this problem as an integer programming problem. Then, we propose a distributed algorithm, which does not require the knowledge of the location of nodes or distance between them. Finally, we provide simulation results demonstrating the performance of the proposed algorithm.
Similar content being viewed by others
Availability of data and materials
Not applicable.
References
Rahmani AM, Ali S, Malik MH, Yousefpoor E, Yousefpoor MS, Mousavi A et al (2022) An energy-aware and Q-learning-based area coverage for oil pipeline monitoring systems using sensors and Internet of Things. Sci Rep 12:9638
Elhabyan R, Shi W, St-Hilaire M (2019) Coverage protocols for wireless sensor networks: review and future directions. J Commun Netw 21:45–60
Idrees AK, Al-Yaseen WL (2021) Distributed genetic algorithm for lifetime coverage optimisation in wireless sensor networks. Int J Adv Intell Parad 18:3–24
Narayan V, Daniel A (2022) CHHP: coverage optimization and hole healing protocol using sleep and wake-up concept for wireless sensor network. Int J Syst Assur Eng Manag 13:546–556
Idrees AK, Couturier R (2022) Energy-saving distributed monitoring-based firefly algorithm in wireless sensors networks. J Supercomput 78:2072–2097
Boualem A, De Runz C, Ayaida M, Akdag H (2023) A fuzzy/possibility approach for area coverage in wireless sensor networks, Soft Comput pp. 1–16
Dande B, Chang C-Y, Liao W-H, Roy DS (2022) MSQAC: Maximizing the surveillance quality of area coverage in wireless sensor networks. IEEE Sens J 22:6150–6163
Jamali S, Hatami M (2015) Coverage aware scheduling in wireless sensor networks: An optimal placement approach. Wireless Pers Commun 85:1689–1699
Luo C, Hong Y, Li D, Wang Y, Chen W, Hu Q (2020) Maximizing network lifetime using coverage sets scheduling in wireless sensor networks. Ad Hoc Netw 98:102037
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
Katti A (2022) Target coverage in random wireless sensor networks using cover sets. J King Saud Univ Comput Inf Sci 34:734–746
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: Bio-Inspired Computation in Telecommunications, ed: Elsevier, 2015, pp. 263–285
Yan F, Ma W, Shen F, Xia W, Shen L (2020) Connectivity based k-coverage hole detection in wireless sensor networks. Mobile Netw Appl 25:783–793
Zhang J, Chu H, Feng X (2020) Efficient coverage hole detection algorithm based on the simplified rips complex in wireless sensor networks. J Sens 2020:1–13
Huang R, Dong Y, Bao G, Liu Y, Wei M, Lu J et al (2021) A new topology control algorithm in software defined wireless rechargeable sensor networks. IEEE Access 9:101003–101012
Barbarossa S, Sardellitti S (2020) Topological signal processing over simplicial complexes. IEEE Trans Signal Process 68:2992–3007
Ghrist R, Muhammad A (2005) Coverage and hole-detection in sensor networks via homology, In: Proceedings of the 4th international symposium on Information processing in sensor networks, Los Angeles, California, 2005, pp. 254–260
Vergne A, Decreusefond L, Martins P (2019) Computing the k-coverage of a wireless network. In: Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools, pp. 175–178
Yan F, Martins P, Decreusefond L (2014) Accuracy of homology based coverage hole detection for wireless sensor networks on sphere. Wirel Commun IEEE Trans 13:3583–3595
Yan F, Vergne A, Martins P and Decreusefond L (2014) Homology-based distributed coverage hole detection in wireless sensor networks, IEEE/ACM Trans Netw pp. 1–1
Chintakunta H, Krim H (2014) Distributed localization of coverage holes using topological persistence. IEEE Trans Signal Process 62:2531–2541
Varposhti M, Dehghan M, Safabakhsh R (2015) A distributed homological approach to location-independent area coverage in wireless sensor networks. Wirel Pers Commun 83:3075–3089
Xiang L, Yan F, Zhu Y, Xia W, Shen F, Xing S (2020) et al. A homology based coverage optimization algorithm for wireless sensor networks, In: Ad Hoc Networks: 11th EAI International Conference, ADHOCNETS 2019, Queenstown, New Zealand, November 18–21, 2019, Proceedings, 2020, pp. 288–301
Tahbaz-Salehi A, Jadbabaie A (2010) Distributed coverage verification in sensor networks without location information. IEEE Trans Autom Control 55:1837–1849
Varposhti M, Hakami V, Dehghan M (2020) Distributed coverage in mobile sensor networks without location information. Auton Robot 44:627–645
Xing G, Wang X, Zhang Y, Lu C, Pless R, Gill C (2005) Integrated coverage and connectivity configuration for energy conservation in sensor networks. ACM Trans Sen Netw 1:36–72
Hatcher A (2002) Algebraic Topology: Cambridge. Cambridge Univ. Press, U.K.
Goldberg TE (2002) Combinatorial laplacians of simplicial complexes.B.S. thesis, Bard College, New York
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, 2006, pp. 1024–1038.
Bott R and Tu L (1995) Differential Forms in Algebraic Topology: New york: Springer-Verlag
Silva VD, Ghrist R (2006) Coordinate-free coverage in sensor networks with controlled boundaries via homology. Int J Robot Res 25:1205–1222
Funding
No funding.
Author information
Authors and Affiliations
Contributions
I am the only author. I have done all the works by myself.
Corresponding author
Ethics declarations
Conflict of interest
The author declares that she has no conflict of interest.
Ethical approval
Not applicable.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Varposhti, M. Distributed homology-based sensor selection and scheduling in wireless sensor networks. J Supercomput 80, 6601–6621 (2024). https://doi.org/10.1007/s11227-023-05716-z
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-023-05716-z