Distributed wireless network resource optimisation method based on mobile edge computing

Abstract

AbstractFor caching and forwarding problems in mobile networks, a new method of caching and forwarding in mobile networks based on boundary computing is proposed. Using Problem Optimisation to Transform Joint Optimal Problems into Linear Programming Problems and online algorithms, such as real‐time caching and forwarding, are designed. The network ranking leader, consumption amount, and network signal reception of the three algorithms are compared. The study found that in terms of network sort captain, there are significant differences between the CPLEX algorithm, the cell clustering for spatial transcriptomics (CCST) algorithm, and edge computing methods. The CCST algorithm and edge computing have little difference in queue length with small queue length and low latency. However, the CPLEX algorithm has a long queue, resulting in high latency. In terms of amount spent, at the beginning, the edge computing method requires more costly than the linear programming method. But as the beta value increases, so does its amount spent. Although the amount spent of the CPLEX algorithm is low, it is not accepted by users in terms of network delay. In terms of the network signal reception, the edge computing method is 18.3% higher than the linear programming method, and the network signal reception of the CPLEX algorithm is low. Under the premise of higher network signal reception and smaller queue length, higher delivery costs can be achieved and can be adjusted by the size. It can make the consumption amount and the network congestion level to be satisfied.