关键词: 多节点, 电子信息资源, 均衡分配, 被囊群算法, 顶点着色算法, 正交配对法

Abstract: Aiming at the problem that wireless access nodes  in wireless communication networks were affected by changes in network status during communication and found it difficult to quickly adapt to these changes, reconfiguring network resources, and affecting communication efficiency and stability, we proposed an instant equilibrium allocation algorithm for multi node electronic information resource communication. Firstly, based on graph theory, a network communication graph and a conflict graph were constructed, and the communication relationships of each node in the communication network were determined by using the communication graph. The vertex coloring algorithm was used to color the conflict graph, and the orthogonal pairing method was 
used to select the links with the strongest orthogonality in the channel for pairwise pairing,  completing the communication link grouping. Secondly, a balanced allocation model  with the goal of minimizing communication delay and maximizing energy efficiency was established. The reverse differential tunicate swarm algorithm was used to solve the model. Through operations such as mutation, crossover, and selection, the search process of the algorithm was accelerated and optimization efficiency was improved. The optimal solution that met the conditions was found in the shortest number of iterations, resource allocation was completed, and the optimal allocation scheme was ultimately determined. The experimental results show that the highest packet loss of the proposed algorithm is only 3.12%, the lowest communication delay can reach 0.1 ms, and the Jain fairness index is always above 0.9, which can improve the efficiency and stability of the communication network.

Key words: multiple node, electronic information resource, balanced distribution, tunicate swarm algorithm, vertex coloring algorithm, orthogonal pairing method