Towards A Game Theoretic Understanding of Ad-Hoc Routing

Authors:
Irfan Zakiuddin;Tim Hawkins;Nick Moffat
Affiliations:
Command and Intelligence Systems, QinetiQ, Malvern, UK;Trusted Information Management, QinetiQ, Malvern, UK;Trusted Information Management, QinetiQ, Malvern, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 7
Cited 5

Multicast routing in a datagram internetwork

Multicast routing in a datagram internetwork
Interconnections (2nd ed.): bridges, routers, switches, and internetworking protocols

Interconnections (2nd ed.): bridges, routers, switches, and internetworking protocols
Model checking

Model checking
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
Coping with communication gray zones in IEEE 802.11b based ad hoc networks

WOWMOM '02 Proceedings of the 5th ACM international workshop on Wireless mobile multimedia
On the accuracy of MANET simulators

Proceedings of the second ACM international workshop on Principles of mobile computing
Implementation experience with MANET routing protocols

ACM SIGCOMM Computer Communication Review

Testing methodology for an ad hoc routing protocol

Proceedings of the ACM international workshop on Performance monitoring, measurement, and evaluation of heterogeneous wireless and wired networks
A formal validation methodology for MANET routing protocols based on nodes' self similarity

Computer Communications
A passive conformance testing approach for a MANET routing protocol

Proceedings of the 2009 ACM symposium on Applied Computing
One step forward: Linking wireless self-organizing network validation techniques with formal testing approaches

ACM Computing Surveys (CSUR)
Nodes self-similarity to test wireless ad hoc routing protocols

TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems

Quantified Score

Hi-index	0.00

Visualization

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.