Femto-matching: Efficient traffic offloading in heterogeneous cellular networks

Heterogeneous cellular networks use small base stations, such as femtocells and WiFi APs, to offload traffic from macrocells. While network operators wish to globally balance the traffic, users may selfishly select the nearest base stations and make some base stations overcrowded. In this paper, we propose to use an auction-based algorithm - Femto-Matching, to achieve both load balancing among base stations and fairness among users. Femto-Matching optimally solves the global proportional fairness problem in polynomial time by transforming it into an equivalent matching problem. Furthermore, it can efficiently utilize the capacity of randomly deployed small cells. Our trace-driven simulations show Femto-Matching can reduce the load of macrocells by more than 30% compared to non-cooperative game based strategies.

[1]  Seong-Lyun Kim,et al.  Downlink capacity and base station density in cellular networks , 2011, 2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt).

[2]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[3]  Dimitri P. Bertsekas,et al.  A new algorithm for the assignment problem , 1981, Math. Program..

[4]  Mung Chiang,et al.  RAT selection games in HetNets , 2013, 2013 Proceedings IEEE INFOCOM.

[5]  Z. Néda,et al.  On the size-distribution of Poisson Voronoi cells , 2004, cond-mat/0406116.

[6]  Xiaobing Wu,et al.  Cell planning for heterogeneous networks: An approximation algorithm , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[7]  Jeffrey G. Andrews,et al.  Joint Resource Partitioning and Offloading in Heterogeneous Cellular Networks , 2013, IEEE Transactions on Wireless Communications.

[8]  Ramachandran Ramjee,et al.  Generalized Proportional Fair Scheduling in Third Generation Wireless Data Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  B. Ripley,et al.  Introduction to the Theory of Coverage Processes. , 1989 .

[10]  Walid Saad,et al.  A college admissions game for uplink user association in wireless small cell networks , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[11]  J. Seaman.  Introduction to the theory of coverage processes , 1990 .

[12]  Klara Nahrstedt,et al.  CRAWDAD dataset uiuc/uim (v.2012-01-24) , 2012 .

[13]  Mauro Dell'Amico,et al.  Assignment Problems , 1998, IFIP Congress: Fundamentals - Foundations of Computer Science.

[14]  Jeffrey G. Andrews,et al.  User Association for Load Balancing in Heterogeneous Cellular Networks , 2012, IEEE Transactions on Wireless Communications.

[15]  Aruna Balasubramanian,et al.  DOME: a diverse outdoor mobile testbed , 2009, HotPlanet '09.

[16]  Kin K. Leung,et al.  Asymptotic Analysis of Proportionally Fair Scheduling in Rayleigh Fading , 2011, IEEE Transactions on Wireless Communications.

[17]  2015 IEEE Conference on Computer Communications, INFOCOM 2015, Kowloon, Hong Kong, April 26 - May 1, 2015 , 2015, IEEE Conference on Computer Communications.

[18]  Gustavo de Veciana,et al.  Dynamic association for load balancing and interference avoidance in multi-cell networks , 2007, IEEE Transactions on Wireless Communications.

[19]  Yang Richard Yang,et al.  Proportional Fairness in Multi-Rate Wireless LANs , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[20]  Farooq Khan,et al.  LTE for 4G Mobile Broadband: Air Interface Technologies and Performance , 2009 .

[21]  Narayan Prasad,et al.  Exploiting cell dormancy and load balancing in LTE HetNets: Optimizing the proportional fairness utility , 2014, 2014 IEEE International Conference on Communications (ICC).

[22]  Jeffrey G. Andrews,et al.  An overview of load balancing in hetnets: old myths and open problems , 2013, IEEE Wireless Communications.