Authors: Lu Yan, Stephen Hailes
Addresses: School of Computer Science, University of Hertfordshire, College Lane, Hatfield, Hertfordshire AL10 9AB, UK. ' Department of Computer Science, University College London, Gower Street, London, WC1E 6BT, UK
Abstract: Every node in a wireless ad hoc network 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. In this article, we use game theory to analyse cooperative mechanisms and derive optimal criteria in forwarding. Distinguished from previous works, we take the consideration of realistic scenarios such as noise, non-simultaneously, non-perfect measurement and different strategies by the nodes.
Keywords: optimal forwarding; game theory; wireless networks; ad hoc networks; cooperative mechanisms.
International Journal of Autonomous and Adaptive Communications Systems, 2008 Vol.1 No.4, pp.447 - 464
Published online: 28 Nov 2008 *Full-text access for editors Access for subscribers Purchase this article Comment on this article