Abstract
The opportunistic mobile communication network is a social communication network, where every node depends on the other in transferring data. Thus, every node makes a potential router. However, due to the lack of resource, nodes tend to become selfish by dropping the messages relayed through them. In this paper, an algorithm is proposed to control such selfish nodes from overtaking the network. The proposed algorithm is designed for an uncertain stochastic network environment, where the popular strategy like Tit for Tat (TFT) fails. It is further compared with Generous popular approaches such as Generous Tit for Tat (GTFT) and Generous Zero-determinant (GenZD). Furthermore, the simulation study has shown that it outperforms the GTFT and GenZD while controlling the free rider selfish nodes.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call