Requirements and challenges for building service-oriented pervasive middleware
Proceedings of the 2009 international conference on Pervasive services
Incentive cooperation strategies for peer-to-peer live multimedia streaming social networks
IEEE Transactions on Multimedia - Special section on communities and media computing
Cooperation in ad hoc networks with noisy channels
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Maintaining defender's reputation in anomaly detection against insider attacks
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
Cooperation stimulation strategies for peer-to-peer wireless live video-sharing social networks
IEEE Transactions on Image Processing
gPath: a game-theoretic path selection algorithm to protect Tor's anonymity
GameSec'10 Proceedings of the First international conference on Decision and game theory for security
A cross-layer game for energy-efficient jamming detection in ad hoc networks
Security and Communication Networks
Game theory meets network security and privacy
ACM Computing Surveys (CSUR)
Cross-layer metrics for reliable routing in wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In autonomous mobile ad hoc networks, nodes belong to different authorities and pursue different goals; therefore, cooperation among them cannot be taken for granted. Meanwhile, some nodes may be malicious, whose objective is to damage the network. In this paper, we present a joint analysis of cooperation stimulation and security in autonomous mobile ad hoc networks under a game theoretic framework. We first investigate a simple yet illuminating two-player packet forwarding game and derive the optimal and cheat-proof packet forwarding strategies. We then investigate the secure routing and packet forwarding game for autonomous ad hoc networks in noisy and hostile environments and derive a set of reputation-based cheat-proof and attack-resistant cooperation stimulation strategies. When analyzing the cooperation strategies, besides Nash equilibrium, other optimality criteria, such as Pareto optimality, subgame perfection, fairness, and cheat-proofing, have also been considered. Both analysis and simulation studies have shown that the proposed strategies can effectively stimulate cooperation among selfish nodes in autonomous mobile ad hoc networks under noise and attacks, and the damage that can be caused by attackers is bounded and limited.