Please use this identifier to cite or link to this item:
http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/9061
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sharma, Davinder S | - |
dc.contributor.author | Sharma, Neeru | - |
dc.date.accessioned | 2023-01-10T09:30:40Z | - |
dc.date.available | 2023-01-10T09:30:40Z | - |
dc.date.issued | 2011 | - |
dc.identifier.uri | http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/9061 | - |
dc.description.abstract | Orthogonal variable spreading factor (OVSF) codes are used to support multimedia calls in CDMA wireless networks. The inefficient use of OVSF code tree reduces the system throughput. The paper discusses a novel code assignment design to provide flexibility of rate variation in data calls maximizing channel utilization. The ongoing call uses different codes at different times depending on the code tree status and instantaneous traffic load. For low traffic loads, the high rate codes can be utilized. For medium to high instantaneous load conditions, the vacant codes with capacity less than the call rate can be utilized. For same call reassignments are done to assign different codes at different times. The utilization of the code tree can reach close to 100%. Simulation results are given to verify the superiority of the proposed design. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Jaypee University of Information Technology, Solan, H.P. | en_US |
dc.subject | OVSF codes | en_US |
dc.subject | QoS, Spreading factor | en_US |
dc.subject | OVSF code assignment | en_US |
dc.title | Performance Improvement in Ovsf Based Cdma Networks Using Flexible Assignment Of Data Calls | en_US |
dc.type | Article | en_US |
Appears in Collections: | Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Performance Improvement in OVSF based CDMA Networks Using Flexible Assignment of Data Calls.pdf | 258.87 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.