casa 15(5): e4

Research Article

Best-Response Distributed Subchannel Selection for Minimizing Interference in Femtocell Networks}

Download162 downloads
  • @ARTICLE{10.4108/icst.iniscom.2015.258415,
        author={Somsak Kittipiyakul and Shashi Shah},
        title={Best-Response Distributed Subchannel Selection for Minimizing Interference in Femtocell Networks\}},
        journal={EAI Endorsed Transactions on Context-aware Systems and Applications},
        volume={2},
        number={5},
        publisher={ICST},
        journal_a={CASA},
        year={2015},
        month={4},
        keywords={femtocells, interference management, distributed subchannel selection, simultaneous move, best response strategy, nash equilibrium},
        doi={10.4108/icst.iniscom.2015.258415}
    }
    
  • Somsak Kittipiyakul
    Shashi Shah
    Year: 2015
    Best-Response Distributed Subchannel Selection for Minimizing Interference in Femtocell Networks}
    CASA
    EAI
    DOI: 10.4108/icst.iniscom.2015.258415
Somsak Kittipiyakul1,*, Shashi Shah2
  • 1: Sirindhorn International Institute of Technology
  • 2: Sirindhorn International Institute of Technology and Japan Advanced Institute of Science and Technology
*Contact email: somsak@siit.tu.ac.th

Abstract

We study a distributed channel allocation problem of non-cooperative OFDMA femtocells in two-tiered macro-femto networks. The objective is to maximize the total capacity of uplink macro users and femto users. We assume a time-slotted system, a time-invariant channel model (no fading), each user knows the signal-to-interference-plus-noise ratio (SINR) of all channels, and the channel selection happens only at the beginning of each time-slot. We study the performance of a best-response strategy where each user chooses to transmit in the highest-SINR channel. For simplicity, we focus on the homogeneous 3-link, 2-channel case and show that if all users update their actions every time-slot (i.e., all users make simultaneous moves), an oscillation can occur and result in the worst performance. To avoid the oscillation and achieve the highest total capacity, while still assuming no coordination among the users, we propose a stochastic best-response algorithm, where each user updates its channel selection with a selection probability p. We use a Markov chain to analyze the average capacity performance and use simulation results to confirm our analysis and also provide performance of other homogeneous cases with more number of links and channels. It is shown that the highest total capacity can be achieved when the selection probability p is very small. This stochastic best response with small p in effect provides a sequential move mechanism which requires no coordination.