A scheme for stimulating message relaying cooperation

Haifeng Lin,Fuquan Zhang

doi:10.1177/1550147720907038

Haifeng Lin, Fuquan Zhang

Open Access

https://doi.org/10.1177/1550147720907038

Copy DOI

Abstract

It is expected that all the nodes try their best to store and forward the messages in the intermittent connection network. However, due to the limited resources, such as memory, power, and transient communication chance, selfish nodes may relay the messages without responsibility. Stimulating selfish to behave normally could improve network performance. However, usually, it is difficult to distinguish the selfish behavior from the inability to relaying the message. By monitoring the behavior of relay nodes that messages are forwarding through, this article proposes a scheme that relays messages according to the reputation of intermediate nodes. The proposed reputation estimation scheme combines selfish behavior and inability behavior, and reveals very little private information for the protocol practice. There is a trade-off between the threshold and the performance. Too low value may not distinguish the selfish nodes. On the contrary, some normal nodes may excluded and cannot join the relaying and processing. Simulation effectively demonstrates that the reputation affects the node’s performance, and an appropriate reputation threshold value is useful for improving the network performance.

Highlights

The nodes store, carry, and forward a message in an intermediate tolerant network, by assuming that every node would like to cooperate, wait for opportunities, and try their best to deliver each message
Selfish nodes existing in the networks or nodes that are constrained with memory, bandwidth, and calculation ability are likely to violate this hypothesis
Due to the limited resources, such as memory, power, and transient communication chance, selfish nodes may relay the messages without responsibility

Summary

Introduction

The nodes store, carry, and forward a message in an intermediate tolerant network, by assuming that every node would like to cooperate, wait for opportunities, and try their best to deliver each message. Selfish nodes existing in the networks or nodes that are constrained with memory, bandwidth, and calculation ability are likely to violate this hypothesis. The selfish behavior of node, such as keeping itself the message when the memory becomes full[1] or first relaying itself the message when a connection ‘‘opportunity’’ arises,[2] will result in a lower delivery probability,[3] a higher overhead, and the overall performance decrease.[4,5] This would be more serious when the majority of nodes are selfish. Selfish nodes that deny relaying messages would gradually cooperate.[12,13]

Objectives

Conclusion