Redundant Node Scheduling Algorithm for Wireless Sensor Networks Based on Topology Structure
Wireless sensor networks face issues such as high energy consumption and the impact of individual node failures on the entire network. In order to effectively regulate redundant nodes to balance node coverage and energy consumption in the network, the Ditian algorithm is introduced and initialized....
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10994509/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849715245065437184 |
|---|---|
| author | Lijuan Shi jun zheng |
| author_facet | Lijuan Shi jun zheng |
| author_sort | Lijuan Shi |
| collection | DOAJ |
| description | Wireless sensor networks face issues such as high energy consumption and the impact of individual node failures on the entire network. In order to effectively regulate redundant nodes to balance node coverage and energy consumption in the network, the Ditian algorithm is introduced and initialized. The computation structure is reconstructed through adaptive adjustment, and the discrimination of redundant nodes is optimized. Meanwhile, the cluster topology is added to wireless sensor networks to control network nodes and complete the information transmission process. The experimental results showed that the improved Ditian had an average remaining energy of 3.6J after 600 runs. In the validation set, the energy efficiency was further improved, with an average remaining energy of 1.92J and a standard deviation of 0.51J. When the RMSE threshold was 0.8, the network lifetime reached 11 minutes, and the running time was significantly better than comparison algorithms. Furthermore, in the simulation experiment verification, the working state nodes of the proposed hybrid algorithm accounted for 1/5 of the total nodes, and the lifespan of the regional network could reach 1,098 seconds, with a duration better than common algorithms. The above results indicate that the algorithm can effectively improve energy utilization, expand its application in multiple fields, and provide new solutions for the efficient operation of wireless sensor networks. |
| format | Article |
| id | doaj-art-4a2f7e9ec2da491394e41d50d75e8907 |
| institution | DOAJ |
| issn | 2169-3536 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj-art-4a2f7e9ec2da491394e41d50d75e89072025-08-20T03:13:27ZengIEEEIEEE Access2169-35362025-01-0113847528476410.1109/ACCESS.2025.356846410994509Redundant Node Scheduling Algorithm for Wireless Sensor Networks Based on Topology StructureLijuan Shi0https://orcid.org/0009-0001-8252-5331jun zheng1School of Cyberspace Security, Changzhou College of Information Technology, Changzhou, ChinaCollege of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, ChinaWireless sensor networks face issues such as high energy consumption and the impact of individual node failures on the entire network. In order to effectively regulate redundant nodes to balance node coverage and energy consumption in the network, the Ditian algorithm is introduced and initialized. The computation structure is reconstructed through adaptive adjustment, and the discrimination of redundant nodes is optimized. Meanwhile, the cluster topology is added to wireless sensor networks to control network nodes and complete the information transmission process. The experimental results showed that the improved Ditian had an average remaining energy of 3.6J after 600 runs. In the validation set, the energy efficiency was further improved, with an average remaining energy of 1.92J and a standard deviation of 0.51J. When the RMSE threshold was 0.8, the network lifetime reached 11 minutes, and the running time was significantly better than comparison algorithms. Furthermore, in the simulation experiment verification, the working state nodes of the proposed hybrid algorithm accounted for 1/5 of the total nodes, and the lifespan of the regional network could reach 1,098 seconds, with a duration better than common algorithms. The above results indicate that the algorithm can effectively improve energy utilization, expand its application in multiple fields, and provide new solutions for the efficient operation of wireless sensor networks.https://ieeexplore.ieee.org/document/10994509/Topology structurewireless sensorsnode schedulingconnected control set algorithmnetwork redundant nodes |
| spellingShingle | Lijuan Shi jun zheng Redundant Node Scheduling Algorithm for Wireless Sensor Networks Based on Topology Structure IEEE Access Topology structure wireless sensors node scheduling connected control set algorithm network redundant nodes |
| title | Redundant Node Scheduling Algorithm for Wireless Sensor Networks Based on Topology Structure |
| title_full | Redundant Node Scheduling Algorithm for Wireless Sensor Networks Based on Topology Structure |
| title_fullStr | Redundant Node Scheduling Algorithm for Wireless Sensor Networks Based on Topology Structure |
| title_full_unstemmed | Redundant Node Scheduling Algorithm for Wireless Sensor Networks Based on Topology Structure |
| title_short | Redundant Node Scheduling Algorithm for Wireless Sensor Networks Based on Topology Structure |
| title_sort | redundant node scheduling algorithm for wireless sensor networks based on topology structure |
| topic | Topology structure wireless sensors node scheduling connected control set algorithm network redundant nodes |
| url | https://ieeexplore.ieee.org/document/10994509/ |
| work_keys_str_mv | AT lijuanshi redundantnodeschedulingalgorithmforwirelesssensornetworksbasedontopologystructure AT junzheng redundantnodeschedulingalgorithmforwirelesssensornetworksbasedontopologystructure |