Abstract

With the characteristics of self-organization and no network infrastructure, Ad Hoc network is widely used in civil and military communication. Critical node identification is an important factor in Ad Hoc network security. To evaluate the importance of nodes, we propose a critical node identification algorithm based on cascading failure from the overall performance of the network, which is called the connectivity loss potential (CLP) algorithm. Specifically, the connectivity loss potential is used as a measure to complete the preliminary screening of critical nodes and then expand horizontally and vertically according to the spatial locations of the initial node-set. Select the nodes that can greatly decrease the network's connectivity as the identification results of critical nodes. Simulation results show that the proposed CLP algorithm outperforms other critical node identification algorithms, leading to the networks collapse with fewer nodes removed.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.