Tie-breaking can maximize fairness without sacrificing throughput in D2D-assisted networks

Opportunistic schedulers such as MaxRate and Proportional Fair are known for trading off between throughput and fairness of users in cellular networks. In this paper, we propose a novel solution that integrates opportunistic scheduling design principles and cooperative D2D communication capabilities in order to maximize fairness without sacrificing throughput. Specifically, we develop a mathematical approach and design a smart tie-breaking scheme which maximizes the fairness achieved by the MaxRate scheduler. However, our approach could be applied to improve fairness of any scheduler. In addition, we show that users that cooperatively form D2D clusters benefit from both higher throughput and fairness. Our scheduling scheme is simple to implement, scales linearly with the number of clusters, and is able to double the throughput of Equal Time schedulers and to outperform by 20% or more Proportional Fair schedulers, while providing a user fairness index comparable to or better than Proportional Fair.

[1]  Olav Tirkkonen,et al.  Resource Sharing Optimization for Device-to-Device Communication Underlaying Cellular Networks , 2011, IEEE Transactions on Wireless Communications.

[2]  Ness B. Shroff,et al.  A framework for opportunistic scheduling in wireless networks , 2003, Comput. Networks.

[3]  Chunming Qiao,et al.  Integrated cellular and ad hoc relaying systems: iCAR , 2001, IEEE J. Sel. Areas Commun..

[4]  Michael J. Neely,et al.  Order Optimal Delay for Opportunistic Scheduling in Multi-User Wireless Uplinks and Downlinks , 2008, IEEE/ACM Transactions on Networking.

[5]  Xuemin Shen,et al.  Operator controlled device-to-device communications in LTE-advanced networks , 2012, IEEE Wireless Communications.

[6]  Vincenzo Mancuso,et al.  An SDR-based experimental study of outband D2D communications , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[7]  Philip A. Whiting,et al.  Convergence of proportional-fair sharing algorithms under general conditions , 2004, IEEE Transactions on Wireless Communications.

[8]  Raymond Knopp,et al.  Information capacity and power control in single-cell multiuser communications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[9]  Urtzi Ayesta,et al.  Scheduling in a Random Environment: Stability and Asymptotic Optimality , 2011, IEEE/ACM Transactions on Networking.

[10]  M.J. Neely,et al.  Order Optimal Delay for Opportunistic Scheduling in Multi-User Wireless Uplinks and Downlinks , 2008, IEEE/ACM Transactions on Networking.

[11]  Matthew S. Grob,et al.  CDMA/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users , 2000, IEEE Commun. Mag..

[12]  S. Shakkottai,et al.  Pathwise optimality of the exponential scheduling rule for wireless channels , 2004, Advances in Applied Probability.

[13]  Dongning Guo,et al.  Low complexity scheduling algorithms for wireless networks with full duplex state exchange , 2014, 2014 48th Annual Conference on Information Sciences and Systems (CISS).

[14]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[15]  Ness B. Shroff,et al.  Performance of low-complexity greedy scheduling policies in multi-channel wireless networks: Optimal throughput and near-optimal delay , 2013, 2013 Proceedings IEEE INFOCOM.

[16]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..

[17]  Urtzi Ayesta,et al.  A modeling framework for optimizing the flow-level scheduling with time-varying channels , 2010, Perform. Evaluation.

[18]  Carl Wijting,et al.  Device-to-device communication as an underlay to LTE-advanced networks , 2009, IEEE Communications Magazine.

[19]  R. Srikant,et al.  Throughput-Optimal Opportunistic Scheduling in the Presence of Flow-Level Dynamics , 2011, IEEE/ACM Transactions on Networking.

[20]  Qi Zhang,et al.  Cellular Controlled Short-Range Communication for Cooperative P2P Networking , 2009, Wirel. Pers. Commun..

[21]  Lei Ying,et al.  Scheduling in Multi-Channel Wireless Networks: Rate Function Optimality in the Small-Buffer Regime , 2014, IEEE Trans. Inf. Theory.

[22]  Cyril Leung,et al.  Proportional Fair Multiuser Scheduling in LTE , 2009, IEEE Signal Processing Letters.

[23]  G. Veciana,et al.  Throughput optimality of delay-driven MaxWeight scheduler for a wireless system with flow dynamics , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[24]  Stefania Sesia,et al.  LTE - The UMTS Long Term Evolution, Second Edition , 2011 .

[25]  Peter Jacko,et al.  Value of information in optimal flow-level scheduling of users with Markovian time-varying channels , 2011, Perform. Evaluation.