• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11A
• /
• pp.815-821
• /
• 2009

In this paper, we propose a new type of mutually cooperative relaying (MCR) scheme based on a spatially coordinate-interleaved orthogonal design (SCID), in which two cooperative users are spatially multiplexed without bandwidth expansion. It provides not only diversity gain (with order of two) as in the existing MCR scheme, but also additional coding gain. Our simulation results demonstrate that the proposed SCID scheme is useful for improving the uplink performance as long as one user can find another active user as a close neighbor that is simultaneously communicating with the same destination, e.g., a base station in the cellular network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.2
• /
• pp.283-290
• /
• 2006

The cellular neural networks have the structure that consists of an array of the same cell which is a simple processing element, and each of the cells has local connectivity and space invariant template properties. So, it has a very suitable structure for the hardware implementation. But, it is impossible to have a one-to-one mapping between the CNN hardware processors and the pixels of the practical large image. In this paper, a $5{\times}5$ CNN hardware processor with pipeline input and output that can be applied to the time-multiplexing processing scheme, which processes the large image with a small CNN cell block, is designed. the operation of the implemented $5{\times}5$ CNN hardware processor is verified from the edge detection and the shadow detection experimentations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6A
• /
• pp.594-599
• /
• 2010

This paper studies the effect of the deployment position of the relay stations on the downlink signal-to-interference-noise-ratio (SINR) in multihop cellular networks. Two different relay deployment scenarios are considered where relay stations are located either inside cells or on the boundary among adjacent cells. The fundamental contribution is to compare fairly the average SINR between two scenarios with the proposed relay modeling framework that includes multi-cell geometries and inter-cell interferences. The mathematical results show that the SINR increases when relay stations are located inside cells because of higher received signal power.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1186-1189
• /
• 2016

A distributed uplink power control algorithm based on flocking model is proposed to improve the energy efficiency of mobiles station (MS) in cellular networks. As each bird in a flock matches its velocity with the average velocity of the adjacent birds, each MS in a cell matches its uplink rate with the average uplink rate of the co-channel MSs in adjacent cells by controlling its transmission power. Results show that the proposed algorithm effectively reduces the power consumption in the MS, while maintaining a low outage probability, which eventually improves the energy efficiency of the MS.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.5
• /
• pp.584-594
• /
• 1999

이 논문에서는 CDMA(Code Division Multiple Access)셀룰러 시스템에서 우선순위 큐(Queue)에 기반을 둔 핸드오프채널할당기법의 모델을 제안하였다. 또한 제안한 모델의 성능을 컴퓨터 시뮬레이션을 통해 비우선순위기법 및 FIFO(First In First Out)큐기법과 비교하였다. 제안하는 모델의 핸드오프 채널할당 기법에서는 이동국의 진행방향에 있는 인접 셀(Neighbor Cell)의 파일롯 중에서 임계치가 T-ADD 이상인 파일롯이 있을 경우 기지국이 이 파일롯(Pilot)에 대한 파일롯 세기 측정메시지를 이동국으로부터 수신 한 지점에서 드롭타이머가 종료된후 현재의 셀에서 사용중인 파일롯에 대한 파일롯 세기 측정 메시지를 이동국으로부터 수신한 시점까지 핸드오프 처리가능 영역으로 정의하고 이를 우선순위 큐의 최대큐 대기시간으로 사용하였다. 제안된 기법의 성능을 분석하기 위한 성능평가 척도는 강조종료확률, 호 블록킹 확률, 전체 제공 트래픽에 대한 수행 트래픽 비율, 평균 규크기미치 핸드오프 시 평균 지연시간이다. 성능시뮬레이션결과, 제안된 기법이 전체 시스템 호처리 용량면에서 약간의 단점은 발생하지만 핸드오프 처리에 있어서 높은 성능을 유지함을 알수 있었다.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.439-448
• /
• 1999

In this paper, two optimization algorithms based on artificial neural networks and genetic algorithms are proposed for cellular radio channel assignment problems. The channel assignment process is characterized as minimization of the energy function which represents constraints of the channel assignment problems. All three constraints such as the co-channel constraint, the adjacent channel constraint and the co-site channel constraint are considered. In the neural networks approach, certain techniques such as the forced assignment and the changing cell order are developed, and in the genetic algorithms approach, data structure and proper genetic operators are developed to find optimal solutions, As simulation results, the convergence rates of the two approaches are presented and compared.

• The Journal of the Korea Contents Association
• /
• v.6 no.6
• /
• pp.9-15
• /
• 2006

To obtain realistic composite performance and availability measures, one should consider performance changes that are associated with failure recovery behavior. In this paper we address two modeling approaches, exact composite and approximate, and develop SRN models for these approaches. The former approach is to combine the performance and availability models and yields accurate results but generally faces largeness problem. To avoid the problem, the two level hierarchical model is developed. The upper level model describes the failure and repair behavior of the system and the lower level captures the pure performance aspect of the system, channel allocation and service. It models guard channel and preemptive handoff scheme. As numerical results, blocking and dropping probabilities are given for new call and handoff call, respectively.

• Journal of Advanced Navigation Technology
• /
• v.23 no.4
• /
• pp.322-327
• /
• 2019

In this paper, we propose first a scheme of grouping spectrum holes that are created in the multiple channels of primary users, and then by using the scheme we enhance quality of service (QoS) of wideband cognitive radio users in cellular cognitive radio networks. In our scheme, spectrum holes created in each primary channel are predicted by Wiener prediction process, and then the predicted spectrum holes happened in the same time are grouped into a group. The wideband cognitive radio users explore the group of spectrum holes to improve their QoS. Simulation results show that their handoff calls dropping rate and initial calls blocking rate are significantly reduced in our scheme, compared to those in the single primary channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2539-2548
• /
• 2015

Overcoming inter-cell interference and spectrum scarcity are major issues in heterogeneous cellular networks. Static Frequency reuse schemes have been proposed as an effective way to manage the spectrum and reduce ICI(Inter cell Interference) in cellular networks. In a kind of static frequency reuse scheme, the allocations of transmission power and subcarriers in each cell are fixed prior to system deployment. This limits the potential performance of the static frequency reuse scheme. Also, most of dynamic frequency reuse schemes did not consider small cell and the network environment when the traffic load of each cell is heavy and non-uniform. In this paper, we propose an inter-cell resource allocation algorithm that dynamically optimizes subcarrier allocations for the multi-cell heterogeneous networks. The proposed dynamic frequency reuse scheme first finds the subcarrier usage in each cell-edge by using the exhaustive search and allocates subcarrier for all the cells except small cells. After that it allocates subcarrier for the small cell and then iteratively repeats the process. Proposed dynamic frequency reuse scheme performs better than previous frequency reuse schemes in terms of the throughput by improving the spectral efficiency due to it is able to adapt the network environment immediately when the traffic load of each cell is heavy and non-uniform.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.18 no.4
• /
• pp.171-180
• /
• 2004

CDP(handoff Call Dropping Probability) and CBP(new Call Blocking Probability) have been used as two important call level QoS parameters in cellular mobile communications. But, many methods to reduce CDP without considering CBP have been studied, and hand-off call priority scheme has been introduced. But the use of hand-off call priority scheme increases CBP and decreases channel utilization rate depending on the number of reserved channel for priority. In this paper, we propose a CAC(Call Admission Control) algorithm with overflow and preemption to solve the problem caused by considering CDP and CBP in calculation of the number of channel reserved. The problem is the increase of CDP as the traffic load increases. In our CAC algorithm, hand-off call is permitted to use(overflow) unreserved and unused channel if there is no reserved and unused channel, and new call is permitted to use(preemption) the channel overflowed by hand-off call if there is no unreserved and unused channel. This mechanism of calculation of the number of reserved channel and CAC algorithm is expected to increase channel utilization rate, and can be applied to media-based QoS provision in cellular mobile communications.