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
Securing ad hoc routing protocols
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
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
Stimulating cooperation in self-organizing mobile ad hoc networks
Mobile Networks and Applications
The sybil attack in sensor networks: analysis & defenses
Proceedings of the 3rd international symposium on Information processing in sensor networks
Experiences applying game theory to system design
Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems
Rethinking incentives for mobile ad hoc networks
Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems
Certain limitations of reputation--based schemes in mobile environments
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
On-demand public-key management for mobile ad hoc networks: Research Articles
Wireless Communications & Mobile Computing - Wireless Network Security
A secure incentive architecture for ad hoc networks: Research Articles
Wireless Communications & Mobile Computing - Wireless Network Security
Achieving cooperation in multihop wireless networks of selfish nodes
GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
Why does it pay to be selfish in a MANET?
IEEE Wireless Communications
Self-policing mobile ad hoc networks by reputation systems
IEEE Communications Magazine
| Hi-index | 0.00 |
In autonomous ad hoc network, nodes belonging to different entities try to maximize their own utilities. Selfish dropping of route control packets relieves node of relaying packets for others and saves its own resources. Current watchdog or ACK-based detection scheme cannot cope with it effectively. Based on statistics relation of route control packets within neighborhood, this paper proposed an energy-efficient distributed algorithm to detect the selfishness in route discovery. Relation between key parameter setting, algorithm's effectiveness and performance was analyzed with tool of game theory. Extensive simulations showed that the algorithm could detect and punish the selfish nodes effectively.