The strategic placement of mobile agents on a hexagonal graph using game theory

Abstract

Abstract-This paper considers an application of Dynamic Game Theory with the goal of increasing the performance of a Mobile Ad Hoc Network in relation to increasing packet delivery ratio and reducing end-to-end delay by the strategic placement of drones. A multi-stage sequential game of two players, each with one drone is played out in a scenario depicted by a hexagonal graph, obstacles such as forests are also included. The algorithm for the game has been implemented in JavaScript and the results show that the best strategic locations of the placement of the drones can be established during the sequential moves of the players. Results also show that the Nash Equilibrium is achieved during play.

MANET Performance Optimization Using Network-Based Criteria and Unmanned Aerial Vehicles

“…The former one corresponds to the case when all players act together and aim at maximizing their total pay-off, while the latter one appears when each player maximizes their own pay-off function. In [18][19][20], the problem of determining the Nash equilibrium and best-reply solutions was was studied in detail within the framework of multi-stage and one-stage (static) games.…”

“…Within the stated research program, there have been several papers dealing with the problem of optimal placing of drones under different assumptions about the players' strategies, see [18][19][20]. However, as was previously shown, the computed optimal solutions are in general non-unique.…”