z-logo
open-access-imgOpen Access
Dynamic resource allocation based on service time prediction for device‐to‐device communication underlaying cellular networks
Author(s) -
Zheng Jun,
Chen Renpeng,
Zhang Yuan
Publication year - 2015
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2014.0434
Subject(s) - computer science , resource allocation , quality of service , service (business) , base station , performance metric , metric (unit) , computer network , resource management (computing) , resource (disambiguation) , distributed computing , real time computing , engineering , operations management , economy , management , economics
This work studies the dynamic resource allocation for device‐to‐device communication and proposes a service time prediction‐based dynamic resource allocation mechanism for a cellular system. The proposed allocation mechanism introduces the concept of ‘utility’ as a metric to reflect the quality of experience of users with different service requirements, and takes into account service time prediction in spectral resource allocation. Specifically, it enables a base station to predict the service time of a new user and the remaining service time of existing users in the system, and takes into account the predicted service time and remaining service time in calculating the effective utility gain caused by the arrival of a new user. Based on the calculated effective utility gain, the base station will select the physical resource block (PRB) with the largest effective utility gain every time it allocates a PRB to the new user. Simulation results show that the proposed dynamic allocation mechanism can significantly improve the system performance in terms of the overall average utility and the number of users successfully admitted to the system.

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