• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.973-974
• /
• 2013

This paper analyzes a characteristic of dynamic carrier and bandwidth allocation methods of OFDMA PON. We then discuss the possible problems when we implement those methods in hardware.

• ETRI Journal
• /
• v.24 no.6
• /
• pp.465-468
• /
• 2002

Ethernet passive optical networks (PONs) are an emerging access network technology that provides a low-cost method of deploying optical access lines between a carrier's central office and a customer site. In this paper, we propose a new algorithm of dynamic bandwidth allocation for multimedia services over Ethernet PONs. To implement the suggested dynamic bandwidth allocation algorithm, we present control message formats that handle classified bandwidths in a multi-point control protocol of Ethernet PONs.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.113-116
• /
• 2003

In this paper, we propose a dynamic parallel channel allocation mechanism that dynamically controls total number of allocation channels of each subscriber to effectively service user bandwidth demands while high utilization and fairness are guaranteed in WDM based optical access networks. The logical performance gain of statistical multiplexing by dynamic channel allocation is validated with analytic method as well as simulations. We also introduce the adaptive padding scheme in order to efficiently distribute forwarded frames to aggregated multi-link channels which are formed by parallel channel allocation mechanism. The proposed scheme shows the performance enhancement by minimizing unnecessary padding size and the processing time.

• ETRI Journal
• /
• v.42 no.6
• /
• pp.846-858
• /
• 2020

The non-orthogonal multiple access (NOMA) technique offers throughput improvement to meet the demands of the future generation of wireless communication networks. The objective of this work is to further improve the throughput by including an underlay cognitive radio network with an existing multi-carrier NOMA network, using cooperative communication. The throughput is maximized by optimal resource allocation, namely, power allocation, subcarrier assignment, relay selection, user pairing, and subcarrier pairing. Optimal power allocation to the primary and secondary users is accomplished in a way that target rate constraints of the primary users are not affected. The throughput maximization is a combinatorial optimization problem, and the computational complexity increases as the number of users and/or subcarriers in the network increases. To this end, to reduce the computational complexity, a dynamic network resource allocation algorithm is proposed for combinatorial optimization. The simulation results show that the proposed network improves the throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7A
• /
• pp.693-701
• /
• 2008

In OFDMA (Orthogonal Frequency Division Multiple Access) system that frequency reuse factor is 1, as the same channels in the neighborhood cells creates inter-cell co-channel interference which provides a resource underutilization problem, channel allocation schemes to minimize inter-cell interference have been studied. This paper proposes a new CNIR (Carrier to Noise and Interference Ratio)-based distributed Inter-cell DCA (Dynamic Channel Allocation) algorithm in the OFDMA environment with frequency reuse factor of 1. When a channel allocation is requested, if there is not a free channel in home cell or the available free channels in home cell do not satisfy a required threshold value, the proposed Inter-cell DCA algorithm finds CNIR values of available free channels in the neighborhood cells and then allocates a free channel with maximum CNIR value. Through the simulation results, we find that the proposed scheme decreases both new call block rate and forced termination rate due to new call generation at the same time because it increases channel allocation probability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.691-708
• /
• 2010

An important issue of supporting multi-users with diverse quality-of-service (QoS) requirements over wireless networks is how to optimize the systematic scheduling by intelligently utilizing the available network resource while, at the same time, to meet each communication service QoS requirement. In this work, we study the problem of a variety of communication services over multi-media heterogeneous cognitive OFDM system. We first divide the communication services into two parts. Multimedia applications such as broadband voice transmission and real-time video streaming are very delay-sensitive (DS) and need guaranteed throughput. On the other side, services like file transmission and email service are relatively delay tolerant (DT) so varying-rate transmission is acceptable. Then, we formulate the scheduling as a convex optimization problem, and propose low complexity distributed solutions by jointly considering channel assignment, bit allocation, and power allocation. Unlike prior works that do not care computational complexity. Furthermore, we propose the FAASA (Fairness Assured Adaptive Sub-carrier Allocation) algorithm for both DS and DT users, which is a dynamic sub-carrier allocation algorithm in order to maximize throughput while taking into account fairness. We provide extensive simulation results which demonstrate the effectiveness of our proposed schemes.

• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.26-35
• /
• 2009

In this paper, we investigate how to do resource allocation to guarantee a minimum user data rate at low signaling overhead in multi-cell orthogonal frequency division multiple access (OFDMA) wireless systems. We devise dynamic resource allocation (DRA) algorithms that can minimize the QoS violation ratio (i.e., the ratio of the number of users who fail to get the requested data rate to the total number of users in the overall network). We assume an OFDMA system that allows dynamic control of frequency reuse factor (FRF) of each sub-carrier. The proposed DRA algorithms determine the FRFs of the sub-carriers and allocate them to the users adaptively based on inter-cell interference and load distribution. In order to reduce the signaling overhead, we adopt a hierarchical resource allocation architecture which divides the resource allocation decision into the inter-cell coordinator (ICC) and the base station (BS) levels. We limit the information available at the ICC only to the load of each cell, that is, the total number of sub-carriers required for supporting the data rate requirement of all the users. We then present the DRA with limited coordination (DRA-LC) algorithm where the ICC performs load-adaptive inter-cell resource allocation with the limited information while the BS performs intra-cell resource allocation with full information about its own cell. For performance comparison, we design a centralized algorithm called DRA with full coordination (DRA-FC). Simulation results reveal that the DRA-LC algorithm can perform close to the DRA-FC algorithm at very low signaling overhead. In addition, it turns out to improve the QoS performance of the cell-boundary users, and achieve a better fairness among neighboring cells under non-uniform load distribution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4823-4843
• /
• 2017

In this paper, an improved utility-based cross-layer dynamic subcarrier allocation (DSA) algorithm is proposed for single carrier frequency division multiple access (SC-FDMA) system, which adopts adaptive service rate control (ASRC) to eliminate the service rate waste and improve the spectral efficiency in heterogeneous network including non-real-time traffic and real-time traffic. In this algorithm, furthermore, a first in first out (FIFO) queuing model with finite space is established on the cross-layer scheduling framework. Simulation results indicate that by taking the service rate constraint as the necessary condition for optimality, the ASRC algorithm can effectively eliminate the service rate waste without compromising the scheduling performance. Moreover, the ASRC algorithm is able to further improve the quality of service (QoS) performance and transmission throughput by contributing an attractive performance trade-off between real-time and non-real-time applications.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.153-154
• /
• 2006

We propose the dynamic channel allocation (DCA) algorithm for multi-cell OFDMA systems to avoid co-channel interference (CCI). The proposed algorithm is utilized not in a centralized, but in a distributed manner which reduces complexity. The simulation results confirm that the number of overlapping allocated subcarriers is reduced and the average SINR of a sub-carrier is increased by this algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7B
• /
• pp.620-627
• /
• 2003

Ethernet passive optical networks (EPONs) are an emerging access network technology that provide a low-cost method of deploying optical access lines between a carrier's central office and customer sites. Dynamic bandwidth allocation (DBA) provides statistical multiplexing between the optical network units for efficient upstream channel utilization. To support dynamic bandwidth distribution, 1 propose an cyclic polling-based DBA algorithm for differentiated classes of service in EPONs. And, I show that an interleaved polling scheme severely decreases downstream channel capacity for user traffics when the upstream network load is low. To obtain realistic simulation results, I used synthetic traffic that exhibits the properties of self-similarity and long-range dependence I then analyzed the network performance under various loads, specifically focusing on packet delays for different classes of traffic.