| アイテムタイプ |
学術雑誌論文 / Journal Article.(1) |
| 公開日 |
2016-04-11 |
| 書誌情報 |
en : IEEE Access
巻 3,
p. 1849-1860,
発行日 2015
|
| タイトル |
|
|
タイトル |
Energy-Efficient Context-Aware Matching for Resource Allocation in Ultra-Dense Small Cells |
|
言語 |
en |
| 言語 |
|
|
言語 |
eng |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
Energy-efficient |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
context-aware |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
caching |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
ultra-dense |
| キーワード |
|
|
言語 |
en |
|
主題Scheme |
Other |
|
主題 |
small cell |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_6501 |
|
資源タイプ |
journal article |
| アクセス権 |
|
|
アクセス権 |
open access |
|
アクセス権URI |
http://purl.org/coar/access_right/c_abf2 |
| 著者 |
ZHOU, Zhenyu
董, 冕雄
太田, 香
CHANG, Zheng
|
| 室蘭工業大学研究者データベースへのリンク |
|
|
表示名 |
董 冕雄（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 |
|
内容記述 |
With the explosive growth of mobile data traffic and rapidly rising energy price, how to implement caching at small cells in an energy-efficient way is still an open problem and requires further research efforts. In this paper, we study the energy-efficient context-aware resource allocation problem, which falls into the category of mixed integer nonlinear programming (MINLP) and is NP-hard. To provide a tractable solution, the MINLP problem is decoupled and reformulated as a one-to-one matching problem under two-sided preferences, which are modeled as the maximum energy efficiency that can be achieved under the expected matching. An iterative algorithm is developed to establish preference profiles by employing nonlinear fractional programming and Lagrange dual decomposition. Then, we propose an energy-efficient matching algorithm based on the Gale-Shapley algorithm, and provide the detailed discussion and analysis of stability, optimality, implementation issues, and algorithmic complexity. The proposed matching algorithm is also extended to scenarios with preference, indifference, and incomplete preference lists by introducing some tie-breaking and preference deletion rules. The simulation results demonstrate that the proposed algorithm achieves significant performance and satisfaction gains compared with the conventional algorithms. |
|
言語 |
en |
| 出版者 |
|
|
出版者 |
IEEE |
|
言語 |
en |
| 出版者版へのリンク |
|
|
表示名 |
10.1109/ACCESS.2015.2478863 |
|
URL |
https://doi.org/10.1109/ACCESS.2015.2478863 |
| DOI |
|
|
関連タイプ |
isIdenticalTo |
|
|
識別子タイプ |
DOI |
|
|
関連識別子 |
10.1109/ACCESS.2015.2478863 |
| 日本十進分類法 |
|
|
主題Scheme |
NDC |
|
主題 |
007 |
| ISSN |
|
|
収録物識別子タイプ |
PISSN |
|
収録物識別子 |
2169-3536 |
| 権利 |
|
|
権利情報 |
© 2015 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 |
IEEE_A-3-1849-1860 (5.5 MB)
