Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks
Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
Stimulating cooperation in self-organizing mobile ad hoc networks
Mobile Networks and Applications
Modelling incentives for collaboration in mobile ad hoc networks
Performance Evaluation - Selected papers from the first workshop on modeling and optimization in mobile, ad hoc and wireless networks (WiOpt'2003)
A Privacy Preserving Reputation System for Mobile Information Dissemination Networks
SECURECOMM '05 Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks
Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
Optimistic fair exchange for secure forwarding
MOBIQUITOUS '07 Proceedings of the 2007 Fourth Annual International Conference on Mobile and Ubiquitous Systems: Networking&Services (MobiQuitous)
Hide-and-Lie: enhancing application-level privacy in opportunistic networks
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Can altruism spare energy in ad hoc networking?
Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia
RIS: A Reciprocal Incentive Scheme in Selfish Opportunistic Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
In opportunistic networks, selfish nodes can exploit the services provided by other nodes by downloading messages that interest them, but refusing to store and distribute messages for the benefit of other nodes. We propose a mechanism to discourage selfish behavior based on the principles of barter. We develop a game-theoretic model in which we show that the proposed approach indeed stimulates cooperation of the nodes. The results show that, in practical scenarios, the message delivery rate considerably increases, if the mobile nodes follow the Nash Equilibrium strategy in the proposed mechanism compared to the data dissemination protocol when no encouraging mechanism is present.