9,085 research outputs found
Cloud/fog computing resource management and pricing for blockchain networks
The mining process in blockchain requires solving a proof-of-work puzzle,
which is resource expensive to implement in mobile devices due to the high
computing power and energy needed. In this paper, we, for the first time,
consider edge computing as an enabler for mobile blockchain. In particular, we
study edge computing resource management and pricing to support mobile
blockchain applications in which the mining process of miners can be offloaded
to an edge computing service provider. We formulate a two-stage Stackelberg
game to jointly maximize the profit of the edge computing service provider and
the individual utilities of the miners. In the first stage, the service
provider sets the price of edge computing nodes. In the second stage, the
miners decide on the service demand to purchase based on the observed prices.
We apply the backward induction to analyze the sub-game perfect equilibrium in
each stage for both uniform and discriminatory pricing schemes. For the uniform
pricing where the same price is applied to all miners, the existence and
uniqueness of Stackelberg equilibrium are validated by identifying the best
response strategies of the miners. For the discriminatory pricing where the
different prices are applied to different miners, the Stackelberg equilibrium
is proved to exist and be unique by capitalizing on the Variational Inequality
theory. Further, the real experimental results are employed to justify our
proposed model.Comment: 16 pages, double-column version, accepted by IEEE Internet of Things
Journa
Energy-Efficient Resource Allocation in Wireless Networks: An Overview of Game-Theoretic Approaches
An overview of game-theoretic approaches to energy-efficient resource
allocation in wireless networks is presented. Focusing on multiple-access
networks, it is demonstrated that game theory can be used as an effective tool
to study resource allocation in wireless networks with quality-of-service (QoS)
constraints. A family of non-cooperative (distributed) games is presented in
which each user seeks to choose a strategy that maximizes its own utility while
satisfying its QoS requirements. The utility function considered here measures
the number of reliable bits that are transmitted per joule of energy consumed
and, hence, is particulary suitable for energy-constrained networks. The
actions available to each user in trying to maximize its own utility are at
least the choice of the transmit power and, depending on the situation, the
user may also be able to choose its transmission rate, modulation, packet size,
multiuser receiver, multi-antenna processing algorithm, or carrier allocation
strategy. The best-response strategy and Nash equilibrium for each game is
presented. Using this game-theoretic framework, the effects of power control,
rate control, modulation, temporal and spatial signal processing, carrier
allocation strategy and delay QoS constraints on energy efficiency and network
capacity are quantified.Comment: To appear in the IEEE Signal Processing Magazine: Special Issue on
Resource-Constrained Signal Processing, Communications and Networking, May
200
- …