Spatial SINR Games Combining Base Station Placement and Mobile Association

Altman, Eitan; Kumar, Anurag; Singh, Chandramani; Sundaresan, Rajesh

doi:10.1109/infcom.2009.5062081

Cited by 35 publications

(41 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The objective of each node is to choose a MAP that maximize its utility function (19). Or equivalently it can be given by the following minimization problem:…”

Section: Utility With Delaymentioning

confidence: 99%

“…Consider the utility function in Equation (19). The team utility for this game when each node transmits with MAP p is…”

Section: B Delaymentioning

confidence: 99%

“…We consider in this paper the geometric aspects of the MANET and analyze the network performance at equilibrium. For games that take geometric aspects into consideration see [19].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Stochastic geometry based medium access games

Hanawal¹,

Altman²,

Baccelli³

2012

2012 Proceedings IEEE INFOCOM

Self Cite

View full text Add to dashboard Cite

Abstract-This paper studies the performance of Mobile Ad hoc Network (MANET) when the nodes, that form a Poisson point process, selfishly choose their Medium Access Probability (MAP). We introduce a pricing scheme based on the transmission energy requirements and compute the symmetric Nash equilibrium MAP in closed form. It is shown that by appropriately pricing the nodes the selfish behavior of the nodes can be used to achieve the social optimum at equilibrium. Goodput and delay are considered as the performance metric that each node is interested in optimizing taking into account the cost it incurs. The Price of anarchy is then analyzed for these games. When utility with delay is considered, we bound the price of anarchy and study the effect of system parameters. When utility with goodput is considered it is shown that PoA is infinite at the price that achieves global optimal density of success.

show abstract

“…The objective of each node is to choose a MAP that maximize its utility function (19). Or equivalently it can be given by the following minimization problem:…”

Section: Utility With Delaymentioning

confidence: 99%

“…Consider the utility function in Equation (19). The team utility for this game when each node transmits with MAP p is…”

Section: B Delaymentioning

confidence: 99%

See 1 more Smart Citation

Stochastic geometry based medium access games

Hanawal¹,

Altman²,

Baccelli³

2012

2012 Proceedings IEEE INFOCOM

Self Cite

View full text Add to dashboard Cite

show abstract

“…al [6], which considers a hierarchical game with players at two levels-base stations and mobile subscribers. For given locations of the base stations, each mobile chooses the base station to associate with so as to maximize its Signal to Interference and Noise Ratio (SINR).…”

Section: A Related Workmentioning

confidence: 99%

“…One of the aspects in which our work differs from [6] is that each base station chooses the amount of spectrum to purchase from the regulator, whereas the base stations in [6] do not make this choice. On the other hand, locations of base stations are fixed in our paper, unlike [6].…”

Section: A Related Workmentioning

confidence: 99%

A hierarchical spatial game over licenced resources

Kasbekar

Altman

Sarkar

2009

2009 International Conference on Game Theory for Networks

View full text Add to dashboard Cite

Abstract-We consider a scenario in which a regulator owns the spectrum in a region. Two service providers lease spectrum from the regulator and set up a base station each to serve mobile subscribers. This leads to a hierarchical game with players at two levels-the mobile subscribers at level 1 and the service providers at level 2. In the game at level 1, each mobile subscriber chooses a service provider to subscribe to and whether to be a primary subscriber of its service provider and receive high-priority service or to be a secondary subscriber and receive low-priority service. In the game at level 2, each service provider chooses the quantity of spectrum to lease from the regulator and the rates at which to charge its mobile subscribers for the throughput they receive. We first analyze the game at level 1 for different models and in each case show the existence of a threshold-type Wardrop equilibrium, in which there exist thresholds that divide the region into sets of mobile subscribers that make the same decision at equilibrium. Next, assuming that the mobile subscribers act so as to give rise to the equilibrium found above, we analyze the game at level 2 and show the existence of a Nash equilibrium.

show abstract

Green Base Station Placement for Microwave Backhaul Links

Silva

Masucci

2017

Ubiquitous Networking

View full text Add to dashboard Cite

Wireless mobile backhaul networks have been proposed as a substitute in cases in which wired alternatives are not available due to economical or geographical reasons. In this work, we study the location problem of base stations in a given region where mobile terminals are distributed according to a certain probability density function and the base stations communicate through microwave backhaul links. Using results of optimal transport theory, we provide the optimal asymptotic distribution of base stations in the considered setting by minimizing the total power over the whole network. *

show abstract

Spatial SINR Games Combining Base Station Placement and Mobile Association

Cited by 35 publications

References 5 publications

Stochastic geometry based medium access games

Stochastic geometry based medium access games

A hierarchical spatial game over licenced resources

Green Base Station Placement for Microwave Backhaul Links

Contact Info

Product

Resources

About