Social network node message forwarding method, device, equipment and storage medium

Abstract

The application relates to the technical field of information transmission, and discloses a social network node message forwarding method, device, equipment and storage medium, which comprises the following steps: generating a forwarding function according to the attribute of a to-be-forwarded message and the delivery urgency, position correlation, participation contribution and asset state of a sending node, generating a receiving function according to the attribute of the to-be-forwarded message and the delivery urgency, participation contribution, social correlation and asset state of a receiving node; performing calculation based on the forwarding function and the receiving function to generate a first sending cost and a first receiving cost; and forwarding the to-be-forwarded message from the sending node to the receiving node when the first sending cost is greater than or equal to the first receiving cost. Through the abstraction of the message forwarding between nodes into a transaction process, the virtual currency is used as a transaction medium to negotiate the forwarding service, the parties help to ensure that the forwarding service is transacted at a reasonable price through the negotiation rules, the nodes are encouraged to actively participate in the message forwarding, and the network performance is improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of information transmission, and particularly relates to a social network node message forwarding method and device, equipment and a storage medium. BACKGROUND

[0002] In a social-aware network, social network nodes usually show selfish behavior due to resource constraints and social connections, etc., resulting in too low network performance. SUMMARY

[0003] The main purpose of the present application is to provide a social network node message forwarding method, aiming at solving the technical problem that in a social-aware network, nodes usually show selfish behavior due to resource constraints and social connections, etc., resulting in too low network performance.

[0004] To achieve the above purpose, the present application provides a social network node message forwarding method, which comprises:

[0005] According to the attributes of the to-be-forwarded message and the delivery urgency, location relevance, participation contribution and asset state of the sending node, a forwarding function is generated, and according to the attributes of the to-be-forwarded message and the delivery urgency, participation contribution, social connection and asset state of the receiving node, a receiving function is generated;

[0006] Based on the forwarding function and the receiving function, a first sending cost and a first receiving cost are calculated;

[0007] When the first sending cost is greater than or equal to the first receiving cost, the to-be-forwarded message is forwarded from the sending node to the receiving node.

[0008] Optionally, after the step of calculating the first sending cost and the first receiving cost based on the forwarding function and the receiving function, the method further comprises:

[0009] When the first sending cost is less than the first receiving cost, the asset state of the sending node and the asset state of the receiving node are compared;

[0010] If the asset state of the sending node is greater than the asset state of the receiving node, the first sending cost is adjusted according to the cooperation degree, average contribution degree and location relevance of the sending node to obtain a second sending cost;

[0011] When the second sending cost is greater than or equal to the first receiving cost, the to-be-forwarded message is forwarded from the sending node to the receiving node.

[0012] Optionally, after the step of comparing the asset status of the sending node and the asset status of the receiving node when the first sending cost is less than the first receiving cost, the method further comprises:

[0013] if the asset status of the sending node is less than or equal to the asset status of the receiving node, adjusting the first receiving cost according to the cooperation degree, average contribution degree and social correlation degree of the receiving node to obtain a second receiving cost;

[0014] when the first sending cost is greater than or equal to the second receiving cost, forwarding the to-be-forwarded message from the sending node to the receiving node.

[0015] Optionally, before the step of generating a forwarding function according to the attribute of the to-be-forwarded message and the delivery urgency, location relevance, participation contribution degree and asset status of the sending node, and generating a receiving function according to the attribute of the to-be-forwarded message and the delivery urgency, participation contribution degree, social correlation degree and asset status of the receiving node, the method further comprises:

[0016] when receiving the information that the sending node is going to forward, detecting whether the to-be-forwarded message is a local message generated by the sending node itself;

[0017] if yes, obtaining a forced forwarding value of the sending node at present, and comparing the forced forwarding value with a preset forwarding threshold;

[0018] when the forced forwarding value is greater than the preset forwarding threshold, prohibiting the sending node from forwarding the local message.

[0019] Optionally, after the step of prohibiting the sending node from forwarding the local message when the forced forwarding value is greater than the preset forwarding threshold, the method further comprises:

[0020] updating the forced forwarding value based on the cooperation degree and contribution value of the sending node in a statistical time period as a period;

[0021] when detecting that the forced forwarding value is less than or equal to the preset forwarding threshold, allowing the sending node to forward the local message.

[0022] Optionally, after the step of forwarding the to-be-forwarded message from the sending node to the receiving node when the first sending cost is greater than or equal to the first receiving cost, the method further comprises:

[0023] allocating the asset of the sending node to the receiving node based on the determined sending cost;

[0024] calculating hash values of each item in the forwarding information according to a hash function, and signing the first hash value of the sending cost based on a private key of the sending node to obtain a signature value;

[0025] packing the forwarding information, the hash values of each item and the signature value into a target block, and broadcasting the target block to the entire network.

[0026] Optionally, after the step of packing the forwarding information, the hash values of each item and the signature value into a target block, and broadcasting the target block to the entire network, the method further comprises:

[0027] calculating a second hash value of the sending cost based on a public key of the sending node and the signature value, and verifying the signature value according to the first hash value and the second hash value to obtain verification information;

[0028] checking the forwarding valid information sent by each node in the receiving network;

[0029] when the number of the forwarding valid information reaches a preset valid threshold and the verification information is passed, setting the target block as valid and adding it into a block chain.

[0030] In addition, to achieve the above object, the present application further provides a social network node message forwarding device, which comprises:

[0031] a function determination module configured to generate a forwarding function according to attributes of a to-be-forwarded message and delivery urgency, location relevance, participation contribution and asset state of a sending node, and generate a receiving function according to the attributes of the to-be-forwarded message and delivery urgency, participation contribution, social relevance and asset state of a receiving node;

[0032] a cost generation module configured to calculate based on the forwarding function and the receiving function to generate a first sending cost and a first receiving cost;

[0033] a message forwarding module configured to forward the to-be-forwarded message from the sending node to the receiving node when the first sending cost is greater than or equal to the first receiving cost.

[0034] In addition, to achieve the above object, the present application further provides a social network node message forwarding device, which comprises a memory, a processor and a computer program stored in the memory and executable on the processor, and the computer program is configured to implement the steps of the social network node message forwarding method as described above.

[0035] In addition, to achieve the above object, the application further provides a storage medium, which is a computer readable storage medium, and a computer program is stored on the storage medium, and the computer program is executed by a processor to implement the steps of the social network node message forwarding method.

[0036] In the application, a forwarding function is generated according to the attribute of the message to be forwarded and the delivery urgency, location relevance, participation contribution and asset state of the sending node, a receiving function is generated according to the attribute of the message to be forwarded and the delivery urgency, participation contribution, social relevance and asset state of the receiving node, the first sending cost and the first receiving cost are generated by calculation based on the forwarding function and the receiving function, and the message to be forwarded is forwarded from the sending node to the receiving node when the first sending cost is greater than or equal to the first receiving cost. Since the message forwarding between the nodes that meet each other is abstracted as a transaction process in the application, and the virtual currency is used as a transaction medium to negotiate the transaction of the forwarding service, the forwarding service is ensured to be transacted at a reasonable price by means of the negotiation rules of both parties, so as to encourage the selfish nodes to actively participate in the message forwarding, and the network performance is improved. BRIEF DESCRIPTION OF DRAWINGS

[0037] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and serve to explain the principles of the application together with the specification.

[0038] In order to more clearly illustrate the technical solutions in the embodiments of the application or the prior art, the accompanying drawings needed to be used in the embodiments or prior art description will be briefly introduced as follows. Obviously, for those skilled in the field, other drawings can also be obtained based on these drawings without creative labor.

[0039] Figure 1 The flowchart of the first embodiment of the social network node message forwarding method of the application;

[0040] Figure 2 The flowchart of the second embodiment of the social network node message forwarding method of the application;

[0041] Figure 3 The message transaction flowchart of the social network node message forwarding method of the application;

[0042] Figure 4 The flowchart of the third embodiment of the social network node message forwarding method of the application;

[0043] Figure 5 The flowchart of the fourth embodiment of the social network node message forwarding method of the application;

[0044] Figure 6 Block diagram of a social network node message forwarding method of the present application;

[0045] Figure 7 Block diagram of a social network node message forwarding device of the present application;

[0046] Figure 8 Device structure diagram of a hardware operating environment involved in a social network node message forwarding method of an embodiment of the present application.

[0047] The object, features and advantages of the present application will be further illustrated in conjunction with the embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0048] It should be understood that the specific embodiments described herein are merely intended to explain the technical solutions of the present application, and are not intended to limit the present application.

[0049] In order to better understand the technical solutions of the present application, the specific embodiments will be described in detail below with reference to the accompanying drawings and specific embodiments.

[0050] The main solution of the embodiment of the present application is: generating a forwarding function according to the attributes of the message to be forwarded and the delivery urgency, location relevance, participation contribution and asset state of the sending node, generating a receiving function according to the attributes of the message to be forwarded and the delivery urgency, participation contribution, social relevance and asset state of the receiving node; calculating based on the forwarding function and the receiving function to generate a first sending cost and a first receiving cost; when the first sending cost is greater than or equal to the first receiving cost, forwarding the message to be forwarded from the sending node to the receiving node.

[0051] In a social perception network, nodes are usually unwilling to participate in the message forwarding of other nodes due to resource constraints and social connections, and only want to forward local messages of their own nodes. This factor leads to selfish behavior of the nodes and results in low network performance.

[0052] Therefore, the present application provides an incentive method based on dynamic pricing of messages, which abstracts the message forwarding between the nodes that meet as a transaction process, and uses virtual currency as a transaction medium to negotiate the forwarding service, thereby encouraging selfish nodes to actively participate in message forwarding and improving network performance.

[0053] It should be noted that the execution subject of the present embodiment can be a computing service device with data processing, network communication and program running functions, such as a computer, etc., or an electronic device capable of realizing the above functions, etc. The present embodiment and each of the following embodiments will be described below taking a social network node message forwarding device as an example.

[0054] Based on this, the application embodiment provides a social network node message forwarding method, referring to Figure 1 , Figure 1 The flowchart of the first embodiment of the social network node message forwarding method of the application is shown.

[0055] In this embodiment, the social network node message forwarding method comprises:

[0056] In step S10, a forwarding function is generated according to the attribute of the message to be forwarded and the delivery urgency, position relevance, participation contribution and asset state of the sending node, and a receiving function is generated according to the attribute of the message to be forwarded and the delivery urgency, participation contribution, social correlation and asset state of the receiving node.

[0057] It should be noted that the delivery urgency of the node is the urgency of the node to receive and forward the message, which is mainly determined by the remaining cache space, remaining energy and remaining survival time of the node, and can be represented by a state index. The position relevance of the node refers to the distance between the node and the destination node, which can be normalized by using a Gaussian similarity function as a measure of the position attribute of the node, wherein the position attribute of the node mainly includes the moving speed of the node, the angle with the destination node and the distance. The participation contribution value of the node refers to the participation contribution degree of the node in the message transmission process. The asset state of the node, also known as the wealth state of the node, is used to represent the number of virtual currencies owned by the current node. The social correlation of the node refers to the closeness or strength of the relationship between the nodes in the network.

[0058] In addition, it should be noted that the forwarding function, also known as the buyer valuation function, refers to the expenditure function of the sending node for pricing the forwarding service according to its own attributes and the attributes of the message to be forwarded. The receiving function, also known as the seller valuation function, refers to the income function of the receiving node for pricing the forwarding service according to its own attributes and the attributes of the message to be forwarded.

[0059] It should be understood that in order to ensure that the message can be successfully sent to the next hop node, the buyer (i.e. the sending node) must consider its own wealth reserve, delivery urgency and message attributes carried, and determine a reasonable expenditure price as a reward for providing forwarding service to the next hop node.

[0060] It can be understood that when the buyer's wealth reserve is sufficient, the buyer will give a reasonable price by comprehensively considering the delivery urgency and the wealth reserve; when the buyer's wealth reserve is insufficient, the buyer's delivery urgency will become higher as time elapses, the message survival time and the remaining cache and energy of the node gradually decrease, and therefore the buyer will give a higher transaction price in order to reduce his own pressure. When the buyer's participation contribution degree is higher, it will be beneficial for the buyer to purchase the forwarding service. When the node carries a larger message, the energy and cache consumed by forwarding will also increase, thereby affecting the buyer's bid for the forwarding service. In addition, when the buyer has a higher location relevance with the message destination node, it means that the buyer will reach the destination node in a shorter time.

[0061] It should be understood that when receiving the message carried by the buyer, the seller (i.e., the receiving node) also needs to consider its own wealth reserve, delivery urgency and the attribute of the carried message to price and maximize its income.

[0062] It can be understood that when the seller's wealth reserve is sufficient, the node's willingness to provide message forwarding will decrease, and therefore the seller's delivery urgency needs to be considered for reasonable pricing. When the seller's wealth reserve is insufficient, it needs to obtain virtual currency from elsewhere at a lower price, and its willingness to provide message forwarding will increase. When the seller has a higher participation contribution degree, it will be more beneficial to forward the message. In addition, the message size is proportional to the energy and cache required for message forwarding, and when the message is larger, the energy and cache consumption of the seller providing the forwarding service will also increase, thereby affecting the pricing. In addition, the seller also needs to consider the social association between nodes. If the nodes have a high association degree, it means that the two nodes have a good relationship, and at this time the seller's willingness to forward the message is stronger, and the bid will be relatively lower; on the contrary, if the nodes have a low association degree, the sending node's bid will be relatively higher.

[0063] For the convenience of understanding, the following examples are given, but do not limit the present application. In an example, the attributes of the node are defined as follows:

[0064] 1. Delivery urgency of the node

[0065] The delivery urgency of node i at time h can be defined as:

[0066]

[0067] wherein a, β, γ are weight values introduced to balance different optimization targets, and the weight values between different instances will have a significant impact on the performance of the algorithm, respectively represent the remaining cache space, the remaining energy value of node i at time h, and the remaining survival time of message m, Ci(i) represents the initial total cache space of node i, Ci(E) represents the initial total energy value of node i, and Tm(i) represents the initial lifetime of message m.

[0068] 2. Node's position relevance

[0069] The node position attribute function loc(i, d) is defined as:

[0070]

[0071] where v i represents the moving speed of node i, and the position coordinates of node i and destination node d are assumed to be (a i , b i ) and (a d , b d ), respectively.

[0072]

[0073] where A represents the angle between node i and the destination node. D(i, d) represents the Euclidean distance between node i and the destination node. The node position attribute function loc(i, d) is normalized using a Gaussian similarity function, and the node's position relevance is calculated as follows:

[0074]

[0075] where (σ = 1) is a scale parameter. When the node position attribute function of node i is smaller, the value of g(i) is closer to 1, which means that the time taken by node i to reach the destination node is shorter.

[0076] 3. Node's participation contribution

[0077] The cooperation degree X i (h) of node i at time h is defined as:

[0078]

[0079] where F i represents the total number of messages that node i forwards that are not self-generated, and when node i successfully forwards a message that is not self-generated, F i + 1; M i represents the number of times that node i meets other nodes, and when node i meets other nodes, M i + 1.

[0080] When the message successfully delivered to the destination node with the help of a node, the algorithm assigns contribution values according to the order of nodes on the forwarding path. The first relay node on the delivery path is given the maximum contribution value; the last relay node is given a relatively large contribution value; other relay nodes on the delivery path gradually reduce their contribution values according to their positions on the forwarding path. The contribution value C(i,n) assigned to node i on the nth path is defined as:

[0081]

[0082] where r(0 < r < 1) represents the contribution value distribution ratio factor; L represents the total number of relay nodes on this path. Whenever a message is successfully delivered to the destination node, the contribution value of node i is accumulated according to the above distribution scheme, and then the average contribution value avgC of node i is calculated. i .

[0083] The algorithm measures the degree of participation and contribution of a node in the message delivery process through the cooperation degree and average contribution degree of the node. Then the participation contribution degree PC of node i i is expressed as:

[0084] PC i (h) = ρ * X i (h) + (1 - ρ) * avgC i ,

[0085] where ρ is the weight factor that affects PC i (h) and avgC i , and ρ ∈ [0, 1]. i

[0086] 4. Asset Status of Nodes

[0087] In the network, according to the existing virtual currency amount of nodes, it can be divided into three different virtual currency states: sufficient state, general state, and insufficient state. When V i (h) > V max , the node is in the sufficient virtual currency state, and at this time C i (h) > 1; when V i (h) < V min , the node is in the insufficient virtual currency state, and at this time C i (h) < 1; when V min ≤ V i (h) ≤ V max , the node is in the general virtual currency state, and at this time C i (h) = 1. The relevant calculations are as follows:

[0088]

[0089] where V i (h) represents the amount of virtual currency that node i possesses at time h. The virtual currency threshold V max and V min represent the maximum and minimum values of the amount of virtual currency possessed by a node, respectively.

[0090] 5. Social connection between nodes

[0091] In the network, the social connection of a node is determined by the social overlap of the node and the contact between nodes. The social overlap of node i and node j, denoted as overlap ij is:

[0092]

[0093] where com ij represents the number of common neighbor nodes between node i and j, neigh i and neigh j represent the total number of neighbor nodes of node i and j, respectively.

[0094] The contact between nodes is quantified by analyzing the frequency and time of meeting between nodes to quantify the closeness of the connection between the nodes. The contact between node i and j, denoted as contact ij is calculated as follows:

[0095]

[0096] where Nmc ij represents the number of meetings between node i and j so far, Tm ij represents the sum of all meeting times between node i and j so far, N represents the number of nodes in the current network, and accurentT represents the current time.

[0097] Therefore, the social connection SC ij between nodes is calculated as follows:

[0098]

[0099] where, is overlap ij and contact ij have an impact on SC ij , and

[0100] In summary, the spending function (i.e., the spending function) BN px (h) of buyer x forwarding message m at time h is defined as:

[0101]

[0102] wherein M size represents the size of m, g(x) represents the position correlation degree of x, σ1 is the weight of the node position correlation degree, and satisfies α+β+γ+σ1=1.C x (h) represents the wealth condition of x at time h, PC x (h) represents the participation contribution degree of x at time h.

[0103] The income function (i.e., the receiving function) of the seller y receiving the information m at time h is high when the correlation degree between nodes is high, i.e., SC xy ≥SC xy_min , which is defined as follows:

[0104]

[0105] The income function (i.e., the receiving function) of the seller y receiving the information m at time h is low when the correlation degree between nodes is low, i.e., SC xy <SC xy_min , which is defined as follows:

[0106]

[0107] wherein M size represents the size of m, SC xy represents the social correlation degree between x and y, σ2 represents the weight value of the social correlation degree between x and y, and satisfies α+β+γ+σ2=1.SC xy_min represents the minimum threshold value of the social correlation degree between x and y, C y (h) represents the wealth condition of y at time h, PC y (h) represents the participation contribution degree of y at time h.

[0108] Step S20, calculating based on the forwarding function and the receiving function to generate a first sending cost and a first receiving cost.

[0109] It should be noted that the first sending cost refers to the initial buyer pricing of the data forwarding service by the sending node according to the attribute of the to-be-forwarded message and the forwarding function. The first receiving cost refers to the initial seller pricing of the data forwarding service by the receiving node according to the attribute of the to-be-forwarded message and the receiving function.

[0110] It should be understood that the calculation of the to-be-forwarded message based on the forwarding function and the receiving function can be to generate a first sending cost (i.e., a first buyer bid) according to the attribute of the to-be-forwarded message, the delivery urgency of the sending node, the location relevance, the participation contribution, and the asset state, to generate a first receiving cost (i.e., a first seller bid) according to the attribute of the to-be-forwarded message, the delivery urgency of the receiving node, the social relevance, the participation contribution, and the asset state, wherein the attribute of the to-be-forwarded message can be determined according to the size of the to-be-forwarded message to generate the first sending cost and the first receiving cost, or can be priced according to the type (such as text, video, image, etc.) of the to-be-forwarded message. Of course, in order to improve the speed of forwarding of key information, the calculation of the to-be-forwarded message based on the forwarding function and the receiving function can also be to generate the first sending cost and the first receiving cost according to the importance of the to-be-forwarded message.

[0111] Step S30, when the first sending cost is greater than or equal to the first receiving cost, forwarding the to-be-forwarded message from the sending node to the receiving node.

[0112] It should be understood that the first sending cost is the pricing of the sending node (i.e., the buyer) for the data forwarding service, and the first receiving cost is the pricing of the receiving node (i.e., the seller) for the data forwarding service. When the first sending cost is greater than or equal to the first receiving cost, i.e., the price offered by the buyer is greater than or equal to the price of the seller, the first negotiation between the buyer and the seller is successful, and the message can be successfully forwarded.

[0113] For the convenience of understanding, the following examples are given, but do not limit the present application. In an example, before the transaction starts, both the buyer and the seller need to inform each other of the message pricing and the wealth state. After the transaction starts, the buyer x gives an expenditure price BN px (h), and the seller y gives a price SN py (h). If BN px (h) ≥ SN py (h), the message m successfully completes forwarding, and the forwarding transaction of the next message can be performed. If BN px (h) < SN py (h), the first negotiation fails.

[0114] In this embodiment, a forwarding function is generated according to the attribute of the message to be forwarded and the delivery urgency, location relevance, participation contribution and asset state of the sending node, a receiving function is generated according to the attribute of the message to be forwarded and the delivery urgency, participation contribution, social relevance and asset state of the receiving node; the first sending cost and the first receiving cost are generated by calculation based on the forwarding function and the receiving function; when the first sending cost is greater than or equal to the first receiving cost, the message to be forwarded is forwarded from the sending node to the receiving node. Since the application: the message forwarding between nodes is abstracted as a transaction process, the virtual currency is used as a transaction medium for the bargaining transaction of the forwarding service, and the two parties ensure the forwarding service to be traded at a reasonable price by means of the bargaining rules, so as to encourage the selfish nodes to actively participate in the message forwarding.

[0115] With reference to Figure 2 , Figure 2 The flowchart of the second embodiment of the message forwarding method of the social network node of the application is shown in the figure, based on the first embodiment shown in the above Figure 1 The second embodiment of the message forwarding method of the social network node of the application is proposed based on the first embodiment shown in the above

[0116] In this embodiment, after the step S30, it further includes:

[0117] In step S401, when the first sending cost is less than the first receiving cost, the asset state of the sending node and the asset state of the receiving node are compared.

[0118] It can be understood that when the two parties fail to negotiate for the first time and enter the second bargaining stage, the first sending cost and the first receiving cost need to be adjusted, the buyer needs to increase the price of the message forwarding service, and the seller node needs to reduce the price of the message forwarding service. Of course, in order to make the buyer and the seller get satisfactory pricing as much as possible, it is also necessary to compare the wealth conditions (i.e. asset conditions) of the two parties to determine the party that needs to adjust the price.

[0119] For the convenience of understanding, the following examples are given, but the application is not limited thereto. In an example, reference is made to Figure 3 , Figure 3 The message transaction flowchart of the message forwarding method of the social network node of the application is shown in the figure. Both the buyer and the seller need to inform each other of the message pricing and the wealth state.

[0120] After the transaction starts, the buyer x gives the spending price BN px (h), and the seller y gives the price SN py (h). If BN px (h) ≥ SN py (h), the message m successfully completes the forwarding, and the forwarding transaction of the next message can be performed. If BNpx (h) < SN py (h), the first negotiation forwarding fails.

[0121] If the first negotiation between the buyer and the seller fails, the second negotiation stage is entered. By comparing the wealth of both parties, the price of each party is re-adjusted. If C x (h) < C y (h), SN py (h) is unchanged, and is adjusted according to the formula BN px (h) = BN px (h)*(1+k1); if C y (h) ≥ C x (h), BN px (h) is unchanged, and is adjusted according to the formula SN py (h) = SN py (h)*(1-k2).

[0122] If the second negotiation between the buyer and the seller reaches a consensus, that is, BN px (h) ≥ SN py (h), the message is forwarded; otherwise, the transaction is abandoned, and the next transaction is continued.

[0123] In step S402, if the asset state of the sending node is greater than the asset state of the receiving node, the first sending cost is adjusted according to the cooperation degree, the average contribution degree, and the position correlation degree of the sending node to obtain a second sending cost.

[0124] It should be understood that when the asset of the sending node is greater than the asset of the receiving node, the wealth reserve of the buyer is sufficient, and therefore, in order to protect the interests of the seller, the buyer should comprehensively consider the cooperation degree, the average contribution degree, and the position correlation degree of the buyer to adjust the first sending cost and increase the price of the buyer.

[0125] For the convenience of understanding, the following examples are given, but the present application is not limited thereto. In an example, if C x (h) < C y (h), SN py (h) is unchanged, and is adjusted according to the formula BN px (h) = BN px (h)*(1+k1), wherein k1 is an adjustment factor, and is calculated as follows:

[0126] k1 = ω1*X x (h) + ω2*avgC x + ω3*g(x),

[0127] wherein X x (h) represents the cooperation degree of x, avgC xThe average contribution degree of x is represented by g(x), and the position relevance of node x is represented by g(x). ω1, ω2 and ω3 are weights, respectively representing the influence of the cooperation degree, the average contribution degree and the position relevance of the node on the adjustment factor k1, and the sum of the three is 1. The weights are dynamically adjusted by adaptive weighting, and the calculation of the values of the weights is as follows:

[0128]

[0129] Step S403: When the second sending cost is greater than or equal to the first receiving cost, the to-be-forwarded message is forwarded from the sending node to the receiving node.

[0130] It can be understood that when the adjusted sending cost is greater than the receiving cost, the second negotiation is successful, and the message can be forwarded, otherwise the transaction is abandoned and the next transaction is continued.

[0131] Further, in order to ensure that the forwarding service is transacted at a reasonable price, after the step S403, the method further comprises: if the asset state of the sending node is less than or equal to the asset state of the receiving node, adjusting the first receiving cost according to the cooperation degree, the average contribution degree and the social relevance of the receiving node to obtain a second receiving cost; and when the first sending cost is greater than or equal to the second receiving cost, forwarding the to-be-forwarded message from the sending node to the receiving node.

[0132] It should be understood that when the asset of the sending node is less than the asset of the receiving node, the buyer node cannot pay the price of the message forwarding service given by the current seller node, and the seller needs to adjust the first receiving cost based on the cooperation degree, the average contribution degree and the social relevance between the nodes.

[0133] For the convenience of understanding, the following examples are given, but do not limit the present application. In an example, if C y (h)≥C x (h), the BN px (h) remains unchanged, and is adjusted according to the formula SN py (h)=SN py (h)*(1-k2), wherein k2 is calculated as follows:

[0134] k2=θ1*X y (h)+θ2*avgC y +θ3*SC xy ,

[0135] wherein X y (h) represents the cooperation degree of y, avgC y represents the average contribution degree of y, and SC xyThe social correlation between nodes x and y is represented. θ1, θ2 and θ3 are weights, respectively representing the influence of cooperation degree, average contribution degree and social correlation between nodes on the adjustment factor k2, and the sum of the three is 1. The values of the weights are calculated as follows:

[0136]

[0137] In this embodiment, when the first negotiation between the two nodes fails, the second negotiation stage is entered, and the prices of the two parties are adjusted respectively by comparing their wealth. If the wealth of the buyer is greater than that of the seller, the buyer increases the expenditure price; if the wealth of the buyer is less than that of the seller, the income price is reduced, so as to ensure that the forwarding service is transacted at a reasonable price.

[0138] Referring to Figure 4 , Figure 4 FIG. 1 is a flowchart of a third embodiment of a social network node message forwarding method according to the present application, which is based on the second embodiment shown in FIG. 2. Figure 2 The third embodiment of the social network node message forwarding method according to the present application is proposed.

[0139] In this embodiment, before the step S10, the method further comprises:

[0140] Step S01: When receiving the information to be forwarded by the sending node, it is detected whether the to-be-forwarded message is a local message generated by the sending node itself.

[0141] It should be noted that the local message refers to the information generated by the node itself. Due to the limited energy and cache of the nodes in the network, they tend to preferentially forward their own messages or refuse to forward non-local messages to ensure that their own generated messages can be successfully delivered.

[0142] It should be understood that the detection of whether the to-be-forwarded message is a local message generated by the sending node itself can be based on the production node information identification attached when the message is generated, or based on the message survival time of the message. The message survival time is reduced every time the message is forwarded. If the message survival time of the to-be-forwarded message of a node is equal to the initial survival threshold, the to-be-forwarded message is the local message of the node.

[0143] Step S02: If yes, the forced forwarding value of the sending node is obtained, and the forced forwarding value is compared with a preset forwarding threshold.

[0144] It should be noted that the forced forwarding value is a specific value or attribute related to the sending node, indicating the number of messages that the sending node must forward under certain conditions. The preset forwarding threshold is a condition set by the system in advance. By comparing the forced forwarding value and the preset forwarding threshold, the system can determine the behavior of the sending node, such as whether to perform a forwarding operation, adjust the forwarding strategy, etc.

[0145] For the convenience of understanding, the following examples are given, but do not limit the present application. In one example, the forced forwarding value CF i of node i is determined by the cooperation degree X i (h) and the contribution value C(i, n) of i, and the specific calculation method is as follows:

[0146]

[0147] Step S03, when the forced forwarding value is greater than the preset forwarding threshold, the sending node is prohibited from forwarding the local message.

[0148] Further, in order to remove the restriction of the node forwarding the local message, after the step S03, it further includes: updating the forced forwarding value based on the cooperation degree and the contribution value of the sending node periodically; when it is detected that the forced forwarding value is less than or equal to the preset forwarding threshold, the sending node is allowed to forward the local message.

[0149] It should be understood that the forced forwarding value is automatically updated at a fixed frequency, ensuring that the node's forwarding behavior can be monitored and adjusted at a certain time node. When the forced forwarding value is greater than the preset forwarding threshold, the node must forward a certain number of messages generated by other nodes corresponding to the forced forwarding value, in order to forward its own messages. When the node is restricted to forward, in order to successfully forward its own messages, it is necessary to participate in forwarding the messages generated by other nodes to improve the cooperation degree, and then gradually reduce the forced forwarding value of itself, until the normal message forwarding capability is finally restored.

[0150] In this embodiment, by setting the forced forwarding strategy, the selfish node which is unwilling to participate in the forwarding of messages of other nodes is forced to forward a certain number of non-local messages, thereby encouraging the low cooperation degree node to participate in cooperation.

[0151] Referring to Figure 5 , Figure 5 is a flowchart of the fourth embodiment of the social network node message forwarding method of the present application. Based on the third embodiment shown in the above Figure 4 , the fourth embodiment of the social network node message forwarding method of the present application is proposed.

[0152] In this embodiment, after the step S30, it further includes:

[0153] Step S501, based on the determined sending cost, allocate the asset of the sending node to the receiving node.

[0154] It should be noted that the sending cost refers to the final pricing of the forwarding service determined by the sending node and the receiving node through negotiation.

[0155] Step S502, according to the hash function, calculate the hash value of each item in the forwarding information, and based on the private key of the sending node, sign the first hash value of the sending cost to obtain a signature value.

[0156] It should be noted that the hash function is a function that transforms an arbitrary length input into a fixed length output through a certain algorithm, and this transformation process is irreversible, and the original input data cannot be inferred from the hash value. The hash value is the fixed length data output by the hash function, and for a given hash function and input data, the hash value is unique. Private key signature involves combining the hash value of the data with the private key to generate a signature value through a specific algorithm, which can be verified by anyone with the corresponding public key to confirm the source and integrity of the message.

[0157] It should be understood that when storing transaction data, each node in the network generates a public key and a private key through a public key encryption algorithm. Among them, the private key is securely kept by the node, while the public key is publicly disclosed on the network. To ensure the security of the transaction process and prevent false bids, the transaction record generated between the initiator (buyer) and the acceptor (seller) of a transaction needs to be verified, which contains information such as the transaction price of the two parties.

[0158] Step S503, pack the forwarding information, the hash value of each item and the signature value into a target block, and broadcast the target block to the entire network.

[0159] Further, in order to ensure the consensus and consistency of the entire network on the transaction history, after step S503, it further includes: based on the public key of the sending node and the signature value, calculate the second hash value of the sending cost, and according to the first hash value and the second hash value, verify the signature value to obtain verification information; receiving the forwarding valid information sent by each node in the network after checking; when the number of forwarding valid information reaches the preset valid threshold and the verification information is passed, set the target block as valid and add it to the block chain.

[0160] Specifically, once the target block is constructed, it is broadcast to the entire blockchain network. The nodes in the network verify the block after receiving it. The verification process includes checking the legality of the block (such as whether it meets the protocol rules of the blockchain), verifying the signatures of the transactions in the block, and confirming whether the hash value of the block matches, etc. At the same time, the hash algorithm is used in the blockchain network to ensure the tamper resistance of the transaction data. Each new block contains the hash value of the previous block, and any tampering with the transaction data will change its hash value.

[0161] For the convenience of understanding, the following examples are given, but do not limit the present application. In an example, referring to Figure 6 , Figure 6 is a block diagram of the blockchain of the social network node message forwarding method of the present application. The information in the figure is as follows:

[0162] PreviousHash is the hash value of the previous block linked by the current block. Data is the actual data content stored in the block. Timestamp is the time stamp, which records the exact time when the block is created (or the transaction is packaged into the block). HostID is the identity identifier of the buyer (message sender), and OtherID is the identity identifier of the seller (message receiver). Cost refers to the price or fee of the message forwarding service agreed by the two parties. Hash is the fixed-length output obtained by encrypting the data in the block through the hash function.

[0163] Once the new block is consensus by the entire network, it will be added to the end of the blockchain, and each new block contains the hash value of the previous block, and any tampering with the transaction data will change its hash value. At the same time, all nodes follow the longest chain principle, that is, when there are multiple competing branch chains, the node will choose to join the longest valid chain as the main chain.

[0164] In this embodiment, by writing the verified transaction record into the block and adding it to the blockchain, the transparency and credibility of the transaction data are realized, and any node participating in the network can access and verify these transaction records, ensuring the consensus and consistency of the entire network on the transaction history.

[0165] It should be noted that the above examples are only for understanding the present application and do not constitute a limitation on the social network node message forwarding method of the present application. Based on this technical concept, more forms of simple transformation are within the protection scope of the present application.

[0166] The present application also provides a social network node message forwarding device, please refer to Figure 7 , the social network node message forwarding device comprises:

[0167] The function determining module 10 is configured to generate a forwarding function according to the attribute of the message to be forwarded and the delivery urgency, the location relevance, the participation contribution and the asset state of the sending node, and to generate a receiving function according to the attribute of the message to be forwarded and the delivery urgency, the participation contribution, the social relevance and the asset state of the receiving node;

[0168] The cost generating module 20 is configured to calculate based on the forwarding function and the receiving function to generate a first sending cost and a first receiving cost;

[0169] The message forwarding module 30 is configured to forward the message to be forwarded from the sending node to the receiving node when the first sending cost is greater than or equal to the first receiving cost.

[0170] The social network node message forwarding device provided by the present application adopts the social network node message forwarding method in the above embodiments, and can solve the technical problem that the network performance is too low due to the selfish behavior of nodes in a social perception network, which is usually caused by limited resources and social relevance. Compared with the prior art, the social network node message forwarding device provided by the present application has the same beneficial effects as the social network node message forwarding method provided by the above embodiments, and other technical features in the social network node message forwarding device are the same as the features disclosed in the above embodiments, which will not be repeated here.

[0171] The present application provides a social network node message forwarding device, which comprises at least one processor and a memory connected with the at least one processor, wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the social network node message forwarding method in the above embodiment one.

[0172] Reference will be made to the following description of the embodiments of the present application with reference to the drawings. Figure 8 which shows a structural schematic diagram of a social network node message forwarding device suitable for implementing the embodiments of the present application. The social network node message forwarding device in the embodiments of the present application can include but is not limited to mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (Personal Digital Assistant), PADs (Portable Application Description), PMPs (Portable Media Player), vehicle-mounted terminals (such as vehicle-mounted navigation terminals) and the like, and fixed terminals such as digital TVs, desktop computers and the like. Figure 8The illustrated social network node message forwarding device is merely an example and should not limit the function and usage range of the embodiments of the present application in any way.

[0173] As shown in Figure 8 The social network node message forwarding device can include a processing device 1001 (e.g., a central processing unit, a graphics processing unit, etc.) that can perform various appropriate actions and processes according to programs stored in a read only memory (ROM) 1002 or programs loaded from a storage device 1003 into a random access memory (RAM) 1004. Various programs and data required for the operation of the social network node message forwarding device are also stored in the RAM 1004. The processing device 1001, the ROM 1002, and the RAM 1004 are connected to each other through a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Generally, the following systems can be connected to the I / O interface 1006: input devices 1007 including, for example, a touch screen, a touch pad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; output devices 1008 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; the storage device 1003 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009. The communication device 1009 can allow the social network node message forwarding device to communicate wirelessly or wired with other devices to exchange data. Although the social network node message forwarding device with various systems is shown in the figure, it should be understood that all of the illustrated systems are not required to be implemented or possessed. More or less systems can be alternatively implemented or possessed.

[0174] In particular, the processes described above with reference to the flowcharts can be implemented as a computer software program according to the embodiments disclosed in the present application. For example, the embodiments disclosed in the present application include a computer program product including a computer program carried on a computer readable medium, the computer program containing program codes for executing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network through the communication device, or installed from the storage device 1003, or installed from the ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the methods of the embodiments disclosed in the present application are performed.

[0175] The social network node message forwarding device provided by the present application adopts the social network node message forwarding method in the above embodiment, and can solve the technical problem that the network performance is too low due to the selfish behavior of nodes in the social perception network due to limited resources and social connections. Compared with the prior art, the social network node message forwarding device provided by the present application has the same beneficial effects as the social network node message forwarding method provided by the above embodiment, and other technical features in the social network node message forwarding device are the same as the features disclosed in the previous embodiment method, which will not be repeated here.

[0176] It should be understood that various parts of the present application can be realized by hardware, software, firmware or a combination thereof. In the description of the above embodiments, specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner.

[0177] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto, and any person skilled in the art can easily think of changes or replacements within the technical scope disclosed by the present application, which should be covered within the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

[0178] The present application provides a computer readable storage medium having computer readable program instructions (i.e. computer programs) stored thereon, the computer readable program instructions being used to execute the social network node message forwarding method in the above embodiment.

[0179] The computer readable storage medium provided in the present application may, for example, be a U disk, but is not limited to an electric, magnetic, optical, electromagnetic, infrared, or semiconductor system, system, or device, or any combination thereof. More specific examples of the computer readable storage medium can include, but are not limited to, an electric connection with one or more conductive wires, a portable computer disk, a hard disk, a random access memory (RAM), a read only memory (ROM), an erasable programmable read only memory (EPROM or flash memory), an optical fiber, a portable compact disk read only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present embodiment, the computer readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, system, or device. The program code contained on the computer readable storage medium can be transmitted by any suitable medium, including but not limited to an electric wire, an optical cable, an RF (Radio Frequency), and the like, or any suitable combination thereof.

[0180] The computer readable storage medium described above can be contained in a social network node message forwarding device, or can exist separately without being assembled into the social network node message forwarding device.

[0181] The computer readable storage medium described above carries one or more programs, which, when executed by the social network node message forwarding device, enable the social network node message forwarding device to implement the social network node message forwarding method as described above.

[0182] Computer program code for carrying out operations of the present application can be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code can execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection can be made to an external computer (for example, through the Internet using an Internet Service Provider).

[0183] The flow diagrams and the block diagrams in the drawings are illustrations of architectures, functionalities, and operations of possible implementations of systems, methods, and computer program products according to various embodiments of the present application. In this regard, each block in the flow diagrams or block diagrams can represent a module, a segment, or a portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that in some alternative implementations, the functions noted in the blocks can occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently or the blocks may

[0184] The modules involved in the embodiments of the present application can be implemented in the form of software or in the form of hardware. In some cases, the name of the module does not constitute a limitation on the module itself.

[0185] The readable storage medium provided by the present application is a computer readable storage medium, which stores computer readable program instructions (i.e. computer programs) for executing the social network node message forwarding method described above, and can solve the technical problem that the network performance is too low due to the self-interested behavior of nodes in the social perception network, which is usually caused by limited resources and social connections. Compared with the prior art, the computer readable storage medium provided by the present application has the same beneficial effects as the social network node message forwarding method provided by the above-mentioned embodiments, which will not be described here.

[0186] The above merely provides part of embodiments of the present application, and does not limit the patent scope of the present application. Any equivalent structure transformation based on the technical concept of the present application, or direct / indirect application in other related technical fields, which is made according to the content of the present application and the drawings, is included in the patent protection scope of the present application.

Claims

1. A method for forwarding messages between nodes in a social network, characterized in that, The social network node message forwarding method includes: A forwarding function is generated based on the attributes of the message to be forwarded and the delivery urgency, location relevance, participation contribution, and asset status of the sending node; a receiving function is generated based on the attributes of the message to be forwarded and the delivery urgency, participation contribution, social relevance, and asset status of the receiving node. The forwarding function is equal to the product of the size of the message to be forwarded, the asset status of the sending node, the participation contribution, and the first weighted sum. The first weighted sum is equal to the weighted sum of the delivery urgency and location relevance of the sending node. The sum of the first weight of the location relevance and the weights of each item in the delivery urgency of the sending node is 1. The receiving function is equal to the product of the size of the message to be forwarded, the reciprocal of the asset status of the receiving node, the non-participation contribution, and the second weighted sum. The non-participation contribution is equal to 1 minus the participation contribution of the receiving node. When the social correlation between the sending node and the receiving node is greater than or equal to the minimum social correlation, the second weighted sum is equal to the weighted sum of the delivery urgency of the receiving node and the social correlation minus the second weight of the social correlation. The sum of the second weight and the weights of each item in the delivery urgency of the receiving node is 1. When the social correlation between the sending node and the receiving node is less than the minimum social correlation, the second weighted sum is equal to the weighted sum of the delivery urgency of the receiving node and the social correlation. The sum of the second weight of the social correlation and the weights of each item in the delivery urgency of the receiving node is 1. Based on the forwarding function and the receiving function, a first sending cost and a first receiving cost are generated. When the first sending cost is greater than or equal to the first receiving cost, the message to be forwarded is forwarded from the sending node to the receiving node; Before the steps of generating a forwarding function based on the attributes of the message to be forwarded and the delivery urgency, location relevance, participation contribution, and asset status of the sending node, and generating a receiving function based on the attributes of the message to be forwarded and the delivery urgency, participation contribution, social relevance, and asset status of the receiving node, the method further includes: When receiving information that the sending node is about to forward the message, it is detected whether the message to be forwarded is a local message generated by the sending node itself. If so, obtain the forced forwarding value of the current sending node and compare the forced forwarding value with the preset forwarding threshold; When the forced forwarding value is greater than the preset forwarding threshold, the sending node is prohibited from forwarding the local message.

2. The social network node message forwarding method as described in claim 1, characterized in that, After the step of calculating and generating the first transmission cost and the first reception cost based on the forwarding function and the receiving function, the method further includes: When the first sending cost is less than the first receiving cost, compare the asset status of the sending node and the asset status of the receiving node. If the asset status of the sending node is greater than that of the receiving node, the first sending cost is adjusted according to the cooperation degree, average contribution degree and location relevance of the sending node to obtain the second sending cost. When the second sending cost is greater than or equal to the first receiving cost, the message to be forwarded is forwarded from the sending node to the receiving node.

3. The social network node message forwarding method as described in claim 2, characterized in that, After the step of comparing the asset status of the sending node and the asset status of the receiving node when the first sending cost is less than the first receiving cost, the method further includes: If the asset status of the sending node is less than or equal to the asset status of the receiving node, the first receiving cost is adjusted according to the cooperation degree, average contribution degree and social relevance of the receiving node to obtain the second receiving cost. When the first sending cost is greater than or equal to the second receiving cost, the message to be forwarded is forwarded from the sending node to the receiving node.

4. The social network node message forwarding method as described in claim 3, characterized in that, After the step of prohibiting the sending node from forwarding the local message when the forced forwarding value is greater than the preset forwarding threshold, the method further includes: The forced forwarding value is updated periodically based on the cooperation level and contribution value of the sending node, using a statistical time period as the cycle. When the forced forwarding value is detected to be less than or equal to the preset forwarding threshold, the sending node is allowed to forward the local message.

5. The social network node message forwarding method according to any one of claims 1 to 3, characterized in that, After the step of forwarding the message to be forwarded from the sending node to the receiving node when the first sending cost is greater than or equal to the first receiving cost, the method further includes: The assets of the sending node are allocated to the receiving node based on a determined sending cost; The hash value of each item in the forwarding information is calculated according to the hash function, and the first hash value of the sending cost is signed based on the private key of the sending node to obtain the signature value; The forwarding information, the hash values ​​of each item, and the signature value are packaged into a target block, and the target block is broadcast to the entire network.

6. The social network node message forwarding method as described in claim 5, characterized in that, After the steps of packaging the forwarding information, the hash values ​​of each item, and the signature value into the target block and broadcasting the target block to the entire network, the method further includes: The second hash value of the sending cost is calculated based on the public key of the sending node and the signature value, and the signature value is verified based on the first hash value and the second hash value to obtain verification information; Receive valid forwarding information sent by each node in the network after inspection; When the number of forwarded valid information reaches a preset valid threshold and the verification information is passed, the target block is set as valid and added to the blockchain.

7. A message forwarding device for a social network node, characterized in that, The social network node message forwarding device includes: The function determination module is used to generate a forwarding function based on the attributes of the message to be forwarded and the delivery urgency, location relevance, participation contribution, and asset status of the sending node, and to generate a receiving function based on the attributes of the message to be forwarded and the delivery urgency, participation contribution, social relevance, and asset status of the receiving node. The forwarding function is equal to the product of the size of the message to be forwarded, the asset status of the sending node, the participation contribution, and the first weighted sum. The first weighted sum is equal to the weighted sum of the delivery urgency and location relevance of the sending node. The sum of the first weight of the location relevance and the weights of each item in the delivery urgency of the sending node is 1. The receiving function is equal to the product of the size of the message to be forwarded, the reciprocal of the asset status of the receiving node, the non-participation contribution, and the second weighted sum. The non-participation contribution is equal to 1 minus the participation contribution of the receiving node. When the social correlation between the sending node and the receiving node is greater than or equal to the minimum social correlation, the second weighted sum is equal to the weighted sum of the delivery urgency of the receiving node and the social correlation minus the second weight of the social correlation. The sum of the second weight and the weights of each item in the delivery urgency of the receiving node is 1. When the social correlation between the sending node and the receiving node is less than the minimum social correlation, the second weighted sum is equal to the weighted sum of the delivery urgency of the receiving node and the social correlation. The sum of the second weight of the social correlation and the weights of each item in the delivery urgency of the receiving node is 1. The cost generation module is used to calculate and generate a first transmission cost and a first reception cost based on the forwarding function and the receiving function; The message forwarding module is used to forward the message to be forwarded from the sending node to the receiving node when the first sending cost is greater than or equal to the first receiving cost. The function determination module is further configured to, when receiving information that the sending node is about to forward, detect whether the message to be forwarded is a local message generated by the sending node itself; if so, obtain the current forced forwarding value of the sending node, compare the forced forwarding value with a preset forwarding threshold; when the forced forwarding value is greater than the preset forwarding threshold, prohibit the sending node from forwarding the local message.

8. A social network node message forwarding device, characterized in that, The social network node message forwarding device includes: a memory, a processor, and a social network node message forwarding program stored in the memory and executable on the processor. When the social network node message forwarding program is executed by the processor, it implements the social network node message forwarding method as described in any one of claims 1 to 6.

9. A storage medium, characterized in that, The storage medium stores a social network node message forwarding program, which, when executed by a processor, implements the social network node message forwarding method as described in any one of claims 1 to 6.

Images