Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
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
On Using Reputations in Ad hoc Networks to Counter Malicious Nodes
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
Stochastic properties of the random waypoint mobility model
Wireless Networks
Reputation-based framework for high integrity sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Reputed authenticated routing for ad hoc networks protocol (reputed-ARAN)
PE-WASUN '05 Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Achieving cooperation in multihop wireless networks of selfish nodes
GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
A Bayesian game approach for intrusion detection in wireless ad hoc networks
GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
Sustaining cooperation in multi-hop wireless networks
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Routing in Ad Hoc Networks of Mobile Hosts
WMCSA '94 Proceedings of the 1994 First Workshop on Mobile Computing Systems and Applications
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Information theoretic framework of trust modeling and evaluation for ad hoc networks
IEEE Journal on Selected Areas in Communications
Review: Certification-based trust models in mobile ad hoc networks: A survey and taxonomy
Journal of Network and Computer Applications
A game theory-based surveillance mechanism against suspicious insiders in MANETs
INTRUST'10 Proceedings of the Second international conference on Trusted Systems
Analytical models for trust based routing protocols in wireless ad hoc networks
ACM SIGSOFT Software Engineering Notes
| Hi-index | 0.00 |
In Mobile Ad-Hoc Networks (MANETs), establishing trust relationships between the nodes in a decentralized fashion has been an important research issue for a long time. If the sender nodes accurately identify the legitimate nodes in the network, a robust routing can be provided while mitigating the effects of malicious nodes. Further, there is always a mutual interaction between a sender and its neighbor nodes during the communication. This mutual interaction can be easily modeled as a game between two or more players (one player being the sender and the rest being the receivers). Regardless of its type (legitimate or malicious), each player attempts to maximize its benefit during the game by choosing an optimal strategy. In this paper, we propose a secure and robust routing scheme in which the interaction between the sender and receiver nodes is modeled using a dynamic Bayesian game model. A repeated game is considered and opinions of a node about the types of other nodes is established using an acknowledgement mechanism from the destination. The proposed method uses the intersection of game theory, trust establishment and coding theory to resist colluding Byzantine (insider) attacks. The scheme guarantees the availability of message as long as a legitimate path exists. Through simulations we will show the efficiency of the scheme with respect to latency, availability and energy consumption in the presence of adversary.