Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
Network assisted power control for wireless data
Mobile Networks and Applications - Special issue on Mobile Multimedia Communications (MOMUC '99)
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Enforcing service availability in mobile ad-hoc WANs
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
CDMA uplink power control as a noncooperative game
Wireless Networks
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
A utility-based power-control scheme in wireless cellular systems
IEEE/ACM Transactions on Networking (TON)
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Decentralized Trust Management
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
Selfish routing
Trust evaluation in ad-hoc networks
Proceedings of the 3rd ACM workshop on Wireless security
Attack-resistant trust metrics for public key certification
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
Boosting CBR Agents with Genetic Algorithms
ICCBR '09 Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
A prediction QOS approach reputation-based in web services
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Multi criteria decision methods for coordinating case-based agents
MATES'09 Proceedings of the 7th German conference on Multiagent system technologies
A game theoretic trust model for on-line distributed evolution of cooperation inMANETs
Journal of Network and Computer Applications
RAMP: a reputation-aware multi-hop routing protocol in wireless ad-hoc networks
Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
Trust mechanisms in wireless sensor networks: Attack analysis and countermeasures
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Self-organizing networks such as wireless ad hoc networks present a number of problems and paradoxes towards trustworthiness and consistency of the network. Lack of cooperation between nodes drastically brings down the throughput of the network. Selfish behavior of the nodes is one of the issues, which deter the trust among them. This paper explores the multiple modes to build trust and proposes an effective, dynamic and distributed framework using evolutionary game theory. Strategic, non-cooperative and evolutionary game theory has been utilized to model the dynamic behavior of selfish nodes in a self-policing ad hoc network. AODV routing assisted by the proposed game model enlightens a cogent scenario, which demonstrates that it can stimulate cooperation among selfish nodes, albeit without negotiations. The proposed model encompasses two distinct modes to learn and predict the behavior of neighbors namely deterministic and random. Deterministic mode is a generic one which helps to analyze the behavior of the network for standard strategic patterns whereas the random strategy profiles are explored using randomized analysis based on genetic algorithm. This paper investigates the simulated results for the two methods and asserts that if nodes use evolved strategies and trust evaluation mechanism, then the model supports in accomplishing the cooperation level to reach the maximum possible.