Results 1  10
of
53
A gametheoretic approach to energyefficient power control in multicarrier CDMA systems
 IEEE Journal on Selected Areas in Communications (JSAC
, 2006
"... Abstract—A gametheoretic model for studying power control in multicarrier codedivision multipleaccess systems is proposed. Power control is modeled as a noncooperative game in which each user decides how much power to transmit over each carrier to maximize its own utility. The utility function co ..."
Abstract

Cited by 85 (8 self)
 Add to MetaCart
(Show Context)
Abstract—A gametheoretic model for studying power control in multicarrier codedivision multipleaccess systems is proposed. Power control is modeled as a noncooperative game in which each user decides how much power to transmit over each carrier to maximize its own utility. The utility function considered here measures the number of reliable bits transmitted over all the carriers per joule of energy consumed and is particularly suitable for networks where energy efficiency is important. The multidimensional nature of users ’ strategies and the nonquasiconcavity of the utility function make the multicarrier problem much more challenging than the singlecarrier or throughputbasedutility case. It is shown that, for all linear receivers including the matched filter, the decorrelator, and the minimummeansquareerror detector, a user’s utility is maximized when the user transmits only on its “best ” carrier. This is the carrier that requires the least amount of power to achieve a particular target signaltointerferenceplusnoise ratio at the output of the receiver. The existence and uniqueness of Nash equilibrium for the proposed power control game are studied. In particular, conditions are given that must be satisfied by the channel gains for a Nash equilibrium to exist, and the distribution of the users among the carriers at equilibrium is characterized. In addition, an iterative and distributed algorithm for reaching the equilibrium (when it exists) is presented. It is shown that the proposed approach results in significant improvements in the total utility achieved at equilibrium compared with a singlecarrier system and also to a multicarrier system in which each user maximizes its utility over each carrier independently. Index Terms—Energy efficiency, game theory, multicarrier codedivision multipleaccess (CDMA), multiuser detection, Nash equilibrium, power control, utility function. I.
Coalition games with cooperative transmission: A cure for the curse of boundary nodes in selfish packetforwarding wireless networks
 IEEE Trans. Comm
, 2009
"... Abstract — In wireless packetforwarding networks with selfish nodes, applications of a repeated game can induce the nodes to forward each others ’ packets, so that the network performance can be improved. However, the nodes on the boundary of such networks cannot benefit from this strategy, as the ..."
Abstract

Cited by 41 (7 self)
 Add to MetaCart
(Show Context)
Abstract — In wireless packetforwarding networks with selfish nodes, applications of a repeated game can induce the nodes to forward each others ’ packets, so that the network performance can be improved. However, the nodes on the boundary of such networks cannot benefit from this strategy, as the other nodes do not depend on them. This problem is sometimes known as the curse of the boundary nodes. To overcome this problem, an approach based on coalition games is proposed, in which the boundary nodes can use cooperative transmission to help the backbone nodes in the middle of the network. In return, the backbone nodes are willing to forward the boundary nodes’ packets. The stability of the coalitions is studied using the concept of a core. Then two types of fairness, namely, the minmax fairness using nucleolus and the average fairness using the Shapley function are investigated. Finally, a protocol is designed using both repeated games and coalition games. Simulation results show how boundary nodes and backbone nodes form coalitions together according to different fairness criteria. The proposed protocol can improve the network connectivity by about 50%, compared with pure repeated game schemes. I.
Adaptation, Coordination and Distributed Resource Allocation in InterferenceLimited Wireless Networks
"... A sensible design of wireless networks involves striking a good balance between an aggressive reuse of the spectral resource throughout the network and managing the resulting cochannel interference. Traditionally this problem has been tackled using a “divide and conquer” approach. The latter consis ..."
Abstract

Cited by 35 (3 self)
 Add to MetaCart
(Show Context)
A sensible design of wireless networks involves striking a good balance between an aggressive reuse of the spectral resource throughout the network and managing the resulting cochannel interference. Traditionally this problem has been tackled using a “divide and conquer” approach. The latter consists in deploying the network with a static or semidynamic pattern of resource reutilization. The chosen reuse factor, while sacrificing a substantial amount of efficiency, brings the interference to a tolerable level. The resource can then be managed in each cell so as to optimize the per cell capacity using an advanced air interface design. In this paper we focus our attention on the overall network capacity as a measure of system performance. We consider the problem of resource allocation and adaptive transmission in multicell scenarios. As a key instance, the problem of joint scheduling and power control simultaneously in multiple transmitreceive links, which employ capacityachieving adaptive codes, is studied. In principle, the solution of such an optimization hinges on tough issues such as the computational complexity and the requirement for heavy receivertotransmitter feedback and, for cellular networks, celltocell channel state information (CSI) signaling. We give asymptotic properties pertaining to ratemaximizing power control and scheduling in multicell networks. We then present some promising leads for substantial complexity and signaling reduction via the use of newly developed distributed and game theoretic techniques.
Distributed InterferenceAware EnergyEfficient Power Optimization
"... Abstract—Power optimization techniques are becoming increasingly important in wireless system design since battery technology has not kept up with the demand of mobile devices. They are also critical to interference management in wireless systems because interference usually results from both aggr ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
Abstract—Power optimization techniques are becoming increasingly important in wireless system design since battery technology has not kept up with the demand of mobile devices. They are also critical to interference management in wireless systems because interference usually results from both aggressive spectral reuse and high power transmission and severely limits system performance. In this paper, we develop an energyefficient power optimization scheme for interferencelimited wireless communications. We consider both circuit and transmission powers and focus on energy efficiency over throughput. We first investigate a noncooperative game for energyefficient power optimization in frequencyselective channels and reveal the conditions of the existence and uniqueness of the equilibrium for this game. Most importantly, we discover a sufficient condition for generic multichannel power control to have a unique equilibrium in frequencyselective channels. Then we study the tradeoff between energy efficiency and spectral efficiency and show by simulation results that the proposed scheme improves both energy efficiency and spectral efficiency in an interferencelimited multicell cellular network. Index Terms—Interference, energy efficiency, power optimization, OFDM, noncooperative power control. I.
Joint receiver and transmitter optimization for energyefficient CDMA communications
 IEEE J. Sel. Areas Commun., Special Issue on Multiuser Detection for Advanced Communications Systems and Networks
, 2008
"... iv ..."
(Show Context)
Noncooperative Spectrum Access – The Dedicated vs. Free Spectrum Choice
"... We consider a dynamic spectrum access system in which Secondary Users (SUs) choose to either acquire dedicated spectrum or to use spectrumholes (white spaces) which belong to Primary Users (PUs). The tradeoff incorporated in this decision is between immediate yet costly transmission and free but de ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
(Show Context)
We consider a dynamic spectrum access system in which Secondary Users (SUs) choose to either acquire dedicated spectrum or to use spectrumholes (white spaces) which belong to Primary Users (PUs). The tradeoff incorporated in this decision is between immediate yet costly transmission and free but delayed transmission (a consequence of both the possible appearance of PUs and sharing the spectrum holes with multiple SUs). We first consider a system with a single PU band, in which the SU decisions are fixed. Employing queueingtheoretic methods, we obtain explicit expressions for the expected delays associated with using the PU band. Based on that, we then consider selfinterested SUs and study the interaction between them as a noncooperative game. We prove the existence and uniqueness of a symmetric Nash equilibrium, and characterize the equilibrium behavior explicitly. Using our equilibrium results, we show how to maximize revenue from renting dedicated bands to SUs. Finally, we extend the scope to a scenario with multiple PUs, show that the bandpricing analysis can be applied to some special cases, and provide numerical examples.
Robust power allocation for energyefficient locationaware networks
 IEEE/ACM Trans. Netw
"... Abstract—In wireless locationaware networks, mobile nodes (agents) typically obtain their positions using the range measurements to the nodes with known positions. Transmit power allocation not only affects network lifetime and throughput, but also determines localization accuracy. In this paper, ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
(Show Context)
Abstract—In wireless locationaware networks, mobile nodes (agents) typically obtain their positions using the range measurements to the nodes with known positions. Transmit power allocation not only affects network lifetime and throughput, but also determines localization accuracy. In this paper, we present an optimization framework for robust power allocation in network localization with imperfect knowledge of network parameters. In particular, we formulate power allocation problems to minimize localization errors for a given power budget and show that such formulations can be solved via conic programming. Moreover, we design a distributed power allocation algorithm that allows parallel computation among agents. The simulation results show that the proposed schemes significantly outperform uniform power allocation, and the robust schemes outperform their nonrobust counterparts when the network parameters are subject to uncertainty. Index Terms—Localization, resource allocation, robust optimization, secondorder conic programming (SOCP), semidefinite programming (SDP), wireless networks. I.
Power optimization for network localization
 IEEE/ACM Trans. on Networking
, 2014
"... ar ..."
(Show Context)
NearOptimal Power Control in Wireless Networks: A Potential Game Approach
"... We study power control in a multicell CDMA wireless system whereby selfinterested users share a common spectrum and interfere with each other. Our objective is to design a power control scheme that achieves a (near) optimal power allocation with respect to any predetermined network objective (suc ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
We study power control in a multicell CDMA wireless system whereby selfinterested users share a common spectrum and interfere with each other. Our objective is to design a power control scheme that achieves a (near) optimal power allocation with respect to any predetermined network objective (such as the maximization of sumrate, or some fairness criterion). To obtain this, we introduce the potentialgame approach that relies on approximating the underlying noncooperative game with a “close ” potential game, for which prices that induce an optimal power allocation can be derived. We use the proximity of the original game with the approximate game to establish through Lyapunovbased analysis that natural userupdate schemes (applied to the original game) converge within a neighborhood of the desired operating point, thereby inducing nearoptimal performance in a dynamical sense. Additionally, we demonstrate through simulations that the actual performance can in practice be very close to optimal, even when the approximation is inaccurate. As a concrete example, we focus on the sumrate objective, and evaluate our approach both theoretically and empirically.