When wireless sensors are randomly deployed in natural environments such as ecological monitoring, military monitoring, and disaster monitoring, the initial position of sensors is generally formed through deployment methods such as air-drop, and then, the second deployment is carried out through the existing optimization methods, but these methods will still lead to serious coverage holes. In order to solve this problem, this paper proposes an algorithm to improve the coverage rate for wireless sensor networks based on an improved metaheuristic algorithm. The sensor deployment coverage model was firstly established, and the sensor network coverage problem was transformed into a high-dimensional multimodal function optimization problem. Secondly, the global searching ability and searching range of the algorithm are enhanced by the reverse expansion of the initial populations. Finally, the firefly principle is introduced to reduce the local binding force of sparrows and avoid the local optimization problem of the population in the search process. The experimental results showed that compared with ALO, GWO, BES, RK, and SSA algorithms, the EFSSA algorithm is better than other algorithms in benchmark function tests, especially in the test of high-dimensional multimodal function. In the tests of different monitoring ranges and number of nodes, the coverage of EFSSA algorithm is higher than other algorithms. The result can tell that EFSSA algorithm can effectively enhance the coverage of sensor deployment.
With the continuous renewal and rise of various flight equipment, this article designs a method of water data collection, which is realized through the coordination of an unmanned surface vehicle (USV) carrying unmanned aerial vehicles (UAVs, commonly called drones). In reality, multiple UAVs take-off and landing sites, energy consumption, and other complex issues closely related to USV recovery, UAVs must be considered. If mixed integer linear programming (MILP) is used directly, it is difficult to get satisfactory results in an acceptable time range. Therefore, a heuristic algorithm is proposed to solve the problem of data collection by these devices, which can not only quickly solve the large-scale collaborative optimization problem, but also rationally utilize the total energy consumption of the equipment. The effectiveness of the proposed algorithm is verified and analyzed by experimenting a different number of monitoring nodes, different number of UAVs and different task time. It can not only shorten the cycle of data acquisition task, but also reduce the waiting time of the UAV and USV.
The sixth-generation (6G) system has been attracting increasing attention from both industry and academia, with the space–air–ground integrated network (SAGIN) identified as one of its key applications. This study investigates a SAGIN framework tailored for deployment in remote areas. To address the differing needs of users with emergency and routine tasks, an offloading strategy is proposed that enables direct offloading for emergency tasks and optimized UAV-assisted offloading for routine tasks. Additionally, considering the limited satellite coverage duration, a reliability mechanism for task offloading is designed. The study formulates a task offloading optimization problem aimed at maximizing the completion rate of routine tasks—while reducing their energy consumption and latency—under the premise of guaranteeing the completion of emergency task offloading. The problem is modeled as a Markov Decision Process (MDP). To solve it, a D-MAPPO reinforcement learning algorithm is proposed, which integrates the Dirichlet distribution with the Multi-Agent Proximal Policy Optimization (MAPPO) framework. Simulation results show that, compared with the MAPPO and PPO algorithms, the delay is reduced by 38% and 31%, respectively, while the energy consumption is reduced by 7% and 48%, respectively.
13 February 2023 in Wireless Communications and Mobile Computing
As a result of the green IoT, application layer users are increasingly seeking more services, and it is particularly important to reduce the energy consumption of an IoT monitoring center while ensuring service reliability. In this paper, the max-min ant colony algorithm is proposed to effectively solve the problems of user service reliability and energy consumption optimization of an IoT monitoring center. First, the service reliability of the application layer users is modeled based on a Markov chain, and the quantitative reliability performance indicators are given. Second, an optimization model between the user service reliability and the energy consumption of an IoT monitoring center is established. Finally, the optimization problem is solved based on the improved max-min ant system. Simulation experimental results show that compared with the improved FFD algorithm, the average power consumption of the max-min ant colony algorithm can be reduced by up to 7.14%.
With the wide application of wireless sensor networks (WSNs) in real space, there are numerous studies on 3D sensor deployments. In this paper, the k‐connectivity theoretical model of fixed and random nodes in regular lattice‐based deployment was proposed to study the coverage and connectivity of sensor networks with regular lattice in 3D space. The full connectivity range and cost of the deployment with sensor nodes fixed in the centers of four regular lattices were quantitatively analyzed. The optimal single lattice coverage model and the ratio of the communication range to the sensing range (rc/rs) were investigated when the deployment of random nodes satisfied the k‐connectivity requirements for full coverage. In addition, based on the actual sensing model, the coverage, communication link quality, and reliability of different lattice‐based deployment models were determined in this study.