• Title/Summary/Keyword: channel scheduling

Search Result 337, Processing Time 0.02 seconds

Grant Scheduling Method to Improve the Channel Efficiency of Ethernet Passive Optical Network

  • Lee Yutae;Chung Hae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4B
    • /
    • pp.186-191
    • /
    • 2005
  • To provide fairness among different ONUs in EPON, the upstream channel remains idle for some time after OLT receives the buffer status from all ONUs every cycle, which decreases the utilization and increases the delay. To solve this deficiency, we present a new grant scheduling method. The method consists of dividing ONUs into several sets where OLT can schedule ONUs in one set while others will be transmitting their traffic. This method will better utilize the bandwidth of EPON. The numerical results show that the larger the number of ONU sets is the smaller the minimum overhead becomes.

A MU-MIMO User Scheduling Mechanism based on Active CSI Exchange (능동적 CSI 교환을 기반으로 한 MU-MIMO 유저 스케줄링 기법)

  • Lee, Kyu-Haeng;Kim, Chong-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.41 no.4
    • /
    • pp.192-201
    • /
    • 2014
  • User scheduling boosts the Multi-User Multi-Input Multi-Output (MU-MIMO) gain by selecting an optimal set of users to increase the 802.11 Wi-Fi system capacities. Many kinds of user scheduling algorithms, however, fail to realize the advantages of MU-MIMO due to formidable Channel State Information (CSI) overhead. In this paper, we propose a user scheduling method considering such CSI exchange overhead and its MAC protocol, called ACE (Active CSI Exchange based User Scheduling for MU-MIMO Transmission). Unlike most proposals, where user scheduling is performed after an Access Point (AP) receives CSI from all users, ACE determines the best user set during the CSI exchange phase. In particular, the AP broadcasts a channel hint about previously scheduled users, and the remaining users actively send CSI reports according to their Effective Channel Gains (ECGs) calculated from the hint. Through trace-driven MATLAB simulations, we prove that the proposed scheme improves the throughput gain significantly.

On the Starvation Period of CDF-Based Scheduling over Markov Time-Varying Channels

  • Kim, Yoora
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.8
    • /
    • pp.924-927
    • /
    • 2016
  • In this paper, we consider a cumulative distribution function (CDF)-based opportunistic scheduling for downlink transmission in a cellular network consisting of a base station and multiple mobile stations. We present a closed-form formula for the average starvation period of each mobile station (i.e., the length of the time interval between two successive scheduling points of a mobile station) over Markov time-varying channels. Based on our formula, we investigate the starvation period of the CDF-based scheduling for various system parameters.

Cyclic Codebook Scheme for Coordinated Scheduling and Beamforming (협력적 스케줄링 및 빔형성을 위한 순환적 코드북 기법)

  • Kim, Seong-Hyun;Lee, Sang-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11A
    • /
    • pp.861-869
    • /
    • 2011
  • In this paper, we propose coordinated scheduling and beamforming based on limited feedback to overcome the effects of inter-cell interference in multi-cell environment. The goal of this study is to improve a performance of cell-edge area significantly affected by the inter-cell interference and also to guarantee a performance of the entire system. Existing coordinated scheduling and beamforming based on the perfect channel state information generates an overhead for the channel state information feedback and exchange at the users and base stations, respectively. In this study, first we propose a novel codebook to obtain a null space of an interference channel efficiently which can be used to reduce the inter-cell interference. Using the proposed codebook, we propose coordinated scheduling and beamforming to improve the performance of cell-edge area and the entire system. Through the proportional fair scheduling, the performance of the proposed technique is shown as improvement of channel capacity for users located cell-edge area and entire system.

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

Link Scheduling Method Based on CAZAC Sequence for Device-to-Device Communication (D2D 통신 시스템을 위한 CAZAC 시퀀스 기반 링크 스케줄링 기법)

  • Kang, Wipil;Hwang, Won-Jun;Choi, Hyung-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.4
    • /
    • pp.325-336
    • /
    • 2013
  • FlashLinQ, one of the typical D2D communication systems developed by Qualcomm, considers a single-tone communication based distributed channel-aware link scheduling method to realize the link scheduling process with low control overheads. However, considering the frequency selective fading effect of practical multi-path channel, the single-tone based SIR estimation causes a critical scheduling error problem because the received single-tone signal has quite different channel gain at each sub-carrier location. In order to overcome this problem, we propose a novel link scheduling method based on CAZAC (Constant Amplitude Zero Auto-Correlation) sequence for D2D communication system. In the proposed method, each link has a unique offset value set for the generation of CAZAC sequences. CAZAC sequences with the cyclic offsets are transmitted using multiple sub-blocks in the entire bandwidth, and then each device can obtain nearly full-band SIR using a good cyclic cross-correlation property of CAZAC sequence.

Efficient Channel Estimation and Packet Scheduling Scheme for DVB-S2 ACM Systems (DVB-S2 ACM 시스템을 위한 효율적인 채널 예측 및 패킷 스케줄링 기법)

  • Kang, Dong-Bae;Park, Man-Kyu;Chang, Dae-Ig;Oh, Deock-Gil
    • Journal of Satellite, Information and Communications
    • /
    • v.7 no.1
    • /
    • pp.65-74
    • /
    • 2012
  • The QoS guarantee for the forward link in satellite communication networks is very important because there are a variety of packets with multiplexing. Especially, the packets are processed depending on the available bandwidth in satellite network changing the wireless channel state in accordance with weather condition. The DVB-S2 increases the transmission efficiency by applying the adaptive coding and modulation (ACM) techniques as a countermeasure of rain attenuations. However, the channel estimation algorithm is required to support the ACM techniques that select the MODCOD values depending on the feedback data transmitted by RCSTs(Return Channel via Satellite Terminal) because satellite communication networks have a long propagation delay. In this paper, we proposed the channel estimation algorithm using rain attenuation values and reference data and the packet scheduling scheme to support the QoS and fairness. As a result of performance evaluation, we showed that proposed algorithm exactly predicts the channel conditions and supports bandwidth fairness to the individual RCST and guarantees QoS for user traffics.

Multi-Channel Time Division Scheduling for Beacon Frame Collision Avoidance in Cluster-tree Wireless Sensor Networks (클러스트-트리 무선센서네트워크에서 비콘 프레임 충돌 회피를 위한 멀티채널 시분할 스케줄링)

  • Kim, Dongwon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.3
    • /
    • pp.107-114
    • /
    • 2017
  • In beacon-enabled mode, beacon collision is a significant problem for the scalability of cluster-tree wireless sensor networks. In this paper, multi-channel time division scheduling (MCTS) is proposed to prevent beacon collisions and provide scalability. A coordinator broadcasts a beacon frame, including information on allocated channels and time-slots, and a new node determines its own channel and time-slot. The performance of the proposed method is evaluated by comparing the proposed approach with a typical ZigBee. MCTS prevents beacon collisions in cluster-tree wireless sensor networks. It enables large-scale wireless sensor networks based on a cluster tree to be scalable and effectively constructed.

Scheduling Scheme and Performance Analysis of IEEE802.15.4e TSCH (IEEE802.15.4e TSCH의 스케줄링 방식 및 성능분석)

  • Park, Mi-Ryong;Kim, Dongwon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.5
    • /
    • pp.43-49
    • /
    • 2017
  • In this paper, we propose the scheduling scheme of IEEE802.15.4e TSCH which is not specified in standard specification. The proposed scheme schedules the link by cooperating among the devices. A new device scans EBs(Enhanced Beacons) from network. An advertiser device broadcasts an enhanced beacon frame including links information on allocated channel offset and time-slots, and a new device can determine its own channel offset and time-slot. It's performance on maximum throughput and minimum delay is evaluated by comparing the proposed approach with a typical single channel IEEE802.15.4.

Fairness-insured Aggressive Sub-channel Allocation and Efficient Power Allocation Algorithms to Optimize the Capacity of an IEEE 802.16e OFDMA/TDD Cellular System

  • Ko, Sang-Jun;Chang, Kyung-Hi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.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.