• Title/Summary/Keyword: channel scheduling

Search Result 337, Processing Time 0.034 seconds

The Interface Test between LEO Satellite and Ground Station (저궤도위성과 지상국 간 접속 검증 시험)

  • Kwon, Dong-Young;Jung, Ok-Chul;Kim, HeeSub
    • Aerospace Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.49-56
    • /
    • 2012
  • LEO Satellite performs the operations and missions by FSW(Flight Software) after separation from a launch vehicle. Many of the operations by FSW are automatically conducted by the algorithms of FSW. In the case of the IAC(Initial Activation and Checkout) operations, a mission scheduling, an orbit transition, etc, however, a decision and a control of the satellite operators or manufacturers are required in order to operate the satellite safely. For this, the wireless communication channel between a satellite and a ground station should be prepared to receive telemetries and to transmit tele-commands for controlling FSW properly. Therefore, the verification of the interface between KOMPSAT-3 and a ground station is essential. This verification test is named the satellite end-to-end test. In this paper, we show the design process of the satellite end-to-end test and test results.

A study on fairness packet scheduling scheme in IEEE 802.11e WLAN system (Fairness보장을 위한 IEEE 802.l1e무선 LAN패킷 스케줄링 기법 연구)

  • Jang Jae-Shin;Jeon Hyung-Ik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.9
    • /
    • pp.1551-1557
    • /
    • 2006
  • Since subscribers, who pay the same communication fees, have a strong desire to take similar services with the other users, it is an important issue to provide fairness among those subscribers wherever they are located. Therefore, in this paper we propose a QoS packet scheduler that can provide fairness among wireless LAN terminals and evaluate its performance using computer simulation. The key idea of this scheduler is to reduce the CW value of the wireless LAN terminal that has failed in sending its packets due to channel transmission error in order to offer the wireless MM terminal a higher transmission priority which is the idea of service compensation. We evaluate its performance using NS-2 network simulator, compare its numerical results to those of IEEE 802.11e without this scheme, and conclude that this scheme can reduce throughput difference between similar wireless LAN terminals.

Adaptive User Selection in Downlink Multi-User MIMO Networks (다중 사용자 및 다중 안테나 하향링크 네트워크에서 적응적 사용자 선택 기법)

  • Ban, Tae-Won;Jung, Bang Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.7
    • /
    • pp.1597-1601
    • /
    • 2013
  • Multiple antenna technique is attracting attention as a core technology for next-generation mobile communication systems to accommodate explosively increasing mobile data traffic. Especially, recent researches focus on multi-user multiple input multiple output (MU-MIMO) system where base stations are equipped with several tens of transmit antennas and transmit data to multiple terminals (users) simultaneously. To enhance the performance of MU-MIMO systems, we, in this paper, propose an adaptive user selection algorithm which adaptively selects a user set according to varying channel states. According to Monte-Carlo based computer simulations, the performance of proposed scheme is significantly improved compared to the conventional scheme without user selection and approaches that of exhaustive search-based optimal scheme. On the other hand, the proposed scheme can reduce the computational complexity to $K/(2^K-1)$ compared to the optimal scheme where K denotes the number of total users.

Efficient User Selection Algorithms for Multiuser MIMO Systems with Zero-Forcing Dirty Paper Coding

  • Wang, Youxiang;Hur, Soo-Jung;Park, Yong-Wan;Choi, Jeong-Hee
    • Journal of Communications and Networks
    • /
    • v.13 no.3
    • /
    • pp.232-239
    • /
    • 2011
  • This paper investigates the user selection problem of successive zero-forcing precoded multiuser multiple-input multiple-output (MU-MIMO) downlink systems, in which the base station and mobile receivers are equipped with multiple antennas. Assuming full knowledge of the channel state information at the transmitter, dirty paper coding (DPC) is an optimal precoding strategy, but practical implementation is difficult because of its excessive complexity. As a suboptimal DPC solution, successive zero-forcing DPC (SZF-DPC) was recently proposed; it employs partial interference cancellation at the transmitter with dirty paper encoding. Because of a dimensionality constraint, the base station may select a subset of users to serve in order to maximize the total throughput. The exhaustive search algorithm is optimal; however, its computational complexity is prohibitive. In this paper, we develop two low-complexity user scheduling algorithms to maximize the sum rate capacity of MU-MIMO systems with SZF-DPC. Both algorithms add one user at a time. The first algorithm selects the user with the maximum product of the maximum column norm and maximum eigenvalue. The second algorithm selects the user with the maximum product of the minimum column norm and minimum eigenvalue. Simulation results demonstrate that the second algorithm achieves a performance similar to that of a previously proposed capacity-based selection algorithm at a high signal-to-noise (SNR), and the first algorithm achieves performance very similar to that of a capacity-based algorithm at a low SNR, but both do so with much lower complexity.

Reliable Dynamic TDMA Scheme with new Packing method for Image Transmission over Link-16 (Link-16에서 이미지 전송을 위한 신뢰성 기반의 동적 TDMA 기법과 새로운 패킹 방법)

  • Baek, Hoki;Lim, Jaesung;Koo, Jayeul;Jin, Jeonghwan;Chun, Philseong;Oh, Ilhyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.11
    • /
    • pp.1045-1053
    • /
    • 2012
  • Link-16 is a widely used TDL (Tactical Data Link) which uses TDMA (Time Division Multiple Access). Link-16 is a very low rate system, so it supports small size of data like tactical message and voice. However, there are related works to transmit situation awareness information like image due to the increasing interest about EBO(Effect-Based Operation), recently. Special TDMA scheduling is needed not static TDMA of Link-16 for image transmission because image data has much larger size than the existing tactical data. In this paper, we proposed Link-16K which enhances the Link-16 MAC. The proposed Link-16K is compatible with Link-16, and includes dynamic TDMA, new packing method, and an efficient retransmission scheme for image transmission effectively. We can see that image transmission delay is reduced and channel utilization is increased through simulation results of proposed idea.

Moving Mass Actuated Reentry Vehicle Control Based on Trajectory Linearization

  • Su, Xiao-Long;Yu, Jian-Qiao;Wang, Ya-Fei;Wang, Lin-lin
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.14 no.3
    • /
    • pp.247-255
    • /
    • 2013
  • The flight control of re-entry vehicles poses a challenge to conventional gain-scheduled flight controllers due to the widely spread aerodynamic coefficients. In addition, a wide range of uncertainties in disturbances must be accommodated by the control system. This paper presents the design of a roll channel controller for a non-axisymmetric reentry vehicle model using the trajectory linearization control (TLC) method. The dynamic equations of a moving mass system and roll control model are established using the Lagrange method. Nonlinear tracking and decoupling control by trajectory linearization can be viewed as the ideal gain-scheduling controller designed at every point along the flight trajectory. It provides robust stability and performance at all stages of the flight without adjusting controller gains. It is this "plug-and-play" feature that is highly preferred for developing, testing and routine operating of the re-entry vehicles. Although the controller is designed only for nominal aerodynamic coefficients, excellent performance is verified by simulation for wind disturbances and variations from -30% to +30% of the aerodynamic coefficients.

Contents Scheduling Method for Push-VOD over Terrestrial DTV using Markov-Chain Modeling and Dynamic Programming Approach (마르코프 연쇄 모델링과 동적 계획 기법을 이용한 지상파 DTV 채널에서의 Push-VOD의 콘텐츠 스케줄링 방법)

  • Kim, Yun-Hyoung;Lee, Dong-Jun;Kang, Dae-Kap
    • Journal of Broadcast Engineering
    • /
    • v.15 no.4
    • /
    • pp.555-562
    • /
    • 2010
  • After starting digital terrestrial broadcasting, there have been a number oftrials to provide new services like data broadcasting on a spare bandwidth of a DTV channel. Recently, the Push-VOD service, which provides A/V contents on that bandwidth, gets more attention and is being standardized as NRT(Non-Real-Time) by ATSC. However, it is highly probable that the contents transmitted in this way contain many errors due to the DTV receiving environment. Thus, in order to improve the reliability of transmission, the contents should be transmitted repeatedly several times, considering the unidirectional property of DTV terrestrial network. In this paper, we propose a method to calculate the optimal number of repetitions to transmit each contents in a way that minimizes the number of errors occured, when trying to transmit several contents to the receiver in a restricted time, using Markov-chain modeling and dynamic programming approach.

Hierarchical-based Dynamic Bandwidth Allocation Algorithm for Multi-class Services in Ethernet PON (이더넷 PON에서 다중 클래스 서비스를 위한 계층적 구조 기반의 동적 대역 할당 알고리듬)

  • 한경은;안계현;김영천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3A
    • /
    • pp.223-232
    • /
    • 2004
  • In this paper we propose the hierarchical-based dynamic bandwidth allocation algorithm for multi-class services in Ethernet-PON. The proposed algorithm consists of the high level scheduler in OLT and the low level scheduler in ONU. The hierarchical architecture is able to provide scalability and resource efficiency in Ethernet-PON which has the distributed nature of the scheduling domain, with queues and the scheduler located at a large distance from each other. We also propose three dynamic bandwidth allocation algorithms for the low level scheduler: Proportional Allocation algorithm, Maximum Request First Allocation (MRFA) algorithm and High Priority First Allocation (HPFA) algorithm. We implement the Ethernet-PON standardized in the IEEE 802,3ah using OPNET. We also evaluate and analyze the performance for the proposed algorithms in terms of channel utilization, queuing delay and the amount of remainder.

A Channel Scheduling Scheme for Interference Avoidance in Wireless USB Systems (무선 USB 시스템에서 간섭 회피를 위한 채널 스케쥴링 기법)

  • Kim, Jin-Woo;Park, Kyung Woo;Oh, Il-Whan;Kim, Kyung-Ho;Lee, Seong Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.7
    • /
    • pp.1441-1449
    • /
    • 2015
  • Wireless universal serial bus (WUSB) is the USB technology merged with WiMedia PHY/MAC. WUSB can be applied to wireless persanal area network (WPAN) applications as well as PAN applications like wired USB. Because numerous WUSB networks operate independently for each application, data conflict can occur between adjacent networks. To avoid data conflict, the resource in a different time zone can be utilized. However, if devices in a network increase, available resources in the network decrease, and then the lack of resources necessary to provide service can occur. To solve this problem, we propose interference avoidance scheme for WUSB systems.

Enhanced Bit-Loading Techniques for Adaptive MIMO Bit-Interleaved Coded OFDM Systems (적응 다중 안테나 Bit-Interleaved Coded OFDM 시스템을 위한 향상된 Bit-Loading 기법)

  • Cho, Jung-Ho;Sung, Chang-Kyung;Moon, Sung-Hyun;Lee, In-Kyu
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.2
    • /
    • pp.18-26
    • /
    • 2009
  • When channel state information (CSI) is available at the transmitter, the system throughput can be enhanced by adaptive transmissions and opportunistic multiuser scheduling. In this paper, we consider multiple-input multiple-output (MIMO) systems employing bit-interleaved coded orthogonal frequency division multiplexing (BIC-OFDM). We first propose a bit-loading algorithm based on the Levin-Campello algorithm for the BIC-OFDM. Then we will apply this algorithm to the MIMO system with a finite set of constellations, by reassigning residual power on each stream Simulation results show that proposed bit-loading scheme which takes the residual power into account improves the system performance especially at high signal-to-noise ratio (SNR) range.