2,014 research outputs found
On a game theoretic approach to capacity maximization in wireless networks
We consider the capacity problem (or, the single slot scheduling problem) in
wireless networks. Our goal is to maximize the number of successful connections
in arbitrary wireless networks where a transmission is successful only if the
signal-to-interference-plus-noise ratio at the receiver is greater than some
threshold. We study a game theoretic approach towards capacity maximization
introduced by Andrews and Dinitz (INFOCOM 2009) and Dinitz (INFOCOM 2010). We
prove vastly improved bounds for the game theoretic algorithm. In doing so, we
achieve the first distributed constant factor approximation algorithm for
capacity maximization for the uniform power assignment. When compared to the
optimum where links may use an arbitrary power assignment, we prove a approximation, where is the ratio between the largest and the
smallest link in the network. This is an exponential improvement of the
approximation factor compared to existing results for distributed algorithms.
All our results work for links located in any metric space. In addition, we
provide simulation studies clarifying the picture on distributed algorithms for
capacity maximization.Comment: 16 pages, 5 figures (to appear in INFOCOM 2011
Energy-Efficient Power and Rate Control with QoS Constraints: A Game-Theoretic Approach
A game-theoretic model is proposed to study the cross-layer problem of joint
power and rate control with quality of service (QoS) constraints in
multiple-access networks. In the proposed game, each user seeks to choose its
transmit power and rate in a distributed manner in order to maximize its own
utility and at the same time satisfy its QoS requirements. The user's QoS
constraints are specified in terms of the average source rate and average
delay. The utility function considered here measures energy efficiency and the
delay includes both transmission and queueing delays. The Nash equilibrium
solution for the proposed non-cooperative game is derived and a closed-form
expression for the utility achieved at equilibrium is obtained. It is shown
that the QoS requirements of a user translate into a "size" for the user which
is an indication of the amount of network resources consumed by the user. Using
this framework, the tradeoffs among throughput, delay, network capacity and
energy efficiency are also studied.Comment: To appear in the proceedings of the 2006 International Wireless
Communications and Mobile Computing Conference (IWCMC'06), Vancouver, BC,
Canada, July 200
Potential Games for Energy-Efficient Resource Allocation in Multipoint-to-Multipoint CDMA Wireless Data Networks
The problem of noncooperative resource allocation in a
multipoint-to-multipoint cellular network is considered in this paper. The
considered scenario is general enough to represent several key instances of
modern wireless networks such as a multicellular network, a peer-to-peer
network (interference channel), and a wireless network equipped with
femtocells. In particular, the problem of joint transmit waveforms adaptation,
linear receiver design, and transmit power control is examined. Several utility
functions to be maximized are considered, and, among them, we cite the received
SINR, and the transmitter energy efficiency, which is measured in bit/Joule,
and represents the number of successfully delivered bits for each energy unit
used for transmission. Resorting to the theory of potential games,
noncooperative games admitting Nash equilibria in multipoint-to-multipoint
cellular networks regardless of the channel coefficient realizations are
designed. Computer simulations confirm that the considered games are
convergent, and show the huge benefits that resource allocation schemes can
bring to the performance of wireless data networks.Comment: Submitted to Physical Communication, ELSEVIE
Energy-Efficient Resource Allocation in Multiuser MIMO Systems: A Game-Theoretic Framework
This paper focuses on the cross-layer issue of resource allocation for energy
efficiency in the uplink of a multiuser MIMO wireless communication system.
Assuming that all of the transmitters and the uplink receiver are equipped with
multiple antennas, the situation considered is that in which each terminal is
allowed to vary its transmit power, beamforming vector, and uplink receiver in
order to maximize its own utility, which is defined as the ratio of data
throughput to transmit power; the case in which non-linear interference
cancellation is used at the receiver is also investigated. Applying a
game-theoretic formulation, several non-cooperative games for utility
maximization are thus formulated, and their performance is compared in terms of
achieved average utility, achieved average SINR and average transmit power at
the Nash equilibrium. Numerical results show that the use of the proposed
cross-layer resource allocation policies brings remarkable advantages to the
network performance.Comment: Proceedings of the 16th European Signal Processing Conference,
Lausanne, Switzerland, August 25-29, 200
Energy-Efficient Resource Allocation in Wireless Networks with Quality-of-Service Constraints
A game-theoretic model is proposed to study the cross-layer problem of joint
power and rate control with quality of service (QoS) constraints in
multiple-access networks. In the proposed game, each user seeks to choose its
transmit power and rate in a distributed manner in order to maximize its own
utility while satisfying its QoS requirements. The user's QoS constraints are
specified in terms of the average source rate and an upper bound on the average
delay where the delay includes both transmission and queuing delays. The
utility function considered here measures energy efficiency and is particularly
suitable for wireless networks with energy constraints. The Nash equilibrium
solution for the proposed non-cooperative game is derived and a closed-form
expression for the utility achieved at equilibrium is obtained. It is shown
that the QoS requirements of a user translate into a "size" for the user which
is an indication of the amount of network resources consumed by the user. Using
this competitive multiuser framework, the tradeoffs among throughput, delay,
network capacity and energy efficiency are studied. In addition, analytical
expressions are given for users' delay profiles and the delay performance of
the users at Nash equilibrium is quantified.Comment: Accpeted for publication in the IEEE Transactions on Communication
Signal Processing and Optimal Resource Allocation for the Interference Channel
In this article, we examine several design and complexity aspects of the
optimal physical layer resource allocation problem for a generic interference
channel (IC). The latter is a natural model for multi-user communication
networks. In particular, we characterize the computational complexity, the
convexity as well as the duality of the optimal resource allocation problem.
Moreover, we summarize various existing algorithms for resource allocation and
discuss their complexity and performance tradeoff. We also mention various open
research problems throughout the article.Comment: To appear in E-Reference Signal Processing, R. Chellapa and S.
Theodoridis, Eds., Elsevier, 201
A Comprehensive Survey of Potential Game Approaches to Wireless Networks
Potential games form a class of non-cooperative games where unilateral
improvement dynamics are guaranteed to converge in many practical cases. The
potential game approach has been applied to a wide range of wireless network
problems, particularly to a variety of channel assignment problems. In this
paper, the properties of potential games are introduced, and games in wireless
networks that have been proven to be potential games are comprehensively
discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on
Communications, vol. E98-B, no. 9, Sept. 201
Pareto-optimal Nash equilibrium in capacity allocation game for self-managed networks
In this paper we introduce a capacity allocation game which models the
problem of maximizing network utility from the perspective of distributed
noncooperative agents. Motivated by the idea of self-managed networks, in the
developed framework decision-making entities are associated with individual
transmission links, deciding on the way they split capacity among concurrent
flows. An efficient decentralized algorithm is given for computing strongly
Pareto-optimal strategies, constituting a pure Nash equilibrium. Subsequently,
we discuss the properties of the introduced game related to the Price of
Anarchy and Price of Stability. The paper is concluded with an experimental
study.Comment: Computer Networks, 201
Energy Efficiency in Multi-hop CDMA Networks: A Game Theoretic Analysis
A game-theoretic analysis is used to study the effects of receiver choice on
the energy efficiency of multi-hop networks in which the nodes communicate
using Direct-Sequence Code Division Multiple Access (DS-CDMA). A Nash
equilibrium of the game in which the network nodes can choose their receivers
as well as their transmit powers to maximize the total number of bits they
transmit per unit of energy is derived. The energy efficiencies resulting from
the use of different linear multiuser receivers in this context are compared,
looking at both the non-cooperative game and the Pareto optimal solution. For
analytical ease, particular attention is paid to asymptotically large networks.
Significant gains in energy efficiency are observed when multiuser receivers,
particularly the linear minimum mean-square error (MMSE) receiver, are used
instead of conventional matched filter receivers.Comment: To appear in the Proceedings of the Workshop on Multi-Layer Modelling
and Design of Multi-Hop Wireless Networks (MLMD 06), Minneapolis, MN, July 12
- 15, 200
Distributed Game Theoretic Optimization and Management of Multichannel ALOHA Networks
The problem of distributed rate maximization in multi-channel ALOHA networks
is considered. First, we study the problem of constrained distributed rate
maximization, where user rates are subject to total transmission probability
constraints. We propose a best-response algorithm, where each user updates its
strategy to increase its rate according to the channel state information and
the current channel utilization. We prove the convergence of the algorithm to a
Nash equilibrium in both homogeneous and heterogeneous networks using the
theory of potential games. The performance of the best-response dynamic is
analyzed and compared to a simple transmission scheme, where users transmit
over the channel with the highest collision-free utility. Then, we consider the
case where users are not restricted by transmission probability constraints.
Distributed rate maximization under uncertainty is considered to achieve both
efficiency and fairness among users. We propose a distributed scheme where
users adjust their transmission probability to maximize their rates according
to the current network state, while maintaining the desired load on the
channels. We show that our approach plays an important role in achieving the
Nash bargaining solution among users. Sequential and parallel algorithms are
proposed to achieve the target solution in a distributed manner. The
efficiencies of the algorithms are demonstrated through both theoretical and
simulation results.Comment: 34 pages, 6 figures, accepted for publication in the IEEE/ACM
Transactions on Networking, part of this work was presented at IEEE CAMSAP
201
- …