earticle

영어

In opportunistic networks, selfish nodes will refuse to forward messages for others to save their precious resources such as bandwidth, buffer and energy, and the system performance will degrade significantly. Therefore, it is necessary to motivate the selfish nodes to cooperatively forward messages. However, current cooperation mechanisms for opportunistic networks mainly focus on encouraging nodes to participate in message forwarding, but fail to consider the node congestion problem. When many messages are forwarded to the nodes with high connection degree, these nodes will become congested and discard most messages, which will seriously degrade the routing performance. To stimulate the selfish nodes with limited buffer to cooperatively forward messages, this paper proposes a congestion-aware node cooperation mechanism based on double auction, called CANCMDA. In CANCMDA, nodes first determine the self congestion degree according to current free buffer and message receiving speed. Then, combining message delivery probability and congestion degree, nodes trade messages based on double auction model. The double auction trade process is a bayesian game, and nodes get the optimal bid by solving the bayesian equilibrium to trade messages. The experimental results show that CANCMDA can effectively stimulate selfish nodes to cooperatively forward messages when congested, and achieves higher message delivery ratio with lower overhead ratio, compared with other mechanisms.