Bandwidth dynamic optimization method based on matching game

Abstract

The invention discloses a bandwidth dynamic optimization method based on a matching game. The method is a bandwidth dynamic optimization method in a 5G ultra-dense networking environment. According tothe method, in a spectral discretization condition, related knowledge of a matching game theory is used; a base station and user preference are sufficiently considered; due to utilization of an iterative method, the matching relationship of a user and the base station in a spectral fragmentation condition is determined; and thus, bandwidth allocation has stability and optimality. The bandwidth dynamic optimization method based on the matching game disclosed by the invention has a very wide application scene in conditions that services are continuously disconnected and new services need to beadded.

Description

technical field [0001] The invention relates to a bandwidth dynamic optimization method based on a matching game, in particular to a bandwidth dynamic optimization method in a 5G ultra-dense networking environment, and belongs to the technical field of mobile communications. Background technique [0002] With the development of mobile communication technology, 4G has entered the stage of large-scale commercial use. 5G with continuous wide-area coverage, high-capacity hotspots, large connections with low power consumption, and low latency and high reliability has become a global research hotspot. Ultra-dense networking refers to the addition of a large number of micro cells to traditional cells to increase network density. In recent years, ultra-dense networking has become one of the key technologies of 5G. However, the network environment of 5G is very dynamic, for example, channel dynamics, interference dynamics (for any user or base station, the interference it receives ...

AI Technical Summary

Problems solved by technology

However, there are still many problems. For example, in the case of spectrum aggregation, the spectrum is allocated continuously at the initial stage, but after multiple allocations (because some services quit and some are still occupied), the spectrum is disrupted, and the idle spectrum Fragmentation, the continuous spectrum bandwidth is dynamic at this time; considering the bandwidth status at the next moment at the current moment, for example, it is known that a certain service will be accessed at the next moment, then it is necessary to know the bandwidth situation at the next moment, obviously the next moment The moment bandwidth is random

These issues have a great influence on the design of the optimal bandwidth allocation scheme

Images