e-ISSN : 0975-4024 p-ISSN : 2319-8613   
CODEN : IJETIY    

International Journal of Engineering and Technology

Home
IJET Topics
Call for Papers 2021
Author Guidelines
Special Issue
Current Issue
Articles in Press
Archives
Editorial Board
Reviewer List
Publication Ethics and Malpractice statement
Authors Publication Ethics
Policy of screening for plagiarism
Open Access Statement
Terms and Conditions
Contact Us

ABSTRACT

ISSN: 0975-4024

Title : An Efficient Dynamic Orthogonal Variable Spreading Factor Code Allocation Approach in WCDMA through Swarm Intelligence Technique
Authors : P. Kavipriya, Dr. C. Gomathy
Keywords : Call Admission Control (CAC), Code-Division Multiple Access (CDMA), Dynamic Code Assignment, Artificial Bee Colony
Issue Date : Oct-Nov 2013
Abstract :
CDMA is the access technique adopted in the third generation wireless system. In this technique, all users share the same bandwidth simultaneously but with different codes. This sharing generates interferences that can reduce the overall throughput of the WCDMA network when using a weak code allocation algorithm. On the other hand, shared channels are made for the transmission of bursty data as they allow a single OVSF channelization code to be shared among several users. In WCDMA, effective utilization of OVSF codes has become an active area of research as the number of codes is very limited. It is a fact that the successor and predecessor codes of OVSF cannot be used simultaneously when a specific code is used in OVSF as their encoded sequences become indistinguishable. Consequently, OVSF code tree has inadequate number of available codes. Thus, this research work uses a Swarm Intelligence Technique called Artificial Bee Colony (ABC) approach for dynamic OVSF code assignment in WCDMA networks. The simulation results show that the ABC especially with diploid structure provides reduced code blocking probability and improved spectral efficiency in the system when compared to the CCA and DCA schemes.
Page(s) : 3828-3838
ISSN : 0975-4024
Source : Vol. 5, No.5