Path Connectivity Assessment Based on Continuous Sniffing

The connectivity of a graph is a fundamental property of a graph. Connectivity is a portrayal of the degree of connectivity of a diagram. The level of connectivity of a graph is an important representation of the structural properties of the graph, and many properties of the graph are related to it. It corresponds to the "degree of reliability" of the network in communication networks. The connectivity of the communication network topology is the key to ensure that the system can operate properly. However, communication networks are often subject to different types of attacks that can cause nodes to lose their ability to transmit information. To this end, this paper proposes a path connectivity assessment algorithm based on continuous sniffing to identify the attacked nodes based on a new definition of connectivity assessment in response to randomness attacks. The experimental validation of this algorithm is also carried out with an 8th order undirected network as an example, and finally, the research idea of network connectivity is discussed, which will be an effective and novel idea for network connectivity assessment.