A wireless sensor network (WSN) is a distributed network system composed of a great many sensor nodes that rely on self-organization. The random deployment of WSNs in city planning often leads to the problem of low coverage of monitoring areas. In the construction of smart cities in particular, a large number of sensor nodes need to be deployed to maintain the reception, processing, and transmission of data throughout the city. However, the uneven distribution of nodes can cause a lot of wasted resources. To solve this problem, this paper proposes a WSN coverage optimization model based on an improved marine predator algorithm (IMPA). The algorithm introduces a dynamic inertia weight adjustment strategy in the global exploration and local exploitation stages of the standard marine predator algorithm to balance the exploration and exploitation capabilities of the algorithm and improve its solution accuracy. At the same time, the improved algorithm uses a multi-elite random leading strategy to enhance the information exchange rate between population individuals and improve the algorithm’s ability to jump out of the local optimum. The optimization experiment results of 11 benchmark test functions and part of the CEC2014 test functions show that the optimization performance of the improved algorithm is significantly better than the standard marine predator algorithm and other algorithms in the literature. Finally, the improved algorithm is applied to the WSN coverage optimization problem. The simulation results demonstrate that the IMPA has a better coverage rate than other metaheuristic algorithms and other improved algorithms in the literature for solving the WSN coverage optimization problem.
Aiming at the sparsity of short text features, lack of context, and the inability of word embedding and external knowledge bases to supplement short text information, this paper proposes a text, word and POS tag-based graph convolutional network (TWPGCN) performs short text classification. This paper builds a T-W graph of text and words, a W-W graph of words and words, and a W-P graph of words and POS tags, and uses Graph Convolutional Network (GCN) to learn its feature and performs feature fusion. TWPGCN only focuses on the structural information of text graph, and does not require pre-training word embedding as initial node features, which improves classification accuracy, increases computational efficiency, and reduces computational difficulty. Experimental results show that TWPGCN outperforms state-of-the-art models on five publicly available benchmark datasets. The TWPGCN model is suitable for short text or ultra-short text, and the composition method in the model can also be extended to more fields.