Research On Dynamic Network Planning In Remote Areas Based On Mobile Base Stations

In the wave of global information,the demand for communication in remote areas is also increasing.In many sparsely populated and vast areas,there are usually rapid communication requirements such as geological exploration,information collection,real-time computing,and emergency search.However,the communication resources in remote areas are extremely limited.Due to the vast terrain,it is difficult to deploy base stations on a large scale.At the same time,mobile base stations such as drones and aerostats have limited energy storage,and the number of devices they can carry is limited.Generally,when facing the communication needs of vast areas,the key consideration is how to deploy sufficient communication equipment to achieve full coverage of ground terminals,while rarely analyzing the dynamic nature of mobile base stations for planning and analysis when resources are limited.Therefore,in order to save communication costs in remote areas and achieve basic communication requirements within limited resources,this paper analyzes dynamic planning models under different resources and requirements,uses the dynamic nature of mobile base stations to study the dynamic construction and planning of mobile base stations in ad hoc networks,and designs task edge offloading algorithms to optimize the communication delay and energy consumption of tasks.The main work and achievements of this article are as follows:(1)A temporal dynamic network planning method is proposed,which utilizes the dynamic characteristics of mobile base stations to transform the topology multiple times to cover different terminal devices and achieve full temporal coverage.Aiming at the static topology,an optimized ad hoc network construction method based on Greedy Traversal Algorithm(GTA)is proposed.On the basis of considering user clustering hotspots,the impact of each user is considered,and the mobile device coverage is optimized based on the location information of each user.The simulation results show that the GTA optimized construction algorithm effectively improves terminal coverage.At the same time,resources and requirements determine the planning process.Therefore,by analyzing the impact factors caused by different resource situations on the dynamic planning results,a temporal dynamic planning model suitable for different scenarios is obtained.(2)First Multipath Task Unloading Algorithm based on Sequencing Constraints(FMTUA-SC)is proposed.The algorithm optimizes the offload delay and energy consumption by analyzing the computational order constraints of tasks and designing multipath transmission for the first task.The simulation results show that the design of scheduling constraints can minimize the waiting delay of tasks,and the design of multi-path transmission of the first task can minimize the objective function through energy consumption and time exchange;Based on the comprehensive consideration of delay and energy consumption,the effectiveness of the FMTUA-SC algorithm is verified.