• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권4호
• /
• pp.385-398
• /
• 2009

This paper aims to find a suitable solution to joint allocation of sub-channel and transmit power for multiple users in an IEEE 802.16e OFDMA/TDD cellular system. We propose the FASA (Fairness insured Aggressive Sub-channel Allocation) algorithm, which is a dynamic channel allocation algorithm that considers all of the users' channel state information conditionally in order to maximize throughput while taking into account fairness. A dynamic power allocation algorithm, i.e., an improved CHC algorithm, is also proposed in combination with the FASA algorithm. It collects the extra downlink transmit power and re-allocates it to other potential users. Simulation results show that the joint allocation scheme with the improved CHC power allocation algorithm provides an additional increase of sector throughput while simultaneously enhancing fairness. Four frames of time delay for CQI feedback and scheduling are considered. Furthermore, by addressing the difference between uplink and downlink scheduling in an IEEE 802.16e OFDMA TDD system, we can employ the uplink channel information directly via channel sounding, resulting in more accurate uplink dynamic resource allocation.

• 한국경영과학회지
• /
• 제25권1호
• /
• pp.85-92
• /
• 2000

Channel management is critical in designing a cellular mobile system that offers high capacity and high quality. In this paper, an integrated channel management scheme is proposed, which consists of a dynamic channel allocation scheme and an admission control scheme. The dynamic channel allocation scheme allocates a call request the channel which minimizes the impact on its interfering cell, and consists of two types of channel allocation strategies : nominal channel allocation strategy and non-nominal channel allocation strategy. The admission control scheme named the variable cutoff priority scheme reserves some frequency channels for handoff cells in each cell the number of which varies according to the blocking probability of handoff class in that cell. Computationl tests are performed to evaluate the performance of the proposed scheme in terms of overall blocking probability, defined by the weighted value of the blocking probabilities of new calls and handoff calls. The results show that the proposed scheme yields better performance than other compared schemes.

• Journal of Communications and Networks
• /
• 제15권2호
• /
• pp.222-227
• /
• 2013

This paper presents an analytical framework for dynamic spectrum allocation in cognitive radio networks. We propose a distributed queuing based Markovian model each for single channel and multiple channels access for a contending user. Knowledge about spectrum mobility is one of the most challenging problems in both these setups. To solve this, we consider probabilistic channel availability in case of licensed channel detection for single channel allocation, while variable data rates are considered using channel aggregation technique in the multiple channel access model. These models are designed for a centralized architecture to enable dynamic spectrum allocation and are compared on the basis of access latency and service duration.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.74-77
• /
• 1998

We consider connection-oriented wireless cellular networks. These networks employ dedicated radio channels for the transmission of signaling information. A forward signaling channel is a common signaling channel assigned to carry the multiplexed stream of paging and channel allocation(virtual circuit allocation) packets from a base station to mobile stations. The delay levels experienced by paging and channel allocation packets have serious effect on the utilization level of the limited radio channel capacity. While a slotted mode operation is used to reduce the power consumption level at mobile stations, it may induce an increase in packet delay levels. In this paper, we thus consider a multiplexing scheme for paging and channel allocation packets under which slots are dynamically allocated for the paging packet transmission. For this dynamic scheme, we develop an analytical method for deriving the delay characteristics exhibited by paging and channel allocation packets, and investigate the effect of network parameters on the delay level by using this method.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 통신소사이어티 추계학술대회논문집
• /
• 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.

• 한국군사과학기술학회지
• /
• 제14권5호
• /
• pp.833-841
• /
• 2011

In this paper, we propose uncoordinated dynamic frequency(channel) allocation schemes based on cognitive radio in mobile cellular networks(MCNs). Under the assumptions that mobile base stations are equipped with cognitive radio(CR) function and they construct uncoordinated network, the proposed scheme enables the MCNs by suppression of successive channel switching and management of channel allocation in a dynamic and distributed manner. The proposed scheme is composed of two phase processes. In the first phase, highly orthogonal sequences are generated and assigned to mobile base stations. In the second phase, each mobile base station is allocated a channel according to the pre-assigned orthogonal sequences. Simulation results show that the number of successive spectrum switching is reduced significantly compared with the random switching scheme.

• 한국통신학회논문지
• /
• 제33권7A호
• /
• pp.693-701
• /
• 2008

주파수 재 사용률이 1인 OFDMA(Orthogonal Frequency Division Multiple Access) 시스템에서는 인접한 셀에서 동일채널을 사용하는 것은 셀 간 간섭(Inter-cell-Interference)이 발생하므로 셀 간 간섭을 최소로 하는 채널할당이 이루어져야 한다. 본 논문에서는 OFDMA환경에서 새로운 최대 CNIR(Carrier to Noise and Interference Ratio) 기반의 분산형 Inter-cell DCA (Dynamic Channel Allocation) 알고리즘을 제안한다. 제안된 Inter-cell DCA 알고리즘은 자신의 셀에서 채널할당 요구 시 자신의 셀 내에서 채널이 포화상태이거나 할당 가능한 채널이 남아 있지만 주변 셀 간섭으로 인해 기준 CNIR 문턱치 값을 만족하지 못할 경우에도 인접한 셀의 할당 가능한 채널들의 CNIR을 검색하여 최대 값을 갖는 채널을 할당하는 방법이다. 제안된 방법은 채널 할당 확률을 높여 신규호 블록율과 신규호 생성에 의한 기존채널의 강제 종료율을 동시에 감소시켜 시스템 수율을 향상시킬 수 있음을 시뮬레이션을 통해 확인하였다.

• 대한전자공학회논문지TC
• /
• 제42권11호
• /
• pp.1-12
• /
• 2005

무선 PAN에서 채널시간할당(Channel time allocation) 알고리즘은 실시간 멀티미디어 서비스가 요구하는 엄격한 QoS (Quality of Service) 요구사항을 보장하는데 있어 가장 중요한 요소 중 하나이다. 본 논문에서는 IEEE 802.15.3 고속율 무선 PAN에서 MPEG 스트림과 같은 멀티미디어 트래픽의 지연을 보장하기 위한 동적 채널시간할당 알고리즘을 제안한다. 제안된 알고리즘은 MPEG 스트림의 특성을 이용하고 DEV(Device)는 채널시간할당을 수퍼프레임(Superframe) 끝에서 PNC(Piconet coordinator)로 요청한다. 채널시간할당 요청 정보를 갖고 있는 동적 파라미터를 PNC로 전달하기 위해 미니 패킷이라는 피드 백(Feedback) 제어 패킷을 이용한다. 하나의 수퍼프레임 동안에 각 DEV에 할당될 채널시간은 MPEG 프레임 종류와 트래픽양, MPEG 프레임의 지연한도(Delay bound) 등에 따라 동적으로 변한다. 시뮬레이션을 통하여 제안된 방법의 성능을 다른 방법과 비교 분석한다. 비교 분석결과, 제안된 방법이 지연한도를 보장하면서 높은 성능을 보임을 확인하였다.

• International Journal of Contents
• /
• 제8권2호
• /
• pp.19-22
• /
• 2012

New and handoff calls control mechanisms are the key point to wireless cellular networks. In this paper, we present an adaptive algorithm for dynamic channel allocation scheme with guard channels and also with handoff calls waiting queue ensuring that handoff calls take priority over new calls. Our goal is to find better tradeoff between handoffs and new calls blocking probabilities in order to achieve more efficient channel utilization. Simpy is a Python based discrete event simulation system. We use Simpy to build our simulation models to get analytical data.

• 한국통신학회논문지
• /
• 제32권3A호
• /
• pp.247-260
• /
• 2007

본 논문에서는 802.16e OFDMA/TDD 시스템의 하향링크에서 제안된 FASA (Fairness insured Aggressive Sub-channel Allocation) 알고리즘을 적용하여 사용자에게 적절한 부채널을 할당한 후, 제안된 Improved CHC 알고리즘을 통해 적절한 전송전력을 할당하는 결합할당 알고리즘을 제안한다. FASA 알고리즘은 선택된 사용자에게 최대의 채널 이득을 보장해줄 수 있는 복수개의 부채널이 존재할 경우, 그 중 주변 사용자들에게 가장 적은 채널이득을 보장해주는 부채널을 선택된 사용자에게 할당함으로써 시스템의 Throughput을 최대화 시키는 알고리즘이다. 또한 본 논문에서 제안된 Improved CHC 알고리즘은 사용자에게 할당되는 하향링크 전송 전력 중, 잉여전력을 수거하고 재할당함으로써 시스템의 전송전력할당의 효율성을 최대화 시키는 알고리즘이다. Improved CHC 알고리즘을 통해 추가적인 Throughput 및 공평성의 향상을 얻을 수 있다.