The Improved Nonparametric Regression Model for the IoT Link Load Balancing Control Algorithm

In order to improve the load balance control e ﬀ ect of the Internet of Things link, this paper combines the nonparametric regression model to improve the load balancing algorithm of the Internet of Things link. Moreover, this paper proposes a load balancing research strategy based on data plane data ﬂ ow, which is aimed at improving the load balancing problem of data ﬂ ow in the link. The data center network uses a multilayer fat tree topology to store information in the ﬂ ow table corresponding to the switch for data ﬂ ow processing and forwarding operations. In addition, this paper constructs a load balancing model for intelligent Internet of Things link and veri ﬁ es the model in this paper through experimental research. The research results show that the load balancing control algorithm for Internet of Things link based on the nonparametric regression model proposed in this paper can e ﬀ ectively improve the internal scheduling of the Internet of Things link system and promote the load balancing e ﬀ ect.


Introduction
With the in-depth study of WSN by scientific researchers, they have found that it has a wide range of applications but also has shortcomings, such as sensor node energy, communication distance, computing, and storage capabilities that are very limited. Since each sensor node is powered by a battery with limited energy, the complicated deployment environment brings a lot of inconvenience to the battery replacement work [1]. In addition, with the exhaustion of sensor node energy and the addition of new sensor nodes, the topology of the network will change. In the traditional network hierarchy, only two adjacent layers can communicate with each other, and it is difficult to share information with each other between two nonadjacent layers. Therefore, there are great limitations, which can no longer be well adapted to the development needs of WSN [2]. How to design a good performance energy optimization algorithm to meet the high requirements of WSN on the network life cycle has become the research focus and difficulty of WSN in recent years [3].
High-rate wireless sensor network (HRWSN) integrates information perception, processing, and transmission and is widely used in military, industrial and agricultural control, biomedicine, environmental monitoring, disaster relief, and other fields. It is a key technical link from sensor networks to the Internet of Things and pervasive computing. In order to meet high-quality video surveillance, diversified information collection, complex task processing, high-precision positioning, and other applications, it is urgent to introduce information-rich images, audio, and video into high-rate sensor networks. High-rate sensor networks have the characteristics of rich sensing information, complex processing tasks, node movement, dynamic changes in topology, and severe energy limitation.
This paper combines the nonparametric regression model to improve the Internet of Things link load balancing algorithm, builds an intelligent model, and verifies the effectiveness of this model through research.

Related Work
Firstly, the research and practical application of WSN related theories are reviewed. Researchers have actively carried out research and practical application of WSN related theories and have put forward energy optimization schemes for sensor nodes one after another. Literature [4] proposed the LEACH (Low Energy Adaptive Clustering Hierarchy) algorithm, a typical representative of clustering routing algorithms. Through periodic random selection of cluster heads, each node has an equal probability of being a cluster head, and the network energy consumption is balanced to the entire network; [5] uses simulated annealing algorithm to divide the clusters, and the remaining energy of the nodes is considered when selecting the cluster heads; the number of times the nodes serve as cluster heads is considered in the literature [6]; the pLEACH algorithm proposed in the literature [7] divides the network, and the node with the highest remaining energy is selected as the cluster head in each subarea; literature [8] balances energy consumption by adjusting the data transmission rate; literature [9] improves the selection method of cluster heads and determines the remaining energy of nodes and neighbor nodes. The number and location information are considered; literature [10] uses fuzzy theory to calculate the probability of a node as a cluster head to improve the threshold formula; the LEACH-EC algorithm proposed in literature [11] optimizes the selection of cluster heads through the remaining energy and connectivity of the node In recent years, some new intelligent algorithms have also been proposed. Literature [12] uses particle swarm optimization (PSO) to optimize the selection of cluster heads; literature [13] uses the ant colony algorithm to optimize data transmission. Path. Literature [14] based on the cell membrane optimization algorithm to complete the clustering of nodes through the three factors of concentration, energy, and distance; in addition, some researchers have proposed new energy supply methods, but they are limited by the cost of WSN, and it is difficult to realize the consideration of volume. In literature [15], wireless charging is used for the sensor node to deal with the energy hole problem, and the literature [16] uses a smart solar energy collection system to provide stable power supply to the sensor node.
The data exchange process involves multiple sets of data fusion and data processing, which puts forward certain requirements for load balancing. The related work is analyzed below. The traditional data center network is generally a tree topology with two or three layers of switching structure. Although it can accommodate tens of thousands of servers, with the rapid expansion of the data center scale and the continuous influx of various new services, there is a tree-based data center. The structure shows the shortcomings of low utilization of network resources and poor scalability; so, the data center network topology has begun to transform to a new type of network structure. The structure of literature [17] has become a new and popular network topology with its simple structure, easy deployment, and the advantages of non-blocking transmission and halfbandwidth. According to its characteristics, the fat-tree structure generally adopts ECMP (equal cost multipathbased) or its improved technology to realize traffic forwarding. ECMP, as its name implies, uses multiple equivalent paths to forward traffic. It uses the diversity of the underlying path. When a packet arrives, it selects a path by modulo the number of paths obtained by the hash value of the header of the packet. In this way, the flow will be forwarded along the same path. Since the distribution probability of the value after the header of each flow is equalized, each path has an equal utilization rate, and to a certain extent, the flow can be balanced to achieve the effect of load balancing. However, ECMP also has its own characteristics and limitations. One of the most critical issues is that although most of the data center network traffic is small, a small amount of continuous large flow (we will define it as a stable flow later) accounts for the vast majority. For most bandwidth [18], once two or more long-lived stable flows choose the same egress for forwarding, congestion will occur, resulting in unbalanced distribution of link traffic, and seriously affecting network transmission performance. The test results in literature [19]. It means that the transmission performance can be reduced by 50% in this case. If it is just to balance the link traffic, you can also use packet-based polling and forwarding. This method forwards each message to each outlet in turn according to the FIFO principle, almost ensuring that the number of packets forwarded by each path is the same, but even if it is, the improved balance polling algorithm [20] also cannot avoid a problem; that is, packets arrive out of order. From the perspective of TCP flow, the out-ofsequence arrival of packets is regarded as link congestion, which reduces the sending window and significantly degrades TCP performance. In contrast, ECMP is more suitable for the fat-tree structure. How to implement a dynamic flow routing and scheduling to solve the congestion problem caused by stable flow aggregation in ECMP has become the focus of this paper. For traditional networks, data center network load balancing is performed on each network node, and it is impossible to obtain all node attributes and link information in real time during network operation. It is very difficult to achieve the abovementioned dynamic load balancing effect. But fortunately, with the emergence of SDN technology, the controller can communicate with switches that support the OpenFlow protocol through the OpenFlow protocol [21] to obtain real-time statistical information that can truly and effectively reflect the network status. Based on these statistical information, we can perform calculations more accurately and efficiently from a global perspective, which also makes it possible to implement the abovementioned dynamic load balancing algorithm.

Nonparametric Regression Model and Local Polynomial Regression Estimation
For n observations ðx 1 , Y 1 Þ, ⋯, ðx n , Y n Þ, the relationship between the response variable Y and the covariate x is defined by the following equation: Among them, r is the regression function, the variable x is also called feature, and the estimate of rðxÞ is denoted bŷ r n ðxÞ.
Under the conditions of Nadaraya-Watson kernel estimation, we consider choosing an estimator a ≡r n ðxÞ to 2 Journal of Sensors minimize the sum of squares ∑ n i=1 ðY i − aÞ 2 . We define the weight function w i ðxÞ = Kððx i − xÞ/hÞ and choose a ≡r n ðxÞ to minimize the following weighted sum of squares: The solution isr It happens to be a nuclear regression estimate. We use a local polynomial of porder to improve the estimation. For a value u in a neighborhood of x, the polynomial is In a neighborhood of x, we use the following polynomial to approximate a smooth regression function rðuÞ: We chooseâ = ðâ 0 ,⋯,â p Þ T that minimizes the following local weighted sum of squares to estimate a = ða 0 ,⋯,a p Þ T : It is estimated thatâ depends on x.âðxÞ = ðâ 0 ðxÞ,⋯,â p ðxÞÞ T , and the estimate of rð·Þ isr n ðuÞ = P x ðu ; aÞ. We set the following: : ð7Þ By minimizing formula (8), the weighted least squares estimate is obtained: n ðxÞ =â 0 ðxÞ is the inner product of the first row of

The local polynomial regression is estimated aŝ
Among them, The mean and variance of this estimate are The risk (mean square error) is We need to choose the smoothing parameter h. Ideally, we want to choose the RðhÞ that minimizes v. However, Rð hÞ depends on the unknown function rðxÞ. Instead, the esti-matedRðhÞ of RðhÞ will be minimized. We use the missing crossvalidation score defined below to estimate risk.
The missing crossvalidation score is defined as Among them,r ð−iÞ is the estimate obtained from the i-th Among them, In other words, the weight of x i is 0, and the other weights are reregularized so that their sum is 1.

Journal of Sensors
The intuitive meaning of crossvalidation is due to Predictive risk is equal to Rðr,r n Þ + σ 2 [21], and then EðRÞ equals predictive risk. In this way, the crossvalidation score is an almost unbiased estimate of risk.
For linear smoothers, there is a simple formula for calcu-latingRðhÞ.
r n is a linear smoother; then, the missing crossvalidation scoreRðhÞ can be written aŝ Among them, The smoothing parameter h can be selected by minimizing the crossvalidation scoreRðhÞ.
If we do not minimize the crossvalidation score, we can use another approximation method called generalized crossvalidation. Here, we replace each L ii with its average n −1 ∑ n i=1 L ii = V/n, and V = trðLÞ is the effective degree of freedom. This will minimize the following equation: Generally, the bandwidth that minimizes the generalized crossvalidation score is close to the bandwidth that minimizes the crossvalidation score.
By using approximate ð1 − xÞ −1 ≈ 1 + 2x, we can obtain Generally, for different choices of Θðn, hÞ, many common bandwidth selection criteria can be written as Then, allĥ,ĥ 0 and h 0 tend to 0 at the rate of n −1/5 . More-over, for some normal numbers C 1 , C 2 , σ 1 , σ 2 , there are In this way, the relative convergence rate ofĥ iŝ This slow convergence rate indicates that it is difficult to estimate the bandwidth. The convergence rate is essentially a question of bandwidth selection, because the following formula also holds:

Load Balancing Control Algorithm for Internet of Things Link Based on the Nonparametric Regression Model
The new SDN architecture puts forward the idea of completely separating the controller and the switch. The control plane realizes flexible control of data packets on the forwarding plane through custom programming, which provides a good platform for the innovative development of new networks and applications in the future. It connects the interaction between business applications, network services, and network devices through open interfaces, adopts a centralized control method, has more flexible software programmability, and can realize different network business logic. Among them, the network control layer provides an abstract network global view for the business application layer through the northbound interface API, so that the application layer can directly control the behavior of the network. It can also provide various application services for the network, mainly including network policies, security policies, QoS policies, and cloud services. The control layer and the underlying SDN switch realize data grouping and forwarding processing through the "control-forward" communication interface OpenFlow protocol. The biggest difference between an SDN network and a traditional computer network is that it can customize and flexibly manage the functions of network switching equipment through software programming. Among them, SDN has the three basic characteristics of separation of control and forwarding, open programmable interfaces, and logically centralized control, which brings great convenience to both network managers and application developers. The new SDN architecture is shown in Figure 1, which consists of four parts: an application plane, a control plane, a data plane, and a side management plane. Different interface protocols are used for communication 4 Journal of Sensors and interconnection between the various planes, so that the entire architecture has better perception and control capabilities. Different from the traditional network switching equipment, the SDN switching equipment architecture is shown in Figure 2. The controller is connected to the inherent switching equipment of the SDN data plane through the southbound interface protocol to implement data forwarding. This decoupling architecture design reduces the complexity of network device design and improves the scalability of hardware switching devices.
The OpenFlow protocol is the most commonly used southbound interface protocol for connecting the data plane and the control plane in the SDN architecture. It is a universal, open, and vendor-independent interface protocol. In the SDN network architecture, the OpenFlow protocol is a communication interface used for information exchange between the controller and the switch. The schematic diagram of the OpenFlow protocol architecture is shown in Figure 3. It allows the controller in the control plane to access and manage the switching equipment of the data plane by issuing flow table rules. That is to say, when a newly arrived data packet reaches the OpenFlow switch, it first searches for a match in the flow table. If there is a matching item, it will directly perform the forwarding process. If there is no matching item, the OpenFlow switch will upload the data packet to the controller through the interactive  According to the characteristics of data center network traffic that is relatively concentrated and burst, this paper proposes a load balancing research strategy based on data plane data flow, which is mainly aimed at the load balancing problem of data flow in the link. Data center networks usually adopt a multilayer fat tree topology. A top-level switch at the sending end can access the state information of the neighboring receiving-end switch or the bottom-level receiving-end switch through the next-level switch and save the information in the corresponding flow table of the switch for operations such as data flow processing and forwarding. The overall architecture diagram of the data flow processing of the switch data plane is shown in Figure 4, which includes a switch port module, a load balancing module, and a switch flow table module.
Under the premise of satisfying network connectivity and coverage, unnecessary communication links are eliminated through power control or backbone network node selection. The topology control algorithm is to simplify the densely deployed topology shown in Figure 5(a) to a simple topology through power control or the selection of backbone network nodes, respectively, as shown in Figure 5(b) or Figure 5(c), so as to achieve the purpose of improving node energy utilization rate and prolonging the network lifetime. In Figure 5, circles represent nodes, black nodes are selected backbone network nodes, and dotted lines represent communication links between nodes.
The architecture diagram of the load balancing application is shown in Figure 6. Mininet implements the data center topology, Iperf simulates virtual machine communication, and the proxy&iperfcontroller script is used to collect the traffic matrix and maintain the iperf process. The database is used to record network throughput and link load information. The web is used to display network status information and algorithm control operations. The main logic of the load balancing application is implemented on the floodlight controller.
As can be seen in Figure 6, the load balancing application is mainly composed of four components: link load collection components, traffic collection components, load balancing algorithm components, and routing configuration components. The entire load balancing application has two asynchronous execution processes, namely, the flow analysis process and the link load analysis process.
Each user in the rate sensor network can include multiple types of services. The system bandwidth is B, the number of users in the active period is K, the number of subcarriers   Journal of Sensors is N, and the bandwidth of each subcarrier is B/N. It is assumed that the system can obtain complete instantaneous state information of the channel and report the information to the base station in time through the error-free feedback channel. Assuming that N subcarriers are equally divided into n subchannels, the subchannels composed of subcarriers are almost flat fading channels. In order to improve spectrum utilization, adaptive modulation and coding (AMC) technology can be used on each subchannel. The system divides the system time in units of data frames, and each data frame time can be subdivided into S time slots. Assuming that the channel gain of each subchannel remains unchanged within each frame time, at the beginning of each frame, The base station estimates the state information CSI of each subchannel in the link according to the information fed back by the user. According to the two-dimensional allocatable resources (subchannels, time slots) of the system, the shared channel is divided into multiple time-frequency units as the smallest unit of resource allocation; that is, a certain subchannel is occupied in frequency, and a time slot is occupied in time.
(1 < n < N) and (1 < s < S), respectively, represent the subchannel sequence number and the sequence number within the data frame, so that there are a total of N × S block time-frequency units in a frame, and each time-frequency unit can only be one user occupied. At the MAC layer, the base station allocates an independent data queue with limited capacity for each user, and the service order of the queue is first-come, first-served. Based   Figure 7, the scheduling algorithm divides users into emergency users and nonemergency users according to different parameters of the MAC layer and the physical layer. Then, it adaptively sorts the packets according to the relationship between the user's information and the maximum packet delay that can be tolerated by the user's service. The groups are divided into emergency user compensation group, emergency user noncompensation group, nonemer-gency user compensation group, and nonemergency user noncompensation group. The physical layer sorts the carrier resources and then allocates subchannels and corresponding time slots to each packet according to the sorting results provided by the scheduling algorithm, the channel state information of each user, the number of packets in the user buffer, and the QoS requirements of the service. Finally, the number of packets sent by each user is fed back to the scheduling model.

Journal of Sensors
Under normal circumstances, high-speed sensor network nodes not only have the ability to sense and collect data but also have strong storage and processing capabilities. The real-time communication signal collected by the high-speed sensor node is first divided into multiple data blocks (tasks), and these tasks can be distributed to each high-speed sensor node for parallel processing. Nodes have certain storage and processing capabilities. Due to the realtime requirements of the task, the high-rate sensor network system not only needs the correctness of the task processing result but also ensures that the task can be completed within the specified time, and the final completion time of the task depends on the completion time of the last subtask. When the task is divided into multiple subtasks, all tasks of these complex applications need to be reasonably scheduled and allocated to the processing units of heterogeneous high-speed sensor nodes through a certain scheduling strategy, and task scheduling with the minimum completion time of the entire task is pursued. The quality of the scheduling algorithm directly affects the throughput rate of the task system, the success rate of scheduling, load balancing, and the QoS of the task. Scheduling algorithms for real-time tasks can be divided into two categories: static priority scheduling algorithm and dynamic priority scheduling algorithm.
The predetermined strategy of static priority scheduling is to schedule before the system starts running. Strict static scheduling cannot reschedule tasks while the system is running. The static scheduling algorithm has the advantages of simple implementation, low scheduling overhead, and good predictability when the system is overloaded. Generally, a static scheduling algorithm is used to schedule periodic tasks. The dynamic priority scheduling algorithm dynamically allocates the priority of tasks, and its purpose is to have greater flexibility in resource allocation and scheduling. The dynamic scheduling algorithm is usually used to schedule aperiodic (aperiodic) tasks. Because the emergency hospitals used by high-rate sensor networks have a high degree of uncertainty, the time of task arrival, the size of the data, and other parameters are uncertain, and the data is burst; so, dynamic scheduling algorithms should be adopted. Scheduling algorithms for real-time tasks are divided into preemptive and nonpreemptive scheduling, that is, whether the task will be interrupted by other tasks during execution. In this paper, a nonpreemptive dynamic scheduling algorithm is used to meet the requirements, which can greatly reduce the switching cost between execution tasks, and is especially suitable for emergency hospitals with large data volume and strict delay requirements.
In a heterogeneous high-speed sensor network system, the same task can be allocated to different nodes for processing, different nodes have different processing capabilities, and the same task has different processing times on different nodes. The scheduling model can be divided into a distributed scheduling model and a centralized scheduling model. In the distributed scheduling model, the arrival of local tasks is independent and can be scheduled in parallel with others. In the centralized scheduling model, all tasks are centrally processed in the scheduling processing unit. In this paper, a centralized scheduling model is adopted. Compared with distributed scheduling, the centralized scheduling model has two notable features. (1) The centralized scheduling model is simpler and easier than the distributed scheduling model. (2) By using backup scheduling, it is convenient to realize faulttolerant scheduling. In order to achieve the scheduling goal, this paper proposes a scheduling model based on crosslayer information on the basis of the traditional centralized scheduling model, as shown in Figure 8.
The schematic diagram of the communication between the sensor network and the IPv6 host is shown in Figure 9. IP-based wireless sensor networks are easier to achieve data interaction than other heterogeneous networks that use specific protocols. The Internet gateway enables end-to-end communication between sensing nodes and Internet hosts. Figure 10 shows the network topology structure diagram generated by the BA model in a circular monitoring area with a radius of 500 m, and 200 nodes are randomly deployed. The initial network consists of three interconnected node 3. At each subsequent time step, a new node and two links are added to the network. In Figure 10, circles represent nodes, black nodes are selected backbone network nodes, and dotted lines represent communication links between nodes.
On the basis of the above model, the effect of the IoT sensor parameter regression processing is performed on   Journal of Sensors the model in this paper, and the results shown in Table 1 are obtained.
From the effect of IoT sensor parameter regression processing, the effect evaluation of the IoT sensor parameter regression method proposed in this paper is above 85; so, it has a good effect.
From the above research, it can be seen that the nonparametric regression model proposed in this paper can play a certain role in the sensor parameter regression of the Inter-net of Things. The load balancing control effect of this model is verified on this infrastructure, and the results shown in Table 2 below are obtained.
From the load balancing effect, the evaluation of the load balancing control algorithm based on the nonparametric regression model of the Internet of Things link proposed in this paper is above 70; so, it has a good effect.
It can be seen from the above research that the IoT link load balancing control algorithm based on the

Conclusion
The high-rate sensor network handles multiple mixed services including data, voice, video, web browsing, file transfer, and multimedia applications. In different applications, data, voice, and video information have different requirements for transmission quality parameters such as bandwidth and delay. The amount of data in high-rate sensor networks is relatively large, various types of services have different requirements for the network QoS mechanism, and the resource constraints of sensor nodes are relatively more severe. Therefore, ensuring the QoS requirements of multiple services while meeting the energy constraints of highrate sensor networks has put forward an urgent need for the optimization of the overall performance of high-rate sensor networks. How to coordinate the characteristic parameters of each sublayer in the high-rate sensor network to improve the overall network performance is a new challenge to the hierarchical protocol design of traditional wireless sensor networks. The effect evaluation of the IoT sensor parameter regression method proposed in this paper is above 85, the evaluation of the load balancing control algorithm based on the nonparametric regression model of the Internet of Things link proposed in this paper is above 70, and this paper combines the nonparametric regression model to improve the Internet of Things link load balancing algorithm, builds an intelligent model, and verifies the effectiveness of this model through research.

Data Availability
The labeled dataset used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest
The author declares no competing interests.