544 research outputs found
Non-cooperative Feedback Rate Control Game for Channel State Information in Wireless Networks
It has been well recognized that channel state information (CSI) feedback is
of great importance for dowlink transmissions of closed-loop wireless networks.
However, the existing work typically researched the CSI feedback problem for
each individual mobile station (MS), and thus, cannot efficiently model the
interactions among self-interested mobile users in the network level. To this
end, in this paper, we propose an alternative approach to investigate the CSI
feedback rate control problem in the analytical setting of a game theoretic
framework, in which a multiple-antenna base station (BS) communicates with a
number of co-channel MSs through linear precoder. Specifically, we first
present a non-cooperative feedback-rate control game (NFC), in which each MS
selects the feedback rate to maximize its performance in a distributed way. To
improve efficiency from a social optimum point of view, we then introduce
pricing, called the non-cooperative feedback-rate control game with price
(NFCP). The game utility is defined as the performance gain by CSI feedback
minus the price as a linear function of the CSI feedback rate. The existence of
the Nash equilibrium of such games is investigated, and two types of feedback
protocols (FDMA and CSMA) are studied. Simulation results show that by
adjusting the pricing factor, the distributed NFCP game results in close
optimal performance compared with that of the centralized scheme.Comment: 26 pages, 10 figures; IEEE Journal on Selected Areas in
Communications, special issue on Game Theory in Wireless Communications, 201
Efficiency Resource Allocation for Device-to-Device Underlay Communication Systems: A Reverse Iterative Combinatorial Auction Based Approach
Peer-to-peer communication has been recently considered as a popular issue
for local area services. An innovative resource allocation scheme is proposed
to improve the performance of mobile peer-to-peer, i.e., device-to-device
(D2D), communications as an underlay in the downlink (DL) cellular networks. To
optimize the system sum rate over the resource sharing of both D2D and cellular
modes, we introduce a reverse iterative combinatorial auction as the allocation
mechanism. In the auction, all the spectrum resources are considered as a set
of resource units, which as bidders compete to obtain business while the
packages of the D2D pairs are auctioned off as goods in each auction round. We
first formulate the valuation of each resource unit, as a basis of the proposed
auction. And then a detailed non-monotonic descending price auction algorithm
is explained depending on the utility function that accounts for the channel
gain from D2D and the costs for the system. Further, we prove that the proposed
auction-based scheme is cheat-proof, and converges in a finite number of
iteration rounds. We explain non-monotonicity in the price update process and
show lower complexity compared to a traditional combinatorial allocation. The
simulation results demonstrate that the algorithm efficiently leads to a good
performance on the system sum rate.Comment: 26 pages, 6 fgures; IEEE Journals on Selected Areas in
Communications, 201
Resource Allocation for Energy-Efficient 3-Way Relay Channels
Throughput and energy efficiency in 3-way relay channels are studied in this
paper. Unlike previous contributions, we consider a circular message exchange.
First, an outer bound and achievable sum rate expressions for different
relaying protocols are derived for 3-way relay channels. The sum capacity is
characterized for certain SNR regimes. Next, leveraging the derived achievable
sum rate expressions, cooperative and competitive maximization of the energy
efficiency are considered. For the cooperative case, both low-complexity and
globally optimal algorithms for joint power allocation at the users and at the
relay are designed so as to maximize the system global energy efficiency. For
the competitive case, a game theoretic approach is taken, and it is shown that
the best response dynamics is guaranteed to converge to a Nash equilibrium. A
power consumption model for mmWave board-to-board communications is developed,
and numerical results are provided to corroborate and provide insight on the
theoretical findings.Comment: Submitted to IEEE Transactions on Wireless Communication
Achieving Global Optimality for Weighted Sum-Rate Maximization in the K-User Gaussian Interference Channel with Multiple Antennas
Characterizing the global maximum of weighted sum-rate (WSR) for the K-user
Gaussian interference channel (GIC), with the interference treated as Gaussian
noise, is a key problem in wireless communication. However, due to the users'
mutual interference, this problem is in general non-convex and thus cannot be
solved directly by conventional convex optimization techniques. In this paper,
by jointly utilizing the monotonic optimization and rate profile techniques, we
develop a new framework to obtain the globally optimal power control and/or
beamforming solutions to the WSR maximization problems for the GICs with
single-antenna transmitters and single-antenna receivers (SISO), single-antenna
transmitters and multi-antenna receivers (SIMO), or multi-antenna transmitters
and single-antenna receivers (MISO). Different from prior work, this paper
proposes to maximize the WSR in the achievable rate region of the GIC directly
by exploiting the facts that the achievable rate region is a "normal" set and
the users' WSR is a "strictly increasing" function over the rate region.
Consequently, the WSR maximization is shown to be in the form of monotonic
optimization over a normal set and thus can be solved globally optimally by the
existing outer polyblock approximation algorithm. However, an essential step in
the algorithm hinges on how to efficiently characterize the intersection point
on the Pareto boundary of the achievable rate region with any prescribed "rate
profile" vector. This paper shows that such a problem can be transformed into a
sequence of signal-to-interference-plus-noise ratio (SINR) feasibility
problems, which can be solved efficiently by existing techniques. Numerical
results validate that the proposed algorithms can achieve the global WSR
maximum for the SISO, SIMO or MISO GIC.Comment: This is the longer version of a paper to appear in IEEE Transactions
on Wireless Communication
- …