A Data Forwarding Method for Assessing the Reputation of Selfish Nodes

Abstract

The invention claims a data forwarding method for assessing reputation of a selfish node. The data forwarding method is based on a hidden Markov model, adopts a Viterbi algorithm for estimating a state sequence of a node at each time period T, and further calculates a reputation value of the node. When energy of the node equals an energy threshold value epsilon of network setting, the node is judged to be a cooperative node if the reputation value is greater than or equal to the threshold value, otherwise, the node is judged to be a selfish node, and a node which judges the node to be the selfish node broadcasts ID of the selfish node to the surrounding nodes after perceiving the selfish node. Before the data forwarding, a forwarding sequence of messages is determined according to node state, the encountering probability of the node and a target node is calculated according to know historical encountering information during the node moving process, and the optimal forwarding node for the messages is selected. The design method provided by the invention can achieve node energy balance, is low in calculation complexity of the reputation model, can detect the selfish node accurately, and effectively excites the selfish node to participate in message forwarding.

Description

technical field [0001] The invention relates to an opportunistic network data forwarding strategy technology, in particular to an opportunistic network forwarding strategy design method based on evaluating the reputation of selfish nodes. Background technique [0002] The popularity of a large number of handheld smart mobile devices has promoted the application of wireless ad hoc networks. In a complex wireless network, due to node movement, signal attenuation, etc., the network is often interrupted, but the traditional wireless ad hoc network requires at least one definite link between the source node and the destination node, so it cannot adapt to this environment . Different from the communication mode of the traditional wireless ad hoc network, the nodes in the opportunistic network do not need to establish an end-to-end path before forwarding data, but use the encounter opportunities between nodes to forward data until the message reaches the destination node. This br...

AI Technical Summary

Problems solved by technology

[0005] In view of the fact that there are selfish nodes in opportunistic networks, such nodes refuse to receive and forward messages, so that cooperative nodes frequently receive and forward messages, which will lead to excessive energy consumption and premature "death"

This will not only affect the receiving and sending of cooperative nodes' own messages, but also affect the connectivity of the network topology, resulting in serious unfairness in the allocation of network resources.

Secondly, there are issues such as the expiration of the message TTL, or the limited cache of the node. When the cooperative node is in the cooperative state, it may refuse to receive the message sent by the other party due to buffer overflow and other reasons. In this way, the observed node will perceive that it has initiated a selfish behavior.

Images