This research looks into cooperation in sensor networks and their related challenges. Cooperation is defined as the tendency of network nodes to forward packets to other nodes. Non-cooperation of nodes with each other is considered a type of misbehavior. Cooperation methods aim to reduce the effect of misbehaving nodes representing a kind of selfishness in the network. Subsequently, methods based on charging and reward models are used to motivate nodes to cooperate. In the proposed method, due to dynamic cost management, all nodes are forced to cooperate and distribute traffic in the network. Each node must calculate and declare its route cost according to the consumed energy. Source nodes tend to choose routes imposing a lower cost. In this way, without contradiction, they force the nodes to reduce their profit and subsequently reduce the fraud caused by price increases to increase rewards. Also, the necessary motivation for the participation of all nodes in the network is provided. The core of this routing method is sensitive to the path cost, based on the combination of dynamic pricing technique and AODV routing. The proposed method regarding network traffic distribution and helping low-power nodes works better than the previous methods. It strengthens the cooperation rate and network lifetime due to uniform energy consumption between nodes.
|
||||||||