Mostrar el registro sencillo del ítem

dc.contributor.authorMancuso, Vincenzo 
dc.contributor.authorAsadi, Arash 
dc.contributor.authorJacko, Peter
dc.date.accessioned2021-07-13T09:26:55Z
dc.date.available2021-07-13T09:26:55Z
dc.date.issued2016-06-25
dc.identifier.urihttp://hdl.handle.net/20.500.12761/215
dc.description.abstractOpportunistic 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.
dc.language.isoeng
dc.titleTie-breaking Can Maximize Fairness without Sacrificing Throughput in D2D-assisted Networksen
dc.typeconference object
dc.conference.date21-24 June 2016
dc.conference.placeCoimbra, Portugal
dc.conference.titleThe 17th International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM 2016)*
dc.event.typeconference
dc.pres.typepaper
dc.rights.accessRightsopen access
dc.subject.keywordCellular networks
dc.subject.keywordOpportunistic scheduling
dc.subject.keywordD2D communications
dc.subject.keywordTie-breaking
dc.description.refereedTRUE
dc.description.statuspub
dc.eprint.idhttp://eprints.networks.imdea.org/id/eprint/1326


Ficheros en el ítem

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem