Full metadata record
DC FieldValueLanguage
dc.contributor.authorLiou, Yi-Shingen_US
dc.contributor.authorGau, Rung-Hungen_US
dc.contributor.authorChang, Chung-Juen_US
dc.date.accessioned2017-04-21T06:50:14Z-
dc.date.available2017-04-21T06:50:14Z-
dc.date.issued2014en_US
dc.identifier.isbn978-1-4799-3083-8en_US
dc.identifier.issn1525-3511en_US
dc.identifier.urihttp://hdl.handle.net/11536/135342-
dc.description.abstractIn this paper, we propose a group partition approach for scalable throughput optimization of capacity-region-aware Device-to-Device communications. Instead of the conventional collision model, we adopt network information theory that allows a receiving device to simultaneously decode multiple packets from multiple transmitting devices, as long as the vector of transmitting rates is inside the capacity region. We propose a novel approach to partition devices into subgroups based on coloring a conflict graph and then solve an optimization problem for each subgroup. In particular, the formation of the conflict graph explicitly takes the capacity region into consideration. Simulation results show that the proposed approach could significantly outperform the greedy algorithm.en_US
dc.language.isoen_USen_US
dc.subjectDevice-to-Device communicationsen_US
dc.subjectcapacity regionen_US
dc.subjectgraph coloringen_US
dc.subjectmedium access controlen_US
dc.titleGroup Partition for Capacity-Region-Aware Device-to-Device Communicationsen_US
dc.typeProceedings Paperen_US
dc.identifier.journal2014 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC)en_US
dc.citation.spage1685en_US
dc.citation.epage1690en_US
dc.contributor.department電機工程學系zh_TW
dc.contributor.departmentDepartment of Electrical and Computer Engineeringen_US
dc.identifier.wosnumberWOS:000392912400292en_US
dc.citation.woscount0en_US
Appears in Collections:Conferences Paper