CN111130870B - Tactical mobile ad hoc network key node analysis method based on influence factor evaluation - Google Patents

Tactical mobile ad hoc network key node analysis method based on influence factor evaluation Download PDF

Info

Publication number
CN111130870B
CN111130870B CN201911309814.2A CN201911309814A CN111130870B CN 111130870 B CN111130870 B CN 111130870B CN 201911309814 A CN201911309814 A CN 201911309814A CN 111130870 B CN111130870 B CN 111130870B
Authority
CN
China
Prior art keywords
node
communication
hoc network
nodes
tactical mobile
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201911309814.2A
Other languages
Chinese (zh)
Other versions
CN111130870A (en
Inventor
王英
彭钦鹏
吴广富
李云
张平安
孙培斯
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201911309814.2A priority Critical patent/CN111130870B/en
Publication of CN111130870A publication Critical patent/CN111130870A/en
Application granted granted Critical
Publication of CN111130870B publication Critical patent/CN111130870B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/142—Network analysis or design using statistical or mathematical methods
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/20—Network architectures or network communication protocols for network security for managing network security; network security policies in general
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/009—Security arrangements; Authentication; Protecting privacy or anonymity specially adapted for networks, e.g. wireless sensor networks, ad-hoc networks, RFID networks or cloud networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/06—Testing, supervising or monitoring using simulated traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention belongs to the safety field of tactical mobile ad hoc networks, and particularly relates to a tactical mobile ad hoc network key node analysis method based on influence factor evaluation, which comprises the steps of constructing a communication model of a tactical mobile ad hoc network radio station; restoring the network topology through the established model, namely obtaining an adjacency matrix of the tactical mobile ad hoc network communication radio station; calculating node criticality according to an adjacency matrix of the tactical mobile ad hoc network communication radio station to complete key node analysis; the invention considers the communication flow in the prior research, has better identification effect compared with the traditional semi-local centrality and near centrality method, reduces the time complexity for the connectivity deletion method with better identification effect, and further improves the identification efficiency of the key nodes of the tactical mobile ad hoc network.

Description

Tactical mobile ad hoc network key node analysis method based on influence factor evaluation
Technical Field
The invention belongs to the field of Tactical Mobile Ad-hoc Networks (T-MANET) safety, and particularly relates to a Tactical Mobile Ad-hoc network key node analysis method based on influence factor evaluation.
Background
All radio station equipment of the tactical mobile ad hoc network adopts a consistent battlefield communication protocol, the protocol carries out layering on information transmission of the tactical mobile ad hoc network, wherein a traditional IP Layer is defined as an Intranet Layer (Intranet Layer), and the Intranet Layer determines a possible route between each source node and a destination node in the tactical mobile ad hoc network radio station so as to complete initial establishment, updating and maintenance of network topology and provide guarantee for communication service of an upper Layer. The tactical mobile ad hoc network radio station system takes the networking of a first-level tactical radio station system and a second-level tactical radio station system as an example, the first-level radio station system is a backbone network in the tactical mobile ad hoc network and is responsible for data exchange with the second-level radio station. And the secondary station system is mainly used for guaranteeing voice and data communication of the following users. In complex networks in various fields, a key node means that one or a plurality of nodes have a great influence on the structural characteristics and stability of the whole network, and the nodes have a great degree of connection or have a position advantage. The identification and analysis of the key nodes have important application value in the field of military information, on one hand, a network maintainer dynamically detects the key nodes in the network through a related technology, adjusts the processing capacity of the key nodes on information, or enhances the communication safety mechanism of the key nodes, so that the network load can be effectively reduced, and the safety and the reliability of the network can be improved; on the other hand, after the network scout identifies the key nodes in the network of the other party by technical means, the network scout accurately attacks the key nodes, so that important information in the network is intercepted or the network of the other party is destroyed.
At present, researchers at home and abroad carry out related research aiming at key node identification in a mobile ad hoc network, and the existing research is mainly based on a complex network analysis method and can be divided into two types: the first type is connectivity deletion method, which generally measures the key of nodes by calculating the shortest path among all nodes, defining network connectivity, and comparing the change of the network connectivity before deletion after deleting the links adjacent to the nodes. The second type is a characteristic parameter analysis method, which takes a mediation method and a semi-local centrality method as examples, the mediation method introduces the mediation of a k-hop range to accurately sequence the key of the nodes, although the method accurately analyzes the topology in the k-hop range and has a good effect on identifying the key nodes, the algorithm time complexity is high, the overall topology of the current network is not restored from the reconnaissance angle, and the method is not suitable for reconnaissance of the topological structure of the tactical mobile ad hoc network. Although the semi-local centrality method can quickly identify key nodes in the large-scale mobile ad hoc network, the method only considers the relation of the node degrees in the 4-hop range, and the identification result is not general.
Disclosure of Invention
In order to solve the problem that the conventional research method cannot restore the current network topology by intercepting actual communication data so as to reasonably and fully analyze key nodes in the current network by combining with scout data, the invention provides a tactical mobile ad hoc network key node analysis method based on influence factor evaluation, which comprises the following steps:
s1, building a communication model of the tactical mobile ad hoc network radio station;
s2, restoring the network topology through the established model, namely obtaining the adjacency matrix of the tactical mobile ad hoc network communication radio station;
and S3, calculating the node criticality according to the adjacency matrix of the tactical mobile ad hoc network communication radio station, and completing key node analysis.
Further, the establishment of the communication model of the tactical mobile ad hoc network radio station comprises the following steps: initializing N primary radio stations to form a primary radio station cluster, wherein each secondary radio station cluster comprises l secondary radio stations and 1 primary radio station as cluster head nodes, the total number of the secondary radio stations in the whole network is N, and if the maximum communication range of the secondary radio stations is RSmaxThe maximum communication range of the primary radio station is REmaxDistance between adjacent secondary stations in the cluster is LSDistance between adjacent first-stage radio stations among clusters is LEThen L is satisfiedS≤RSmax，LE≤REmax。
Further, the analyzing and restoring the network topology by the communication relation comprises:
s201, arranging S scout nodes according to the networking scale, and configuring the maximum monitoring range RL of the scout nodesmax；
S202, setting a monitoring timer T by the scout nodelistenThe scout node starts a monitoring mode at an MAC layer and captures information frames transmitted, received or forwarded by all radio stations in a monitoring range;
s203, the scout node decapsulates each captured information frame by a tactical mobile ad hoc network communication protocol MAC frame structure, identifies a control field to judge the type of the information frame, and enters a step S204 if the information frame is a tactical mobile ad hoc network communication protocol data frame, or enters a step S205 if the information frame is not the tactical mobile ad hoc network communication protocol data frame;
s204, storing the tactical mobile ad hoc network communication protocol data frame decapsulated by the scout node into a scout node buffer area, and then entering the step S206;
s205, discarding the information frame;
s206, the scout node extracts intranet head information in each data frame from the buffer area, analyzes and screens out each source address, each relay address and each destination address, enables the source addresses, the relay addresses and the destination addresses to form a complete routing path and then adds the routing path to a communication information recording table, and records time for capturing a current data packet;
s207, updating timer T of communication information of adjacent scout nodesCRAAnd periodically exchanging the communication relation information recorded by each other in time.
S208, after the monitoring timer is overtime, the scout node screens out the number c of all radio stations which are in communication and carry out data communication and the IP address of each communication radio station from the communication relation analysis table.
S209, the scout node analyzes the node relation among the source node, the relay node and the destination node in each communication relation item, and an adjacency matrix of the tactical mobile ad hoc network communication radio station is constructed.
Further, the adjacent scout nodes update the timer T in the communication informationCRAThe process of (a) is represented as:
Figure BDA0002324210310000031
further, the communication information record table includes fields of number, time, source node IP, relay node IP, destination node IP, hop count, current node IP, whether to relay and size of captured data packet.
Further, constructing the adjacency matrix for the tactical mobile ad-hoc network communication station comprises: simplifying all communication stations into a node set V ═ V { V } in a graph theory1,v2,v3,...,vcThe communication link between each station is simplified into an edge set E ═ E without weight and direction1,e2,e3,...,ek,...,ec×c|ek＝(vi,vj) The network topology among all communication stations can be represented as an unweighted undirected graph G ═ V, E, and then the adjacency matrix of tactical mobile ad hoc communication stations is represented as:
Figure BDA0002324210310000041
wherein c is the element of ith row and jth column in the tactical mobile ad hoc network communication station adjacency matrix A of the unauthorized undirected graph G.
Further, calculating node criticality based on the adjacency matrix of the tactical mobile ad hoc network communication station comprises:
s301, calculating a node shortest routing hop matrix H from the adjacency matrix A;
s302, traversing the adjacency matrix A, and accumulating a after scanning each lineijAnd taking the value as the degree of the node;
s304, calculating the center density of the nodes according to the node degree;
s305, mixing TlistenWithin a period of timeFrequency f of node appearing in current node IP item in linkage information record tablecurrentAnd the number f of occurrences of an item of source node IPsourceTraffic data f as nodesi；
S306, normalizing the central density and the flow data of all the nodes;
s307, calculating the criticality of the node according to the sum of weighted values of the normalized center density and the normalized flow data;
and S308, sequencing the criticality of the c communication nodes to complete the analysis of the criticality of the nodes.
Further, the calculating the shortest node routing hop count matrix H from the adjacency matrix a includes:
assigning the adjacency matrix A to the matrix H, satisfying (H)ij)c×c＝(aij)c×c；
Let the power matrix M be the theta power of the matrix A, i.e. M equals A(θ)，mij (θ)Elements representing the ith row and jth column of the power matrix M, if Mij (θ)When t, it represents the node viTo node vjT shortest paths with route hop number theta are arranged between the two paths;
theta increases from 1 in sequence and is equal to all the elements a with the value of 0 except the diagonal in the matrix AbkWhen the first order a appearsbk (θ)When not equal to 0, the value of theta is the node vbTo node vkThe shortest route hop number between the two and writes the value into the kth column of the b-th row in the matrix H to satisfy Hbk＝θ；
If s ═ maxHoop time abk (θ)When 0, the node v is illustratedbTo node vkIs not reachable, at this time hbkInfinity, i.e. node vbTo node vkThe shortest route between is represented by the hop count:
Figure BDA0002324210310000051
further, the center density of the nodes is represented as:
Figure BDA0002324210310000052
wherein c is the number of detected communication nodes in the whole network, hijThe value of (A) is obtained by inquiring the shortest routing hop matrix H of the node; gkIs CkNumber of intermediate nodes, CkThe set of all node numbers in degrees k is recorded.
Further, calculating the criticality of the node according to the sum of the weighted values of the normalized center density and the traffic data includes:
ri＝ω×τi+μ×Fi；
wherein, ω is a central degree influence factor of the node, μ is a flow influence factor of the node, and ω + μ is 1.0; fiThe flow data after normalization; tau isiCenter density after normalization.
The invention is suitable for analyzing the key nodes by adopting the evaluation based on the influence factors in the combat process of the radio station equipment using the tactical mobile ad hoc network communication protocol, and a reconnaissance party can accurately restore the current network topology structure and evaluate the key degree of the communication nodes in the network under the condition of not knowing the current network layout and the communication process. In the invention, the shortest route hop number matrix of the nodes is solved through the property of the adjacency matrix, the center density of the nodes is defined and calculated to measure the connection degree between the nodes, and finally, the key of the nodes is evaluated by introducing influence factors in combination with the communication flow of the nodes. The method considers the communication flow in the prior research, has better identification effect compared with the traditional semi-local centrality and approximate centrality method, reduces the time complexity for the connectivity deletion method with better identification effect, and further improves the identification efficiency of the key nodes of the tactical mobile ad hoc network.
Drawings
FIG. 1 is a flow chart of the method of the present invention;
FIG. 2 illustrates an intranet packet header format used in the method of the present invention;
FIG. 3 is a simulation parameter illustration;
FIG. 4 is a diagram of a network topology configuration in accordance with the present invention;
FIG. 5 is a network topology graph restored by scout nodes;
FIG. 6 is TlistenRecording graphs of the center density, the flow and the degree of the partial communication nodes in time;
FIG. 7 is a graph showing the comparison result of the key ratio between the present method and the conventional method.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The invention provides a tactical mobile ad hoc network key node analysis method based on influence factor evaluation, which comprises the following steps:
s1, building a communication model of the tactical mobile ad hoc network radio station;
s2, restoring the network topology through the established model, namely obtaining an adjacency matrix of the tactical mobile ad hoc network communication radio station;
and S3, calculating the node criticality according to the adjacency matrix of the tactical mobile ad hoc network communication radio station, and completing the key node analysis.
In this embodiment, as shown in fig. 1, the tactical mobile ad hoc network key node analysis flow chart based on impact factor evaluation is implemented by the present invention, and mainly includes two modules: the method mainly comprises the steps of building a tactical mobile ad hoc network radio station communication model and wishing a network topology through the built model in the process of carrying out the communication relation analysis, namely obtaining an adjacency matrix of the tactical mobile ad hoc network communication radio station.
In this embodiment, the building of the communication model of the tactical mobile ad hoc network radio station comprises:
initializing 5 primary radio stations to form a primary radio station setAnd the group, wherein each secondary radio station cluster comprises 19 secondary radio stations and 1 primary radio station as cluster head nodes, and the total number of the radio stations in the whole network is 100 at the moment. Fig. 4 is a network topology configuration diagram of the radio node in the present invention. In the network, 10 service data flows are configured altogether, each service flow is at a random packet sending rate, wherein a secondary station node (abbreviated as S1_10 node) numbered 10 in a cluster 1 is enabled to send CBR service data based on UDP protocol bearer to an S3_7 node through a primary station node relay between clusters, wherein the load size of each data packet of an application layer is 100 bytes, and the packet sending rate is 1.5 packets/S. Similarly, the packet sending rate of the S1_18 node to the S2_5 node through the relay is 2 packets/S; the packet sending rate of the S2_11 node to the S2_19 node in the cluster is 0.5 packets/S; the packet sending rate of the S2_12 node to the S4_3 node through the relay is 1 packet/S; the packet sending rate of the S2_14 node to the S3_6 node through the relay is 1 packet/S; the packet sending rate of the S3_11 node to the S4_15 node through the relay is 2 packets/S; the packet sending rate of the S3_16 node to the S3_1 node in the cluster is 1.5 packets/S; the packet sending rate of the S3_2 node to the S5_17 node through the relay is 1.5 packets/S; the packet sending rate of the S4_9 node to the S5_8 node through the relay is 2 packets/S; the packet sending rate of the S5_4 node to the S5_19 node in the cluster is 5 packets/S; setting the maximum communication range RS of the secondary radio stationmax150m, maximum communication range RE of primary stationmax200m, and the distance between adjacent secondary stations in the cluster is LSDistance between adjacent first-stage radio stations among clusters is LEThen satisfy LS≤RSmax，LE≤REmax。
In this real-time example, the network topology is also expected to include through the established model:
s201, arranging 5 scout nodes according to the networking scale, and configuring the maximum monitoring range RL of the scout nodesmaxIs 250 m;
s202, setting a monitoring timer T by the scout nodelistenThe monitoring time is 10s, then the scout node starts a monitoring mode at an MAC layer and captures information frames transmitted, received or forwarded by all radio stations in a monitoring range;
s203, the scout node carries out decapsulation on each captured information frame by a tactical mobile ad hoc network protocol MAC frame structure, identifies a control field to judge the type of the information frame, and enters a step S204 if the tactical mobile ad hoc network protocol data frame is detected, or enters a step S205 if the tactical mobile ad hoc network protocol data frame is detected;
s204, storing the tactical mobile ad hoc network protocol data frame unpacked by the scout node into a scout node buffer area, and then entering the step S206;
s205, discarding the information frame;
s206, the scout node extracts intranet header information in each data frame from the buffer area, analyzes and screens out each source address, relay address and destination address according to the header format of an intranet layer in a tactical mobile ad hoc network protocol in the graph 2, enables the source address, the relay address and the destination address to form a complete routing path and then adds the routing path to a communication information recording table, and records the time (accurate to nanosecond) for capturing the current data packet;
s207, setting a communication information updating timer TCRAAt 2.0s, the neighboring scout node is at TCRAPeriodically exchanging communication relation information recorded by each other within time;
s208, after the monitoring timer is overtime, screening out the number c of all radio stations which are in communication and carry out data communication from the communication relation analysis table to be 45 and the IP address of each communication radio station by the scout node;
s209, the scout node analyzes the node relation among the source node, the relay node and the destination node in each communication relation item, and constructs an adjacency matrix A (a) of the tactical mobile ad hoc network communication radio stationij)45×45Expressed as:
Figure BDA0002324210310000081
in this embodiment, as shown in fig. 1, the key node evaluation includes solving the shortest routing hop count of the node, calculating the node center density and the communication traffic, configuring the image factor, calculating the criticality, and evaluating the key node, and specifically includes the following steps:
s301 calculates a shortest node routing hop count matrix H (H) from the adjacency matrix aij)45×45Which isThe maximum medium routing hop count maxHoop is 7;
Figure BDA0002324210310000091
s302, traversing the adjacency matrix A, and accumulating a after scanning each lineijA value of (a) in whichij＝ai1+ai2+...+aijDenoted as γ, i.e. the degree d of the node i is calculatediWherein d isi＝γi；
S303, defining a set C to record all nodes in a specified degree, where C ═ C1,C2,C3,...,Ck}，CkRecord all node numbers with degree k and set CkThe number of middle nodes is gk；
S304, calculating the center density of the node I according to the formula 3 as follows:
Figure BDA0002324210310000092
s305, traversing the communication information record table, and counting the frequency f of each communication node appearing in the column of' current node IPcurrentThe number f of times the node appears in the column "source node IPsourceComputing node at TlistenTotal flow rate f in timeiWherein f isi＝fcurrent+fsourceAnd satisfies the following conditions:
Figure BDA0002324210310000093
wherein, TxiFor traffic sent by the node, RxiFor traffic received by the node, RliAnd the traffic forwarded by the node as a relay. In FIG. 6 is shown at TlistenThe center density, the flow and the degree of the time internal sub-node;
s306, normalizing the central density and the flow data of all the nodes according to the formula 5 and the formula 6Processing to obtain the center density tau of the node IiThe node flow is Fi：
Figure BDA0002324210310000094
Figure BDA0002324210310000095
S307, calculating the criticality r of the node i according to the following formulaiComprises the following steps:
ri＝ω×τi+μ×Fi；
in the embodiment, the density of the default center of the reconnaissance party and the communication flow rate are equally important for evaluating the criticality of the node, so that ω is equal to μ is equal to 0.5; the present invention also provides for other situations, including:
when the scout considers that the center density is more important than the communication flow, ω is 0.9 and μ is 0.1;
when the scout considers that the center density is obviously more important than the communication flow, omega is 0.7, mu is 0.3;
when the scout considers that the communication flow is more important than the center density, omega is 0.3, mu is 0.7;
when the scout considers that the communication flow rate is more important than the center density, ω is 0.1 and μ is 0.9.
And S308, carrying out criticality sequencing on the 45 communication nodes. Fig. 7 is a comparison result of the method and the conventional method for ordering the most critical 15 nodes in the scenario when ω ═ μ ═ 0.5.
In order to verify the reliability of the tactical mobile ad hoc network key node analysis method based on the influence factor evaluation, simulation is to analyze from two aspects of topology reduction degree and node key degree. The topology reduction degree reflects the coincidence degree of the current network topology and the actual network topology configuration, and directly reflects the reliability of the method for the tactical mobile ad hoc network using key node analysis based on influence factor evaluation; the node criticality is a result obtained by using a key analysis method based on influence factor evaluation, and the larger the node criticality is, the more important the strategic position of the node in the tactical mobile ad hoc network is, and the larger the attack on the network of the other party is after the node is destroyed.
As shown in fig. 3, in the simulation, it is assumed that the gateway address of the secondary station node is 198.3.1.0, the gateway address of the primary station node is 198.2.1.0, and the subnet mask is 255.255.255.0. The scout restores the current network topology as shown in fig. 5, in which the solid points are the nodes of the primary radio station and the stripe points are the nodes of the secondary radio station. It can be seen from the analysis results of monitoring the current data and the communication information that 5 primary radio station clusters are completely restored, wherein in the clusters numbered 1, 3, 4 and 5, except for the sending node and the receiving node set in simulation, data relay is generated in the secondary radio station clusters. Because the range of the nodes in the secondary radio station cluster is large in simulation, the distance between the sending and receiving nodes selected each time and the head node of the primary radio station cluster is random, and it is reasonable to process data forwarding to generate relays. In the simulation result of fig. 5, the secondary station nodes with IP addresses 198.3.5.4, 198.3.5.18, and 198.3.5.19 in the cluster 5 and the secondary station nodes with IP addresses 198.3.2.11, 198.3.2.17, 198.3.2.18, and 198.3.2.19 in the cluster 2 have no communication relationship with other nodes, and belong to an isolated subgraph. While the intra-cluster nodes with IP addresses 198.3.3.16, 198.3.3.4, and 198.3.3.1 in cluster 3 and other communicating nodes create relays, these nodes are not isolated and are consistent with the configuration of the simulation.
Fig. 7 shows the results of ranking and comparing the node criticality of the method with the conventional method in the scenario where ω ═ μ ═ 0.5, in which the scout considers that the node center density is as important as the node communication traffic, while the connectivity deletion method, the semi-local centrality method and the near centrality method are only analyzed from the size or variation of a certain fixed characteristic parameter in the complex network, and the node criticality is not discussed in combination with the actual communication traffic. For the top 8 nodes with the highest criticality ranking,the method provided by the invention is consistent with the analysis result of the connectivity deletion method with better identification effect, because the adjacency matrix is changed when each node is deleted in the connectivity deletion method, the shortest route hop number matrix among the nodes needs to be recalculated or updated, and the time complexity of the identification algorithm of the key nodes for n communications is O (mn)2). In the method, only the shortest routing hop number matrix of the nodes needs to be solved and the hop number between the node pairs with specified degrees is searched, the time complexity is O (maxHoop multiplied by n), and as the maxHoop is 7, the algorithm time complexity can be approximate to O (n) for the large-scale tactical mobile ad hoc network. Secondly, for the node with the IP address 198.3.5.18 in the cluster 5, although the node is located at the edge of the network from the perspective of connectivity, node tightness and connectivity, the packet sending rate of the traffic flow passing through the node in the simulation configuration is 5packets/s, and the communication traffic processed by the node in the whole network is more, so the node may also be a key node, the key degree of the node with the IP address 198.3.5.18 in the method is ranked 9 th, and the nodes in the other three methods are ranked beyond 15 th, so the method has more accurate recognition effect compared with other methods.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.

Claims (9)

1. The tactical mobile ad hoc network key node analysis method based on the influence factor evaluation is characterized by comprising the following steps of:
s1, constructing a communication model of the tactical mobile ad hoc network radio station, comprising the following steps: initializing N primary radio stations to form a primary radio station cluster, wherein each secondary radio station cluster comprises l secondary radio stations and 1 primary radio station as cluster head nodes, the total number of the secondary radio stations in the whole network is N, and if the maximum communication range of the secondary radio stations is RSmaxThe maximum communication range of the primary radio station is REmaxDistance between adjacent secondary stations in the cluster is LSDistance between adjacent first-stage radio stations among clusters is LEThen satisfy LS≤RSmax，LE≤REmax；
S2, restoring the network topology through the established model, namely obtaining the adjacency matrix of the tactical mobile ad hoc network communication radio station;
and S3, calculating the node criticality according to the adjacency matrix of the tactical mobile ad hoc network communication radio station, and completing the key node analysis.
2. The tactical mobile ad hoc network key node analysis method based on impact factor evaluation as claimed in claim 1, wherein the analyzing and restoring the network topology by the connectivity relationship comprises:
s201, arranging S scout nodes according to the networking scale, and configuring the maximum monitoring range RL of the scout nodesmax；
S202, setting a monitoring timer T by the scout nodelistenThe scout node starts a monitoring mode at an MAC layer and captures information frames transmitted, received or forwarded by all radio stations in a monitoring range;
s203, the scout node decapsulates each captured information frame by a tactical mobile ad hoc network communication protocol MAC frame structure, identifies a control field to judge the type of the information frame, and enters a step S204 if the information frame is a tactical mobile ad hoc network communication protocol data frame, or enters a step S205 if the information frame is not the tactical mobile ad hoc network communication protocol data frame;
s204, storing the tactical mobile ad hoc network communication protocol data frame unpackaged by the scout node into a scout node buffer zone, and then entering the step S206;
s205, discarding the information frame;
s206, extracting the intranet head message in each data frame from the buffer area by the scout node, analyzing and screening each source address, each relay address and each destination address, adding the source address, the relay address and the destination address to a communication information recording table after forming a complete routing path, and simultaneously recording the time for capturing the current data packet;
s207, updating timer T of communication information of adjacent reconnaissance nodesCRAPeriodically exchanging communication relation information recorded by each other within time;
s208, after the monitoring timer is overtime, screening out the number c of all radio stations which are in communication and carry out data communication and the IP address of each communication radio station from the communication relation analysis table by the scout node;
s209, the scout node analyzes the node relation among the source node, the relay node and the destination node in each communication relation item, and an adjacency matrix of the tactical mobile ad hoc network communication radio station is constructed.
3. The impact factor evaluation-based tactical mobile ad hoc network key node analysis method of claim 2, wherein neighboring scout nodes update timer T in the communication informationCRAThe process of (a) is represented as:
Figure FDA0003596961580000021
4. the method of claim 2, wherein the linkage information record table comprises fields of number, time, source node IP, relay node IP, destination node IP, hop count, current node IP, whether to relay and size of captured packet.
5. The method of claim 1 wherein constructing an adjacency matrix for tactical mobile ad hoc network communication stations comprises: simplifying all communication stations into a node set V ═ V in a graph theory1,v2,v3,...,vcThe communication link between each radio station is simplified into an edge set E ═ E without weight and direction1,e2,e3,...,ek,...,ec×c|ek＝(vi,vj) The network topology among all communication stations can be represented as an unweighted undirected graph G ═ V, E, and then the adjacency matrix of tactical mobile ad hoc communication stations is represented as:
Figure FDA0003596961580000022
wherein c is the element of ith row and jth column in the tactical mobile ad hoc network communication station adjacency matrix A of the unauthorized undirected graph G.
6. The method of claim 1 wherein calculating node criticality based on an adjacency matrix of tactical mobile ad hoc network communication stations comprises:
s301, calculating a node shortest routing hop count matrix H from the adjacency matrix A;
s302, traversing the adjacency matrix A, and accumulating a after scanning each lineijAnd taking the value as the degree of the node;
s304, calculating the center density of the nodes according to the node degree;
s305, adding TlistenFrequency f of node appearing in current node IP in linkage information record table in timecurrentAnd the number f of occurrences of an item of source node IPsourceTraffic data f as nodesi；
S306, normalizing the central density and the flow data of all the nodes;
s307, calculating the criticality of the node according to the sum of weighted values of the normalized center density and the normalized flow data;
and S308, sequencing the criticality of the c communication nodes to complete the analysis of the criticality of the nodes.
7. The tactical mobile ad hoc network key node analysis method according to claim 1, wherein the calculating the node shortest routing hop count matrix H from the adjacency matrix a comprises:
assign the adjacency matrix A to the matrix H, satisfy (H)ij)c×c＝(aij)c×c；
Let the power matrix M be the theta power of the matrix A, i.e. M equals A(θ)，mij (θ)Representing the elements of the ith row and jth column of the power matrix M, if Mij (θ)When t, then it represents node viTo node vjT shortest paths with route hop number theta are arranged between the two paths;
theta increases from 1 in sequence and is equal to all the elements a with the value of 0 except the diagonal in the matrix AbkWhen the first order a appearsbk (θ)When not equal to 0, the value of theta is the node vbTo node vkThe shortest route hop number between the two and writes the value into the kth column of the b-th row in the matrix H to satisfy Hbk＝θ；
If s ═ maxHoop time abk (θ)When 0, the node v is illustratedbTo node vkIs not reachable at this time hbkInfinity, i.e. node vbTo node vkThe shortest path between is represented by the hop count:
Figure FDA0003596961580000031
8. the tactical mobile ad hoc network key node analysis method based on impact factor evaluation as claimed in claim 1, wherein the center density of the nodes is represented as:
Figure FDA0003596961580000041
wherein c is the number of detected communication nodes in the whole network, hijThe value of (A) is obtained by inquiring the shortest routing hop matrix H of the node; gkIs CkNumber of intermediate nodes, CkThe set of all node numbers in degrees k is recorded.
9. The method of claim 1, wherein calculating the criticality of a node based on a sum of weighted values of normalized center density and traffic data comprises:
ri＝ω×τi+μ×Fi；
wherein, ω is a central degree influence factor of the node, μ is a flow influence factor of the node, and ω + μ is 1.0; fiThe flow data after normalization; tau isiCenter density after normalization.
CN201911309814.2A 2019-12-18 2019-12-18 Tactical mobile ad hoc network key node analysis method based on influence factor evaluation Active CN111130870B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911309814.2A CN111130870B (en) 2019-12-18 2019-12-18 Tactical mobile ad hoc network key node analysis method based on influence factor evaluation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911309814.2A CN111130870B (en) 2019-12-18 2019-12-18 Tactical mobile ad hoc network key node analysis method based on influence factor evaluation

Publications (2)

Publication Number Publication Date
CN111130870A CN111130870A (en) 2020-05-08
CN111130870B true CN111130870B (en) 2022-06-03

Family

ID=70499663

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911309814.2A Active CN111130870B (en) 2019-12-18 2019-12-18 Tactical mobile ad hoc network key node analysis method based on influence factor evaluation

Country Status (1)

Country Link
CN (1) CN111130870B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112769892B (en) * 2020-12-11 2022-04-19 北京邮电大学 Method and system for constructing distributed computing network system of multiple mobile devices
CN113014602B (en) * 2021-03-26 2022-02-18 湖南大学 Industrial network defense method and system based on optimal communication path
CN113965400B (en) * 2021-11-01 2023-06-30 电子科技大学长三角研究院(衢州) Method for determining flow key points in communication network

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106878067A (en) * 2017-01-24 2017-06-20 中国人民解放军电子工程学院 A kind of dynamic AdHoc network keys node recognition methods
CN109104725A (en) * 2018-08-27 2018-12-28 重庆邮电大学 The method for preventing joint network from attacking in Tactical Mobile ad hoc network

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8391271B2 (en) * 2009-03-19 2013-03-05 Bae Systems Information And Electronic Systems Integration Inc. Time synchronization for distributed mobile ad hoc networks
US20120042075A1 (en) * 2010-08-16 2012-02-16 Raytheon Company Adaptive services command and control infrastructure

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106878067A (en) * 2017-01-24 2017-06-20 中国人民解放军电子工程学院 A kind of dynamic AdHoc network keys node recognition methods
CN109104725A (en) * 2018-08-27 2018-12-28 重庆邮电大学 The method for preventing joint network from attacking in Tactical Mobile ad hoc network

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"A hierarchical identity based key management scheme in tactical Mobile Ad Hoc Networks";Fei Wang,Helen Tang,F. Richard Yu,Peter C. Mason;《MILCOM 2009 - 2009 IEEE Military Communications Conference》;20100115;全文 *
"MANET中关键节点补偿算法研究";王琳;《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑》;20070615;全文 *
"一种基于SCA规范的自组网电台系统设计与实现方法";毕海霞，魏志强，贯林林;《火控雷达技术》;20140925;全文 *

Also Published As

Publication number Publication date
CN111130870A (en) 2020-05-08

Similar Documents

Publication Publication Date Title
CN111130870B (en) Tactical mobile ad hoc network key node analysis method based on influence factor evaluation
Wu et al. A generic distributed broadcast scheme in ad hoc wireless networks
CN108337166B (en) Low-delay high-reliability routing method for aviation cluster network
Duong Load balancing routing under constraints of quality of transmission in mesh wireless network based on software defined networking
CN111835633B (en) Routing and loop-back preventing method and device in easy mesh networking
Channa et al. A reliable routing scheme for post-disaster ad hoc communication networks.
CN108134772A (en) A kind of safety routing method using AODV or DSDV protocol realizations
CN109639588A (en) A kind of web impact factor method for routing of Aviation cluster
CN115474214A (en) Networking method and system based on miniaturized access grouping equipment
Guo et al. A trusted resource-based routing algorithm with entropy estimation in integrated space-terrestrial network
Gupta et al. A novel approach for malicious node detection in cluster-head gateway switching routing in mobile ad hoc networks
Mohapatra et al. Performance analysis of reactive routing protocols in MANET under CBR traffic using NS2
Abdollahi et al. Software-defined networking-based adaptive routing for multi-hop multi-frequency wireless mesh
Hu et al. Mesh network reliability analysis for ultra-reliable low-latency services
AU2021100084A4 (en) IOT-Enable Wireless Sensor Networks for controlled And Safe Routing
Kumari et al. Communication based clustering to detect selfish nodes in MANET
Ichaba et al. Performance effects of algorithmic elements in selected MANETs routing protocols
Juneja DRI table based traffic-behaviour analysis approach for detection of blackhole attack
Peng et al. Influential Nodes Analysis Method of Tactical Mobile Ad Hoc Networks Based on Impact Factors Evaluation
CN105187264A (en) Straight connection link quality monitoring method, communication device and system
Shrivastava et al. A new technique to prevent MANET against rushing attack
CN110139304A (en) MPR set option method based on isolated degree and non-MPR node
Kai et al. A rank sequence method for detecting black hole attack in ad hoc network
Wang et al. Improvement and optimization of a mobile multi-agent AODV routing protocol
Alattas A Novel Method for Avoiding Congestion in a Mobile Ad Hoc Network for Maintaining Service Quality in a Network

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant