Tie-breaking Can Maximize Fairness without Sacrificing Throughput in D2D-assisted Networks

被引:0
作者
Mancuso, Vincenzo [1 ]
Asadi, Arash [2 ]
Jacko, Peter [3 ]
机构
[1] IMDEA Networks Inst, Madrid, Spain
[2] Tech Univ Darmstadt, Darmstadt, Germany
[3] Univ Lancaster, Lancaster LA1 4YW, England
来源
2016 IEEE 17TH INTERNATIONAL SYMPOSIUM ON A WORLD OF WIRELESS, MOBILE AND MULTIMEDIA NETWORKS (WOWMOM) | 2016年
关键词
Cellular networks; Opportunistic scheduling; D2D communications; Tie-breaking; TO-DEVICE COMMUNICATION; TIME-VARYING CHANNELS; LTE-ADVANCED NETWORKS; WIRELESS NETWORKS; OPTIMAL DELAY; PERFORMANCE; ALGORITHMS; OPTIMALITY; FRAMEWORK; USERS;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:9
相关论文
共 27 条
[1]  
[Anonymous], 2014, SCI WORLD J
[2]  
Asadi A., 2016, P IEEE INFOCOM
[3]  
Ayesta U., 2013, EU Patent, Patent No. [EP2 384 076 B1, 2384076]
[4]   Scheduling in a Random Environment: Stability and Asymptotic Optimality [J].
Ayesta, Urtzi ;
Erausquin, Martin ;
Jonckheere, Matthieu ;
Verloop, Ina Maria .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2013, 21 (01) :258-271
[5]   A modeling framework for optimizing the flow-level scheduling with time-varying channels [J].
Ayesta, Urtzi ;
Erausqum, Martin ;
Jacko, Peter .
PERFORMANCE EVALUATION, 2010, 67 (11) :1014-1029
[6]   CDMA/HDR: A bandwidth-efficient high-speed wireless data service for nomadic users [J].
Bender, P ;
Black, P ;
Grob, M ;
Padovani, R ;
Sindhushayana, N ;
Viterbi, A .
IEEE COMMUNICATIONS MAGAZINE, 2000, 38 (07) :70-77
[7]   Scheduling in Multi-Channel Wireless Networks: Rate Function Optimality in the Small-Buffer Regime [J].
Bodas, Shreeshankar ;
Shakkottai, Sanjay ;
Ying, Lei ;
Srikant, R. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (02) :1101-1125
[8]   User-level performance of channel-aware scheduling algorithms in wireless data networks [J].
Borst, S .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2005, 13 (03) :636-647
[9]  
Chaponniere E. F., 2002, US Patent, Patent No. [US 6,449,490 B1, 6,449,490]
[10]   Device-to-Device Communication as an Underlay to LTE-Advanced Networks [J].
Doppler, Klaus ;
Rinne, Mika ;
Wijting, Carl ;
Ribeiro, Cassio B. ;
Hugl, Klaus .
IEEE COMMUNICATIONS MAGAZINE, 2009, 47 (12) :42-49