TY - GEN
T1 - A robust mechanism for resource allocation with interference mitigation in femtocellular networks
AU - Ali, Najah Abu
PY - 2012
Y1 - 2012
N2 - Interference mitigation can be particularly challenging in hybrid 4G cellular networks employing a femtocellular tier, especially given the ad hoc nature in which femtocells are deployed. So far, mitigation mechanisms have been based on simplified models assuming regular (grid-based) deployment, using average interference characterization or satisfying the SINR requirements while ignoring the required data rates. In this paper, we show that such simplifications can be relaxed. Specifically, we derive an interference mitigation mechanism assuming an ad hoc deployment. The mechanism optimizes resource allocations on per-subcarrier basis while satisfying user data rate requirements. It is also based on a rigorous cross-tier interference characterization (macro-femto, femto-femto), and utilizes robust stochastic programming techniques. Simulation results indicate great potential in our proposal as it significantly outperforms a heuristic greedy algorithm.
AB - Interference mitigation can be particularly challenging in hybrid 4G cellular networks employing a femtocellular tier, especially given the ad hoc nature in which femtocells are deployed. So far, mitigation mechanisms have been based on simplified models assuming regular (grid-based) deployment, using average interference characterization or satisfying the SINR requirements while ignoring the required data rates. In this paper, we show that such simplifications can be relaxed. Specifically, we derive an interference mitigation mechanism assuming an ad hoc deployment. The mechanism optimizes resource allocations on per-subcarrier basis while satisfying user data rate requirements. It is also based on a rigorous cross-tier interference characterization (macro-femto, femto-femto), and utilizes robust stochastic programming techniques. Simulation results indicate great potential in our proposal as it significantly outperforms a heuristic greedy algorithm.
UR - http://www.scopus.com/inward/record.url?scp=84871983406&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84871983406&partnerID=8YFLogxK
U2 - 10.1109/ICC.2012.6364401
DO - 10.1109/ICC.2012.6364401
M3 - Conference contribution
AN - SCOPUS:84871983406
SN - 9781457720529
T3 - IEEE International Conference on Communications
SP - 5048
EP - 5052
BT - 2012 IEEE International Conference on Communications, ICC 2012
T2 - 2012 IEEE International Conference on Communications, ICC 2012
Y2 - 10 June 2012 through 15 June 2012
ER -