<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

Filters

2015 - 20182

Settings

🏛️國立陽明交通大學機構典藏

Author: search.filters.author.Liang, Jia-MingSubject: search.filters.subject.3GPP

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item type:Item,
    Data Offloading for Dynamic Point Selection in Cloud Radio Access Networks (C-RAN)
    (2018-01-01)
    Hsu, Ching-Kuo
    ;
    Liang, Jia-Ming
    ;
    Chen, Jen-Jee
    ;
    Wu, Kun-Ru
    ;
    Tseng, Yu-Chee
    For next generation mobile communications. Cloud-RAN (C-RAN) is an emerging network architecture to provide broadband services. C-RAN separates computation entities, i.e., Baseband Units (BBUs), from base stations (BSs) and puts BBUs in a cloud located in a centralized network. With C-RAN, UEs can receive data from multiple collaborative cells and thus can leverage the dynamic point selection (DPS) technology to improve network efficiency. When user equipments (UEs) enter a hotspot and can not be served due to congestion, data offloading from the hotspot to its neighboring cells may take place to balance heterogeneous cells' loads. This work shows how to integrate such DPS offloading with the Discontinuous Reception (DRX) mechanism, which allows UEs to turn off their radio interfaces in a periodical manner. We address the resource allocation problem in heterogeneously-loaded C-RAN by optimizing UEs' energy consumption based on DRX while reserving sufficient bandwidths for UEs considering their quality-of-service (QoS) through DPS. We propose an offloading-based DPS scheduling scheme by exploiting not only maximal instantaneous throughputs but also minimal energy cost. Simulation results show that our scheme can improve throughput, resource utilization, and energy consumption as compared to existing schemes.
  • Thumbnail Image
    Item type:Item,
    A Dynamic Reservation Scheme in Online Charging System for Family Shared Plan
    (2015)
    Huang, Huai-Sheng
    ;
    Su, Tzu-Chung
    ;
    Liang, Jia-Ming
    ;
    Tseng, Yu-Chee
    ;
    資訊工程學系
    For simplifying billing and limiting data usage, Family Shared Plan (FSP) is now a popular plan provided by telecommunications operators. Based on the 3rd Generation Partnership Project (3GPP) specifications, Online Charging System (OCS) has to determine the Granted Unit (GU) and create reservations per session before a service is delivered by the serving network to a User Equipment (UE). However, fixed GUs cannot adapt to dynamic consumer behaviors, which usually require dynamic GUs. Clearly, giving small GUs will incur too many signaling messages for making reservations, but giving excessive GUs will cause unbalanced distribution of resources, especially in FSP cases. How to determine GUs is an open issue that can be self-defined by telecommunications operators. In this paper, we propose a new scheme for dynamically assigning GUs to UEs belonging to the same FSP, based on their historical data usage and total monthly data allowance. Simulation results show that our scheme can substantially save signalings by at least 22% compared to fixed scheme under unpredictable behaviors.