• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.508-516
• /
• 2006

The explosive growth of wireless network users and the existence of various wireless services have demanded high rate throughput as well as user's QoS guarantees. Towards this, this paper proposes QoS-oriented subcarrier allocation scheme considering the QoS provisioning of multiple users, which is major requirement for wireless network design point of view. This paper introduces joint RR/K&H combined with M-LWDF(Modified Largest Weighted Delay First) scheme throughout observing statistical channel behavior and real time queuing analysis for appropriate resource allocation tightly connected to multiuser scheduling. Accordingly, the system throughput can be enhanced, and the QoS demanded for delay sensitive services can be satisfied. Furthermore, the proposed scheme is applied for OFDMA(Orthogonal Frequency Division Multiple Access) systems to allocate sub-carriers in optimal way. The simulation results verify plausible performances of proposed resource allocation scheme via showing superior effective capacity under time-varying physical-layer channel behaviors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5A
• /
• pp.417-425
• /
• 2005

KOINONIA is high-rate Wireless Personal Area Network (WPAN) technology, and is developed for multimedia traffic transmission in personal area. A KOINONIA piconet is a collection of one or more associated slaves under a single master. Efficient scheduling of a master for the traffic of slaves is essential to use channel effectively and to guarantee QoS of multimedia traffic. We propose a new scheduling algorithm to allocate channel time at desired intervals regardless of superframe length, and a Connection Admission Control(CAC) algorithm to regulate the number of traffics in a piconet. Our proposed algorithms have been shown to save channel time and to meet QoS requirements compared to the conventional weighted round-robin algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.10
• /
• pp.1379-1385
• /
• 2018

In the conventional multi-user superposition transmission, the power allocation coefficients of data symbols and the received signal processing of users are determined by the condition of instantaneous channel powers. However, the use of instantaneous channel powers can increase the system complexity. Hence, we consider fixed multi-user superposition transmission using average channel powers. The fixed multi-user superposition transmission can reduce the system complexity because it uses the condition of average channel powers that slowly change over time in order to decide the power allocation coefficients and the received signal processing. In this paper, we analyze the average symbol error rate for the fixed multi-user superposition transmission. In particular, an expression for the average symbol error rate of M-ary Quadrature Amplitude Modulation is derived assuming Rayleigh fading channels. In addition, through the numerical results, we show that the conventional and fixed multi-user superposition transmissions achieve the similar average symbol error rate performances at the user in the severe channel condition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6A
• /
• pp.603-610
• /
• 2006

This paper considers the problem of mitigating CCI(Co-channel Interference) in cellular OFDMA downlink systems. The users in the cell-edge area suffer from large CCIs, and their SINR requirements are hard to be maintained. To guarantee their QoS, we propose a new exclusive sub-carrier allocation and power control algorithm. The performance of the proposed two-step algorithm is simulated in SUI-A path-loss model, and it is compared with that of the conventional algorithm. The simulation results show that the data transmission rate in the cell-edge area was increased by 600Kbps within the same power constraint. The results indicate that with proposed algorithm, the data rate stability can be achieved independently of the user location in the cell.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.750-758
• /
• 2013

In this paper, we introduce the low-density parity-check (LDPC) coded orthogonal frequency division multiplexing (OFDM) subframe reordering scheme for achieving equal combined power allocation in type I hybrid automatic repeat request (H-ARQ) systems and analyze the performance improvement by using the channel capacity. Also, it is confirmed that the layered decoding for subframe reordering scheme in H-ARQ systems gives faster convergence speed. It is verified from numerical analysis that a subframe reordering pattern having larger channel capacity shows better bit error rate (BER) performance. Therefore the subframe reordering pattern achieving equal combined power allocation for each subframe maximizes the channel capacity and outperforms other subframe reordering patterns. Also, it is shown that the subframe reordering scheme for achieving equal combined power allocation gives better performance than the conventional Chase combining scheme without increasing the decoding complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1A
• /
• pp.58-64
• /
• 2009

In this paper, we propose an dynamic random channel allocation scheme increasing probability of channel acquisition and reducing delay by limiting the number of minimum RCHs(Random CHannels) as an optimal factor $\beta$. The MAC protocol of HIPERLAN/2 is based on TDMA/TDD and MT(Mobile Terminal) can obtain chance of traffic transmission through channel competition in RCH period. And AP(Access Point) can dynamically schedule the number of RCHs based on the number of the collision in each RCH of the previous frame. Therefore, the proposed scheme increases a probability of channel acquisition and reduces delay by means of guaranteeing the number of minimum RCHs. With a practical Internet traffic, it is concluded that by the proposed scheme the delay reduction of the order of 19% and slightly better throughput are obtained compared to the conventional algorithm.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.86-87
• /
• 2007

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.156-160
• /
• 2002

In this paper, we have estimated by means of the theoretical analysis and the simulation of FCA(Fixed Channel Assignment) and CB(Channel Borrowing) in order to consider the CB as a technique to meet ducting interference from adjacent countries. Also, we assumed that the receiving power level of ducting interference with time rate can be characterized by the normal distribution due to the previous measured results, and the ducting interferences which are exceeding the reference power level can be regarded as calls. These calls can be processed by CR assignment and by which sharing channels between cells brings to us the method of meeting the ducting interference to use spectrum resources effectively. However, the spectrum frequency reusing and the interference effects between channels should be considered in CB simulation in the future.

• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.41-49
• /
• 2007

Ethernet passive optical network(EPON) is the next-generation technology for supporting services of high-quality at low-cost. In the EPON, all optical network units(ONUs) have to share a limited uplink channel for upstream data. In order to satisfy bandwidth demands of users on high-capacity local access networks(LANs), the optical line terminal(OLT) efficiently divides and allocates time slots of uplink channel to all ONUs. We discuss previous schemes for dynamic bandwidth allocation(DBA), such as interleaved polling with adaptive cycle time(IPACT) and sliding cycle time(SLICT). In this paper, dynamic right sizing of maximum-windows(DRSM), as a novel bandwidth allocation service, is proposed for more effective and efficient time slot allocation of the uplink channel. DRSM which is based on past information of bandwidth allocated by OLT calculates maximum available bandwidth and dynamically alters the maximum window size for the next ONU. This scheme does not only exert every effort to meet bandwidth demands of ONUs with the possible scope, it also seeks fairness of bandwidth allocation among ONUs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2171-2180
• /
• 1997

In this paper, we proposed a MAC protocol called P/S-DCA that using dynamci channel allocation scheme for supports the multimedia traffic in wireless ATM, and analysis theoretically the throughput and delay of up/down link according to varying the down traffic load. To evaluate and the dynamic channel allocation scheme, simulations are executed with varying down traffic load. The results are proved that system capacity is improved better than PRMA and C-PRAM. The system capacity, denoting by $M_{0.01}$, is defined as the maximum number of conversations which can be supported under constraint of packet dropping probability no more than 1%. It is shown that the values of $M_{0.01}$ for ${\lambda}_{d}=0.5,\;{\lambda}_{d}=0.2\;{\lambda}_{d}=0.1\;{\lambda}_{d}=0.001$ are about 43, 69, 77 and 83, respectively. This indicates that P/S-DCA protocol achieves a significant improvement in system capacity relative to PRMA and C-PRMA protocol.