Due to characteristics of small size, passive operation, easy deployment, real-time monitoring and data collection, wireless sensor networks are widely used in the field of the Internet of Things (IoT). However, sensor networks face challenges related to limited energy and short lifespan. In order to improve network energy efficiency and extend the lifecycle of WSN, we propose a multi factor competitive clustering routing algorithm based on K-Means and weighted inter standard correlation, denoted as MC-CRITIC-KM. Firstly, in the clustering stage, the K-Means algorithm is used to cluster the sensor network nodes. Secondly, in the selection of the cluster head stage, considering factors such as residual energy, distance, density, and load rate, as well as the objectivity of the WSN environment, the CRITIC weighting method is used to weight the factors. The objectivity of the CRITIC standard eliminates the subjective impact of adjusting the weights of each factor. Finally, four factors and their respective weights are designed to change in each round of data collection to adapt to the high dynamic changes of the sensor network in subsequent rounds. The simulation results show that this scheme is superior to LEACH, KMeans-LEACH, EEUC, IACA routing protocols in terms of network node energy efficiency, and improves the energy efficiency and lifecycle of the entire system.
Ultra-Dense Network (UDN) is one of the key techniques for the next generation of mobile network due to providing high system throughput. However, severe interference often occurs in UDN, which greatly impact the data rates of cell-edge users. User-centric wireless access virtualization has been widely adopted in UDN to mitigate the interference of cell-edge users by sharing resources and eliminating cell boundary. However, it's only effective for moderate scale networks. Moreover, the efficiency needs further improvement. In this paper, we study effective cooperative clustering method for large scale UDN with less computations in order to improve the throughput of cell-edge users. We formulate a convex optimization problem in which the objective is to maximize the system throughput with overlapping virtual cells. We propose a clustering method to solve this optimization problem. We design a fast-convergent iterative algorithm called K-Nearest Neighbor (KNN) algorithm to perform users clustering. Simulation results show that our proposed algorithm has better throughput performance for both average and cell-edge users. Especially, the per-carrier throughput is improved, which leads to more serviceable users with limited resources.
In recent years, deep artificial neural networks have attracted much attention and have been applied in various fields because they surpass the parameter fitting effect of traditional methods under the condition of data convergence. On the other hand, limited transmission bandwidth and storage capacity make image compression necessary in communication. Here, a compression algorithm that combines the K‐means clustering algorithm with the neural network algorithm is proposed. First, the pixel points of the image are clustered by K‐means algorithm in order to reduce the amount of data input to the neural network algorithm. Secondly, neural network is used to extract image features which realizes further compression. The experiment results show that the peak signal‐to‐noise ratio (PSNR) is 33.48 dB at most with compression ratio at 32:1. The ablation experiment shows that the run time speeds up 9.5% compared to the algorithm without K‐means clustering. Comprehensive comparison experiment shows that the average PSNR is 30.09 dB, which is larger than other baseline approaches. The proposed algorithm is an efficient solution for image compression.
The technology of unmanned aerial vehicles (UAVs) is extensively utilized across various domains due to its exceptional mobility, cost-effectiveness, rapid deployment, and flexible configuration. However, its limited storage space and the contradiction between the large amount of image data returned and the limited bandwidth in emergency scenarios necessitate the development of a suitable UAVs image compression technology. In this research, we propose an image splicing compression algorithm based on the extended Kalman filter for UAV communication (SEKF-UC). Firstly, we introduce the concept of image splicing to enhance the compression ratio while ensuring image quality, leveraging the characteristics of deep learning-based compression, which are relatively unaffected by the size of the compressed data. Secondly, to address the issue of slow processing speed of deep neural networks (DNN) caused by the substantial volume of data involved in image splicing, we incorporate an extended Kalman filter module to expedite the process. Simulation experiments show that our proposed algorithm outperforms existing methods in multiple ways, achieving a significant compression ratio improvement, from 2:1 to 25:1, with a marginal reduction of 6.5% in structural similarity (SSIM) compared to the non-spliced approach. Moreover, for deep neural networks (DNN), our method incorporating the extended Kalman filter module achieves the same error level with only 30 iterations—a significant reduction compared to the traditional BP algorithm’s requirement of over 4000 iterations—while improving the average network operation speed by an impressive 89.76%. Additionally, our algorithm excels in image quality, with peak signal-to-noise ratio (PSNR) improving by 92.7% and SSIM by 42.1%, at most, compared to other algorithms. These results establish our algorithm as a highly efficient and effective solution, suitable for various image processing and data compression applications.