Fair packet forwarding in MANETs with anonymous stations: A game-theoretic approach

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A station of a mobile ad-hoc network (MANET) may selfishly refuse to forward transit packets as it shortens the battery life and takes up a portion of the bandwidth that could be used for source packets. Due to a high degree of station anonymity, selfishness meets with little punishment. The well-known watchdog mechanism can be used to check if an adjacent station forwards packets. We point out that a watchdog may be unable to tell source from transit packets, which enables undetectable manipulation of local congestion controls in selfish stations. We allow each station to set its source packet admission threshold so as to maximise a throughput- and reputation-related payoff. The nature of possible Nash equilibria of the resulting noncooperative game are examined for a generic model of packet forwarding and symmetric traffic flows. A novel packet forwarding protocol called F^T is proposed and the payoffs it yields are approximately analysed. © IFIP International Federation for Information Processing 2004.

Cite

CITATION STYLE

APA

Konorski, J. (2004). Fair packet forwarding in MANETs with anonymous stations: A game-theoretic approach. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3042, 418–429. https://doi.org/10.1007/978-3-540-24693-0_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free