English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90429/105609 (86%)
Visitors : 10442790      Online Users : 800
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 >  Item 310904400/8701


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/8701


    Title: Utilization optimization for ovsf single-code allocation in WCDMA networks
    Authors: Chen, Jui-Chi
    Contributors: Department of Computer Science and Information Engineering
    Keywords: Blocking probability;Breeder reactors;Cellular neural networks;Cellular telephone systems;Chlorination;Computer networks;Context sensitive grammars;Network protocols;Optimization;Risk assessment;Sensor networks;OVSF code;Telecommunications;Utilization optimization;WCDMA
    Date: 2008
    Issue Date: 2010-04-07 21:27:30 (UTC+8)
    Publisher: Asia University
    Abstract: Resources such as Wideband Code Division Multiple Access (WCDMA) Orthogonal Variable Spreading Factor (OVSF) codes are considered scarce and valuable in modern cellular networks, therefore operators must use them efficiently. The author proposes an evaluation model for predicting OVSF single-code allocation performance in WCDMA networks. In this paper, two performance measures-call blocking probability (CBP) and bandwidth utilization (BU)-are adopted to solve a utilization optimization problem. Specifically, a given traffic statistic and a specified maximum CBP constraint are applied to maximize BU in a Node-B. Operators can use the results to deploy their codes flexibly and to improve profitability.
    Relation: Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an 31:1077-1081
    Appears in Collections:[資訊工程學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    0KbUnknown267View/Open
    411.doc34KbMicrosoft Word244View/Open


    All items in ASIAIR are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback