P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Algorithmic Game Theory
Femtocells sharing management using mobility prediction model
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
| Hi-index | 0.00 |
In wireless access network optimization, today's main challenges reside in traffic offload and in the improvement of both capacity and coverage networks. The mobile operators are interested in solving their localized coverage and capacity problems in areas where the macro network signal is not able to serve the demand for mobile data. Thus, the major issue for mobile operators is to find the best solution at reasonable expanses. The femto cell seems to be the answer to this problematic. In this work, we focus on the problem of sharing femto access between a same mobile operator's customers. A paradigm for bandwidth sharing management added to a TBAS model for exchanging connectivity is proposed for a fair sharing connectivity system ensuring QoS. This paper focuses on an economic model based on FON model and considers the sharing femto access problem as a problem divided into to 2 levels: a game restricted to service requesters customers (SRCs) and a second game restricted to service providers customers (SPCs). We consider that SRCs are static and have some similar and regular connection behavior. We also note that each SPC and each SRC have a software embedded respectively on its femto access, user equipment (UE) on which ADist algorithm is running to learn the best strategy increasing its gain using only local information. We will try to answer the following questions for a game with N SRCs and P SPCs: how many connections are necessary for each SRC/SPC in order to learn the strategy maximizing its gain? Does exist an algorithm converging to a stable state? If yes, does this state a Nash Equilibrium?