Heuristic Algorithm for Proportional Fair Scheduling in D2D-Cellular Systems

Gu, Jaheon; Bae, Sueng Jae; Hasan, Syed Faraz; Chung, Min Young

doi:10.1109/twc.2015.2477998

Cited by 38 publications

(22 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From Figure 3, it can be seen that the performance of the random algorithm (RA) is the worst, and the performance of the exhaustive algorithm (EA) is the best. From Figures 3 and 4, compared with the genetic Input: PAR min , PAR max , HMCR min , HMS, g n , MAXI, d, U min , U max , L, α Output: we use C(U x ), P average or EE as the results (1) Step 1: initialization and coding (2) Step 2: generate new solutions and update the harmony memory bank (3) While g n <� MAXI (4) For j � 1 : K (5) For i � 1 : M (6) If rand < HMCR then (7) index1 � roultte(fitness function) (8) index2 � roultte(fitness function) (9) If index1 < index2 (10) index � index2 (11) Else (12) index � index1 (13) End (14) If rand < PAR (15) If rand < d (16) Newharmony(i) � HM(index, i) + bw (17) Else (18) Newharmony (i) � HM(index, i) − bw (19) End (20) Else (21) Newharmony (i) � HM(index, i); 6 Mobile Information Systems algorithm (GA) which has good performance in the eld of D2D resource allocation, the improved harmony search algorithm (IHSA) has superior global search performance by dynamically adjusting algorithm parameters. erefore, the improved harmony search algorithm proposed in this paper is closer to the result of the exhaustive algorithm.…”

Section: Numerical Resultsmentioning

confidence: 99%

“…In order to reduce the computational complexity of the learning framework, two kinds of resource allocation algorithms based on matching theory were proposed for different scenarios. In [10], a low-complexity heuristic algorithm had also been proposed to realize the high logarithmic sum of the average user data rates. In [11], a new adaptive subcarrier allocation scheme was designed and a novel power allocation scheme was proposed, which can provide an optimal solution with low computation complexity.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Resource Allocation Schemes Based on Intelligent Optimization Algorithms for D2D Communications Underlaying Cellular Networks

Zhou

Xing

et al. 2018

Mobile Information Systems

View full text Add to dashboard Cite

In this paper, the resource allocation problem for device-to-device (D2D) communications underlaying cellular networks is formulated and analyzed. In our scenario, we consider that the number of D2D user equipment (DUE) pairs is far larger than that of cellular user equipments (CUEs). Meanwhile, the resource blocks are divided into two types: resource blocks for CUEs and the ones for CUEs and DUEs. Firstly, the system model is presented, and the resource allocation problem is formulated. en, a resource allocation scheme based on the genetic algorithm is proposed. To overcome the problem that the dedicated resource is not fully shared in the genetic algorithm, an improved harmony search algorithm is proposed for resource allocation. Finally, the analysis and simulation results show that the performances of the proposed genetic algorithm and the improved harmony search algorithm outperform than that of the random algorithm and are very close to that of the exhaustive algorithm. is result can provide an effective optimization for resource allocation of D2D communications.

show abstract

Section: Numerical Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Resource Allocation Schemes Based on Intelligent Optimization Algorithms for D2D Communications Underlaying Cellular Networks

Zhou

Xing

et al. 2018

Mobile Information Systems

View full text Add to dashboard Cite

show abstract

“…The user status mainly considers the number of active users, D2D clusters, and the D2D users. The comparison of resource reuse includes no-reuse scheme, random scheme [29], heuristic algorithm [30], and the Hungarian algorithm proposed in this paper. The key parameters of the simulation are shown in Table 3.…”

Section: Parameter Settingsmentioning

confidence: 99%

Emergency Communications Based on Throughput-Aware D2D Multicasting in 5G Public Safety Networks

Yin

Feng

et al. 2020

Sensors

View full text Add to dashboard Cite

Emergency communications need to meet the developing demand of equipment and the complex scenarios of network in public safety networks (PSNs). Heterogeneous Cloud Radio Access Network (H-CRAN), an important technology of the 5th generation wireless systems (5G), plays an important role in PSN. H-CRAN has the features of resource sharing and centralized allocation which can make up for resource shortage in emergency communications. Therefore, an emergency communications strategy based on Device-to-device (D2D) multicast is proposed to make PSN more flexible and rapid. Nearby users can communicate directly without a base station through D2D. This strategy may guarantee high speed data transmission and stable continuous real-time communications. It is divided into three steps. Firstly, according to the distance between users, the alternative cluster head is divided. Secondly, two kinds of cluster head user selection schemes are developed. One is based on terminal power and the other is based on the number of extended users. Last but not least, the Hungarian Algorithm based on throughput-aware is used to channel multiplexing. The numerical results show that the proposed scheme can effectively extend the coverage of PSN and optimize the utilization of resources.

show abstract

“…Here, the PF scheduling is used to achieve the system fairness. As proven in [12], the PF scheduling scheme in D2D underlay communications can be expressed as…”

Section: B Pf Schedulingmentioning

confidence: 99%

“…There are few works on how PF scheduling scheme is applied in D2D underlay communications. Authors in [12] transform the PF scheduling into an assignment problem form by applying Maclaurin series expansion without considering the mutual interferences. However, the transmission powers of all users are allocated the same value and authors do not consider the QoS requirements of all links.…”

Section: Introductionmentioning

confidence: 99%

Joint Power and Channel Allocation for Underlay D2D Communications with Proportional Fairness

Liu

Zhang

You

2019

2019 15th International Wireless Communications &Amp; Mobile Computing Conference (IWCMC)

View full text Add to dashboard Cite

Since D2D (Device-to-Device) communication was proposed in cellular network as a new paradigm for enhancing network performance, many works have been done on resource allocation to improve system throughput and energy efficiency (EE) for underlay D2D communications. However, the system long-term average fairness as one of the system main performance metrics was rarely considered especially when users are moving. In this paper, we formulate the joint power and channel allocation problem aiming at maximizing the system fairness subject to the minimum required SINRs (Signal to Interference and Noise Ratios) and power consumption limits of cellular and active D2D links. To solve the above problem practically, we first decompose our original problem into two sub-problems (power and channel allocation), then solve them sequentially. Simulation results show that our proposed algorithm can dramatically enhance the system fairness and slightly improve the system throughput comparing with existing method.

show abstract

Heuristic Algorithm for Proportional Fair Scheduling in D2D-Cellular Systems

Cited by 38 publications

References 20 publications

Resource Allocation Schemes Based on Intelligent Optimization Algorithms for D2D Communications Underlaying Cellular Networks

Resource Allocation Schemes Based on Intelligent Optimization Algorithms for D2D Communications Underlaying Cellular Networks

Emergency Communications Based on Throughput-Aware D2D Multicasting in 5G Public Safety Networks

Joint Power and Channel Allocation for Underlay D2D Communications with Proportional Fairness

Contact Info

Product

Resources

About