A novel edge reconstruction strategy for command and control networks: Balancing shortest path length and node importance

Abstract

Addressing the deficiencies prevalent in current edge reconstruction methodologies within command and control networks, characterized by overly uniform degree distributions and inadequate treatment of isolated nodes, this paper introduces a novel approach that integrates considerations of both shortest path length and node importance. Firstly, we delineate the initial load and capacity of edges through the incorporation of edge importance and edge hierarchy. Subsequently, node importance is defined by leveraging node betweenness centrality and node degree. Through the amalgamation of shortest path length and node importance, we devise a methodology for computing the edge reconstruction index. Following this, we prioritize the establishment of new edges based on the maximum edge reconstruction index and devise a neighbor load allocation strategy grounded on remaining capacity. Finally, simulation experiments are conducted to compare the global efficiency, reconstruction efficiency, reconstruction cost, and network connectivity coefficient of various reconstruction strategies. The results showcase a substantial reduction in reconstruction cost and a notable enhancement in reconstruction efficiency with the proposed methodology.