Data transmission method based on node selfish degree

Abstract

The invention discloses a data transmission method based on a node selfish degree. The method comprises the following steps: dividing a network into multiple partitions, setting at least one access hotspot to store and manage an access record of a node, mobile rule information, the selfish degree and an integral condition of each partition, wherein the access hotspot searches a service providing node for a service request node according to the stored node access record and the mobile rule information, and the access hotspot receives push feedback information from the service providing node and forwards the push feedback information to the service request node, thereby enabling the service request node to select the service providing node according to the push feedback information; performing selfish degree adjusting and integral change on the service request node according to a transmission task transfer behavior between the service request node and the selected service providing node; and performing the data transmission according to a selfish degree adjusting result and an integer change result. The node is stimulated to abandon the immediate integral benefit, the transmission task is transferred to a more fit node, thereby improving a data delivery rate and the data transmission speed.

Description

technical field [0001] The invention relates to a delay-tolerant network system, in particular to a data transmission method based on selfishness, and belongs to the technical field of communication networks. Background technique [0002] In a delay-tolerant network, data is transmitted in a store-carry-forward manner, which is based on the willingness of nodes to help each other. However, there may be some selfish nodes in the network who are unwilling to share their own memory, nor Willing to help other nodes carry information. In order to solve the problem of node selfishness, there are mainly three incentive methods in existing research: (1) Reputation-based incentive mechanism, nodes exchange reputation information with each other, and when data is forwarded, source nodes often choose reputation (2) points-based incentive mechanism, which rewards nodes with high cooperation willingness through points; (3) hybrid incentive mechanism, which combines the advantages of the...

AI Technical Summary

Problems solved by technology

[0003] However, it is not always beneficial for existing schemes to stimulate node cooperation through more interests. Blindly pursuing interests is another level of selfish behavior. For example, when a node carrying data transmission tasks encounters more When it is about to reach another node of the destination node, it may be unwilling to transfer the transmission task to this more competent node in order not to give up its vested interests, thus hindering the rapid and stable transmission of information, that is to say, pure interest incentives It is possible to encourage nodes to influence the information transfer rate and stability of the network as a whole in order to obtain incentives

[0004] Therefore, the existing scheme cannot encourage nodes to give up their own interests for cooperation, making it difficult to further improve the data delivery rate and transmission efficiency of the network

Images