摘要
良好的城市通信网络在军事战争中具有至关重要的作用,设计强抗毁性的军用通信网络是国家安全战略的重要工作之一。首先,采用Prim算法给出我国139个城市的通信网络线路总长度最短连接方案;其次,假设某城市因遭到破坏导致网络中断,利用搜索算法构建不影响已有连通子图的修复连接方案,该方案不仅考虑全连通最小代价需求,还针对节点城市间距离、节点城市关键重要性和修复难度等综合评定战备节点数量和地理位置;最后,假定从设计网络中随机选取的通信节点被摧毁,利用设计的综合评价指标对网络连通效能进行评估。
A good urban communication network plays a vital role in the military war,therefore designing a resilient military communications network is one of the important elements of a national security strategy.This paper uses Prim algorithm to work out the shortest connection scheme of the total length of communication network lines in 139 cities in China.When the network of a city is interrupted due to damage,a repair connection scheme that does not affect the existing connected subgraph is constructed by using the search algorithm.Such scheme not only considers the minimum cost of full connectivity,but also comprehensively evaluates the number and geographical location of combat readiness nodes based on the distance between node cities,the key importance of node cities,and the dif⁃ficulty of repair.When the communication nodes randomly selected from the designed network are destroyed,a designed connectivity evaluation index is used to evaluate the network connectivity efficiency.
作者
段宗皓
司贺兵
刘占
DUAN Zonghao;SI Hebing;LIU Zhan(Graduate School,People’s Public Security University of China,Beijing 100038,China;School of Intelligence Policing,China People’s Police University,Langfang,Hebei Province 065000,China)
出处
《中国人民警察大学学报》
2023年第8期33-40,共8页
Journal of China People's Police University
