The wireless sensor network (WSN) is composed of several sensor nodes organized by multi-hop self-organization, which is a typical network for the industrial internet in industrial application. However, the energy using and processing capacity of each node are greatly limited. Therefore, it is of great significance to study energy-saving and efficient communication protocols for WSN. To prolong the lifetime of WSN and improve network throughput, a high throughput routing protocol with balanced energy consumption is proposed. The designed protocol first employs the K-means clustering algorithm to cluster the nodes, then calculates the weights based on the residual energy of and distance between the nodes, and finally selects the best node as the cluster head. Moreover, the optimal size of the package is determined by the parameters of the wireless transceiver and the channel conditions. In the data transmission stage, the Dijkstra algorithm is used to calculate the multi-objective weight function as the link cost. Experimental results demonstrate the superior performance of the proposed protocol over the CERP and TEEN routing protocols in terms of energy saving of network nodes, so as to improve the throughput and survival time of the entire system.

that, we train the neural network's sample set, and add the momentum item to correct the weight, so that the neural network can be predicted more quickly and accurately. The main idea of this paper is to predict the future data based on the historical data which are collected by sensor nodes, so as to achieve the purpose of reducing the amount of data transmission in the network and saving the energy of nodes.Finally, the experimental results show that the improved particle swarm optimization algorithm based on weight improved particle swarm optimization neural network algorithm has higher accuracy than the multiple regression method and the grey prediction method. In addition, the method can be used to effectively save energy in wireless sensor data transmission.

No abstract

In wireless sensor networks (WSN)

Range query is the hot topic of the privacy-preserving data publishing. To preserve privacy, the large range query means more accumulate noise will be injected into the input data. This study presents a research on differential privacy for range query via Haar wavelet transform and Gaussian mechanism. First, the noise injected into the input data via Laplace mechanism is analyzed, and we conclude that it is difficult to judge the level of privacy protection based on the Haar wavelet transform and Laplace mechanism for range query because the sum of independent random Laplace variables is not a variable of a Laplace distribution. Second, the method of injecting noise into Haar wavelet coefficients via Gaussian mechanism is proposed in this study. Finally, the maximum variance for any range query under the framework of Haar wavelet transform and Gaussian mechanism is given. The analysis shows that using Haar wavelet transform and Gaussian mechanism, we can preserve the differential privacy for each input data and any range query, and the variance of noise is far less than that just using the Gaussian mechanism. In an experimental study on the dataset age extracted from IPUM’s census data of the United States, we confirm that the proposed mechanism has much smaller maximum variance of noises than the Gaussian mechanism for range-count queries.