Cluster-based route convergence method based on network state graph model
To address the challenges of time-varying node connectivity and frequent link failures in tactical communication networks under conditions of strong adversarial and high-mobility operations, which result in frequent route convergence and short effective transmission times, a cluster-based route conv...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2024-12-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024267/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832595499812651008 |
|---|---|
| author | PAN Chengsheng LU Huangjie SHI Huaifeng WANG Yingzhi |
| author_facet | PAN Chengsheng LU Huangjie SHI Huaifeng WANG Yingzhi |
| author_sort | PAN Chengsheng |
| collection | DOAJ |
| description | To address the challenges of time-varying node connectivity and frequent link failures in tactical communication networks under conditions of strong adversarial and high-mobility operations, which result in frequent route convergence and short effective transmission times, a cluster-based route convergence method based on network state graph model (OSPF-CSG) was proposed. Firstly, link states were obtained based on the statistical characteristics of Hello messages, and node states were characterized using aggregated link state features to construct the network state graph model. Secondly, the neighbor state machine’s state transition triggers were improved, and two new OSPF message types were developed to design an active/passive association mechanism for complete adjacency relationships. Finally, on this basis, a cluster head bootstrap algorithm, node clustering algorithm, and inter-cluster connection algorithm were proposed to achieve cluster-based routing convergence. Simulation results show that, in eight different network topologies and under different link damage conditions, OSPF-CSG achieves an average reduction of 82% in the total number of route convergences, a reduction in routing overhead by 70% on average, and an improvement in packet delivery rate by 60% on average compared to the traditional OSPF protocol’s route convergence algorithm. |
| format | Article |
| id | doaj-art-ce765e52b45d4d22ac97488badd0a087 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2024-12-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-ce765e52b45d4d22ac97488badd0a0872025-01-18T19:00:07ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2024-12-01459511080268820Cluster-based route convergence method based on network state graph modelPAN ChengshengLU HuangjieSHI HuaifengWANG YingzhiTo address the challenges of time-varying node connectivity and frequent link failures in tactical communication networks under conditions of strong adversarial and high-mobility operations, which result in frequent route convergence and short effective transmission times, a cluster-based route convergence method based on network state graph model (OSPF-CSG) was proposed. Firstly, link states were obtained based on the statistical characteristics of Hello messages, and node states were characterized using aggregated link state features to construct the network state graph model. Secondly, the neighbor state machine’s state transition triggers were improved, and two new OSPF message types were developed to design an active/passive association mechanism for complete adjacency relationships. Finally, on this basis, a cluster head bootstrap algorithm, node clustering algorithm, and inter-cluster connection algorithm were proposed to achieve cluster-based routing convergence. Simulation results show that, in eight different network topologies and under different link damage conditions, OSPF-CSG achieves an average reduction of 82% in the total number of route convergences, a reduction in routing overhead by 70% on average, and an improvement in packet delivery rate by 60% on average compared to the traditional OSPF protocol’s route convergence algorithm.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024267/network state graphnode clusteringroute convergenceOSPF protocol |
| spellingShingle | PAN Chengsheng LU Huangjie SHI Huaifeng WANG Yingzhi Cluster-based route convergence method based on network state graph model Tongxin xuebao network state graph node clustering route convergence OSPF protocol |
| title | Cluster-based route convergence method based on network state graph model |
| title_full | Cluster-based route convergence method based on network state graph model |
| title_fullStr | Cluster-based route convergence method based on network state graph model |
| title_full_unstemmed | Cluster-based route convergence method based on network state graph model |
| title_short | Cluster-based route convergence method based on network state graph model |
| title_sort | cluster based route convergence method based on network state graph model |
| topic | network state graph node clustering route convergence OSPF protocol |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024267/ |
| work_keys_str_mv | AT panchengsheng clusterbasedrouteconvergencemethodbasedonnetworkstategraphmodel AT luhuangjie clusterbasedrouteconvergencemethodbasedonnetworkstategraphmodel AT shihuaifeng clusterbasedrouteconvergencemethodbasedonnetworkstategraphmodel AT wangyingzhi clusterbasedrouteconvergencemethodbasedonnetworkstategraphmodel |