Method of key node identification in command and control networks based on level flow betweenness Online publication date: Mon, 05-Aug-2019
by Yun-Ming Wang; Cheng-Sheng Pan; Bo Chen; Duo-Ping Zhang
International Journal of Computational Science and Engineering (IJCSE), Vol. 19, No. 3, 2019
Abstract: Key node identification in command and control (C2) networks is an appealing problem that has attracted increasing attention. Due to the particular nature of C2 networks, the traditional algorithms for key nodes identification have problems with high complexity and unsatisfactory adaptability. A new method of key node identification based on level flow betweenness (LFB) is proposed, which is suitable for C2 networks. The proposed method first proves the definition of LFB by analysing the characteristics of a C2 network. Then, this method designs algorithms for key node identification based on LFB and theoretically derives the complexity of this algorithm. Finally, a number of numerical simulation experiments are carried out, and the results demonstrate that this method reduces algorithm complexity, improves identification accuracy and enhances adaptability for C2 networks.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook