Optimization of Resource Allocation in Small Cells Networks: A Green Networking Approach

Cengis Hasan 1
1 SOCRATE - Software and Cognitive radio for telecommunications
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
Abstract : The term "green networking" refers to energy-efficient networking technologies and products, while minimizing resource usage as possible. This thesis targets the problem of resource allocation in small cells networks in a green networking context. We develop algorithms for different paradigms. We exploit the framework of coalitional games theory and some stochastic geometric tools as well as the crowding game model. We first study the mobile assignment problem in broadcast transmission where minimal total power consumption is sought. A green-aware approach is followed in our algorithms. We examine the coalitional game aspects of the mobile assignment problem. This game has an incentive to form grand coalition where all players join to the game. By using Bondareva-Shapley theorem, we prove that this coalitional game has a non-empty core which means that the grand coalition is stable. Then, we examine the cost allocation policy for different methods. In a second part, we analyze a significant problem in green networking called switching off base stations in case of cooperating service providers by means of stochastic geometric and coalitional game tools. The coalitional game herein considered is played by service providers who cooperate in switching off base stations. We observed the Nash stability which is a concept in hedonic coalition formation games. We ask the following question: Is there any utility allocation method which could result in a Nash-stable partition? We address this issue in the thesis. We propose the definition of the Nash-stable core which is the set of all possible utility allocation methods resulting in stable partitions obtained according to Nash stability. We finally consider games related to the association of mobiles to an access point. The player is the mobile which has to decide to which access point to connect. We consider the choice between two access points or more, where the access decisions may depend on the number of mobiles connected to each access points. We obtained new results using elementary tools from congestion and crowding games. Last but not least, we extend our work to cooperative transmissions. We formulate the partner selection problem in cooperative relaying based on a matching theoretic approach. Partner selection is described as a special stable roommate problem where each player ranks its partners by some criterion. We adapted Irving's algorithm for determining the partner of each player. We introduced a decentralized version of the Irving's algorithm.
Complete list of metadatas

Cited literature [92 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00942967
Contributor : Jean-Marie Gorce <>
Submitted on : Thursday, February 6, 2014 - 6:03:43 PM
Last modification on : Saturday, October 27, 2018 - 1:20:21 AM
Long-term archiving on : Monday, May 12, 2014 - 11:41:02 AM

Identifiers

  • HAL Id : tel-00942967, version 1

Citation

Cengis Hasan. Optimization of Resource Allocation in Small Cells Networks: A Green Networking Approach. Computer Science and Game Theory [cs.GT]. INSA de Lyon, 2013. English. ⟨tel-00942967⟩

Share

Metrics

Record views

364

Files downloads

667