Abstract
Energy efficiency is an extremely important performance indicator for device-To-device communications due to the limited battery capacity of user equipments (UEs). In this paper, we focus on the two-stage EE optimization problem, which consists of a channel and power allocation problem in the first stage, and a context-Aware D2D peer recovery problem in the second stage. We incorporate a many-To-one matching framework to solve the nonconvex combinatorial problem with dynamically varying preferences. At each iteration of the first-stage match, D2D transmitters and cellular UEs are firstly matched by assuming that the preferences remain unchanged, which are used later to update the preferences. The second-stage matching problem between D2D transmitters and receivers can also be solved by the proposed algorithm with little modifications. We validate the proposed algorithm through numerical results and compare it with several heuristic algorithms.
| Original language | English |
|---|---|
| Title of host publication | 2016 International Conference on Information and Communication Technology Convergence, ICTC 2016 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 90-96 |
| Number of pages | 7 |
| ISBN (Electronic) | 9781509013258 |
| DOIs | |
| Publication status | Published - 2016 Nov 30 |
| Event | 2016 International Conference on Information and Communication Technology Convergence, ICTC 2016 - Jeju Island, Korea, Republic of Duration: 2016 Oct 19 → 2016 Oct 21 |
Other
| Other | 2016 International Conference on Information and Communication Technology Convergence, ICTC 2016 |
|---|---|
| Country | Korea, Republic of |
| City | Jeju Island |
| Period | 16/10/19 → 16/10/21 |
Fingerprint
ASJC Scopus subject areas
- Computer Networks and Communications
- Hardware and Architecture
- Signal Processing
Cite this
Energy-efficient context-Aware resource allocation in D2D communications : An iterative matching approach. / Zhou, Zhenyu; Ma, Guifang; Zhang, Di; Xu, Chen.
2016 International Conference on Information and Communication Technology Convergence, ICTC 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 90-96 7763443.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Energy-efficient context-Aware resource allocation in D2D communications
T2 - An iterative matching approach
AU - Zhou, Zhenyu
AU - Ma, Guifang
AU - Zhang, Di
AU - Xu, Chen
PY - 2016/11/30
Y1 - 2016/11/30
N2 - Energy efficiency is an extremely important performance indicator for device-To-device communications due to the limited battery capacity of user equipments (UEs). In this paper, we focus on the two-stage EE optimization problem, which consists of a channel and power allocation problem in the first stage, and a context-Aware D2D peer recovery problem in the second stage. We incorporate a many-To-one matching framework to solve the nonconvex combinatorial problem with dynamically varying preferences. At each iteration of the first-stage match, D2D transmitters and cellular UEs are firstly matched by assuming that the preferences remain unchanged, which are used later to update the preferences. The second-stage matching problem between D2D transmitters and receivers can also be solved by the proposed algorithm with little modifications. We validate the proposed algorithm through numerical results and compare it with several heuristic algorithms.
AB - Energy efficiency is an extremely important performance indicator for device-To-device communications due to the limited battery capacity of user equipments (UEs). In this paper, we focus on the two-stage EE optimization problem, which consists of a channel and power allocation problem in the first stage, and a context-Aware D2D peer recovery problem in the second stage. We incorporate a many-To-one matching framework to solve the nonconvex combinatorial problem with dynamically varying preferences. At each iteration of the first-stage match, D2D transmitters and cellular UEs are firstly matched by assuming that the preferences remain unchanged, which are used later to update the preferences. The second-stage matching problem between D2D transmitters and receivers can also be solved by the proposed algorithm with little modifications. We validate the proposed algorithm through numerical results and compare it with several heuristic algorithms.
UR - http://www.scopus.com/inward/record.url?scp=85015765537&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85015765537&partnerID=8YFLogxK
U2 - 10.1109/ICTC.2016.7763443
DO - 10.1109/ICTC.2016.7763443
M3 - Conference contribution
AN - SCOPUS:85015765537
SP - 90
EP - 96
BT - 2016 International Conference on Information and Communication Technology Convergence, ICTC 2016
PB - Institute of Electrical and Electronics Engineers Inc.
ER -