糖心Vlog破解版

Citation

Kirpichnikova A, Gromova E & Blakeway S (2026) Game-Theoretic Agent Placement for Vulnerability Mitigation in MANETs. In: RelStat-2025, Lecture Notes in Networks and Systems book series, Springer. Lecture Notes in Networks and Systems. The 25th International Multi-Conference Reliability and Statistics in Transportation and Communication, Riga, Latvia, 16.10.2025-18.10.2025. Springer. https://doi.org/10.1007/978-3-032-19245-5_9

Abstract
We propose a novel approach to agent placement in MANETs based on node vulnerability. A cost function is introduced to quantify the vulnerability of each node, reflecting its role in maintaining overall network connectivity. Building on this, we model the agent placement problem as a non-cooperative game, where players seek Nash equilibrium strategies for locating a new agent in an unoccupied node. In disaster-recovery scenarios, these agents may represent rapidly deployable UAVs (drones) acting as mobile relay nodes to extend and stabilize network coverage. To validate the theoretical results, a real-world network topol-ogy from New Orleans during the post-disaster recovery efforts following Hurricane Katrina in 2005 was used. Simulation results demonstrate that positioning agents according to the proposed algorithm leads to a measurable improvement in key network performance metrics.

Keywords
MANET; Game Theory; Nash Equilibrium; Unmanned Aerial Vehicle; Disaster Recovery; Performance Evaluation; Network Simulator NS-3; Performance Evaluation; Ad hoc On-Demand Distance Vector Routing