Abstract
In order to better improve the reliability of data transmission and extend the network lifetime, the paper proposes the Sensing Clustering Routing Algorithm Based on Collaborative Computing (SCR-CC). The proposed algorithm uses the characteristics of the perceptual radius, which obey the normal distribution, and gives the process of completing the expected value of the data transmission of any two nodes in the cluster. Secondly, the paper analysed the necessary conditions of the existence for the expected value of the number of neighbour nodes when the redundant nodes are closed and the working nodes meet arbitrary differences. Thirdly, the cluster angle formed by the base station and the cluster is used to optimize the clustering structure and complete the dynamic clustering process to achieve the energy balance of the entire network. Finally, the simulation experiments show that the proposed SCR-CC algorithm compared with the other three algorithms reduces the number of failed nodes by 11.37% on average and increases the network lifetime by 27.09% on average; therefore, the efficiency and effectiveness of the SCR-CC algorithm are verified.
Highlights
In the initial stage of the network, the sensor node transmits the collected data directly or indirectly to the sink node through wireless communication, and the sink node sends the data to the management end in a wireless or wired way. e process forms an uplink for data transmission, and the control terminal can send instructions, monitoring tasks, and resource configuration commands to the sensor nodes through this link, and the process forms an uplink for transmission of control commands
Based on the advantages of the abovementioned plane routing and hierarchical routing, this paper proposes a Sensing Clustering Routing Algorithm Based on Collaborative Computing (SCR-CC)
In order to evaluate the system further, this paper uses MATLAB2017b to randomly deploy 3500 sensor nodes in a square area of 100 × 100 m2, 300 × 300 m2, and 500 × 500 m2
Summary
Many scholars at home and abroad have carried out in-depth and detailed research work on routing protocols. E protocol neither does any maintenance on the network nor does any calculations on routing; it only requires the sensor nodes that receive the data information to send data packets out in a broadcast manner. E algorithm firstly uses a data collection algorithm to calculate the location information of each node according to the structured entropy value and completes the process of mapping an event monitoring area, assisting in the construction of the location of neighboring nodes to reduce energy consumption. Irdly, cluster members use a certain time unit as a period parameter to transmit data to the cluster head node to achieve the purpose of limiting the energy consumption of sensor nodes. Literature [39] proposed a clustering routing protocol with real-time access to data information, which uses a multicluster structure of operation. The effectiveness of the algorithm in this paper is verified by simulation experiments
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
