Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Adaptive Management of an Active Service Network
BT Technology Journal
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
Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Cooperation enforcement schemes for MANETs: a survey: Research Articles
Wireless Communications & Mobile Computing - Wireless Network Security
Ariadne: a secure on-demand routing protocol for ad hoc networks
Wireless Networks
Best neighbor strategy to enforce cooperation among selfish nodes in wireless ad hoc network
Computer Communications
Trust-based evolutionary game model assisting AODV routing against selfishness
Journal of Network and Computer Applications
Ad Hoc Networking
Cellular Genetic Algorithms
Algorithms and Protocols for Wireless, Mobile Ad Hoc Networks
Algorithms and Protocols for Wireless, Mobile Ad Hoc Networks
A trust model based on fuzzy recommendation for mobile ad-hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Taxonomy of trust: Categorizing P2P reputation systems
Computer Networks: The International Journal of Computer and Telecommunications Networking - Management in peer-to-peer systems
Cooperative peer groups in NICE
Computer Networks: The International Journal of Computer and Telecommunications Networking - Management in peer-to-peer systems
RDSR-V. Reliable Dynamic Source Routing for video-streaming over mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A distributed coalition formation framework for fair user cooperation in wireless networks
IEEE Transactions on Wireless Communications
A cluster-based trust-aware routing protocol for mobile ad hoc networks
Wireless Networks
Uncertainty Modeling and Reduction in MANETs
IEEE Transactions on Mobile Computing
A game theoretic trust model for on-line distributed evolution of cooperation inMANETs
Journal of Network and Computer Applications
Information theoretic framework of trust modeling and evaluation for ad hoc networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The scarce resources of a mobile ad hoc network (MANET) should not be wasted attending selfish nodes (those nodes that use resources from other nodes to send their own packets, without offering their own resources to forward other nodes' packets). Thus, rational nodes (those nodes willing to cooperate if deemed worthy) must detect and isolate selfish nodes in order to cooperate only among themselves. To achieve this purpose, in this paper we present a new game theoretic trust model called DECADE (Distributed Emergent Cooperation through ADaptive Evolution). The design of DECADE is shown by first, analyzing a simple case of packet forwarding between two nodes, and then the results are extended to bigger networks. In DECADE, each node seeks individually to maximize its chance to deliver successfully their own packets, so that the cooperation among rational nodes and the isolation of selfish nodes appear as an emergent collective behavior. This behavior emerges as long as there is a highly dynamic interaction among nodes. So, for those cases where the mobility alone does not suffice to provide this interaction, DECADE includes a sociability parameter that encourages nodes to interact among them for faster learning and adaptability. Additionally, DECADE introduces very low overhead on computational and communication resources, achieving close to optimal cooperation levels among rational nodes and almost complete isolation of selfish nodes.