Critical Node Detection Problem in Wireless Multi-hop Networks

 

     

     

    The page contains a network dataset modeled by wireless multi-hop networks for critical node detection problems. This dataset consists of 40 example networks that we use in [Distributed Detecting of Critical Nodes for Maximization of Connected Components in Wireless Multi-hop Networks] paper. In each file, the first row consists of the number of nodes, maximum node degree, number of edges, and the average degree, respectively. The second line specifies cut nodes of the network. In the remaining row, the first two values are connected nodes, and the following four values represent the coordinates of the nodes. You can download the dataset by clicking here. If you are using any of these data, please cite the original sources.

     

     

    We also provide the current best-known results of the dataset (You can download CNP.xlsx, MaxNum.xlsx, MinMaxC.xlsx. ). If there is anything missing, please let us know via e-mail.

 

 

 

 


Return to Home Page