| アイテムタイプ |
学術雑誌論文 / Journal Article.(1) |
| 公開日 |
2017-07-19 |
| 書誌情報 |
en : IEEE Access
巻 4,
p. 6181-6196,
発行日 2016-07-19
|
| タイトル |
|
|
タイトル |
Iterative Energy-Efficient Stable Matching Approach for Context-Aware Resource Allocation in D2D Communications |
|
言語 |
en |
| 言語 |
|
|
言語 |
eng |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
Energy-efficient context-aware resource allocation |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
many-to-one stable matching |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
D2D communications |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
iterative power allocation |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
mixed integer nonlinear programming |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_6501 |
|
資源タイプ |
journal article |
| アクセス権 |
|
|
アクセス権 |
open access |
|
アクセス権URI |
http://purl.org/coar/access_right/c_abf2 |
| 著者 |
ZHOU, Zhenyu
MA, Guifang
董, 冕雄
太田, 香
XU, Chen
JIA, Yunjian
|
| 室蘭工業大学研究者データベースへのリンク |
|
|
表示名 |
董 冕雄（DONG Mianxiong） |
|
URL |
http://rdsoran.muroran-it.ac.jp/html/100000145_ja.html |
| 室蘭工業大学研究者データベースへのリンク |
|
|
表示名 |
太田 香（OTA Kaoru） |
|
URL |
http://rdsoran.muroran-it.ac.jp/html/100000140_ja.html |
| 抄録 |
|
|
内容記述タイプ |
Abstract |
|
内容記述 |
Energy efficiency (EE) is critical to fully achieve the huge potentials of device-to-device (D2D) communications with limited battery capacity. In this paper, we consider the two-stage EE optimization problem, which consists of a joint spectrum and power allocation problem in the first stage, and a context-aware D2D peer selection problem in the second stage. We provide a general tractable framework for solving the combinatorial problem, which is NP-hard due to the binary and continuous optimization variables. In each stage, user equipments (UEs) from two finite and disjoint sets are matched in a two-sided stable way based on the mutual preferences. First, the preferences of UEs are defined as the maximum achievable EE. An iterative power allocation algorithm is proposed to optimize EE under a specific match, which is developed by exploiting nonlinear fractional programming and Lagrange dual decomposition. Second, we propose an iterative matching algorithm, which first produces a stable match based on the fixed preferences, and then dynamically updates the preferences according to the latest matching results in each iteration. Finally, the properties of the proposed algorithm, including stability, optimality, complexity, and scalability, are analyzed in detail. Numerical results validate the efficiency and superiority of the proposed algorithm under various simulation scenarios. |
|
言語 |
en |
| 出版者 |
|
|
出版者 |
IEEE |
|
言語 |
en |
| 出版者版へのリンク |
|
|
表示名 |
10.1109/ACCESS.2016.2593047 |
|
URL |
https://doi.org/10.1109/ACCESS.2016.2593047 |
| DOI |
|
|
関連タイプ |
isIdenticalTo |
|
|
識別子タイプ |
DOI |
|
|
関連識別子 |
10.1109/ACCESS.2016.2593047 |
| 日本十進分類法 |
|
|
主題Scheme |
NDC |
|
主題 |
547 |
| ISSN |
|
|
収録物識別子タイプ |
PISSN |
|
収録物識別子 |
2169-3536 |
| 権利 |
|
|
権利情報 |
© 2016 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 |
| 著者版フラグ |
|
|
出版タイプ |
VoR |
|
出版タイプResource |
http://purl.org/coar/version/c_970fb48d4fbd8a85 |
| フォーマット |
|
|
内容記述タイプ |
Other |
|
内容記述 |
application/pdf |
IEEEAccess_4_6181-6196 (8.5 MB)
