An Efficient design of Point and Area Sweep-Coverage founded Systems for Wireless Sensor Networks
Keywords:
WSN, PoI, SN, Sweep CoverageAbstract
The mobility of WSNs creates a number of challenges, some of which include planning for mobile data collectors and charging trucks. Other challenges include providing coverage. Communication in WSNs often takes place on a hop-by-hop basis between nodes and base stations. Managing connections that involve multiple hops between the sink node and the sensor nodes might be challenging. This is a significant challenge because it evaluates the degree to which WSN sensor nodes cover a given target. The process of continually monitoring a particular point of interest (PoI) over the course of time is referred to as sweep coverage. However, using static SNs for continuous coverage results in an increase in the amount of energy required. In place of continuous monitoring, periodic monitoring may at times be sufficient for determining content, and it also requires significantly less energy. T-sweep coverage refers to the process by which SNs cover a target's points or sub-area after a certain length of time t has passed. It is NP-hard to select the best possible combination of mobile SNs in order to maintain a constant sweep speed while ensuring coverage. The purpose of this study is to address the issue of sweep coverage for a particular point of interest by presenting a new method that uses an approximation of 1.5. There are two different ways to approximate the best possible solution to the point sweep-coverage difficulty found in the research. The A-SCA model's objective is to cover the AoI with a limited number of mobile SNs as much as possible. When most people think about the problem of area sweep coverage, they immediately think of the method known as the 22 approximation. The suggested techniques have been demonstrated, via extensive simulation and analysis, to dramatically minimize the amount of mobile SNs when compared to the state-of-the-art methodologies.
Downloads
References
Gautam K. Das, Robert Fraser, Alejandro L´opez-Ortiz, and Bradford G. Nickerson. On the discrete unit disk cover problem. In WALCOM, pages 146–157, 2011.
Dinesh Dash, Arijit Bishnu, Arobinda Gupta, and Subhas C. Nandy. Approximation algorithms for the deployment of sensors for line segment coverage in wireless sensor networks. In COMSNETS, pages 1–10, 2012.
Nguyen, N.T.; Liu, B.H.; Wang, S.Y. On new approaches of maximum weighted target coverage and sensor connectivity: Hardness and approximation. IEEE Trans. Netw. Sci. Eng. 2019, 7, 1736–1751.
Liang, D.; Shen, H.; Chen, L. Maximum Target Coverage Problem in Mobile Wireless Sensor Networks. Sensors 2021, 21, 184.
Khalesian, M.; Delavar, M.R. Wireless sensors deployment optimization using a constrained Pareto-based multi-objective evolutionary approach. Eng. Appl. Artif. Intell. 2016, 53, 126–139.
Kong, L.; Zhao, M.; Liu, X.Y.; Lu, J.; Liu, Y.; Wu, M.Y.; Shu, W. Surface coverage in sensor networks. IEEE Trans. Parallel Distrib. Syst. 2014, 25, 234–243.
Li, S.; Shen, H. Minimizing the maximum sensor movement for barrier coverage in the plane. In Proceedings of the 2015 IEEE Conference on Computer Communications (INFOCOM), Hong Kong, China, 26 April–1 May 2015; pp. 244–252.
Kim, D.; Wang, W.; Son, J.; Wu, W.; Lee, W.; Tokuta, A.O. Maximum lifetime combined barrier-coverage of weak static sensors and strong mobile sensors. IEEE Trans. Mob. Comput. 2016, 16, 1956–1966.
Guo, J.; Jafarkhani, H. Movement-Efficient Sensor Deployment in Wireless Sensor Networks with Limited Communication Range. IEEE Trans. Wirel. Commun. 2019, 18, 3469–3484.
Gao, X.; Chen, Z.; Wu, F.; Chen, G. Energy Efficient Algorithms for k -Sink Minimum Movement Target Coverage Problem in Mobile Sensor Network. IEEE/ACM Trans. Netw. 2017, 25, 3616–3627.
Elhoseny, M.; Tharwat, A.; Yuan, X.; Hassanien, A.E. Optimizing K-coverage of mobile WSNs. Expert Syst. Appl. 2018, 92, 142–153.
Yu, Z.; Zhou, J.; Guo, W.; Guo, L.; Yu, Z. Participant selection for t-sweep k-coverage crowd sensing tasks. World Wide Web 2017, 21, 741–758.
Huang, P.; Lin, F.; Liu, C.; Gao, J.; Zhou, J.l. ACO-Based Sweep Coverage Scheme in Wireless Sensor Networks. J. Sens. 2015, 2015, 484902.
Li, J.; Xiong, Y.H.; She, J.H.; Wu, M. A Path Planning Method for Sweep Coverage With Multiple UAVs. IEEE Internet Things J. 2020, 7, 8967–8978.
Wu, L.G.; Xiong, Y.H.; Wu, M.; He, Y.; She, J.H. A Task Assignment Method for Sweep Coverage Optimization Based on Crowdsensing. IEEE Internet Things J. 2019, 6, 10686–10699.
Gorain, B.; Mandal, P.S. Approximation algorithm for sweep coverage on graph. Inf. Process. Lett. 2015, 115, 712–718.
K. P. Ferentinos, N. Katsoulas, A. Tzounis, T. Bartzanas, and C. Kittas, “Wireless sensor networks for greenhouse climate and plant condition assessment,” Biosystem Engineering, vol. 153, pp. 70–81, 2017.
M. Elhoseny, A. Tharwat, and A. E. Hassanien, “Bezier curve based path planning in a dynamic field using modified genetic algorithm,” Journal of Computational Science, vol. 25, pp. 339–350, 2018.
K. Cho and Y. Cho, “Hyperledger fabric-based proactive defense against inside attackers in the WSN with trust mechanism,” Electronics, vol. 9, no. 10, p. 1659, 2020.
M. N. U. Islam, A. Fahmin, M. S. Hossain, and M. Atiquzzaman, “Denial-of-service attacks on wireless sensor network and defense techniques,” Wireless Personal Communications, vol. 116, no. 3, pp. 1993–2021, 2021.
M. Chandrakala, G. Dhanalakshmi, and K. Rajesh, “Iot-based autonomous energy-efficient WSN platform for home/office automation using raspberry pi,” in Computer Networks and Inventive Communication Technologies. Springer, 2022, pp. 399–411.
K. F. Hasan, C. Wang, Y. Feng, and Y.-C. Tian, “Time synchronization in vehicular ad-hoc networks: A survey on theory and practice,” Vehicular communications, vol. 14, pp. 39–51, 2018.
S. Yu, J. Lee, K. Lee, K. Park, and Y. Park, “Secure authentication protocol for wireless sensor networks in vehicular communications,” Sensors, vol. 18, no. 10, p. 3191, 2018.
Gazis and E. Katsiri, “A wireless sensor network for underground passages: Remote sensing and wildlife monitoring,” Engineering Reports, vol. 2, no. 6, p. e12170, 2020.
V. Vijayakumar and N. Balakrishnan, “Artificial intelligence-based agriculture automated monitoring systems using WSN,” Journal of Ambient Intelligence and Humanized Computing, pp. 1–8, 2021.
Krishna, K. S. ., Satish, T. ., & Mishra, J. . (2023). Machine Learning-Based IOT Air Quality and Pollution Detection. International Journal on Recent and Innovation Trends in Computing and Communication, 11(2s), 132–145. https://doi.org/10.17762/ijritcc.v11i2s.6036
Mondal, D., & Patil, S. S. (2022). EEG Signal Classification with Machine Learning model using PCA feature selection with Modified Hilbert transformation for Brain-Computer Interface Application. Machine Learning Applications in Engineering Education and Management, 2(1), 11–19. Retrieved from http://yashikajournals.com/index.php/mlaeem/article/view/20
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.
IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.
