Wardrop Equilibrium for CDMA Systems

Bonneau, Nicolas; Debbah, Mérouane; Altman, Eitan; Hjørungnes, A.

doi:10.1109/wiopt.2007.4480091

Cited by 9 publications

(8 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The extension is not trivial and involves advanced results on random matrices with non-equal variances due to Girko [26] whereas classical results rely on the work of Silverstein [27]. A part of this work was previously published as a conference paper [28].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Non-Atomic Games for Multi-User Systems

Bonneau

Debbah

Altman

et al. 2008

IEEE J. Select. Areas Commun.

Self Cite

View full text Add to dashboard Cite

Abstract-In this contribution, the performance of a multi-user system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful framework is provided in order to determine the optimal power allocation when users know only their own channel (while perfect channel state information is assumed at the base station). We consider the realistic case of frequency selective channels for uplink CDMA. This scenario illustrates the case of decentralized schemes, where limited information on the network is available at the terminal. Various receivers are considered, namely the Matched filter, the MMSE filter and the optimum filter. The goal of this paper is to derive simple expressions for the non-cooperative Nash equilibrium as the number of mobiles becomes large and the spreading length increases. To that end two asymptotic methodologies are combined. The first is asymptotic random matrix theory which allows us to obtain explicit expressions of the impact of all other mobiles on any given tagged mobile. The second is the theory of non-atomic games which computes good approximations of the Nash equilibrium as the number of mobiles grows.

show abstract

Section: Related Workmentioning

confidence: 99%

“…α log 2 1 + β + − α log 2 (e) β In the left-hand side of (56), P (y) is given by a MMSE power allocation similar to the one given by (28). Hence, the term α 0 P (y) |h(y)| 2 dy in (56) does not depend on the actual realizations of the channels.…”

Section: Proof Of Propmentioning

confidence: 99%

Non-Atomic Games for Multi-User Systems

Bonneau

Debbah

Altman

et al. 2008

IEEE J. Select. Areas Commun.

Self Cite

View full text Add to dashboard Cite

show abstract

“…For example, uncoordinated random access channels have been analyzed by optimizing their transmission probabilities [3], or their power control [4]; another application is in CDMA systems (e.g. [5]- [7]); and, in the direction of connecting to multiple wireless nodes, [8] considered the possibility of connecting to several 802.11 APs using a single WLAN card.…”

Section: Imentioning

confidence: 99%

Vertical handover between wireless service providers

Mertikopoulos

Moustakas

Dimitriou

2008

2008 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops

View full text Add to dashboard Cite

We discuss the dynamics of user handover between two coexisting wireless service providers and analyze the consequent exploitation of the offered diversity by the use of multi-standard terminals. We show that the potential capacity benefits of mobile-initiated vertical handovers (VHO) are substantial, but it is important to choose the correct VHO criteria in order to achieve optimum load balancing and equilibrium states (both globally and socially). A fast-handover scheme, based on replicator dynamics is presented, which exhibits fast convergence to the socially optimal states by allowing only a subset of the necessary VHOs among the air interfaces to take place. I. IGiven the massive deployment of wireless networks, it is common for mobile users to have several choices of collocated WLANs to connect to. This phenomenon is made especially evident by the large scale appearance of 3G systems operated by major networks. In fact, mobile user chips which support multiple standards already exist and, additionally, there has been a significant amount of work in creating flexible radio devices capable of connecting to any existing standard [1]. It is therefore reasonable to expect that in the near future users will have the option to connect to different networks and to switch dynamically between them on a real-time basis, based on the offered throughput and/or price.The dynamics of this process has several interesting aspects. Firstly, with no central authority to moderate and shepherd the users' s selfish behavior, there is the very real danger of total lack of coordination between the users, leading to frustration and suboptimal performance. Moreover, even though users now have more choices to connect to, the (finite) resources of nearby access points (AP's) still remain an object of competition.It is clear from the above that this process can be modelled in terms of a non-cooperative game. Of course, this is not a novel idea in and by itself: an excellent survey of applications of game theory to networking appears in [2]. For example, uncoordinated random access channels have been analyzed by optimizing their transmission probabilities [3], or their power control [4]; another application is in CDMA systems (e.g.[5]-[7]); and, in the direction of connecting to multiple wireless nodes, [8] considered the possibility of connecting to several 802.11 APs using a single WLAN card.In this paper we analyze instead the dynamics of vertical handover between service providers possibly employing different standards. 1 We will be assuming that users can switch air interfaces in the time-scale of hundreds of milliseconds and call this scheme multi-mode operation (MMO), as opposed to single mode operation where users are not capable to handover between air interfaces (AIs). We thus postulate that parallel connections to both AIs are available, allowing each user to switch between AIs at rates faster than the typical session duration. Due to the limited processing capabilities at the terminal, it will only be able to proc...

show abstract

“…We formulate the problem above as a traffic assignment problem and investigate it using the first and second principles of equilibrium developed by John Glen Wardrop in 1952 [5]. Previous works have applied this idea to cellular, sensor, and ad hoc networks [6], [7], [8]. To the best of our knowledge, our work is the first to focus on DTNs and to generalize the analysis to both transmission and storage constraints.…”

Section: Introductionmentioning

confidence: 99%

Wardrop Equilibrium Formulation of Resource-Constrained DTN Routing in Public Safety Networks

Tournoux

Conan²,

Crowcroft

et al. 2011

2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems

View full text Add to dashboard Cite

In this paper, we investigate the ability of using DTNs in Public Safety networks, where bandwidth and storage are constrained. We formalize the problem as a Wardrop equilibrium over a time-discretized graph. Driven by our findings, we propose RECOR, a centralized REsource-Constrained ORaclebased DTN routing mechanism, which spreads the demand across multiple store-carry-forward paths to satisfy the node storage and link transport constraints observed in intervention situations. By applying the proposed mechanism to real Bluetooth-based DTN traces, we show that the transmission bottleneck can be compensated, but only up to a certain extent, by increasing storage capacity and delay. We also analyze the benefit of strategies that provide more resources to highly connected nodes (e.g. ambulances and firetrucks) which can then feed incentives and policies for DTN network engineering. Finally, the idea presented here is general and suggests the necessity of tracedriven simulation and specific modeling tools for appropriate design of future DTN resource management policies.

show abstract

Wardrop Equilibrium for CDMA Systems

Cited by 9 publications

References 21 publications

Non-Atomic Games for Multi-User Systems

Non-Atomic Games for Multi-User Systems

Vertical handover between wireless service providers

Wardrop Equilibrium Formulation of Resource-Constrained DTN Routing in Public Safety Networks

Contact Info

Product

Resources

About