A Method for Identifying Key Nodes in Dynamic Adhoc Networks
A key node and identification method technology, applied in the field of network security, can solve problems such as difficulty in giving the network, inability to distinguish key nodes, and inability to identify key nodes, so as to improve security, reduce algorithm time complexity, and improve The effect of recognition efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0041] Example 1: see Figure 1 to Figure 8 , a kind of dynamic Ad Hoc network key node identification method, comprises the following steps:
[0042] A. Construct Ad Hoc network model;
[0043] Assume: the Ad Hoc network is composed of n nodes, and the Ad Hoc network is represented by G=(V,L), where V={v 1 ,v 2 ,...,v n} is the set of all nodes in the Ad Hoc network, L={l 1 , l 2 ,...,l m |l k =(v i ,v j )} is a collection of links between all Ad Hoc network nodes, and the same communication protocol is executed between Ad Hoc network nodes;
[0044] Then there are:
[0045]
[0046] B. Define the connectivity of the Ad Hoc network;
[0047] Suppose: ICC means the sum of the reciprocal of the shortest distance between two nodes in the Ad Hoc network is the connectivity of the Ad Hoc network, d ij represents the node v i and node v j the shortest distance;
[0048] Then there are:
[0049]
[0050] C. Comprehensively consider the node deletion method and ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


