8,256 research outputs found
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
Game-theoretic Resource Allocation Methods for Device-to-Device (D2D) Communication
Device-to-device (D2D) communication underlaying cellular networks allows
mobile devices such as smartphones and tablets to use the licensed spectrum
allocated to cellular services for direct peer-to-peer transmission. D2D
communication can use either one-hop transmission (i.e., in D2D direct
communication) or multi-hop cluster-based transmission (i.e., in D2D local area
networks). The D2D devices can compete or cooperate with each other to reuse
the radio resources in D2D networks. Therefore, resource allocation and access
for D2D communication can be treated as games. The theories behind these games
provide a variety of mathematical tools to effectively model and analyze the
individual or group behaviors of D2D users. In addition, game models can
provide distributed solutions to the resource allocation problems for D2D
communication. The aim of this article is to demonstrate the applications of
game-theoretic models to study the radio resource allocation issues in D2D
communication. The article also outlines several key open research directions.Comment: Accepted. IEEE Wireless Comms Mag. 201
Energy-Efficient Resource Allocation Optimization for Multimedia Heterogeneous Cloud Radio Access Networks
The heterogeneous cloud radio access network (H-CRAN) is a promising paradigm
which incorporates the cloud computing into heterogeneous networks (HetNets),
thereby taking full advantage of cloud radio access networks (C-RANs) and
HetNets. Characterizing the cooperative beamforming with fronthaul capacity and
queue stability constraints is critical for multimedia applications to
improving energy efficiency (EE) in H-CRANs. An energy-efficient optimization
objective function with individual fronthaul capacity and inter-tier
interference constraints is presented in this paper for queue-aware multimedia
H-CRANs. To solve this non-convex objective function, a stochastic optimization
problem is reformulated by introducing the general Lyapunov optimization
framework. Under the Lyapunov framework, this optimization problem is
equivalent to an optimal network-wide cooperative beamformer design algorithm
with instantaneous power, average power and inter-tier interference
constraints, which can be regarded as the weighted sum EE maximization problem
and solved by a generalized weighted minimum mean square error approach. The
mathematical analysis and simulation results demonstrate that a tradeoff
between EE and queuing delay can be achieved, and this tradeoff strictly
depends on the fronthaul constraint
Optimal Resource Allocation and Relay Selection in Bandwidth Exchange Based Cooperative Forwarding
In this paper, we investigate joint optimal relay selection and resource
allocation under bandwidth exchange (BE) enabled incentivized cooperative
forwarding in wireless networks. We consider an autonomous network where N
nodes transmit data in the uplink to an access point (AP) / base station (BS).
We consider the scenario where each node gets an initial amount (equal, optimal
based on direct path or arbitrary) of bandwidth, and uses this bandwidth as a
flexible incentive for two hop relaying. We focus on alpha-fair network utility
maximization (NUM) and outage reduction in this environment. Our contribution
is two-fold. First, we propose an incentivized forwarding based resource
allocation algorithm which maximizes the global utility while preserving the
initial utility of each cooperative node. Second, defining the link weight of
each relay pair as the utility gain due to cooperation (over noncooperation),
we show that the optimal relay selection in alpha-fair NUM reduces to the
maximum weighted matching (MWM) problem in a non-bipartite graph. Numerical
results show that the proposed algorithms provide 20- 25% gain in spectral
efficiency and 90-98% reduction in outage probability.Comment: 8 pages, 7 figure
- …