CN110839244B - Credible data collection method based on node trust value virtual force - Google Patents

Credible data collection method based on node trust value virtual force Download PDF

Info

Publication number
CN110839244B
CN110839244B CN201910999966.3A CN201910999966A CN110839244B CN 110839244 B CN110839244 B CN 110839244B CN 201910999966 A CN201910999966 A CN 201910999966A CN 110839244 B CN110839244 B CN 110839244B
Authority
CN
China
Prior art keywords
node
trust value
nodes
trust
force
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
CN201910999966.3A
Other languages
Chinese (zh)
Other versions
CN110839244A (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.)
Huaqiao University
Original Assignee
Huaqiao University
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 Huaqiao University filed Critical Huaqiao University
Priority to CN201910999966.3A priority Critical patent/CN110839244B/en
Publication of CN110839244A publication Critical patent/CN110839244A/en
Application granted granted Critical
Publication of CN110839244B publication Critical patent/CN110839244B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/12—Detection or prevention of fraud
    • H04W12/121—Wireless intrusion detection systems [WIDS]; Wireless intrusion prevention systems [WIPS]
    • H04W12/122—Counter-measures against attacks; Protection against rogue devices
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
    • H04W28/065—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information using assembly or disassembly of packets
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention relates to a credible data collection method based on node trust value virtual force, which comprises the steps of firstly designing a node trust evaluation algorithm (including direct trust and indirect trust) according to the relationship between nodes in the application of data collection of the Internet of things, and calculating the quantitative trust value of the nodes; then mapping the trust value of the node into physical force borne by the node, giving attraction force to the trusted node and giving repulsion force to the untrusted node; simulating the moving initial path into a magnetic soft rope, wherein the initial path moves under the action of the joint force to finally generate a credible data collection path with higher credibility; the credible cluster head nodes are sequentially accessed within a limited moving distance through the moving edge nodes, credible sensing data are collected and sent to surrounding base stations, or directly applied to upper layer users, and the purposes of credible system application and decision making are achieved.

Description

Credible data collection method based on node trust value virtual force
Technical Field
The invention belongs to the field of information security of large-scale wireless sensor networks, and particularly relates to a credible data collection method based on node trust value virtual power.
Background
The rapid development of the internet of things (IoT) and mobile applications puts more stringent requirements on cloud infrastructure and underlying wireless sensor networks, such as system security, ultra-low latency, network energy consumption and reliability, etc. These stringent requirements drive the demand for highly localized services near the network edge of the user. Therefore, mobile Edge Computing (MEC) has come to be a distributed open platform that merges network, computing, storage, and application core capabilities at the network edge near the source of the object or data, and can provide edge intelligent services nearby.
The data collected by the underlying sensor network is the foundation of the internet of things system and the foundation of all applications, but the data collected by the sensors in the network is not credible in the real situation. The sensor nodes are randomly deployed in unattended areas and severe environments to perform various complex tasks and play an important role in various fields. Such as battlefield surveillance, smart cities, intelligent medical monitoring, intrusion detection and emergency response, etc. Due to the complex environment of the underlying sensor network, the network is more vulnerable to attacks, resulting in invalid and even misleading data being collected by the sensors, and less than 49% of the data being valid and trustworthy. If the data collected by the sensors in the network is problematic and unreliable in itself, this will make the data protection and application of the upper layers silent. Network security aims to protect network systems or network resources from various types of attacks. In the underlying WSN, attacks can be divided into two categories: internal attacks and external attacks. Although the security mechanisms of the encryption authentication and routing protocols can effectively resist external attacks, the security mechanisms have little effect on internal attacks, and the existing documents and researches show that the internal attacks of the underlying network of the internet of things are far more harmful than the external attacks. Trust evaluation is an effective and lightweight method for dealing with malicious node attacks inside nodes, and is an important component of computer security. Meanwhile, in the data acquisition research of the existing internet of things system, the used high-efficiency mobile data acquisition devices are all common nodes on the bottom layer, and the computing capacity, the storage capacity, the communication capacity and the energy are very limited. In addition, most of bottom nodes can be accessed by the traditional mobile data acquisition device in the data acquisition process, so that the delay is high, the energy consumption of the nodes is high, and most of the acquired data are invalid data from malicious nodes.
Under the background, by introducing the idea of an edge computing mode, a mobile node with strong functions and fixed nodes such as traditional sink nodes and base stations form an edge node layer, and a credibility virtual power-based credibility data collection method is provided. According to the method, factors of credibility of the sensor nodes are comprehensively considered on the basis of a traditional mobile data collection method, and credible data collection is performed on an Internet of things system by fully utilizing local computing and storing capacity of the edge nodes based on credible evaluation of the nodes.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provide a credible data collection method based on the node trust value virtual force.
In order to realize the purpose, the technical scheme of the invention is as follows:
a credible data collection method based on node credible value virtual force comprises the following steps:
s10, obtaining a trust value of a node;
s20, determining a credible cluster head node based on the obtained credible value;
and S30, mapping the trust value of the node into a virtual acting force applied to the node so as to push the initial path to move, and generating a data collection path with higher reliability.
Preferably, the S10 specifically includes:
s101, judging whether the distance from the current node to a cluster head node is within a preset communication range of the node, if so, calculating a direct trust value of the current node, and taking the direct trust value obtained by calculation as the trust value of the node; if not, go to S102;
s102, judging whether the sum of the distance from the current node to any other node in the cluster and the distance from the other node to the cluster head node is within a preset communication range of the node, if so, marking the other node as a neighbor node of the current node, calculating an indirect trust value of the current node, and taking the calculated indirect trust value as the trust value of the node.
Preferably, the direct trust value is expressed as follows:
Figure BDA0002240986770000021
wherein the content of the first and second substances,
Figure BDA0002240986770000022
expressed as the total direct trust value of node i and node j; omegacom、ωl、ωeAnd ωPRespectively representing the weight, omega, given by communication trust, distance trust, energy trust and packet loss rate trustcom+ωl+ωe+ωP＝1；TcomRepresenting a node communication trust value; t is a unit oflRepresenting a node location trust value; t is a unit ofeRepresenting a node energy trust value; t is a unit ofpRepresenting a node packet loss rate trust value;
node communication trust value TcomThe calculation method of (2) is as follows:
Tcom＝ωoldd×Toldd+ωnewd×Tnewd，
wherein, Tnewd＝S/C；ωoldd+ωnewd＝1；ωolddAnd omeganewdRespectively representing old trust value weight and new trust value weight of node，TolddRepresents old trust value, initialization stage sets Toldd＝0，TnewdRepresenting a new trust value; t isoldd、Tnewd、ωolddAnd ωnewdIs a variable amount; s represents the number of successful communications; c represents the total number of communications;
node location trust value TlThe calculation method of (2) is as follows:
Tl＝1-Ds/R
wherein D isSThe distance between the node and the cluster head node is represented, and R represents the communication range of the node;
node energy trust value TeThe calculation method of (2) is as follows:
Te＝Ec/Ei
wherein, EiRepresenting the initial energy of the node, EcRepresents the remaining energy;
node packet loss rate trust value TpThe calculation method is as follows:
Figure BDA0002240986770000031
wherein, PsIndicating the number of data packets transmitted, PrIndicating the number of packets received.
Preferably, the indirect trust value is expressed as follows:
Figure BDA0002240986770000032
wherein m represents the number of neighbor nodes,
Figure BDA0002240986770000035
representing the weight; (T)X,Y)ARepresenting the trust value of the node X to Y after being transmitted by the neighbor node A;
Figure BDA0002240986770000033
TA,Yrepresenting a direct trust value for nodes a and Y,
Figure BDA0002240986770000034
a direct trust value sum representing a recommended node;
(TX,Y)A＝TX,A×TA,Y
wherein, TX,ARepresenting the direct trust values of nodes X and A; t isA,YRepresenting a direct trust value for nodes a and Y.
Preferably, the S20 specifically includes:
s201, a routing protocol is adopted to perform node clustering in the initial stage of the network to obtain a plurality of clusters, namely a plurality of cluster head nodes are generated;
s202, after the network works for a period of time, all nodes in the cluster generate parameters required for calculating trust values, and the cluster head node calculates the trust values of all nodes in the cluster according to the generated parameters;
s203, after the cluster head nodes compress and fuse the data, sending the trust value data and the identity ID of each node in each cluster to a base station;
s204, the base station carries out statistical analysis on the data of the nodes including the cluster head nodes according to the received data to generate a trust value table of each node;
s205, in the next round of cluster head node election, nodes with high trust values are directly elected as cluster head nodes, and the cluster head nodes sequentially and circularly work.
Preferably, the S30 specifically includes:
giving an initial path, and continuously moving points on the initial path under the action of resultant force of surrounding nodes; the action points of the force of the nodes around the moving path are projection points of the nodes on a path curve, the direction of the attraction force points to the nodes from the action points, and the direction of the repulsion force points to the opposite direction of the nodes, so that the moving edge nodes can always move along a route area with the highest credibility under the resultant force of the credible virtual forces mapped by the node trust values;
defining a node with a trust value greater than 0 as a trusted node, and endowing attraction; defining the node with the trust value less than 0 as an untrusted node and endowing the node with repulsive force; meanwhile, the acting force of the node is in direct proportion to the trust value, for a credible node, the larger the trust value is, the larger the attraction force is, and for an incredible node, the smaller the absolute value is, the smaller the repulsion force is.
Preferably, the virtual force applied to the projection point of the moving path node is represented as follows:
Figure BDA0002240986770000041
wherein p and q respectively represent the number of credible nodes and incredible nodes on the same straight line position; fa、FrRespectively representing the attraction force and the repulsion force of a single node, and the values are equal to the trust value; k is an adjustment coefficient; fvThe virtual force is a virtual force applied to a projection point on the path, and the virtual force comprises a resultant force of an attractive force and a repulsive force.
After the scheme is adopted, the invention has the beneficial effects that:
the invention discloses a credible data collection method based on node trust value virtual force, which aims at the problems that the traditional wireless sensor network only considers the influence of network energy and time delay in data collection and simultaneously ignores various internal attacks faced by nodes. By the method, more credible data can be collected while reducing the energy consumption of the nodes in various applications of the sensor, and the purpose of providing reliable guarantee for upper-layer user decision and data application is achieved; the method can be applied to the application with higher requirements on information safety and data reliability of a large-scale wireless sensor network.
The present invention is described in further detail with reference to the drawings and the embodiments, but the method for collecting trusted data based on node trust value virtual power is not limited to the embodiments.
Drawings
FIG. 1 is a flow chart of a method for collecting trust data based on a node trust value virtual power according to the present invention;
FIG. 2 is a schematic diagram of indirect trust transfer according to the present invention;
FIG. 3 is a schematic diagram of the movement path nodal force effects of the present invention;
FIG. 4 is a diagram of a movement path under the action of a virtual force mapped based on a node trust value according to the present invention;
FIG. 5 is a sparse distribution path diagram of 13 nodes of the present invention;
FIG. 6 is a high density distribution path diagram of 30 nodes of the present invention;
FIG. 7 is a diagram of network energy consumption under different trust value evaluation methods of the present invention;
FIG. 8 is a graph comparing changes in trust values under different trust evaluation methods of the present invention;
FIG. 9 is a graph of distances between different types of nodes and trusted data collection paths of the present invention;
fig. 10 shows the detection rate of network malicious nodes under different strategies according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be described and discussed in detail below with reference to the drawings. It should be understood that the specific embodiments described herein are merely illustrative of the invention and do not limit the invention.
In the application of the data acquisition of the Internet of things, a node trust evaluation algorithm (such as direct trust and indirect trust) is designed according to the relationship between nodes, and the quantitative trust value of the node is calculated by the existing algorithm. And mapping the trust value of the node into physical force borne by the node, and giving attraction force to the trusted node and repulsion force to the untrusted node. The moving initial path is simulated into a magnetic soft rope, the initial path moves under the action of the joint force, and finally a credible data collection path with higher credibility is generated. The credible cluster head nodes are sequentially accessed within a limited moving distance through the moving edge nodes, credible sensing data are collected and sent to surrounding base stations, and then the sensing data are handed to upper-layer users, so that the purposes of credible system application and decision making are achieved.
Referring to fig. 1, the present invention provides a method for collecting trusted data based on a node trust value virtual power, including:
s10, obtaining a trust value of a node;
s20, determining a credible cluster head node based on the obtained trust value;
and S30, mapping the trust value of the node into a virtual acting force applied to the node to push the initial path to move, and generating a data collection path with higher credibility.
Specifically, the detailed implementation steps are as follows.
Step 1): and establishing a direct trust model and calculating the direct trust value of the node. In the network operation, the initial credibility of the node is set (set as T)i) And a confidence threshold delta for the node. The trust value can be represented in various ways, and the interval [0,10 ] is adopted in consideration of the limited storage space of the sensor node]Representing the trust value of the node. Unsigned integers occupy 1 byte and real numbers 4 bytes, so 0,10 is used]75% of memory space can be saved, and data transmission between nodes is correspondingly reduced.
A trust value rule is defined that uses an interval to represent the trust range of a node, the interval being defined as [0,10 ]]The initial trust value of the node is set to 5. The trust value at a certain moment is denoted as TcWhen T isc=0, meaning that the node is completely untrusted; t is a unit ofc=10 indicates that the node is fully trusted.
The direct trust value of the node is obtained by evaluating four fine-grained parameters of a communication trust value, a position trust value, a packet loss rate trust value and an energy trust value of the node as follows.
A. Communicating trust values
Two adjacent nodes in the network communicate with each other, the times S of successful communication and the total times C of communication and the communication trust value T between the nodescomThe relationship of (1):
Tcom＝ωoldd×Toldd+ωnewd×Tnewd，Tnewd＝S/C
and omegaoldd+ωnewd＝1 (1)
Wherein, ω isolddAnd omeganewdRespectively representing the old and new trust value weight of the node, TnewdAnd TolddRespectively list trust value, initialization stage setting Toldd＝0，ωolddAnd omeganewdAre variable amounts.
B. Location trust value
When the node position is closer to the cluster head node, the probability of successfully transmitting the data packet to the node is higher, and the consumed energy is lower. The calculation of the node location trust value is represented as:
Tl＝1-Ds/R (2)
wherein, TlRepresenting a node location trust value, DSThe distance between the node and the cluster head node is shown, and R represents the communication range of the node.
C. Packet loss rate trust value
In a wireless communication environment, the packet loss rate indirectly reflects the quality of a link, and a higher packet loss rate indicates a poorer link quality. In order to determine whether the communication behavior of the node on the data transmission link is abnormal, the packet loss rate trust value of the node needs to be calculated. The number of transmitted data packets is PsThe number of received data packets is PrIf the packet loss rate is greater than the threshold, the packet loss rate trust value is:
Figure BDA0002240986770000061
D. energy trust value
Energy as a key index of a sensor node reflects the service life of the node, and the initial energy of the node is set as EiResidual energy of EcThen the energy confidence value calculation of the node can be represented as Te＝Ec/Ei。
Therefore, the trust evaluation of this section on the node can be expressed as:
Figure BDA0002240986770000062
wherein the content of the first and second substances,
Figure BDA0002240986770000063
expressed as the total direct trust value, ω, of node i and node jcom，ωl，ωe，ωPRespectively representing the weights given by communication trust, distance trust, energy trust and packet loss rate, and simultaneously having omegacom+ωl+ωe+ωP＝1。
Step 2): and establishing an indirect trust transfer model and constructing a node trust value calculation framework. When the adjacent nodes can not obtain the direct trust value, the nodes need to obtain the indirect trust value by relying on the history of the interaction with the trust object. In the indirect trust calculation, the trust value of one node may be recommended by a plurality of nodes, and because the trust values of the nodes are different and the recommended nodes may be malicious nodes or manually operated, the recommended nodes need to be endowed with weight values, and the weight values are defined as
Figure BDA0002240986770000064
Referring to FIG. 2, to compute the trust of node X at node Y, an indirect trust value is obtained through the trust passing of the neighboring nodes of X and Y. For example the following formula:
(TX,Y)A＝TX,A×TA,Y (5)
wherein (T)X,Y)AIs the trust value of node X to Y after passing through the neighbor node a.
The weight of the recommended node is proportional to the direct trust value of the adjacent node, namely:
Figure BDA0002240986770000071
wherein m represents the number of neighbor nodes, TA,YRepresenting a direct trust value for nodes a and Y,
Figure BDA0002240986770000072
representing the direct trust value sum of the recommended nodes.
The indirect trust of X obtained at node Y is:
Figure BDA0002240986770000073
we use equation (5) to compute the trust value of a node when it can directly obtain the direct trust value, otherwise we compute the trust value of the node using equation (7) on the basis of the direct trust value.
Step 3): and calculating the trust value of the node by using the step 1) and the step 2). The trust value evaluation algorithm of the node calculates the node communication trust value, the position intimacy, the packet loss rate and the energy remaining four parameters to finally obtain the trust evaluation value of the node. The input of the algorithm is related variables related to the calculation of the direct trust value and the indirect trust value, the node energy and the data packets sent and received, and the output is the final evaluation trust value of the node.
First, for any given stable network, the trust value of each node (including the cluster head node) is calculated. The method mainly comprises the steps of calculating parameters such as communication trust values, position intimacy, packet loss rate and energy surplus of the sensor nodes, and obtaining direct trust values of the area nodes by combining weights. In the calculation, judgment is carried out firstly to see whether the node is a neighbor node of the node or not and whether the data packet received by the node at this time meets the requirement or not. And calculating the direct trust value of the node meeting the condition, otherwise, considering the indirect trust value.
The algorithm mainly comprises two steps: first, a direct trust value T is calculatedX,Y(trust value between node X and neighbor node Y), followed by TX,YBased on the relation of the node communication range, whether the direct trust value or the indirect trust relation is adopted to solve the trust value is determined, and finally the node trust value T is obtainedc。
Figure BDA0002240986770000074
Figure BDA0002240986770000081
And for nodes which are not in the own neighbor node list or are used as neighbor nodes, but the number of the data packets received by the node at this time is less than a threshold value, indirect trust is also adopted to calculate the trusted value of the node.
Step 4): and determining the credible cluster head node by using the obtained trust value. And based on the cluster head generated by the low-power-consumption self-adaptive routing protocol, using the trust value as a condition for electing a cluster head node. The generation process of the cluster head node based on the trust value is as follows:
1) In the initial stage of the network, a routing protocol is adopted to perform node clustering to obtain a plurality of clusters, namely a plurality of cluster head nodes are generated.
2) After the network works for a period of time, each node in the cluster generates parameters required for calculating the trust value, and the cluster head node calculates the trust value of each node in the cluster according to the generated parameters.
3) After the cluster head node performs necessary compression and fusion on the data, only the trust value data and the identity ID of each node in each cluster are sent to the base station.
4) The base station carries out statistical analysis on the data of the nodes including the cluster head nodes according to the received data, and a trust value table of each node can be generated.
5) And in the next round of cluster head node election, directly electing the node with a higher trust value as a cluster head node, and sequentially and circularly working.
And step 5): and mapping the trust value of the node into a virtual acting force borne by the node to push the initial path to move by using the trust values from the step 1) to the step 4), so as to generate a data collection path with higher credibility. Based on the trust evaluation of the nodes, the mobile edge node can avoid the untrusted nodes for mobile data collection. In the path planning, the overall trust condition of a region is comprehensively considered instead of only considering a single node, and the requirement of data timeliness is also considered (the path planning moves to a region with high reliability as much as possible within a limited moving distance). The nodes are divided into different areas according to the belonged geographic areas or the clustering mode, the credible nodes are endowed with attractive force according to the evaluation of the credible values of the nodes, while the untrustworthy nodes are endowed with repulsive force, and the force is related to the credible values of the nodes. The path of movement is modeled as a magnetic cord that "pushes" the path of movement towards trusted areas and away from untrusted areas by the combined forces of attraction and repulsion.
According to the node trust value evaluation, the rules of the corresponding acting force and the planning path of the node trust value are described as follows:
defining a trust value Tc>0 is a credible node, and is endowed with attraction, TcIf less than 0, the node is an untrusted node, and repulsive force is given; simultaneously the magnitude of the node acting force and the trust value TcProportional ratio, TcGreater values for greater attraction, TcThe smaller the absolute value, the smaller the repulsive force.
The main objective is to give an initial path, and the point on the initial path moves continuously under the action of the resultant force of the surrounding nodes, so as to generate a moving path with higher reliability within a specified path length (or a specified time). The action points of the force of the nodes around the moving path are projection points of the nodes on a path curve, the direction of the attraction force points to the nodes from the action points, and the direction of the repulsion force points to the opposite direction of the nodes, so that the moving edge nodes can always move along a route area with the highest credibility under the resultant force of the credible virtual forces mapped by the node trust values. Referring to fig. 4, the structural diagram shows a simple trusted path generation process, where given an initial mobile data collection path (simulated as a magnetic rope), points on the path continuously move under the effect of the resultant of virtual forces mapped by the trust values of surrounding nodes, so that the path is continuously updated, and finally a more trusted mobile data collection path that meets the limit of the movement distance is generated. And the mobile edge node moves along the trusted path from the selected starting point, and collects the data of the trusted node within a limited moving distance.
The acting forces of a plurality of nodes on the same side (or two sides) of the curve on the curve path are defined to be algebraically synthesized, and the direction is the direction of the attractive force or the repulsive force of the resultant force. Referring to fig. 3, the force action points of the nodes around the moving path are projection points of the nodes on the path curve, the direction of the attraction force is directed to the nodes from the action points, the direction of the repulsion force is directed to the opposite direction of the nodes, the acting forces of a plurality of nodes on the same straight line on the same side (or two sides) of the curve on the path are algebraically synthesized, and the direction is the direction of the attraction force or the repulsion force of the resultant force. The mobile edge node can always move along the route area with the highest credibility under the action of the credibility virtual force of the node trust value mapping.
The virtual force (including attractive force and repulsive force) applied to the projected point of the moving path node can be expressed as:
Figure BDA0002240986770000091
wherein p and q respectively represent the number of trusted nodes and untrusted nodes on the same straight line position; fa、FrRespectively representing the attraction and repulsion of a single node, numerically equal to the trust value Tc(ii) a k is an adjustment coefficient; fvThe resultant force on the projected point on the path.
Figure BDA0002240986770000092
Figure BDA0002240986770000101
In the algorithm 2, the new coordinates of the nodes are defined as two-dimensional coordinates, specifically, the new coordinates are calculated as addition and subtraction of horizontal and vertical coordinates, the action of the resultant force pushes the movement of the path to be finally reflected on the change of the coordinates, and the different magnitudes of the movement speed and the resultant force also influence the change speed of the coordinates.
In this embodiment, a simulation platform is constructed by using MATLAB R2018a, and performance evaluation and analysis are performed on the proposed trusted data collection algorithm. The simulation environment is set to be that 100 nodes are randomly deployed in an area of 300m × 300m, and 30 nodes are selected as cluster head nodes, it is assumed that the mobile edge nodes start to move at a constant speed from a selected starting point, and the moving speed and the communication radius are adjustable. The minimum energy threshold of a node is set to one-thousandth of the initial energy of the node, and the minimum packet reception threshold is two-thousandth of the threshold for node data generation. An initial path without intersection is set, and then a path with the maximum trust value is generated within the specified moving distance according to the virtual force algorithm. In our experiment we selected 13 reference points on the moving path to segment the initial path (virtual magnetic cord). Based on these reference points, the path moves by half a unit distance under a unit force according to the action of the virtual force resultant mapped by the calculated trust value of the node, and the movement path of the specified distance is obtained by running 10 time units, as shown in fig. 5.
As the length of the initial path and the number of nodes increase, the planned trusted data collection path also becomes complex, as shown in fig. 6. The initial path nodes are set to be 30 for experiment, and meanwhile, the distribution density of the nodes in the network is correspondingly increased.
It can be seen that the length of the newly generated path is smaller than that of the original path, and the new path is located closer to the trusted node. The comprehensive intuitive path generation experiment shows that the credible data collection method based on the virtual force can push the mobile path to a credible area and is far away from an incredible area, thereby achieving the purpose of efficiently collecting credible data.
To verify the validity of the trust evaluation algorithm, the present embodiment simulates an internal attack of the node (mainly selfish node). The performance of the algorithm is verified by deploying a certain proportion of malicious nodes in the network. As can be seen from fig. 7, the network energy consumption using the method named the ETRES trust evaluation system increases rapidly as malicious nodes increase from 20% to 80%. Especially when the proportion of malicious nodes in the network reaches around 40%, the rate of energy consumption increases considerably with this approach. The energy consumption growth trend with the method named BTEM trust evaluation mechanism is very similar to ETRES, both much larger than the VFDC method proposed by the present invention. Meanwhile, through experimental results, the energy consumption of the VFDC method provided by the invention is only slightly increased under different malicious node proportion conditions, but the overall consumption is stabilized below 45. The method has the advantages of good robustness and stability, and capability of effectively resisting malicious attacks from the interior of the node. From fig. 8, it can be seen that when the proportion of malicious nodes in the network reaches about 50%, the trust value of the node is rapidly reduced, which also reflects the credibility of the trust evaluation method. The results of the method adopting ETRES and the method adopting BTEM are similar, and when the ratio of network malicious nodes is high, the trust value of the nodes is reduced to a neutral level (the trust value is 5 which is also the initial value of the nodes). However, compared with the other two methods, the VFDC method provided herein has a significant advantage when the malicious node ratio is about 60.
To intuitively illustrate the validity of the proposed trusted data collection method from the data, the distance between a point on the trusted path and the trusted and untrusted nodes at different times (rounds) is calculated, as shown in fig. 9. As the initial path iterates (the experimental time increases), the distance of the newly generated trusted path from the untrusted nodes increases rapidly. Although the curve from the trusted node is relatively flat, the distance is slowly reduced. Through the experiment, the credible data collection method based on the virtual force can push the moving path to a credible area and move away from an incredible area through the force action. As can be seen from fig. 10, as the number of iterations of the movement path increases, the identification rate of the trust evaluation method for the malicious node also increases accordingly. The method using CTRUST has a similar rate of identifying malicious nodes to the VFDC method proposed herein, but is slightly lower, especially in the early stages of network operation, and the detection rate is much lower than that of the method herein. Compared with the BTEM method, the method provided by the invention has a much higher detection rate on the malicious node.
The present embodiment tests network energy consumption using different methods for different network architectures and deployments. As the number of nodes (cluster heads) increases from 10 to 60, the energy consumption of the network nodes increases. The node adopting the BTEM method has the fastest average energy consumption, and the growth rate is the largest when the CTRUST method follows. However, when the network structure based on the trusted cluster head nodes is adopted, the energy consumption of the network is the minimum and the average value is the most stable, so that the energy consumption of each node of the network can be balanced, and the life cycle of the network is effectively prolonged.
In summary, in one aspect, the invention provides a multidimensional trust evaluation method to comprehensively evaluate the trust value of a node, where the trust model includes direct trust and indirect trust, parameters (such as energy, processing capability, etc.) related to the state of the node itself, and the behavior of the node participating in interaction. And providing detailed indexes such as a communication trust value, position intimacy, packet loss rate, energy surplus and the like in a multidimensional trust model to quantify the trust value of the node, so that malicious attacks from the interior of the node can be effectively resisted. Meanwhile, an integer interval is adopted for representing in the quantification of the trust value, so that the memory space of the network node can be well saved. On the other hand, the invention provides a novel credible path generation method, which combines the trust value of the node with the action of the physical neutral force, so as to generate a data collection path with higher credibility by utilizing the action of the resultant force of the virtual force mapped by the trust value of the node. The moving path is simulated into a magnetic soft rope, the reliable node is endowed with attraction force, the unreliable node is endowed with repulsive force, the moving path is pushed to a region with higher reliability and is far away from the unreliable region through the resultant force of the interaction of the attraction force and the repulsive force, the moving distance is shortened, the network life cycle of the node is prolonged, and the purpose of efficiently collecting reliable data is achieved.
The above is just one preferred implementation of the present invention. However, the present invention is not limited to the above embodiments, and any equivalent changes and modifications made according to the present invention, which do not bring out the functional effects beyond the scope of the present invention, belong to the protection scope of the present invention.

Claims (4)

1. A credible data collection method based on node trust value virtual force is characterized by comprising the following steps:
s10, obtaining a trust value of a node;
s20, determining a credible cluster head node based on the obtained trust value;
s30, mapping the trust value of the node into a virtual acting force applied to the node so as to push the initial path to move and generate a data collection path with higher reliability;
the S10 specifically includes:
s101, judging whether the distance from the current node to a cluster head node is within a preset communication range of the node, if so, calculating a direct trust value of the current node, and taking the direct trust value obtained by calculation as the trust value of the node; if not, go to S102;
s102, judging whether the sum of the distance from the current node to any other node in the cluster and the distance from the other node to the cluster head node is within a preset communication range of the node or not, if so, marking the other node as a neighbor node of the current node, calculating an indirect trust value of the current node, and taking the calculated indirect trust value as the trust value of the node;
the S20 specifically includes:
s201, a routing protocol is adopted to perform node clustering in the initial stage of the network to obtain a plurality of clusters, namely a plurality of cluster head nodes are generated;
s202, after the network works for a period of time, each node in the cluster generates parameters required for calculating the trust value, and the cluster head node calculates the trust value of each node in the cluster according to the generated parameters;
s203, after the data are compressed and fused by the cluster head node, sending the trust value data and the identity ID of each node in each cluster to a base station;
s204, the base station carries out statistical analysis on the data of the nodes including the cluster head nodes according to the received data to generate a trust value table of each node;
s205, directly electing nodes with high trust values as cluster head nodes in the next round of cluster head node election, and sequentially working circularly;
the S30 specifically includes:
giving an initial path, and continuously moving points on the initial path under the action of the resultant force of surrounding nodes; force action points of nodes around the moving path are projection points of the nodes on a path curve, the direction of an attraction force points to the nodes from the action points, and the direction of a repulsion force points to the opposite direction of the nodes, so that the moving edge nodes can always move along a route area with the highest credibility under the resultant force action of credible virtual forces mapped by the node trust values;
defining a node with a trust value greater than 0 as a trusted node, and endowing attraction; defining the node with the trust value less than 0 as an untrusted node and endowing the node with repulsive force; meanwhile, the acting force of the node is in direct proportion to the trust value, the larger the trust value is, the larger the attraction force is, and the smaller the absolute value is, the smaller the repulsion force is, for the untrusted node.
2. The method for collecting the trusted data based on the virtual power of the node trust value according to claim 1, wherein the direct trust value is expressed as follows:
Figure FDA0003815923060000021
wherein the content of the first and second substances,
Figure FDA0003815923060000022
expressed as the total direct trust value of node i and node j; omegacom、ωl、ωeAnd ωPRespectively representing the weight, omega, given by communication trust, distance trust, energy trust and packet loss rate trustcom+ωl+ωe+ωP＝1；TcomRepresenting a node communication trust value; t islRepresenting a node location trust value; t iseRepresenting a node energy trust value; t is a unit ofpRepresenting a node packet loss rate trust value;
node communication trust value TcomThe calculation method of (2) is as follows:
Tcom＝ωoldd×Toldd+ωnewd×Tnewd，
wherein, Tnewd＝S/C；ωoldd+ωnewd＝1；ωolddAnd omeganewdRespectively representing the old and new trust value weights of the node, TolddRepresents old trust value, initialization stage sets Toldd＝0，TnewdRepresenting a new trust value; t isoldd、Tnewd、ωolddAnd omeganewdIs a variable amount; s represents the number of successful communications; c represents the total number of communications;
node location trust value TlThe calculation method of (2) is as follows:
Tl＝1-Ds/R
wherein D isSThe distance between the node and the cluster head node is represented, and R represents the communication range of the node;
node energy trust value TeThe calculation method of (2) is as follows:
Te＝Ec/Ei
wherein, EiRepresenting the initial energy of the node, EcRepresents the remaining energy;
node packet loss rate trust value TpThe calculation method is as follows:
Figure FDA0003815923060000023
wherein, PsIndicating the number of data packets transmitted, PrIndicating the number of packets received.
3. The method for collecting the credible data based on the virtual power of the node credible value as claimed in claim 1, wherein the indirect credible value is represented by the following method:
Figure FDA0003815923060000024
wherein m represents the number of neighbor nodes,
Figure FDA0003815923060000025
representing the weight; (T)X,Y)ARepresenting the trust value of the node X to Y after being transmitted by the neighbor node A;
Figure FDA0003815923060000026
TA,Yrepresenting a direct trust value for nodes a and Y,
Figure FDA0003815923060000031
a direct trust value sum representing a recommended node;
(TX,Y)A＝TX,A×TA,Y
wherein, TX,ARepresenting the direct trust values of nodes X and A; t is a unit ofA,YRepresenting the direct trust values of nodes a and Y.
4. The method for collecting the trusted data based on the virtual force of the node trust value according to claim 1, wherein the virtual force applied to the projected point of the node of the moving path is represented as follows:
Figure FDA0003815923060000032
wherein p and q respectively represent the number of trusted nodes and the number of untrusted nodes on the same straight line position; fa、FrRespectively representing the attraction force and the repulsion force of a single node, and the values are equal to the trust values; k is an adjustment coefficient; fvThe virtual force is a virtual force applied to a projection point on the path, and the virtual force comprises a resultant force of an attractive force and a repulsive force.
CN201910999966.3A 2019-10-21 2019-10-21 Credible data collection method based on node trust value virtual force Active CN110839244B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910999966.3A CN110839244B (en) 2019-10-21 2019-10-21 Credible data collection method based on node trust value virtual force

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910999966.3A CN110839244B (en) 2019-10-21 2019-10-21 Credible data collection method based on node trust value virtual force

Publications (2)

Publication Number Publication Date
CN110839244A CN110839244A (en) 2020-02-25
CN110839244B true CN110839244B (en) 2022-11-01

Family

ID=69575413

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910999966.3A Active CN110839244B (en) 2019-10-21 2019-10-21 Credible data collection method based on node trust value virtual force

Country Status (1)

Country Link
CN (1) CN110839244B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111787506A (en) * 2020-07-20 2020-10-16 中南大学 Trusted data collection method based on unmanned aerial vehicle in wireless sensor network
CN115150767B (en) * 2022-09-06 2022-12-13 湖南智警公共安全技术研究院有限公司 Wireless sensor network data transmission method based on edge calculation

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101888328A (en) * 2010-03-02 2010-11-17 北京邮电大学 Trust management system based trusted reconstructing method of IP routing protocol
CN105493438A (en) * 2013-07-01 2016-04-13 诺基亚技术有限公司 A method and apparatus for anonymous authentication on trust in social networking
CN106888430A (en) * 2017-04-17 2017-06-23 华侨大学 A kind of believable sensing cloud Data Collection appraisal procedure
CN108882332A (en) * 2018-07-09 2018-11-23 大连理工大学 Trust cloud data migration method based on sub-clustering in a kind of UWSNs
CN110049528A (en) * 2019-04-25 2019-07-23 华侨大学 Mobile trust data collection method based on trust value effectiveness in a kind of Sensor Network

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100969158B1 (en) * 2008-06-30 2010-07-08 경희대학교 산학협력단 Method of trust management in wireless sensor networks
CA2675701A1 (en) * 2009-08-27 2009-11-05 Ibm Canada Limited - Ibm Canada Limitee Trust assertion using hierarchical weights

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101888328A (en) * 2010-03-02 2010-11-17 北京邮电大学 Trust management system based trusted reconstructing method of IP routing protocol
CN105493438A (en) * 2013-07-01 2016-04-13 诺基亚技术有限公司 A method and apparatus for anonymous authentication on trust in social networking
CN106888430A (en) * 2017-04-17 2017-06-23 华侨大学 A kind of believable sensing cloud Data Collection appraisal procedure
CN108882332A (en) * 2018-07-09 2018-11-23 大连理工大学 Trust cloud data migration method based on sub-clustering in a kind of UWSNs
CN110049528A (en) * 2019-04-25 2019-07-23 华侨大学 Mobile trust data collection method based on trust value effectiveness in a kind of Sensor Network

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
A Secure IoT Service Architecture With an Efficient Balance Dynamics Based on Cloud and Edge Computing;Tian Wang等;《 IEEE Internet of Things Journal》;20180913;全文 *
基于组合指标的无线传感器网络安全路由算法;唐清明等;《电视技术》;20161117(第11期);全文 *
基于节点信任度的三维覆盖算法;党小超等;《计算机应用研究》;20161215(第12期);全文 *
基于雾计算的可信传感云研究进展;王田;《通信学报》;20190325;全文 *
无线传感器网络的基于信任管理的分布式高可靠覆盖机制;李小龙等;《高技术通讯》;20140515(第05期);全文 *

Also Published As

Publication number Publication date
CN110839244A (en) 2020-02-25

Similar Documents

Publication Publication Date Title
Qiu et al. ROSE: Robustness strategy for scale-free wireless sensor networks
Lin et al. Task offloading for wireless VR-enabled medical treatment with blockchain security using collective reinforcement learning
Wang et al. Game-theory-based active defense for intrusion detection in cyber-physical embedded systems
Shen et al. Signaling game based strategy of intrusion detection in wireless sensor networks
CN107682195B (en) Communication network robustness evaluation method based on combination of complex network and big data
CN106888430B (en) Credible sensing cloud data collection and evaluation method
CN110049528B (en) Mobile credible data collection method based on credible value utility in sensor network
Zhao et al. Dynamic Trust Model for Vehicular Cyber-Physical Systems.
CN110839244B (en) Credible data collection method based on node trust value virtual force
Xu et al. Deep reinforcement learning assisted edge-terminal collaborative offloading algorithm of blockchain computing tasks for energy Internet
CN105848242A (en) Safety route optimization method based on trust perception in wireless sensor network
Deng et al. Resource provisioning for mitigating edge DDoS attacks in MEC-enabled SDVN
Raja et al. A Trusted distributed routing scheme for wireless sensor networks using block chain and jelly fish search optimizer based deep generative adversarial neural network (Deep-GANN) technique
CN112616155A (en) Wireless self-organizing network performance evaluation method
Jiang et al. Controversy-adjudication-based trust management mechanism in the internet of underwater things
Fei et al. Fog computing perception mechanism based on throughput rate constraint in intelligent Internet of Things
Li et al. Design and verification of secure communication scheme for industrial IoT intelligent production line system with multi-path redundancy and collaboration
Qiu et al. A 3-D topology evolution scheme with self-adaption for industrial Internet of Things
Jithish et al. A game‐theoretic approach for ensuring trustworthiness in cyber‐physical systems with applications to multiloop UAV control
Peng et al. Dynamic optimization of government data transmission based on blockchain technology
Li et al. A Novel Nature-Inspired Routing Scheme for Improving Routing Quality of Service in Power Grid Monitoring Systems
Huang A Data‐Driven WSN Security Threat Analysis Model Based on Cognitive Computing
Xiao et al. Edge computing clone node recognition system based on machine learning
Zhao et al. A three-party repeated game model for data privacy in mobile edge crowdsensing of IoT
Du et al. Multiattribute evaluation model based on the KSP algorithm for edge computing

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