• Title/Summary/Keyword: Channel Allocation Algorithm

Search Result 247, Processing Time 0.025 seconds

Inter-cell DCA Algorithm for Downlink Wireless Communication Systems (하향링크 무선 통신 시스템에서의 Inter-cell DCA 알고리즘)

  • Kim, Hyo-Su;Kim, Dong-Hoi;Park, Seung-Young
    • 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.

Periodic and Pseudo-static Channel Time Allocation Scheme for IEEE 802.15.3 High-Rate Wireless PANs (IEEE 802.15.3 고속율 무선 팬을 위한 주기적인 유사 정적 채널 시간 할당 방법)

  • Kim, Sun-Myeong
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.4
    • /
    • pp.89-97
    • /
    • 2008
  • In wireless personal area networks (WPANs), the successful design of channel time allocation algorithm is a key factor in guaranteeing the various quality of service (QoS) requirements for the stringent real-time constraints of multimedia services. In this paper we propose a channel time allocation algorithm for achieving a high quality transmission and high channel error tolerance of MPEG stream in the IEEE 802.15.3 high-rate wireless PANs. Our algorithm exploits the characteristics of MPEG stream. When a new MPEG stream arrives, a DEV models it by the traffic envelope and delivers the traffic envelope to the piconet coordinator (PNC) along with the channel time request. The PNC performs channel time allocation according to the envelope. Performance of the proposed scheme is investigated by simulation and analysis. Our results show that compared to conventional scheme, the proposed scheme is very effective and provides a good performance under typical channel error conditions.

  • PDF

Adaptive Resource Allocation Algorithm for HIPERLAN/2 with Error Channel (HIPERLAN/2의 에러 채널을 위한 적응적 자원 할당 알고리즘)

  • 김창균;조광오;이정규
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.2
    • /
    • pp.1-8
    • /
    • 2004
  • In this paper, we proposed ARAHE(Adaptive Resource Allocation algorithm for HIPERLAN/2 with Error channel). It uses EIB(Error Indication Bits) for efficient resource allocation. We evaluate the performance of ARAHE by simulation and the result shows ARAHE has better performance than current method in the case of delay, utilization and TSR(Transmission Success Rate).

Efficient Optical Wavelength Allocation Algorithms for WDM Ring Networks (WDM 링망의 효율적인 광 파장 할당 알고리즘)

  • 이동춘;신승수;조용환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.6B
    • /
    • pp.645-651
    • /
    • 2002
  • This thesis describes two wavelength allocation algorithms applied to OMS (Optical Multiplex Section) or OCh (Optical Channel) SPRING (Shared Protection Ring) and compares their characteristics by simulations. Two wavelength allocation algorithms are optimal algorithm and nonblocking algorithm applicable on SPRING WDM networks. In particular, when a node is added in previous ring network, how to work for each algorithm is considered. The optimal algorithm is better than nonblocking for most of comparisons. Nonblocking algorithm has an important advantage, though. Nonblocking algorithm has no wavelength connection or allocation to reconfigure some previous connections.

Cross-Layer Resource Allocation in Multi-interface Multi-channel Wireless Multi-hop Networks

  • Feng, Wei;Feng, Suili;Zhang, Yongzhong;Xia, Xiaowei
    • ETRI Journal
    • /
    • v.36 no.6
    • /
    • pp.960-967
    • /
    • 2014
  • In this paper, an analytical framework is proposed for the optimization of network performance through joint congestion control, channel allocation, rate allocation, power control, scheduling, and routing with the consideration of fairness in multi-channel wireless multihop networks. More specifically, the framework models the network by a generalized network utility maximization (NUM) problem under an elastic link data rate and power constraints. Using the dual decomposition technique, the NUM problem is decomposed into four subproblems - flow control; next-hop routing; rate allocation and scheduling; power control; and channel allocation - and finally solved by a low-complexity distributed method. Simulation results show that the proposed distributed algorithm significantly improves the network throughput and energy efficiency compared with previous algorithms.

Universal and Can be Applied Wireless Channel Assignment Algorithm (범용 적용이 가능한 무선채널할당알고리즘)

  • Heo, Seo-Jung;Son, Dong-Cheul;Kim, Chang-Suk
    • Journal of Digital Convergence
    • /
    • v.10 no.9
    • /
    • pp.375-381
    • /
    • 2012
  • If a mobile station requests a channel allocation in its mobile networks, the switching center assigns a channel to a mobile station that belongs to each base station. There are three kinds of channel allocation schemes; a fixed channel allocation, a dynamic channel allocation and a hybrid combination of these two forms. In assigning a good frequency, it is our intention to provide quality service to our customers as well as to use resources efficiently. This paper proposes methods of assigning frequencies that minimize interference between channels and that also minimize the amount of searching time involved. In this paper, we propose an algorithm to per specific equipment, regardless of the number of channels that can be used as a general-purpose system, such as base stations, control stations, central office model is proposed, the existing operators manner similar to the fixed channel allocation based statistics and assigned when the conventional method and the improved method is proposed. Different ways and compared via simulations to verify the effectiveness of the proposed approach.

Dynamic Channel Time Allocation Scheme for Multimedia Traffic with Delay Bound in High-Rate Wireless PANs (고속율 무선 PAN에서 지연한도를 갖는 멀티미디어 트래픽을 위한 동적 채널시간할당 방법)

  • Kim Sun-Myeng;Cho Young-Jong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.11
    • /
    • pp.1-12
    • /
    • 2005
  • In wireless personal area networks(PANs), the successful design of channel time allocation algorithm is a key factor in guaranteeing the various quality of service(QoS) requirements for the stringent real-time constraints of multimedia services. In this paper we propose a dynamic channel time allocation algerian for providing delay guarantees to multimedia traffics such as MPEG streams in the IEEE 802.15.3 high-rate WPANs. The dynamic algorithm exploits the characteristics of MPEG stream, wherein the devices (DEVs) send their channel time requests only at the end of superframe boundaries. The algerian uses mini packets for feedback control in order to deliver dynamic parameters for channel time requests from the DEVs to the piconet coordinator (PNC). In this scheme, the duration of channel time allocated to a DEV during a superframe is changed dynamically depending on the MPEG frame type, traffic load and delay bound of the frame, etc. Performance of the proposed scheme is investigated by simulation. Our results show that compared to traditional scheme, the proposed scheme is very effective and has high performance while guaranteeing the delay bound.

Performance of Job scheduling Model And Channel Allocation of Cellular Network (이동망의 채널할당과 작업 스케줄링 관련 모델 및 성능분석)

  • Son, Dong-Cheul;Kim, Dong-Hyun;Ryu, Chung-Sang
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.3 no.1
    • /
    • pp.26-30
    • /
    • 2008
  • It is important matter that inflect well allocated frequency resource in cellular network and is still more serious element in environment that provide multimedia services. This paper describes model and algorithm that increase two elements that is frequency allocation and job scheduling that consider multimedia service traffic special quality by emphasis that do mapping present in CDMA cellular system. We proposed the model cpomposed three parts (channel allocation algorithm, mapping algorithm using genetic algorithm and scheduling algorithm) and simulation results.

  • PDF

An efficient channel allocation for video transmission in OFDMA systems (OFDMA 시스템에서 비디오 전송을 위한 효율적인 채널 할당)

  • Lee, Sang-Jae;Kim, Se-Heon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2007.11a
    • /
    • pp.325-329
    • /
    • 2007
  • The mobile and multimedia service on wireless network have been leaded from the improvement of telecommunication techniques. A typical multimedia service, a video transmission usually requires larger bandwidth than voice transmission. Many channel allocation algorithms for Orthogonal Frequency Division Multiple Access (OFBMA) to use resources more efficiently, Previous channel allocation algorithms have developed with an assumption that the data traffic is constant bit rate (CBR). However, existing algorithms are not suitable to video traffic because it usually generates a variable bit rate (VBR) traffic. In this paper, we proposed a new channel allocation algorithm called a queue-based channel allocation. it is more suitable to transmit the video traffics. Also, a problem are notified in case of realtime generated video traffic and a corresponding heuristic solution was proposed.

  • PDF

HMM-based Adaptive Frequency-Hopping Cognitive Radio System to Reduce Interference Time and to Improve Throughput

  • Sohn, Sung-Hwan;Jang, Sung-Jeen;Kim, Jae-Moung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.4
    • /
    • pp.475-490
    • /
    • 2010
  • Cognitive Radio is an advanced enabling technology for the efficient utilization of vacant spectrum due to its ability to sense the spectrum environment. It is important to determine accurate spectrum utilization of the primary system in a cognitive radio environment. In order to define the spectrum utilization state, many CR systems use what is known as the quiet period (QP) method. However, even when using a QP, interference can occur. This causes reduced system throughput and contrary to the basic condition of cognitive radio. In order to reduce the interference time, a frequency-hopping algorithm is proposed here. Additionally, to complement the loss of throughput in the FH, a HMM-based channel prediction algorithm and a channel allocation algorithm is proposed. Simulations were conducted while varying several parameters. The findings show that the proposed algorithm outperforms conventional channel allocation algorithms.