Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks
Proceedings of the 7th International Workshop on Security Protocols
Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Trust-based evolutionary game model assisting AODV routing against selfishness
Journal of Network and Computer Applications
Studying on economic-inspired mechanisms for routing and forwarding in wireless ad hoc network
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
| Hi-index | 0.02 |
In multi-hop routing protocols within Wireless Ad-hoc Networks (MANET), all the nodes are assumed to be cooperative. However, this assumption might not hold especially when the nodes behave selfishly to reduce their own resource utilization or there exist intentional attackers. Therefore, how to enforce the cooperative behavior is an important issue in MANET. In this paper, we propose a Reputation-Aware Multi-hop routing Protocol (RAMP) to enforce node cooperation. We take advantage of congestion control from Transmission Control Protocol (TCP) to quantify the reputation/trust value of each node, which makes the selfish behaviors not attractive in MANET. To the best of our knowledge, we are the first to integrate the congestion control from TCP for the reputation-based system design. In addition, the respective simulation in NS2 shows RAMP could achieve 10--15% less packet loss than the existing reputation-based scheme such as CONFIDANT and RAMP could outperform CONFIDANT by up to 20% in goodput with the presence of the compromised/selfish nodes.