Game theory for cooperative and relay communications in mobile ad hoc networks: A brief tutorial

被引:1
作者
Yan, Lu [1 ]
机构
[1] School of Computer Science, University of Hertfordshire, Hatfield
关键词
Cooperative communications; Game theory; Networks; Relay communication; Routing; Security; Sensors; Tutorial; Wireless;
D O I
10.1504/IJMNDI.2009.030442
中图分类号
学科分类号
摘要
In mobile ad hoc networks such as wireless ad hoc networks and sensor networks, most of the functions (routing, mobility management and security) must rely on cooperation between nodes. Every node in these networks is both end host (it generates its own data and routing traffic) and infrastructure (it forwards traffic for others), but rational nodes have no incentive to cooperatively forward traffic for others, since this kind of forwarding is not costless. Thus, we are motivated to use game theory to analyse cooperative mechanisms, and derive incentive strategies enforcing cooperation in forwarding. Unlike traditional approaches, in this paper, we introduce a novel and interdisciplinary simulation-based analysis scheme to the networking community in game-theoretic settings. Moreover, we investigate noise models and show some counterintuitive simulation results in presence of noise. Copyright © 2009 Inderscience Enterprises Ltd.
引用
收藏
页码:3 / 9
页数:6
相关论文
共 15 条
  • [1] Anderegg L., Eidenbenz S., Ad hoc-VCG: A truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents, Proc. ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom'03), (2003)
  • [2] Axelrod R., The Evolution of Cooperation, (1984)
  • [3] Buchegger S., Le Boudec J.-Y., Performance analysis of the CONFIDANT protocol, Proc. International Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc'02), (2002)
  • [4] Buttyan L., Hubaux J.-P., Enforcing service availability in mobile ad-hoc wans, Proc. IEEE/ ACM Workshop on Mobile Ad Hoc Networking and Computing (MobiHoc'00), (2000)
  • [5] Dasilva L.A., Srivastava V., Node participation in adhoc and peer-to-peer networks: A game-theoretic formulation, Proc. Workshop on Games and Emergent Behavior in Distributed Computing Environments, (2004)
  • [6] Fang Z., Bensaou B., Fair bandwidth sharing algorithms based on game theory frameworks for wireless adhoc networks, Proc. IEEE Infocom 2004, (2004)
  • [7] Ghosh T., Pissinou N., Makki K., Towards designing a trusted routing solution in mobile ad hoc networks, Mobile Networks and Applications, 10, 6, (2005)
  • [8] Hardin G., The tragedy of the commons, Science, 162, 3859, pp. 1243-1248, (1968)
  • [9] Nowak M.A., Sigmund K., The alternating prisoner's dilemma, Journal of Theoretic Biology, 168, pp. 219-226, (1994)
  • [10] Rasmusen E., Games and Information, (2006)