Electronic Notes in Theoretical Computer Science 119 (2005) 67–92 www.elsevier.com/locate/entcs
Towards A Game Theoretic Understanding of Ad-Hoc Routing Irfan Zakiuddina,1 Tim Hawkinsb,2 Nick Moffatb,3 a b
Command and Intelligence Systems, QinetiQ, Malvern, UK Trusted Information Management, QinetiQ, Malvern, UK
Abstract In this paper we present a new application of game theory, in which game theoretic techniques are used to provide a rigorous underpinning to the analysis of ad-hoc routing protocols. The explosion of interest in ad-hoc networks over the last few years has resulted in a very large number of routing protocols being proposed. Despite this, the science of analysing routing protocols is still relatively immature, and the question that remains is how to decide “how good” a given protocol is. We propose a game theoretic approach as a potentially effective means of answering this question. The conceptual mapping of routing into a game is, we believe, natural and simple. Furthermore, game theory provides an extensive repertoire of tools to analyse key properties. The paper describes how routing techniques can be modelled as games and presents some analytical results. Keywords: game theory, routing, ad-hoc networks, performance analysis
1
Introduction
Game theory comprises a powerful set of techniques to reason about situations involving conflict and competition. The subject of this paper is the application of game theoretic techniques to the analysis of ad-hoc routing protocols. We believe this to be a novel use of such techniques. The particular way in which we have applied game theory to this problem is described in Section 3. 1 2 3
Email:
[email protected] Email:
[email protected] Email:
[email protected]
1571-0661/$ – see front matter © 2005 Elsevier B.V. All rights reserved. doi:10.1016/j.entcs.2004.07.009
