Iterative Energy-Efficient Stable Matching Approach for Context-Aware Resource Allocation in D2D Communications | Zendy

Zhenyu Zhou | Zendy; Guifang Ma | Zendy; Mianxiong Dong | Zendy; Kaoru Ota | Zendy; Chen Xu | Zendy; Yunjian Jia | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Iterative Energy-Efficient Stable Matching Approach for Context-Aware Resource Allocation in D2D Communications

Author(s) -

Zhenyu Zhou,

Guifang Ma,

Mianxiong Dong,

Kaoru Ota,

Chen Xu,

Yunjian Jia

Publication year - 2016

Publication title -

ieee access

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.587

H-Index - 127

ISSN - 2169-3536

DOI - 10.1109/access.2016.2593047

Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research