Research on Anti-interference Dynamic Allocation Algorithm of Channel Resources in Heterogeneous Cellular Networks for Social Communication

The current channel allocation method does not consider the user transmission power problem, which leads to the problems of high user power consumption and low average transmission capacity, so a new anti-interference dynamic allocation algorithm for social communication channel resources in heterogeneous cellular networks is proposed. Determining a reusable set of channel resources for social network users; Under the premise that a given social network user reuses an arbitrary set of resources, the transmission power of the user is adjusted to measure the throughput of each network user on different channel resource sets. At the same time, the undirected graph theory in graph theory and ant colony genetic algorithm are used to cluster social network users, and as heterogeneous network scenarios change, the undirected graph will dynamically change, forming a new clustering scheme. Using intra cluster orthogonal inter cluster multiplexing as a criterion, auction method is used to allocate channel resources for social network users to reduce inter user interference. According to the selfishness of user behavior, a non cooperative game model is established, which combines fixed point theory and iterative algorithms to allocate power to users who complete channel allocation, maximizing user energy efficiency. The experimental results show that the proposed algorithm can reduce the power consumption and greatly increase the average user data amount.