A power allocation algorithm for throughput maximization in mobile networks

The paper focuses on competitively optimal power-control and signal-shaping for "ad-hoc" networks composed of multiple-antenna noncooperative transmit/receive terminals affected by spatially colored multi-access interference (MAI). The target is the competitive maximization of the information throughput (measured in bits/slot) sustained by each link active over the network. For this purpose, the MAI-impaired network is modeled as a noncooperative strategic game, and sufficient conditions for the existence and uniqueness of the Nash equilibrium are provided. We develop fully distributed and scalable power-control and signal-shaping algorithms allowing the implementation of asynchronous space-division multiple access strategies (SDMACSs) able to guarantee the competitive maximization of the users' throughput under both best effort and contracted QoS access policies. We give evidence that the developed SDMACSs outperform (in terms of aggregate throughput) the conventional centralized ones (such as TDMA/FDMA/CDMA), especially in operating scenarios affected by strong MAI. We study the convergence property of the presented SDMACSs and show that, when the throughput set requested by the users is not achievable by the network, then the developed SDMACSs are able to move the working point of the system to the nearest one sustainable by the network. By exploiting the distributed feature of the presented SDMACSs, we propose two connection admission procedures (CAPs) able to optimize (in a competitive sense) the tradeoff between aggregate networking throughput and connection requirements advanced by the users.

[1]  Stephen B. Wicker,et al.  Game theory in communications: motivation, explanation, and application to power control , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[2]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[3]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[4]  J. Ponstein,et al.  Seven kinds of convexity , 1967 .

[5]  Roy D. Yates,et al.  A Framework for Uplink Power Control in Cellular Radio Systems , 1995, IEEE J. Sel. Areas Commun..

[6]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[7]  Angel E. Lozano,et al.  Link-optimal space-time processing with multiple transmit and receive antennas , 2001, IEEE Communications Letters.

[8]  Sergio Verdú,et al.  A general formula for channel capacity , 1994, IEEE Trans. Inf. Theory.

[9]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[10]  Ivan Stojmenovic,et al.  Ad hoc Networking , 2004 .

[11]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[12]  Vikas Kawadia,et al.  Power control and clustering in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[13]  Michael Gastpar,et al.  On the capacity of wireless networks: the relay case , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[14]  Aydano B. Carleial,et al.  Interference channels , 1978, IEEE Trans. Inf. Theory.

[15]  Helmut Bölcskei,et al.  An overview of MIMO communications - a key to gigabit wireless , 2004, Proceedings of the IEEE.

[16]  Cem U. Saraydar,et al.  Efficient power control via pricing in wireless data networks , 2002, IEEE Trans. Commun..

[17]  Enzo Baccarelli,et al.  Optimized Power Allocation and Signal Shaping for Interference-Limited Multi-antenna "Ad Hoc" Networks , 2003, PWC.

[18]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[19]  Rohit U. Nabar,et al.  Introduction to Space-Time Wireless Communications , 2003 .