Full metadata record
DC FieldValueLanguage
dc.contributor.authorLiu, Chun-Hungen_US
dc.contributor.authorHu, Heng-Mingen_US
dc.date.accessioned2020-05-05T00:01:56Z-
dc.date.available2020-05-05T00:01:56Z-
dc.date.issued2018-01-01en_US
dc.identifier.isbn978-1-5386-3180-5en_US
dc.identifier.issn1550-3607en_US
dc.identifier.urihttp://hdl.handle.net/11536/153998-
dc.description.abstractThis paper investigates the achievable downlink and uplink throughputs of users in a full-duplex (FD) heterogeneous network (HetNet) where users are allowed to associate with different downlink and uplink base stations (BSs) and adopt FD transmission to handle bidirectional traffic between them and their associated BSs. In order to exploit the downlink and uplink throughput limits, we propose the model of decoupled generalized user association and use it to define the full-duplex signal-to-interference ratio. We derive the decoupled rate-optimal user association (DROA) scheme that is able to make user associate with the BSs that provide them with the maximum downlink and uplink throughputs. For the DROA scheme, the explicit tight lower bounds on the link throughputs of an FD user are found in a neat form that characterizes general channel fading, user and BS intensities and imperfect self-interference cancellation. These bounds delineate the throughput regions of the FD user that inspire proposing the opportunistic FD scheduling algorithms able to maximize the sum throughput of each bidirectional traffic in the HetNet.en_US
dc.language.isoen_USen_US
dc.titleThroughput Region and Scheduling for Full-Duplex HetNets with Decoupled User Associationen_US
dc.typeProceedings Paperen_US
dc.identifier.journal2018 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC)en_US
dc.citation.spage0en_US
dc.citation.epage0en_US
dc.contributor.department電機工程學系zh_TW
dc.contributor.departmentDepartment of Electrical and Computer Engineeringen_US
dc.identifier.wosnumberWOS:000519271304150en_US
dc.citation.woscount0en_US
Appears in Collections:Conferences Paper