Stochastic Asymmetric Blotto Game Approach for Wireless Resource Allocation Strategies

Abstract

The development of modellings and analytical tools to structurise and study the allocation of resources through noble user competitions become essential, especially considering the increased degree of heterogeneity in application and service demands that will be cornerstone in future communication systems. Stochastic asymmetric Blotto games appear promising to modelling such problems, and devising their Nash equilibrium (NE) strategies by anticipating the potential outcomes of user competitions. In this regard, this paper approaches the generic energy efficiency problem with a new stochastic asymmetric Blotto game paradigm to enable the derivation of joint optimal bandwidth and transmit power allocations by setting multiple users to compete in multiple auction-like contests for their individual resource demands. The proposed modelling innovates by abstracting the notion of fairness from centrally-imposed to distributed-competitive, where each user's pay-off probability is expressed as quantitative bidding metric, so as, all users' actions can be interdependent, i.e., each user attains its utility given the allocations of other users, which eliminates the chance of lowvalued carriers not being claimed by any user, and, in principle, enables the full utilisation of wireless resources. We also contribute by resolving the allocation problem with low complexity using new mathematical techniques based on Charnes-Cooper transformation, which eliminate the additional coefficients and multipliers that typically appear during optimisation analysis, and derive the joint optimal strategy as a set of linear singlevariable functions for each user. We prove that our strategy converges towards a unique, monotonous and scalable NE, and examine its optimality, positivity and feasibility properties in detail. Simulation comparisons with relevant studies confirm the superiority of our approach in terms of higher energy efficiency performance, fairness index and quality-of-service provision.

Big Data Analytics Using Cloud Computing Based Frameworks for Power Management Systems: Status, Constraints, and Future Recommendations

“…In contrast to normal homogeneous systems, heterogeneous computing systems come with different issues [ 122 ]. All of the problems associated with homogeneous parallel processing systems are brought up by the presence of many processing units, and the degree of heterogeneity in the system can bring about non-uniformity in system development, programming techniques, and overall system capabilities [ 123 ]. Three categories of heterogeneity can be present: the first is instruction-set architectures (ISA): Binary incompatibility could result from differing instruction set designs in compute elements.…”

Reliability and robust resource allocation for Cache-enabled HetNets: QoS-aware mobile edge computing

“…In order to guarantee fairness, we considered the proportionally throughput balancing among users [13] in which the sum of the logarithmic utilities over all user equipment should be considered to decrease the data rate unbalancing. In this formulation 𝑥 𝑖𝑗 (𝑖 ∈ ℬ, j ∈ 𝒰) demonstrates the binary user association index, for example, if 𝑥 𝑖𝑗 = 1 user 𝑗 is associated to base station 𝑖 and otherwise it will be equal to zero.…”

QoS-aware Resource Allocation for Live Streaming in Edge-Clouds Aided HetNets Using Stochastic Network Calculus

“…In order to guarantee fairness, we considered the proportionally throughput balancing among users [13] in which the sum of the logarithmic utilities over all user equipment should be considered to decrease the data rate unbalancing. In this formulation ( ∈ ℬ, j ∈ ) demonstrates the binary user association index, for example, if = 1 user is associated to base station and otherwise it will be equal to zero.…”