| アイテムタイプ |
学術雑誌論文 / Journal Article.(1) |
| 公開日 |
2018-03-01 |
| 書誌情報 |
en : IEEE Transactions on Vehicular Technology
巻 66,
号 6,
p. 5256-5268,
発行日 2017-06
|
| タイトル |
|
|
タイトル |
Energy-Efficient Matching for Resource Allocation in D2D Enabled Cellular Networks |
|
言語 |
en |
| 言語 |
|
|
言語 |
eng |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
energy-efficient matching |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
resource allocation |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
nonconvex optimization |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
D2D communications |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
game-theoretical approach |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_6501 |
|
資源タイプ |
journal article |
| アクセス権 |
|
|
アクセス権 |
open access |
|
アクセス権URI |
http://purl.org/coar/access_right/c_abf2 |
| 著者 |
ZHOU, Zhenyu
太田, 香
董, 冕雄
XU, Chen
|
| 室蘭工業大学研究者データベースへのリンク |
|
|
表示名 |
太田 香（OTA Kaoru） |
|
URL |
http://rdsoran.muroran-it.ac.jp/html/100000140_ja.html |
| 室蘭工業大学研究者データベースへのリンク |
|
|
表示名 |
董 冕雄（DONG Mianxiong） |
|
URL |
http://rdsoran.muroran-it.ac.jp/html/100000145_ja.html |
| 抄録 |
|
|
内容記述タイプ |
Abstract |
|
内容記述 |
Energy-efficiency (EE) is critical for device-to-device (D2D) enabled cellular networks due to limited battery capacity and severe co-channel interference. In this paper, we address the EE optimization problem by adopting a stable matching approach. The NP-hard joint resource allocation problem is formulated as a one-to-one matching problem under two-sided preferences, which vary dynamically with channel states and interference levels. A game-theoretic approach is employed to analyze the interactions and correlations among user equipments (UEs), and an iterative power allocation algorithm is developed to establish mutual preferences based on nonlinear fractional programming. We then employ the Gale-Shapley (GS) algorithm to match D2D pairs with cellular UEs (CUs), which is proved to be stable and weak Pareto optimal. We provide a theoretical analysis and description for implementation details and algorithmic complexity. We also extend the algorithm to address scalability issues in large-scale networks by developing tie-breaking and preference deletion based matching rules. Simulation results validate the theoretical analysis and demonstrate that significant performance gains of average EE and matching satisfactions can be achieved by the proposed algorithm. |
|
言語 |
en |
| 出版者 |
|
|
出版者 |
IEEE |
|
言語 |
en |
| 出版者版へのリンク |
|
|
表示名 |
10.1109/TVT.2016.2615718 |
|
URL |
https://doi.org/10.1109/TVT.2016.2615718 |
| DOI |
|
|
関連タイプ |
isVersionOf |
|
|
識別子タイプ |
DOI |
|
|
関連識別子 |
10.1109/TVT.2016.2615718 |
| 日本十進分類法 |
|
|
主題Scheme |
NDC |
|
主題 |
007 |
| ISSN |
|
|
収録物識別子タイプ |
PISSN |
|
収録物識別子 |
0018-9545 |
| 権利 |
|
|
権利情報 |
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |
|
言語 |
en |
| 著者版フラグ |
|
|
出版タイプ |
AM |
|
出版タイプResource |
http://purl.org/coar/version/c_ab4af688f83e57aa |
| フォーマット |
|
|
内容記述タイプ |
Other |
|
内容記述 |
application/pdf |
IEEETVT_66_6_5256_5268 (1.6 MB)
