%0 Journal Article
%A LI Zexu
%A LIU Ying
%A LUO Tao
%A XU Yongqing
%A YANG Can
%T QoS Routing Algorithm in Clustered Self-Organizing Networks
%D 2022
%R 10.13190/j.jbupt.2021-048
%J Journal of Beijing University of Posts and Telecommunications
%P 1-6
%V 45
%N 1
%X Based on the distributed and clustering network architecture, network nodes can be divided into multiple clusters, which can be managed by their corresponding cluster heads in a collaborative manner. In order to achieve on-demand, efficient matches between the differentiated quality of service (QoS) requirements and the multi-dimensional network resources, a reinforcement learning-based routing algorithm is proposed. The proposed algorithm aims to reduce end-to-end delay and prevent congestion by optimizing the routing path, which can be implemented in both centralized cluster heads and distributed nodes, so as to guarantee the robustness in a dynamic environment. The performance is evaluated by numerical simulations in a network with 100 nodes divided into four regions. The simulation results illustrate that the proposed algorithm can reduce average latency significantly. Besides, the algorithm proposed is superior to the minimum-hop method in terms of rejection rate and resource utilization.
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2021-048