ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Electronic Notes in Theoretical Computer Science
Volume 119, Issue 1, 2 February 2005, Pages 67-92
Proceedings of the Workshop on Games in Design and Verification (GDV 2004)
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (356 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.entcs.2004.07.009    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2005 Elsevier B.V. All rights reserved.

Towards A Game Theoretic Understanding of Ad-Hoc Routing

Irfan Zakiuddina, E-mail The Corresponding Author, Tim Hawkinsb, E-mail The Corresponding Author and Nick Moffatb, E-mail The Corresponding Author

aCommand and Intelligence Systems, QinetiQ, Malvern, UK bTrusted Information Management, QinetiQ, Malvern, UK

Available online 10 February 2005.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

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


Electronic Notes in Theoretical Computer Science
Volume 119, Issue 1, 2 February 2005, Pages 67-92
Proceedings of the Workshop on Games in Design and Verification (GDV 2004)
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.