A non-cooperative game forwarding method for mobile edge networks based on user credibility

By adopting a non-collaborative game forwarding method based on user credibility in the mobile edge computing network, the node credibility and screening the optimal game object are solved, and the problem of node instability and privacy leakage in the mobile edge computing network is realized. Efficient and secure data transmission.

CN114666793BActive Publication Date: 2024-11-15HENAN UNIV OF CHINESE MEDICINE
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202210363950.5
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-04-07
Publication Date
2024-11-15
Estimated Expiration
2042-04-07

AI Technical Summary

Technical Problem

The high-speed movement of nodes in mobile edge computing networks, bandwidth and energy limitations of wireless links, and fragile network defense capabilities lead to system instability, resulting in long query delays, high forwarding failure rates, and easy privacy leakage during data transmission. There is a forwarding strategy that ignores the mobility and mutual intelligibility of nodes, resulting in the loss of objectivity of the results.

Method used

Using a mobile edge network non-collaborative game forwarding method based on user credibility, the credibility strength between nodes is evaluated through the entropy weight method, the golden ratio is used to filter the optimal game object, and the credibility of the node is used as the forwarding request factor, and the trustworthiness of the node is used as the forwarding request factor. Nash equilibrium obtains the node forwarding probability, and combines the randomly generated numbers to determine whether to forward data packets, ensuring the security and efficiency of data transmission.

Benefits of technology

It realizes the rational use of node energy, extends the network life, ensures the security and topological stability of data transmission, improves the success rate of data transmission, reduces network redundancy and conflicts, and realizes low latency, low energy consumption, and high throughput data transmission.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114666793B_ABST
    Figure CN114666793B_ABST
Patent Text Reader

Abstract

The present invention discloses a non-cooperative game forwarding method for a mobile edge network based on user credibility. The method takes the mobile edge network environment as the research basis, and objectively evaluates the credibility strength between nodes according to the factors reflecting node performance and social ability such as the residual energy ratio of the node, the connection probability between nodes, the service degree provided by the node, and the link stability, and uses the entropy weight method, and uses the golden section ratio to screen the optimal game object for the neighboring nodes encountered in each forwarding; then the credibility of the node is used as a factor of the forwarding request, and forwarding and non-forwarding are used as a game strategy set, and the node forwarding probability is obtained through Nash equilibrium; finally, combined with the randomly generated number and the data packet transmission situation, according to the set rules, it is determined whether to forward the data packet to the game neighbor node, so as to reduce network redundancy, competition and conflict in MEC applications and improve forwarding efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of mobile edge network application technology, and in particular to a mobile edge network non-cooperative game forwarding method based on user credibility. Background Art

[0002] Mobile Edge Computing (MEC) network is a new type of dynamic distributed self-organizing network. It uses wireless access technology to provide the required services and cloud computing functions to nearby telecom users, creating a high-performance, low-latency, high-bandwidth telecom-grade service environment, which will be widely used in civil and military fields. The autonomous peer nodes in the MEC network can transmit data through direct interaction, and can also handle various other services through mutual collaboration. Although the MEC network can provide users with higher quality and more convenient service experience, the system instability caused by the high-speed movement of nodes, the bandwidth and energy limitations of wireless links, and the fragile network defense capabilities make the effective operation of the MEC network more difficult than traditional distributed networks. Simply applying the previous forwarding strategy to the MEC network will lead to problems such as long query delays, high forwarding failure rates, and easy privacy leakage during data transmission.

[0003] The contact probability between nodes refers to the frequency of interaction between nodes. The node service degree reflects the reliability of nodes by estimating the ability of nodes to receive and forward data packets in network applications, which can effectively identify malicious or selfish nodes. These two social factors are usually used to measure the interaction intensity between nodes in the forwarding model. However, the forwarding models that used these two factors in the past were based on two ideal states: one is that all participating devices have enough energy to participate in the forwarding of data packets, and the other is that there are no routing holes and short loops in the routing protocol. In fact, as time goes by and tasks run, the energy of the device will gradually be lost. Some users with high service degrees have to refuse to provide forwarding services because their remaining energy is low or may be close to zero; moreover, the distance between all neighbor nodes of a node and the target node may also be farther than the distance between the node itself and the target node.

[0004] In the past, most forwarding studies first calculated and compared the forwarding performance of all neighboring nodes of the current node, and then directly selected the best node or selected some nodes to participate in data transmission according to a manually set ratio. This operation has two disadvantages. First, it may screen out suboptimal relay nodes with more stable or safer transmission paths, thereby reducing the success rate of data transmission; second, due to the artificially given screening ratio, the experimental results will lose objectivity.

[0005] In addition, most previous forwarding studies based on multi-user competitive decision-making either directly select the best nodes as relays without considering the willingness of participating nodes, or consider the interests of all participating nodes to conduct cooperative games to select relay nodes. These obviously ignore the mobility, randomness and mutual ignorance of nodes in mobile edge networks, resulting in a lack of objectivity in the results. Summary of the invention

[0006] In order to avoid forwarding data to nodes with low credibility and achieve a balance between node transmission capacity, link stability and overall network performance, the present invention proposes a non-cooperative game forwarding scheme based on user Trustworthiness (NCGT) for mobile edge networks. The method is based on the mobile edge network environment. According to the node performance and social ability factors such as the residual energy ratio of the node, the connection probability between nodes, the service degree provided by the node, and the link stability, the entropy weight method (EW) is used to objectively evaluate the trust strength between nodes, and the golden section ratio (GSR) is used to screen the optimal game object for the neighbor nodes encountered in each forwarding; then the node credibility is used as a factor of the forwarding request, and forwarding and non-forwarding are used as the game strategy set, and the node forwarding probability is obtained through Nash equilibrium; finally, combined with the randomly generated number and the data packet transmission situation, according to the set rules, it is determined whether to forward the data packet to the game neighbor node, reduce network redundancy, competition and conflict in MEC applications, and improve forwarding efficiency.

[0007] In order to achieve the above object, the present invention provides the following technical solutions:

[0008] The present invention provides a non-cooperative game forwarding method for a mobile edge network based on user credibility, comprising the following steps:

[0009] S1. Select four attribute factors closely related to nodes: residual energy ratio, contact probability between nodes, service degree and link stability, and use their weighted sum to represent the measure of trust strength between nodes;

[0010] S2. Calculate the trust strength between the node currently carrying data and all its neighbor nodes, sort the neighbor nodes in descending order according to the trust strength value, and use the golden ratio to select the optimal game object for the neighbor nodes encountered in each forwarding;

[0011] S3, taking the node's credibility as a factor in the forwarding request, taking forwarding and not forwarding as the game strategy set, and obtaining the node forwarding probability through Nash equilibrium;

[0012] S4. By comparing the relationship between the randomly generated number and the above forwarding probability, and whether the node has received forwarding data, it is determined whether the node is the next forwarding relay node.

[0013] Furthermore, step S2 uses an entropy weight method to calculate the trust strength between the node currently carrying data and all its neighboring nodes.

[0014] Furthermore, in step S3, the method for obtaining the node forwarding probability through Nash equilibrium is:

[0015] S31, assuming that the forwarding probability of a node r in the set obtained in step S2 is Y, the relationship between the forwarding probabilities of the remaining nodes in the set and Y is constructed using the number of nodes in the set;

[0016] S32, in the collective node group game forwarding, the equal function relationship between the benefit when r forwards the data packet and the benefit when r does not forward the data packet and at least one of the remaining nodes forwards the data packet is established as the Nash equilibrium point;

[0017] S33. Using the two functions and the benefit function established in steps S31 and S32, through variable substitution and replacement, Y is finally expressed as a function formula that is only related to the number of nodes in the collection.

[0018] Furthermore, the method for determining the forwarding relay node in step S4 is as follows: traverse the set of all neighbor nodes within the effective communication range obtained in step S2, generate a random number for each traversal, and determine whether the random number is less than the node forwarding probability obtained in S3; if the result is established and the current node has never received the data packet, add the trust strength value of the current node to the data packet and forward the data packet to the node; after each forwarding, loop through steps S2 to S4 until the data is transmitted to the target node.

[0019] Furthermore, the above-mentioned non-cooperative game forwarding method for mobile edge networks based on user credibility also includes a step S5 of evaluating the performance of the method. Step S5 uses a data cumulative delivery rate function, an average data transmission delay function, a system energy consumption function and a network throughput function as criteria for evaluating the performance of the method, wherein the cumulative data packet delivery rate refers to the ratio of the number of data packets successfully transmitted to their total number of transmissions; the average transmission delay function is the average duration of all successfully transmitted data packets; the system average energy consumption refers to the sum of the energy consumed by all nodes to transmit data packets per unit time; and the network throughput refers to the number of bytes transmitted between the start of transmission and the successful reception of all data packets that successfully reach the target node.

[0020] Furthermore, in the above-mentioned non-cooperative game forwarding method for a mobile edge network based on user credibility, the mobile edge network adopts an undirected weighted graph to represent the mobile edge network structure under a time series.

[0021] Compared with the prior art, the present invention has the following beneficial effects:

[0022] (1) The present invention selects four attribute factors closely related to the nodes: residual energy ratio, contact probability, service degree and link stability to measure the credibility of the nodes participating in data packet forwarding according to the capacity of the participating nodes themselves and the network conditions. The advantages of this selection are: first, it can ensure the rational use of node energy and extend the network life; second, it can ensure the security of data transmission. Try to select nodes with high credibility to avoid potential network attacks such as eavesdropping, active attacks, and denial of service caused by malicious or selfish nodes; third, it can ensure topological stability. Try to choose a path with strong links to reduce routing changes and network burden.

[0023] (2) The present invention uses the credibility of a node to evaluate all neighboring nodes within its effective communication range, and uses the golden section method in the "optimization" theory to further optimize and screen all neighbors of the current node to ensure the objectivity of each screening of the game forwarding object. The advantages of this are: first, it avoids screening out suboptimal relay nodes with more stable or safer transmission paths as much as possible, thereby improving the success rate of data transmission; second, it avoids the occurrence of experimental results losing objectivity due to artificially given screening ratios.

[0024] (3) The present invention uses forwarding and non-forwarding as game strategies, obtains the forwarding probability of the node through Nash equilibrium, and transmits data according to the set forwarding rules, and finally realizes the intelligent selection of transmission relays in MEC network applications, and realizes the effective transmission of data with low latency, low energy consumption, high delivery rate, and high system throughput. The advantage is that the data forwarding decision operation is as consistent as possible with the actual operation process of society, that is, the nodes participating in the forwarding request do not know the strategies of other nodes when making decisions, and there is no game information exchange between the nodes participating in the forwarding game. Once a node makes a decision, it can no longer have any influence on the development of the game. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in the present invention. For ordinary technicians in this field, other drawings can also be obtained based on these drawings.

[0026] Figure 1The present invention provides a verification of the change in the cumulative delivery rate of data packets under different malicious node ratios.

[0027] Figure 2 The present invention provides a verification of the change in average data packet transmission delay under different malicious node ratios.

[0028] Figure 3 The embodiment of the present invention provides verification of the change of the average transmission energy consumption of the network under different malicious node ratios.

[0029] Figure 4 The embodiment of the present invention provides verification of the change of system throughput under different malicious node ratios.

[0030] Figure 5 The embodiment of the present invention provides verification of the change of the cumulative delivery rate of data packets under different packet sending rates of the source node.

[0031] Figure 6 The embodiment of the present invention provides a verification of the change in the average transmission delay of data packets under different packet sending rates of the source node.

[0032] Figure 7 The embodiment of the present invention provides verification of the change of the average transmission energy consumption of the network under different packet sending rates of the source node.

[0033] Figure 8 The embodiment of the present invention provides verification of the change of system throughput under different packet sending rates of the source node. DETAILED DESCRIPTION

[0034] The following is a clear and complete description of the technical solutions in the embodiments of the present invention in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0035] The present invention optimizes routing selection based on the capacity of the participating nodes and network conditions, comprehensively considers multiple attribute factors in the data packet forwarding process, and ensures the reasonable allocation of system resources. Therefore, the present invention puts forward the following three basic requirements for each node participating in forwarding.

[0036] Ensure reasonable use of node energy and extend network life;

[0037] Ensure the security of data transmission. Try to choose nodes with high credibility to avoid potential network attacks such as eavesdropping, active attacks, and denial of service caused by malicious or selfish nodes;

[0038] Ensure topology stability. Try to choose a path with strong links to reduce routing changes and network burden.

[0039] In order to meet the above requirements and ensure the efficiency of data transmission, the present invention first selects four attribute factors closely related to nodes: residual energy ratio, contact probability, service degree and link stability to measure the credibility of nodes involved in data packet forwarding. Obviously, when forwarding data packets, each node has different attribute values ​​and preferences. Therefore, the corresponding values ​​can be set according to the actual situation of the node.

[0040] Secondly, due to the continuous mobility of nodes in the MEC network, the network topology is dynamic. When the source node and the target node are determined at a certain moment, the choice of which node to use as a relay will ultimately affect the success rate, security, and efficiency of data packet delivery. Most previous studies first calculated and compared the forwarding performance of all neighboring nodes in the current node, and then directly selected the best node or selected some nodes to participate in data transmission according to a manually set ratio. Such an operation has two disadvantages. First, suboptimal relay nodes with more stable or more secure transmission paths may be screened out, thereby reducing the success rate of data transmission; second, due to the artificially given screening ratio, the experimental results will lose objectivity.

[0041] Therefore, the present invention will use the credibility of the node to evaluate all neighboring nodes within its effective communication range, and adopt the golden section method in the "optimization" theory to further optimize and screen all neighbors of the current node to ensure the objectivity of each screening of the game forwarding object.

[0042] Finally, when the target node is not within the effective range of the node carrying the forwarded data, the latter will start the route discovery process. The present invention regards the data request forwarding process in the route discovery process as a multi-user non-cooperative game process. That is, the nodes involved in the forwarding request do not know the strategies of other nodes when making decisions, and there is no game information exchange between the nodes participating in the forwarding game. Once a node makes a decision, it can no longer have any impact on the development of the game. Therefore, the present invention uses forwarding and non-forwarding as game strategies, obtains the forwarding probability of the node through Nash equilibrium, and transmits data according to the set forwarding rules, and finally realizes the intelligent selection of transmission relays in MEC network applications, and realizes the effective transmission of data with low latency, low energy consumption, high delivery rate, and high system throughput.

[0043] The technical solution of the present invention is divided into the following basic execution steps:

[0044] Step 1: Model the research object. It is necessary to model the MEC network environment, device nodes, social attribute factors between nodes, and trust strength measurement objects to facilitate the execution of the algorithm.

[0045] Step 2: Select the optimal game forwarding object for the next step. It is necessary to calculate the trust strength between the node currently carrying data and all its neighboring nodes, and sort the neighboring nodes in descending order according to the trust strength value, and then use the golden ratio to calculate the number of neighboring nodes that need to be retained, which is the optimal game object set for the next step.

[0046] Step 3: Determine the neighboring node for forwarding in the next step. In the process of traversing each node in the set obtained in step 2, first calculate the forwarding probability of each node in the set obtained in step 2. The forwarding probability is calculated for each node by using the number of nodes in the set, the non-cooperative game forwarding strategy (forwarding or not forwarding) between the node groups in the set, and the profit function. Then, by comparing the relationship between the randomly generated number and the above forwarding probability, and whether the node has received forwarding data, determine whether the node is the forwarding relay node for the next step.

[0047] Step 4: Construct an algorithm performance evaluation function. Data cumulative delivery rate, average data transmission delay, system energy consumption and network throughput are basic standards for measuring the performance of the forwarding model. Therefore, the present invention designs a reasonable data cumulative delivery rate function, average transmission delay function, transmission energy consumption function and system throughput function as standards for evaluating algorithm performance, and demonstrates the advantages of the present invention by comparing with other algorithms.

[0048] The present invention has the following technical features:

[0049] The modeling method described in step 1 is the first step in designing a data forwarding algorithm for a mobile edge network. Based on an undirected weighted graph as a network model, the present invention uses the weighted sum of four social attributes, namely, the residual energy ratio of nodes, the connection probability between nodes, the service degree, and the link stability, to represent the measure of the trust strength between nodes.

[0050] The golden ratio described in step 2 is the golden ratio mentioned in "optimization", which is 0.618.

[0051] The forwarding probability described in step 3 is the most critical step of the algorithm and determines the performance of the algorithm. First, assume that the forwarding probability of a node r in the set obtained in step 2 is Y, and use the number of nodes in the set to build the relationship between the forwarding probability of the remaining nodes in the set and Y; then, in the collective game forwarding of the set nodes, the equal function relationship between the benefit of r forwarding a data packet and the benefit of r not forwarding a data packet and at least one of the remaining nodes forwarding a data packet is used as the Nash equilibrium point; finally, using the two functions and the benefit function established in the above two steps, through variable substitution and replacement, Y is finally expressed as a function formula that is only related to the number of nodes in the set.

[0052] The judgment of the forwarding node described in step 3 is a rule designed based on the randomness of user experience and strategy adoption. First, traverse the set obtained in step 2, generate a random number each time, and judge whether the random number is less than the forwarding probability obtained in step 3. If the result is true and the current node has never received the data packet, add the trust strength value of the current node to the data packet and forward the data packet to the node; after each forwarding, loop through steps 2 to 4 until the data is transmitted to the target node.

[0053] The algorithm performance evaluation function described in step 4 can measure the effect of the present invention. The cumulative data packet delivery rate refers to the ratio of the number of data packets successfully delivered to the total number of data packets delivered; the average transmission delay function is the average duration of all successfully delivered data packets; the average system energy consumption refers to the sum of the energy consumed by all nodes to deliver data packets per unit time; the network throughput refers to the number of bytes delivered from the start of delivery to the successful reception of all data packets that successfully reach the target node.

[0054] In order to make the purpose, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail as follows.

[0055] 1. Model the research environment and objects on the simulation platform

[0056] The research object of this invention is a mobile edge network environment with multiple intelligent device nodes governed by different technical standards. The objects that need to be modeled include the mobile edge network structure, the measurement of social attribute factors and the strength of trusted relationships between device nodes, the optimal acquisition model of neighbor node sets, the calculation of neighbor node forwarding probability, and the evaluation model for judging whether the encountering nodes forward. The quantification of each research object is as follows:

[0057] Mobile edge network structure: The mobile edge network structure under time series is represented by an undirected weighted graph, that is, G=={G0,G1,…,G t ,…}, where G t =(V t ,S,B t ) represents the network scenario at time t, V t ={r1,r2,…,r i ,…} is the set of mobile nodes at time t, S = {F, NF} represents the strategy set of node game, B t Represents the payoff function of the node group forwarding game at time t.

[0058] The measure of the strength of the trust relationship between social device nodes: also refers to the value of the edge in the weighted undirected graph. The present invention uses four factors, namely, the node residual energy ratio factor, the connection probability and service degree between nodes, and the link stability, to measure the trust strength between nodes (i.e., the edge value), which can be expressed as Where m is the number of social attributes, n is the number of neighbor nodes in the game, Refers to node r i The j-th social attribute value of . in, represents the residual energy ratio of the node, represents the node r at time t i The initial energy, Represents r i Energy consumed per unit time; Represents the node r i The probability of an interaction or connection, where Represents and node r i The number of contacts made; represents the service degree between nodes, where Represents node r i The number of packets successfully forwarded by other nodes, Represents node r i The total number of packets received; Represents node r i The link stability factor between the target node g and the target node g, α and β (α+β=1, 0≤α, β≤1) are weight coefficients, which can be determined by AHP hierarchical analysis method. and dc represent node r i The geographical distance and communication distance to the target node g, Represents r i The relative speed between g and v max Indicates the maximum moving speed of the node.

[0059] Optimal acquisition model of neighbor node set: It is a key step to standardize and optimize the game objects participating in forwarding. First, according to the calculation in (2) Arrange all neighbor nodes in descending order; then, use the golden ratio to select nodes that meet the requirements as game objects.

[0060] Calculation of neighbor node forwarding probability: It is a comparative indicator to determine whether the node performs forwarding. In the present invention, first assume that the game object r i The forwarding probability of the remaining n-1 nodes in the game set is Y. n-1 =1-(1-Y)n-1 ; Secondly, in the collective node group game forwarding, r i The benefit of forwarding packets is related to r i The equal function relationship established by not forwarding the data packet while at least one of the remaining n-1 nodes forwards the data packet is used as the Nash equilibrium point, that is, b-b'=b×Y n-1 ; Then, let b = Ω × b', Ω is a constant greater than 1; Finally, using the above two functions and the profit function, through variable substitution and replacement, we can finally That is, the node forwarding probability is a function that is only related to the number of nodes in the set.

[0061] 2. Non-cooperative game forwarding mechanism in mobile edge networks based on user credibility

[0062] In order to improve the success rate of data transmission and network throughput in mobile edge networks while reducing system energy consumption and service delays, the present invention constructs a high-reliability data forwarding model based on the social trust strength and non-cooperative game mechanism between nodes, which mainly includes the following four operation steps.

[0063] At time t, when any node r carrying forwarding data i When multiple nodes are encountered,

[0064] (1) Get r i The set of all neighbor nodes within the effective communication range;

[0065] (2) Traverse each node in the set obtained by (1) and determine whether the node is the target node or whether the target node can be contacted through the node, and the node has never received a packet to be forwarded. If the condition is met, r i Then forward the data packet to the target node or forward it to the target node through the node, and end the traversal. Otherwise,

[0066] (3) Use the golden ratio to filter the set obtained in (1) and retain the node set that meets the requirements as the game object set;

[0067] (4) Traverse the set in (3), calculate the forwarding probability of the currently traversed node, and generate a random number between 0 and 1; if the random number is less than the forwarding probability and the node has never received the data packet, add the trust strength value of the node to the data packet and pass the data packet to the node. The node loops through steps (1) to (4) until the data packet is delivered to the target node or the data life cycle ends.

[0068] The end condition of this model is that all packets to be forwarded are successfully delivered to the target node or their life cycle ends.

[0069] The whole experiment is simulated by MATLAB, using the cumulative delivery ratio of packets, average delivery latency, average transmission energy consumption and system throughput as indicators to measure the effect of the present invention. The two mechanisms of whether to use the golden ratio in the present invention are compared with the two routing algorithms S-MODEST and AODV+FDG. The effect of the present invention is good. The results are as follows: Figure 1-Figure 8 As shown. Through experiments, we can see that:

[0070] (1) NCGT uses node performance and social relationships such as node residual energy ratio, contact probability, service degree and link stability, as well as the EW method to measure the trust strength of nodes from an objective perspective, fundamentally ensuring the reliability of relay node selection and the security of data transmission.

[0071] (2) GSR ​​(Golden Ratio) is used to screen the best gaming partner for each forwarding, which can effectively improve the operating efficiency of the NCGT model.

[0072] (3) NCGT increases the credibility of nodes in forwarding requests, takes forwarding and non-forwarding as a game strategy set, and obtains the node forwarding probability through Nash equilibrium, thereby reducing network redundancy, competition and conflict and improving forwarding efficiency.

[0073] (4) NCGT is evaluated by comparing with S-MODEST and AODV+FDG in a hybrid network environment consisting of simulated network and real data set information. The experimental results show that NCGT has the greatest advantages in terms of cumulative delivery rate, average delay, average transmission energy consumption and system throughput.

[0074] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the presence of other identical elements in the process, method, article or device including the elements.

[0075] Each embodiment in this specification is described in a related manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the device embodiment, electronic device embodiment, computer-readable storage medium embodiment, and computer program product embodiment, since they are basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0076] The above-described embodiments are only specific implementation methods of the present application, which are used to illustrate the technical solutions of the present application, rather than to limit them. The protection scope of the present application is not limited thereto. Although the present application is described in detail with reference to the aforementioned embodiments, ordinary technicians in the field should understand that any technician familiar with the technical field can still modify the technical solutions recorded in the aforementioned embodiments within the technical scope disclosed in the present application, or can easily think of changes, or make equivalent replacements for some of the technical specialties therein; and these modifications, changes or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the embodiments of the present application. They should all be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A non-cooperative game forwarding method for mobile edge network based on user credibility, characterized in that: The following steps are involved: S1. Select four attribute factors closely related to nodes: residual energy ratio, connection probability between nodes, service degree and link stability, and use the weighted sum of the four attribute factors to represent the measure of the trust strength between nodes; S2. Calculate the trust strength measurement value between the node currently carrying data and all its neighbor nodes, and sort the neighbor nodes in descending order according to the trust strength measurement value, and use the golden ratio to select the optimal game object for the neighbor nodes encountered in each forwarding; S3, taking the trust strength measurement value of the node as a factor of the forwarding request, taking forwarding and not forwarding as the game strategy set, and obtaining the node forwarding probability through Nash equilibrium; The method of obtaining the node forwarding probability through Nash equilibrium in step S3 is: S31, assuming that the forwarding probability of a node r in the set obtained in step S2 is Y, the relationship between the forwarding probabilities of the remaining nodes in the set and Y is constructed using the number of nodes in the set; S32, in the collective node group game forwarding, the equal function relationship between the benefit when r forwards the data packet and the benefit when r does not forward the data packet and at least one of the remaining nodes forwards the data packet is established as the Nash equilibrium point; S33, using the two functions and the benefit function established in steps S31 and S32, by variable substitution and replacement, finally Y is expressed as a function formula that is only related to the number of nodes in the set; S4, by comparing the relationship between the randomly generated number and the forwarding probability, and whether the node has received forwarding data, determine whether the node is the next forwarding relay node; The method for determining the forwarding relay node in step S4 is as follows: traverse the set of all neighbor nodes within the effective communication range obtained in step S2, generate a random number for each traversal, and determine whether the random number is less than the node forwarding probability obtained in S3. If the result is true and the current node has never received the data packet, add the measurement value of the trust strength of the current node to the data packet and forward the data packet to the node; after each forwarding, loop through steps S2 to S4 until the data is transmitted to the target node.

2. The non-cooperative game forwarding method for mobile edge network based on user credibility according to claim 1, characterized in that: Step S2 uses the entropy weight method to calculate the metric value of the trust strength between the node currently carrying data and all its neighboring nodes.

3. The non-cooperative game forwarding method for mobile edge network based on user credibility according to claim 1, characterized in that: It also includes a step S5 for evaluating the performance of the method. Step S5 uses a data cumulative delivery rate function, an average data transmission delay function, a system energy consumption function and a network throughput function as criteria for evaluating the performance of the method, wherein the data cumulative delivery rate refers to the ratio of the number of data packets successfully transmitted to their total number of transmissions; the average data transmission delay is the average duration of all successfully transmitted data packets; the system energy consumption refers to the sum of the energy consumed by all nodes in transmitting data packets per unit time; and the network throughput refers to the number of bytes transmitted between the start of transmission and the successful reception of all data packets that successfully reach the target node.

4. The non-cooperative game forwarding method for mobile edge network based on user credibility according to claim 1, characterized in that: The mobile edge network uses an undirected weighted graph to represent the mobile edge network structure under time series.