Game theory for cooperative and relay communications in mobile ad hoc networks: a brief tutorial Online publication date: Wed, 16-Dec-2009
by Lu Yan
International Journal of Mobile Network Design and Innovation (IJMNDI), Vol. 3, No. 1, 2009
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Network Design and Innovation (IJMNDI):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com