Non-Cooperative Game for Capacity Offload

With the explosive growth of wireless data traffic, a new multi‐mode small cell has been studied for offloading part of traffic load to unlicensed band in order to alleviate burden in licensed band. With the offloading technology, networks can achieve higher system throughput and provide better quality of experience for users. However, the lack of network planning may result in severe co‐channel interference. The key question is how to allocate traffic load rationally to prevent severe interference from users in unlicensed band. In this paper, to dispose complex coupled interference relation among small cells, we introduce an interference graph to capture the interactions among small cell base stations. Then, based on the interference graph, we formulate the traffic‐offloading problem of the joint user scheduling and power allocation in multi‐mode small cell networks as a local cooperation game. In addition, we prove that the proposed game is an exact potential game, which has at least one pure strategy Nash equilibrium (NE), and the best NE can maximise the total network sum rate. Furthermore, we design a distributed iterative learning algorithm to explore the pure strategy NE point of the game, where it does not need to know the complete information of the total network. Both theoretical analysis and simulation results verify the convergence of the proposed algorithm and near‐optimal system throughput with good fairness. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

“…where S 0 is the initial power selection probability matrix and F .S/ D EOES. (20), that is, the NEs of the game G:…”

Section: Discussion On Convergence Towards Nementioning

confidence: 99%

“…Proof. According to Theorem 3, if we can find the H, which can satisfy the (20), we can prove that the DSSA can converges to a pure strategy NE. When take H.S/ D EOE .S/ , where is the potential function specified by (11).…”

Section: Discussion On Convergence Towards Nementioning

confidence: 99%

Locally cooperative traffic‐offloading in multi‐mode small cell networks via potential games

Shao

Sun

Zhao³

et al. 2016

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

show abstract

“…In practice, the stage game is repeated an infinite number of times and each operator can vary its PSD over time. The players are the two operators; the action space P is the set of feasible PSDs; at the end of each epoch, the operators can observe the action of the other operator and can use the complete history of play to decide on future actions; the strategy space of an operator is the set of complete plans of actions that define what PSD the operator will use in every possible event where the operator needs to act; and the payoff is the expected total revenue over the infinite time horizon expressed in (1). As was observed in [13], the repeated game allows a much richer set of Nash equilibria than the stage game.…”

Section: A the Two-operator Casementioning

confidence: 99%

“…Throughout the proof, we analyze the case where operator 1 deviates, so the superscript will be dropped when it is for operator 1 hereafter. The traffic loads (λ t , λ 2 t ) have four possible realizations: (0,0), (0,1), (1,0), and (1,1). We discuss the case of λ t = λ 2 t = 0 in detail.…”

Section: Appendix a Proof Of Theoremmentioning

confidence: 99%

Sharing of unlicensed spectrum by strategic operators

Teng

Guo

Honig

2014

2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)

View full text Add to dashboard Cite

Facing the challenge of meeting ever-increasing demand for wireless data, the industry is striving to exploit large swaths of spectrum which anyone can use for free without having to obtain a license. Major standards bodies are currently considering a proposal to retool and deploy Long Term Evolution (LTE) technologies in unlicensed bands below 6 GHz. This paper studies the fundamental questions of whether and how the unlicensed spectrum can be shared by intrinsically strategic operators without suffering from the tragedy of the commons. A class of general utility functions is considered. The spectrum sharing problem is formulated as a repeated game over a sequence of time slots. It is first shown that a simple static sharing scheme allows a given set of operators to reach a subgame perfect Nash equilibrium for mutually beneficial sharing. The question of how many operators will choose to enter the market is also addressed by studying an entry game. A sharing scheme which allows dynamic spectrum borrowing and lending between operators is then proposed to address time-varying traffic and proved to achieve perfect Bayesian equilibrium. Numerical results show that the proposed dynamic sharing scheme outperforms static sharing, which in turn achieves much higher revenue than uncoordinated full-spectrum sharing.Implications of the results to the standardization and deployment of LTE in unlicensed bands (LTE-U) are also discussed.

show abstract

“…The stochastic geometry is adopted to analyze the statistical status of the offloading gain [9]. Game theory approaches are explored by offloading researches in [15,16]. Furthermore, the auction theory is also employed to support the offloading target decision and network performance improvements [10,14,17,18].…”

Section: Introductionmentioning

confidence: 99%

Reverse Auction Based Green Offloading Scheme for Small Cell Heterogeneous Networks

Xu¹,

Yuan²,

Li³

et al. 2016

Mobile Information Systems

View full text Add to dashboard Cite

The small cell is treated as a promising proposition to provide hot spot capacity and higher data rates. However, even with dense small cell deployment scenario, the heavy traffic load pressure and low energy efficiency in the small cell heterogeneous network (HetNet) still exist. Therefore, how to make the best use of densely deployed small cells under HetNet environments becomes the focus of researches. Offloading provides a feasible solution to promote cooperation between macrocells and small cells for user traffic supporting. In this paper, we propose the reverse auction based Green Offloading (GO) scheme for energy efficiency improvements. The proposed GO scheme employs the reverse auction theory to handle the offloading decision process, aiming at maximizing the system energy efficiency under the constraints of user Quality of Service (QoS) requirements, bandwidth, and transmission power limitations. Moreover, the reverse auction model gives the facility of multicell coordination transmissions with multiple winners situation. The energy efficiency optimization problem with constraints is solved by Dynamic Programming method with Karush-Kuhn-Tucker (KKT) conditions. The Individual Rationality and Truthfulness of the reverse auction model are also proved. By comparing the energy efficiency performances of the proposed GO scheme with current works within the Long Term Evolution-Advanced (LTE-A) system downlink scenario, simulation results show the improvements of the proposed GO scheme.

show abstract

Non-Cooperative Game for Capacity Offload

Cited by 28 publications

References 19 publications

Locally cooperative traffic‐offloading in multi‐mode small cell networks via potential games

Locally cooperative traffic‐offloading in multi‐mode small cell networks via potential games

Sharing of unlicensed spectrum by strategic operators

Reverse Auction Based Green Offloading Scheme for Small Cell Heterogeneous Networks

Contact Info

Product

Resources

About