RUS  ENG
Full version
JOURNALS // Vestnik Sankt-Peterburgskogo Universiteta. Seriya 10. Prikladnaya Matematika. Informatika. Protsessy Upravleniya // Archive

Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 2019 Volume 15, Issue 1, Pages 22–38 (Mi vspui387)

This article is cited in 1 paper

Applied mathematics

Increasing the performance of a Mobile Ad-hoc Network using a game-theoretic approach to drone positioning

S. Blakewaya, D. V. Gromovb, E. V. Gromovab, A. S. Kirpichnikovac, T. M. Plekhanovab

a Wrexham Glyndŵr University, Mold Road, Wrexham, LL11 2AW, Great Britain
b St. Petersburg State University, 7-9, Universitetskaya nab., St. Petersburg, 199034, Russian Federation
c University of Stirling, Stirling, FK9 4LA, Scotland, Great Britain

Abstract: We describe a novel game-theoretic formulation of the optimal mobile agents' placement problem which arises in the context of Mobile Ad-hoc Networks (MANETs). This problem is modelled as a sequential multistage game. The definitions of both the Nash equilibrium and cooperative solution are given. A modification was proposed to ensure the existence of a Nash equilibrium. A modelling environment for the analysis of different strategies of the players was developed in MATLAB. The programme generates various game situations and determines each player move by solving respective optimisation problems. Using the developed environment, two specific game scenarios were considered in detail. The proposed novel algorithm was implemented and tested using Network Simulator 3 (NS-3). The results show that the proposed novel algorithm increases network performance by using game theory principles and techniques.

Keywords: MANET, dynamic games, multistage games, drone placement, graphs, Nash equilibria, NS-3.

UDC: 519.711.74

MSC: 49N90, 90B18, 93C95

Received: June 27, 2018
Accepted: December 18, 2018

Language: English

DOI: 10.21638/11701/spbu10.2019.102



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024