Coverage and Routing Optimization of Wireless Sensor Networks Using Improved Cuckoo Algorithm

Wireless sensor networks have gradually attracted widespread attention from academia and industry due to their wide application potential and versatility. In response to the coverage and routing issues of wireless sensor networks, this study combines the improved cuckoo algorithm and non-uniform clu...

Full description

Bibliographic Details
Main Authors: Jian Yang, Yimin Xia
Format: Article
Language:English
Published: IEEE 2024-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/10466565/
_version_ 1797243321480904704
author Jian Yang
Yimin Xia
author_facet Jian Yang
Yimin Xia
author_sort Jian Yang
collection DOAJ
description Wireless sensor networks have gradually attracted widespread attention from academia and industry due to their wide application potential and versatility. In response to the coverage and routing issues of wireless sensor networks, this study combines the improved cuckoo algorithm and non-uniform clustering algorithm to design a coverage and routing optimization scheme for wireless sensor networks. Firstly, a wireless sensor network system is studied and built. Subsequently, the traditional cuckoo algorithm is optimized using the Cauchy distribution, and a coverage optimization scheme for wireless sensor networks based on the Cauchy distribution improved cuckoo algorithm is designed. Finally, by optimizing the dynamic range of network area and cluster radius respectively to improve the shortcomings of non-uniform clustering routing algorithms, a wireless sensor networks routing optimization scheme based on dynamic cluster radius optimization non-uniform clustering algorithm is designed. The research results indicated that the designed coverage scheme and routing scheme achieved good application results. Among them, the designed coverage scheme had a minimum running time of 0.89 minutes in node coverage problems and a maximum node coverage rate of 99.52%. The designed routing scheme had a minimum running time of 1.47 minutes and an energy loss rate of 0.84% in the routing optimization problem. In summary, the coverage scheme and routing optimization scheme designed by this research institute have good application effects and can provide certain technical support for the application of wireless sensor networks in other fields.
first_indexed 2024-04-24T18:53:16Z
format Article
id doaj.art-b41095780e5541c1bc44097b47a18163
institution Directory Open Access Journal
issn 2169-3536
language English
last_indexed 2024-04-24T18:53:16Z
publishDate 2024-01-01
publisher IEEE
record_format Article
series IEEE Access
spelling doaj.art-b41095780e5541c1bc44097b47a181632024-03-26T17:47:46ZengIEEEIEEE Access2169-35362024-01-0112395643957710.1109/ACCESS.2024.337588610466565Coverage and Routing Optimization of Wireless Sensor Networks Using Improved Cuckoo AlgorithmJian Yang0https://orcid.org/0009-0001-8299-3434Yimin Xia1School of Automation, Guangdong University of Technology, Guangzhou, ChinaSchool of Integrated Circuits, Guangdong University of Technology, Guangzhou, ChinaWireless sensor networks have gradually attracted widespread attention from academia and industry due to their wide application potential and versatility. In response to the coverage and routing issues of wireless sensor networks, this study combines the improved cuckoo algorithm and non-uniform clustering algorithm to design a coverage and routing optimization scheme for wireless sensor networks. Firstly, a wireless sensor network system is studied and built. Subsequently, the traditional cuckoo algorithm is optimized using the Cauchy distribution, and a coverage optimization scheme for wireless sensor networks based on the Cauchy distribution improved cuckoo algorithm is designed. Finally, by optimizing the dynamic range of network area and cluster radius respectively to improve the shortcomings of non-uniform clustering routing algorithms, a wireless sensor networks routing optimization scheme based on dynamic cluster radius optimization non-uniform clustering algorithm is designed. The research results indicated that the designed coverage scheme and routing scheme achieved good application results. Among them, the designed coverage scheme had a minimum running time of 0.89 minutes in node coverage problems and a maximum node coverage rate of 99.52%. The designed routing scheme had a minimum running time of 1.47 minutes and an energy loss rate of 0.84% in the routing optimization problem. In summary, the coverage scheme and routing optimization scheme designed by this research institute have good application effects and can provide certain technical support for the application of wireless sensor networks in other fields.https://ieeexplore.ieee.org/document/10466565/Cuckoo algorithmwireless networksensorsroutersignal coveragenode
spellingShingle Jian Yang
Yimin Xia
Coverage and Routing Optimization of Wireless Sensor Networks Using Improved Cuckoo Algorithm
IEEE Access
Cuckoo algorithm
wireless network
sensors
router
signal coverage
node
title Coverage and Routing Optimization of Wireless Sensor Networks Using Improved Cuckoo Algorithm
title_full Coverage and Routing Optimization of Wireless Sensor Networks Using Improved Cuckoo Algorithm
title_fullStr Coverage and Routing Optimization of Wireless Sensor Networks Using Improved Cuckoo Algorithm
title_full_unstemmed Coverage and Routing Optimization of Wireless Sensor Networks Using Improved Cuckoo Algorithm
title_short Coverage and Routing Optimization of Wireless Sensor Networks Using Improved Cuckoo Algorithm
title_sort coverage and routing optimization of wireless sensor networks using improved cuckoo algorithm
topic Cuckoo algorithm
wireless network
sensors
router
signal coverage
node
url https://ieeexplore.ieee.org/document/10466565/
work_keys_str_mv AT jianyang coverageandroutingoptimizationofwirelesssensornetworksusingimprovedcuckooalgorithm
AT yiminxia coverageandroutingoptimizationofwirelesssensornetworksusingimprovedcuckooalgorithm