Search
Abstract
In multi-hop ad hoc networks, selfish nodes may unduly acquire high quality of service (QoS) by assigning higher priority to source packets and lower priority to transit packets. Such traffic remapping attacks (TRAs) are cheap to launch, impossible to prevent, hard to detect, and harmful to non-selfish nodes. While studied mostly in single-hop wireless network settings, TRAs have resisted analysis in multi-hop settings. In this paper we offer a game-theoretic approach: we derive a formal model of opportunistic TRAs, define a TRA game with a heuristic rank-based payoff function, and propose a boundedly rational multistage attack strategy that both selfish and non-selfish nodes are free to use. Thus non-selfish nodes are allowed to respond in kind to selfish ones. We characterize the form of equilibrium that the multistage play reaches and verify via simulation that it often coincides with a Nash equilibrium in which harmful TRAs are curbed in the first place, whereas harmless ones need not be.
Citations
-
4
CrossRef
-
0
Web of Science
-
4
Scopus
Authors (2)
-
Szymon Szott
- AGH Kraków
Cite as
Full text
- Publication version
- Accepted or Published Version
- License
- Copyright (2017 IEEE)
Keywords
Details
- Category:
- Conference activity
- Type:
- materiały konferencyjne indeksowane w Web of Science
- Title of issue:
- IEEE GLOBECOM 2017 Conference Proceedings strony 1 - 7
- Language:
- English
- Publication year:
- 2017
- Bibliographic description:
- Konorski J., Szott S..: Modeling a Traffic Remapping Attack Game in a Multi-hop Ad Hoc Network, W: IEEE GLOBECOM 2017 Conference Proceedings, 2017, ,.
- DOI:
- Digital Object Identifier (open in new tab) 10.1109/glocom.2017.8253959
- Verified by:
- Gdańsk University of Technology
seen 122 times