A near optimal interference minimization resource allocation algorithm for D2D communication

Hassan, Yeakub; Hussain, Faisal; Hossen, Sakhawat; Choudhury, Salimur; Alam, Muhammad

doi:10.1109/icc.2017.7997452

Cited by 12 publications

(12 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It should be noted that in some cases, TAFIRA returns solutions, which are not feasible. Moreover, the worst case the performance ratio of TAFIRA is unbounded …”

Section: Related Workmentioning

confidence: 99%

“…It implies that the algorithm is not fair as some D2D pairs are not getting any resources to communicate. Moreover, the algorithm does not give the feasible solution in most cases …”

Section: Related Workmentioning

confidence: 99%

“…LTE network consists of two types of radio resources, namely, UL and downlink (DL). This paper only considers the UL resources following the works of the previous studies . The cellular UEs transmit a signal to the eNB using UL resources, so interference from shared D2D transmitters affects eNB.…”

Section: System Model and Channel Modelmentioning

confidence: 99%

“…[1][2][3] There are few offline algorithms that work on interference minimization problem discussed in the following. Among these, the algorithms discussed in previous studies 10,11,16,17 run on similar problem statements as this paper. A comparison in Table 1 shows the summary of these algorithms.…”

mentioning

confidence: 99%

“…Moreover, the algorithm does not give the feasible solution in most cases. 11 Hassan et al 11 propose a two-phase resource allocation algorithm for similar problem. Phase I finds candidate matching by using a bipartite matching algorithm in such a way that the generated interference is at the minimum.…”

mentioning

confidence: 99%

See 4 more Smart Citations

An online resource allocation algorithm to minimize system interference for inband underlay D2D communications

Hassan

Hussain

Hossen

et al. 2019

Int J Communication

Self Cite

View full text Add to dashboard Cite

Summary This paper addresses the research question of total system interference minimization while maintaining a target system sum rate gain in an inband underlay device‐to‐device (D2D) communication. To the best of our knowledge, most of the state of the art research works exploit offline resource allocation algorithms to address the research problem. However, in Long‐Term Evolution (LTE) and beyond systems (4G, 5G, or 5G+), offline resource allocation algorithms do not comply with the fast scheduling requirements because of the high data rate demand. In this paper, we propose a bi‐phase online resource allocation algorithm to minimize the total system interference for inband underlay D2D communication. Our proposed algorithm assumes D2D pairs as a set of variable elements whereas takes the cellular user equipment (UEs) as a set of constant elements. The novelty of our proposed online resource allocation algorithm is that it incurs a minimum number of changes in radio resource assignment between two successive allocations among the cellular UEs and the D2D pairs. Graphical representation of the simulation results suggests that our proposed algorithm outperforms the existing offline algorithm considering number of changes in successive allocation for a certain percentage of sum rate gain maintaining the total system interference and total system sum rate very similar.

show abstract

“…It should be noted that in some cases, TAFIRA returns solutions, which are not feasible. Moreover, the worst case the performance ratio of TAFIRA is unbounded …”

Section: Related Workmentioning

confidence: 99%

“…It implies that the algorithm is not fair as some D2D pairs are not getting any resources to communicate. Moreover, the algorithm does not give the feasible solution in most cases …”

Section: Related Workmentioning

confidence: 99%

Section: System Model and Channel Modelmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

An online resource allocation algorithm to minimize system interference for inband underlay D2D communications

Hassan

Hussain

Hossen

et al. 2019

Int J Communication

Self Cite

View full text Add to dashboard Cite

show abstract

Relax online resource allocation algorithms for D2D communication

Hossen

Hassan

Hussain

et al. 2018

Int J Communication

Self Cite

View full text Add to dashboard Cite

Summary Maximizing the system sumrate by sharing the resource blocks among the cellular user equipments and the D2D (device to device) pairs while maintaining the quality of service is an important research question in a D2D communication underlaying cellular networks. The problem can be optimally solved in offline by using the weighted bipartite matching algorithm. However, in long‐term evolution and beyond (4G and 5G) systems, scheduling algorithms should be very efficient where the optimal algorithm is quite complex to implement. Hence, a low complexity algorithm that returns almost the optimal solution can be an alternative to this research problem. In this paper, we propose 2 less complex stable matching–based relax online algorithms those exhibit very close to the optimal solution. Our proposed algorithms deal with fixed number of cellular user equipments and a variable number of D2D pairs those arrive in the system online. Unlike online matching algorithms, we consider that an assignment can be revoked if it improves the objective function (total system sumrate). However, we want to minimize the number of revocation (ie, the number of changes in the assignments) as a large number of changes can be expensive for the networks too. We consider various offline algorithms proposed for the same research problem as relaxed online algorithms. Through extensive simulations, we find that our proposed algorithms outperform all of the algorithms in terms of the number of changes in assignment between 2 successive allocations while maintaining the total system sumrate very close to the optimal algorithm.

show abstract

Efficient algorithms to minimize the end-to-end latency of edge network function virtualization

Ghai

Choudhury

Yassine

2020

J Ambient Intell Human Comput

View full text Add to dashboard Cite

A near optimal interference minimization resource allocation algorithm for D2D communication

Cited by 12 publications

References 18 publications

An online resource allocation algorithm to minimize system interference for inband underlay D2D communications

An online resource allocation algorithm to minimize system interference for inband underlay D2D communications

Relax online resource allocation algorithms for D2D communication

Efficient algorithms to minimize the end-to-end latency of edge network function virtualization

Contact Info

Product

Resources

About