Trusted secure routing for ad hoc networks
Proceedings of the 5th ACM international workshop on Mobility management and wireless access
Stimulating cooperation in route discovery of ad hoc networks
Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks
Dynamic reputation-based incentive mechanism considering heterogeneous networks
Proceedings of the 3nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Incentives for Cooperative Relay in Heterogeneous Networks: A Dynamic Reputation-Based Approach
APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
Stimulating cooperation in multi-hop wireless networks using cheating detection system
INFOCOM'10 Proceedings of the 29th conference on Information communications
Hi-index | 0.00 |
In an ad hoc network, intermediate nodes on a communication path are expected to forward packets of other nodes so that the mobile nodes can communicate beyond their wireless transmission range. However, because wireless mobile nodes are usually constrained by limited power and computation resources, a selfish node may be unwilling to spend its resources in forwarding packets which are not of its direct interest, even though it expects other nodes to forward its packets to the destination. It has been shown that the presence of such selfish nodes degrades the overall performance of a non-cooperative ad hoc network. To address this problem, we propose a secure and objective reputation-based incentive (SORI) architecture to encourage packet forwarding and discipline selfish behavior. Different from existing schemes, under our architecture, the reputation of a node is quantified by objective measures; the propagation of reputation is efficiently secured by a one-way-hash-chain-based authentication scheme; and secure routing is in place. Armed with the reputation-based mechanism, we design a punishment scheme to penalize selfish nodes. The experimental results show that the proposed scheme can successfully identify selfish nodes and punish them accordingly. Copyright © 2006 John Wiley & Sons, Ltd.