No abstract

Abstract-In this paper, 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). In particular, we consider two classes of multistage games: sequential and simultaneous. For such games, the definitions of the Nash equilibria and the cooperative solution are given. The described games exhibit a number of interesting features. For instance, the Nash equilibrium may turn out to be unattainable in both a simultaneous and a sequential game. In this case, the game dynamics may exhibit the behaviour similar to that of a limit cycle albeit in a discrete space. 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 players move by solving respective optimisation problems. Using the developed environment, two specific game scenarios were considered in detail.

Abstract-Hybrid Wireless Mesh Networks (HWMNs) were proposed to address the challenges in wireless communications to support mobile applications across different domains. Due to the multi-hop and decentralized network architecture, HWMNs are naturally susceptible to various security threats, especially internal attacks. Therefore, HWMNs must be able to detect anomalies, provide secure routing and protect user privacy through the cooperation among nodes. However, the existing routing protocols for HWMNs cannot ensure the security to protect the users privacy effectively. Moreover, traditional HWMNs are vertically integrated where the control and data planes of mesh routers are bundled together, which makes it complex and difficult to configure the network according to predefined security policies, and to adaptively respond to various dynamic security threats.Software-Defined Wireless Mesh Networks decouple the control plane and data plane of routers and thus enable a more flexible and efficient configuration of security policies. Taking up this opportunity to address the aforementioned challenges, this paper proposes a privacy-aware, secure and energy-aware green routing (PSGR) protocol that can defend against internal attacks, achieve stronger privacy protection and reduce energy consumption in Software-Defined HWMNs. The elaborate theoretical analysis verify that the PSGR protocol can implement the security and privacy protection against internal attacks effectively and efficiently. Simulation results demonstrate a superior performance of PSGR in terms of packet delivery ratio, network throughput and energy efficiency compared to the existing PA-SHWMP, PASER, and HWMP protocols in the presence of Blackhole/Grayhole attacks and wormhole attacks.

No 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.