Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Free to read · Published 13 December 2012

Utility Based Scheduling and Call Admission Control for Long Term Evolution Networks

J. Vijay Franklin1 & K. Paramasivam2

Journal of Computer Science, Volume 8, Issue 12, pp. 2025–2031 · doi.org/10.3844/jcssp.2012.2025.2031

6,785 accesses5,244 downloads0 citations (Crossref)Metrics
Cite Check for updates

Abstract

In this study, we propose to design a call admission control algorithm which schedules the channels for Real time and non-real time users. In Long Term Evolution (LTE) 3GPP Networks, several works were done on call admission control but these works rarely considers scheduling of resources to the real time and non-real time users.When the system meets traffic oriented performance degration, maximum resources are utilized for load balancing and to maintain the consistent quality. In order to avoid the channel degradation and improve the Quality of Service (QoS), the call requests are classified into New Call (NC) request and Handoff Call (HC) request and the type of services are classified as VoIP and video. Then based upon the Received Signal Strength (RSS) value, the channel is estimated as good channel or bad channel. Resource allocation is made for VoIP users based on traffic density. Then non-VoIP users and the non-real time users are allocated resource blocks using the channel condition based marginal utility function. When there are no sufficient resources to allocate, it allocates the resources of bad channel users there by degrading their service. We have designed the network topology with G (n) and B (n) for representing the available good and bad channels. We investigate the performance degradation when the real time, Non real Time, video and VOIP environments based on RSS threshold value.Comparison is made with the VOS in terms of the paramenters like throughput,bandwidth,delay,fairness and rate. Our proposed method provides good performance and quality.From our simulation results we show that this admission control algorithm provides channel quality and prioritizes the handover calls over new calls which allocates resources to all kinds of users.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2012 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Franklin, J. V. & Paramasivam, K. (2012). Utility Based Scheduling and Call Admission Control for Long Term Evolution Networks. Journal of Computer Science, 8(12), 2025–2031. https://doi.org/10.3844/jcssp.2012.2025.2031

Licence
© Science Publications
Issue
Volume 8, Issue 12
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
Utility Based Scheduling and Call Admission Control for Long Term Evolution NetworksJournal of Computer Science · Volume 8, Issue 12 · pp. 2025–2031 · © Science PublicationsDownload