Dynamic Resource Allocation in an Adversarial Urban IoBT Environment

Algorithm 1

Computing algorithm for achieving Stackelberg game equilibrium.

Step 1: Initialize the relevant parameters: that represents bandwidth, that represents a set for interferences at the first round ( would dynamically change according to the Markov transition probability matrix), that represents the power of noise, and that represents a reasonable maximum power that the attackers can accept. Additionally, set

Step 2: By using a searching algorithm, the maximum value of can be found. The maximum corresponds to the optimal solution of the attacker’s power .

 Let : : , =

 For :

  Set =

  Compute based on the function (18)

  If

    Update =

    Set =

Step 3: Building on the above steps, the algorithm searches the optimal solution within the closed interval range to determine the game equilibrium and the corresponding utilities of the attackers and defenders , .