182 0

Maximization of carried traffic by prioritizing new call attempts in a CDMA base station with finite receiver processors

Title
Maximization of carried traffic by prioritizing new call attempts in a CDMA base station with finite receiver processors
Author
김동우
Keywords
prioritized call admission control; CDMA systems
Issue Date
2006-06
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Citation
IEICE TRANSACTIONS ON COMMUNICATIONS, v. E89B, No. 6, Page. 1879-1882
Abstract
If a certain number of receiver processors (RPs) are reserved exclusively for new calls, some decrease in the probability of blocking new calls (P-n) can be obtained at the expense of increase in dropping handoff calls (P-h). This kind of prioritization has been often considered for handoff calls. Since soft handoff in CDMA systems results in sufficiently low P-h, an idea of prioritizing new calls is interesting when admitting more originating traffic into the system is relatively beneficial, which will be further investigated in this paper. An obvious constraint of the above idea is that P-h should be maintained below a given requirement. We formulate the proposed scheme as a mathematical programming problem and prove it improves the performance in terms of weighted carried traffic. As a result of this work, the prioritization of new calls is shown to possibly improve the traffic-carrying performance of a CDMA base station (BS) while maintaining an acceptable level Of P-h, which can be prespecified by a system engineer.
URI
https://search.ieice.org/bin/summary.php?id=e89-b_6_1879https://repository.hanyang.ac.kr/handle/20.500.11754/108238
ISSN
0916-8516; 1745-1345
DOI
10.1093/ietcom/e89-b.6.1879
Appears in Collections:
COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > ELECTRICAL ENGINEERING(전자공학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE