Mobile Data Offloading with Uniform Pricing and Overlaps
| Autor: | Costas Courcoubetis, Mingmei Li, Tony Q. S. Quek |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
TheoryofComputation_MISCELLANEOUS
Mathematical optimization Computer Networks and Communications Computer science business.industry Stochastic game Cellular traffic TheoryofComputation_GENERAL 020206 networking & telecommunications 02 engineering and technology Service provider symbols.namesake Strategy Nash equilibrium 0202 electrical engineering electronic engineering information engineering symbols Cellular network Femtocell Electrical and Electronic Engineering Mobile data offloading business Software Mobile network operator |
| Zdroj: | IEEE Transactions on Mobile Computing. 18:348-361 |
| ISSN: | 2161-9875 1536-1233 |
| Popis: | Mobile data offloading is an emerging technology to alleviate cellular network congestion and improve user service quality. In this paper, we investigate the economics of mobile data offloading through access points (APs) deployed by small cell service providers (SSPs), implementing uniform volume prices for all the mobile users (MUs) in each SSP's coverage including the overlapping area. In particular, we consider a data offloading game with a single mobile network operator (MNO) and two SSPs with overlapping coverage areas, where each SSP announces a uniform price for serving the cellular traffic within its coverage, and the MNO determines the traffic volumes to offload. We show that there is no pure Nash equilibrium (PNE) under such price competition, and determine the corresponding mixed strategy Nash equilibrium (MNE) using price randomization. As a practical solution, we propose a simple one shot auction mechanism that is easy to implement and has PNEs which is payoff equivalent with the MNE under price competition. We believe that this simple mechanism due to its simplicity of determining the equilibrium prices could be used in the negotiation between the SSPs and the MNO to determine the average service prices. Finally, we study the strategic topological infrastructure placement problem using a 1-dimension (1D, linear) user traffic flow model and a 2-dimension (2D) user traffic flow model when SSPs compete assuming uniform price competition as above. We show that the first mover in the placement problem will deploy its APs to cover more than half of the total flow volume and has an advantage to obtain a higher equilibrium payoff. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|