Resource Allocation Algorithm for D2D Communication in Cellular Networks Based on Hungarian Algorithm

Nizam, Fareha; Roslee, Mardeni; Yusoff, Zubaida; Anuar, Khairil; Alzoubi, Kifah Hussein; Elgamati, Mohamed Ahmed A.; Billah, Muhammad Junied

doi:10.1109/micc48337.2019.9037573

Cited by 4 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The RBF can better map feature vectors into a nonlinear space as compared to other learners [ 36 , 37 , 38 ]. On the other hand, the Hungarian algorithm is also already utilized to solve various assignment issues such as resource allocation in wireless communication systems [ 39 , 40 , 41 ].…”

Section: Introductionmentioning

confidence: 99%

Proactive Caching in D2D Assisted Multitier Cellular Network

Ahmad

Hussain

et al. 2022

Sensors

View full text Add to dashboard Cite

Cache-enabled networks suffer hugely from the challenge of content caching and content delivery. In this regard, cache-enabled device-to-device (D2D) assisted multitier cellular networks are expected to relieve the network data pressure and effectively solve the problem of content placement and content delivery. Consequently, the user can have a better opportunity to get their favored contents from nearby cache-enabled transmitters (CETs) through reliable and good-quality links; however, as expected, designing an effective caching policy is a challenging task due to the limited cache memory of CETs and uncertainty in user preferences. In this article, we introduce a joint content placement and content delivery technique for D2D assisted multitier cellular networks (D2DMCN). A support vector machine (SVM) is employed to predict the content popularity to determine which content is to be cached and where it is to be cached, thereby increasing the overall cache hit ratio (CHR). The content request is satisfied either by the neighboring node through the D2D link or by the cache-enabled base stations (BSs) of the multitier cellular networks (MCNs). Similarly, to solve the problem of optimal content delivery, the Hungarian algorithm is employed aiming to improve the quality of satisfaction. The simulation results indicate that the proposed content placement strategy effectively optimizes the overall cache hit ratio of the system. Similarly, an effective content delivery approach reduces the request content delivery delay and power consumption.

show abstract