• Title/Summary/Keyword: Channel Time Allocation

Search Result 192, Processing Time 0.025 seconds

Optimal Power Allocation for Channel Estimation of OFDM Uplinks in Time-Varying Channels

  • Yao, Rugui;Liu, Yinsheng;Li, Geng;Xu, Juan
    • ETRI Journal
    • /
    • v.37 no.1
    • /
    • pp.11-20
    • /
    • 2015
  • This paper deals with optimal power allocation for channel estimation of orthogonal frequency-division multiplexing uplinks in time-varying channels. In the existing literature, the estimation of time-varying channel response in an uplink environment can be accomplished by estimating the corresponding channel parameters. Accordingly, the optimal power allocation studied in the literature has been in terms of minimizing the mean square error of the channel estimation. However, the final goal for channel estimation is to enable the application of coherent detection, which usually means high spectral efficiency. Therefore, it is more meaningful to optimize the power allocation in terms of capacity. In this paper, we investigate capacity with imperfect channel estimation. By exploiting the derived capacity expression, an optimal power allocation strategy is developed. With this developed power allocation strategy, improved performance can be observed, as demonstrated by the numerical results.

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

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.

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.

An Efficient Channel Allocation Strategy in Wireless Multmedia Networks (무선 멀티미디어 망에서의 효율적인 채널 할당 방식)

  • 양승제;조성현박성한
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.127-130
    • /
    • 1998
  • Wireless multimedia networks require channel allocation strategies for various multimedia traffic since the mobility of users needs to be considered in addition to diversity of QoS requirements of multimedia traffic. In this paper, we propose an Efficient Channel Allocation strategy, based on prioritization of handoff calls used in Guard channel method. Gurad channels can be shared between non real time calls and real time handoff calls. To decrease the probability of handoff failure, when resources become scarce, the Call Admission Control can take some resources away from the active calls. It is shown through extensive simulations that the proposed strategy provides higher channel utilization and lower probability of handoff failure than existing strategies.

  • PDF

Dynamic Sub-carrier Multiplexed channel allocation and efficient frame distribution scheme in optical access networks (광가입자망 SCM 채널 동적할당 및 효율적 프레임 분배 방안)

  • 김남욱;윤현호;김태연;유정주;김병휘;강민호
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • 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.

  • PDF

Channel Allocation Using Mobile Station Network in Reproduction Stage (이동통신망에서 재생산 단계를 적용한 채널할당)

  • Heo, Seo-Jung;Son, Dong-Cheol;Kim, Chang-Suk
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.5
    • /
    • pp.577-582
    • /
    • 2012
  • If the mobile station requests the channel allocation in mobile networks, switching center is assigned a channel to mobile station that belong to each base station. Channel allocation schemes is a fixed channel allocation, dynamic channel allocation and a hybrid approach that combines the two forms. To assign a frequency well to use resources efficiently to provide quality service to our customers. In this paper, we proposed method to assign frequencies to minimize interference between channels and to minimizes the number of searching time. The proposed method by the genetic algorithm to improve accuracy and efficiency of the verification steps and reproduction stages were used. In addition, the proposed method by comparing with other methods showed that proposed method is better through the simulations.

Optimum Power Allocation for Distributed Antenna Systems with Large Scale Fading-only Feedback (Large Scale Fading값만을 피드백하는 분산 안테나 시스템을 위한 최적 전력 할당)

  • Lim, Dong-Ho;Choi, Kwon-Hue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.6A
    • /
    • pp.635-642
    • /
    • 2008
  • We propose the Optimum Power Allocation (OPA) scheme for Distributed Antenna Systems(DAS) in the time-varying Rayleigh fading channel. Recently, the OPA schemes which uses the Channel State Information (CSI) including a small scale (fast) fading have been proposed. However, the channel is changing vary fast over time due to small scale fading, therefore Bit Error Rate (BER) increases. Because of this reason, we derive the OPA for minimizing BER in DAS, which only uses a large scale fading to CSI and excepts a small scale fading. The simulation results show that the proposed OPA achieves better BER performance than conventional OPA considering a small scale fading in time-varying Rayleigh fading channel, and also has similar performance in Rayleigh flat-fading environment. The BER performance of proposed OPA which derived in Rayleigh fading channel is similar to minimum BER of Ricean fading channel which has small Line-of-Sight (LOS).

Downlink Power Allocation for Relay Frequency Reuse (릴레이 주파수재사용을 위한 하향링크 전력 자원 할당)

  • Oh, Chang-Yoon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.6
    • /
    • pp.98-104
    • /
    • 2012
  • We consider the optimum power allocation problem for downlink system throughput maximization in a 2 time slotted relay interference channel. Base station (BS) transmits power to Mobile Station (MS) and Relay Station (RS) in time slot 1 (orthogonal channel). In time slot 2, BS and RS transmit power to each MS, while causing cochannel interference to each other. The obtained optimum power allocation scheme allows simultaneous transmissions of BS and RS when the interference level in time slot 2 is low. However, when the interference level is high, RS shuts down its power. Numerical results are provided to support our analysis.

Dynamic Right Sizing of Maximum-windows for Efficient Bandwidth Allocation on EPON (EPON에서 효율적 대역폭 할당을 위한 최대전송윈도우 크기의 동적변화기법)

  • Lee, Sang-Ho;Lee, Tae-Jin;Chung, Min-Young;Lee, You-Ho;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.8 no.4
    • /
    • pp.41-49
    • /
    • 2007
  • Ethernet passive optical network(EPON) is the next-generation technology for supporting services of high-quality at low-cost. In the EPON, all optical network units(ONUs) have to share a limited uplink channel for upstream data. In order to satisfy bandwidth demands of users on high-capacity local access networks(LANs), the optical line terminal(OLT) efficiently divides and allocates time slots of uplink channel to all ONUs. We discuss previous schemes for dynamic bandwidth allocation(DBA), such as interleaved polling with adaptive cycle time(IPACT) and sliding cycle time(SLICT). In this paper, dynamic right sizing of maximum-windows(DRSM), as a novel bandwidth allocation service, is proposed for more effective and efficient time slot allocation of the uplink channel. DRSM which is based on past information of bandwidth allocated by OLT calculates maximum available bandwidth and dynamically alters the maximum window size for the next ONU. This scheme does not only exert every effort to meet bandwidth demands of ONUs with the possible scope, it also seeks fairness of bandwidth allocation among ONUs.

  • PDF