• Title/Summary/Keyword: System Throughput.

Search Result 1,750, Processing Time 0.021 seconds

HSDPA Sector Throughput Analysis With Modified Link Budget (Link budget을 이용한 HSDPA 시스템의 sector throughput 분식)

  • Yi Yo-Serb;Kim Sang-Bum;Hong Dae-Hyung;Jang Byung-Lyerl;Moon Soon-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5A
    • /
    • pp.469-474
    • /
    • 2006
  • In this paper, we develop a method that derive the average sector throughput of HSDPA system. This proposed method reflects the effects of AMC, scheduling and multi-code transmission, and is performed by simple calculation procedures such as link budget analysis. Link budget table is used to estimate a cell coverage in general. We modify the link budget table in order to calculate C/I of the user according to the location of the user in CDMA packet system employing AMC. Furthermore, we utilize the proposed method to analyze the effects of scheduling and multi-code transmission.

Throughput-efficient Online Relay Selection for Dual-hop Cooperative Networks

  • Lin, Yuan;Li, Bowen;Yin, Hao;He, Yuanzhi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.6
    • /
    • pp.2095-2110
    • /
    • 2015
  • This paper presents a design for a throughput-efficient online relay selection scheme for dual-hop multi-relay cooperative networks. Problems arise with these networks due to unpredictability of the relaying link quality and high time-consumption to probe the dual-hop link. In this paper, we firstly propose a novel probing and relaying protocol, which greatly reduces the overhead of the dual-hop link estimation by leveraging the wireless broadcasting nature of the network. We then formulate an opportunistic relay selection process for the online decision-making, which uses a tradeoff between obtaining more link information to establish better cooperative relaying and minimizing the time cost for dual-hop link estimation to achieve higher throughput. Dynamic programming is used to construct the throughput-optimal control policy for a typically heterogeneous Rayleigh fading environment, and determines which relay to probe and when to transmit the data. Additionally, we extend the main results to mixed Rayleigh/Rician link scenarios, i.e., where one side of the relaying link experiences Rayleigh fading while the other has Rician distribution. Numerical results validate the effectiveness and superiority of our proposed relaying scheme, e.g., it achieves at least 107% throughput gain compared with the state of the art solution.

Aggressive Subchannel Allocation Algorithm for Optimize Transmission Efficiency Among Users in Multiuser OFDMA System (다중 사용자 OFDMA 시스템에서의 사용자간 전송효율 최적화를 위한 Aggressive Subchannel Allocation 알고리즘)

  • Ko Sang-Jun;Heo Joo;Chang Kyung-Hi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.6A
    • /
    • pp.617-626
    • /
    • 2006
  • In this paper, we propose an ASA(Aggressive Subchannel Allocation) algorithm, which is an effective dynamic channel allocation algorithm considering all user's channel state to maximize downlink sector throughput in OFDMA system. We compare an ASA algorithm with Round Robin, ACG(Amplitude Craving Greedy), RCG(Rate Craving Greedy) and GPF(General Proportional Fair) in the 2-tier environment of FRF(Frequency Reuse Factor) 1 and then analyze the performance of each algorithms, through compute simulation. Simulation results show that the proposed ASA algorithm gets 58 %, 190 %, 130 % and 8.5 % better sector throughput compared with the Round Robin, ACG, RCG and GPF respectively.

Exploiting Optimal Throughput of Adaptive Relaying Based Wireless Powered Systems under Impacts of Co-channel Interference

  • Nguyen, Thanh-Luan;Do, Dinh-Thuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.2009-2028
    • /
    • 2018
  • Considering a dual-hop energy-harvesting (EH) relaying system, this paper advocates novel relaying protocols based on adaptive time power switching-based relaying (AR) architecture for amplify-and-forward (AF) mode. We introduce novel system model relaying network with impacts of co-channel interference (CCI) and derive analytical expressions for the average harvested energy, outage probability, and the optimal throughput of the information transmission link, taking into account the effect of CCI from neighbor cellular users. In particular, we consider such neighbor users procedure CCI both on the relay and destination nodes. Theoretical results show that, in comparison with the conventional solutions, the proposed model can achieve optimal throughput efficiency for sufficiently small threshold SNR with condition of reasonable controlling time switching fractions and power splitting fractions in concerned AR protocol. We also explore impacts of transmission distances in each hop, transmission rate, the other key parameters of AR to throughput performance for different channel models. Simulation results are presented to corroborate the proposed methodology.

Throughput Analysis of an ARQ Scheme with Noisy Feedback Channel over Nakagami Fading Channel (나카가미 페이딩 채널에서 궤환채널의 잡음을 고려한 ARQ 기법의 정보전송율 분석)

  • 황재문;박진수
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.8
    • /
    • pp.1161-1168
    • /
    • 2002
  • In this paper, the throughput performance of an ARQ scheme is analyzed with noisy feedback channel, in order to exactly analysis for performance of an ARQ scheme. An ARQ mechanism is presented by state diagram, and the throughput of an ARQ scheme is mathematically derived using generation function for a signal flow graph. The channel is modeled by the Nakagami-m fading channel which is distributed over far and wide, and the throughput performance of an ARQ scheme, which is applied in BPSK and BFSK systems, according to feedback gain and fading index m is analyzed through computer simulation. In the results, It is shown conformed that the throughput of an ARQ scheme decreased according to the increase of the noise for feedback channel, but it increased according to the increase of the feedback gain and fading index m. Also, it is shown that the throughput of an ARQ scheme using BPSK system is superior to BFSK system because of the difference of bit error probability between BPSK and BFSK systems.

Flow Control Throughput Performance Improvement of Adaptive Packet Length Allocation Scheme in Wireless Data Communication System (무선 데이타 통신 시스템에서 적응패킷길이할당방식을 이용한 흐름제어 기능 개선)

  • 정기호;박종영;금홍식;이상곤;류흥균
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.2
    • /
    • pp.11-18
    • /
    • 1995
  • Error detection in ARQ(Automatic Repeat Request) protocols is very important in wireless data communication systems. The throughput efficiency of ARQ protocols can be improved by dynamically adapting the protocol packet length so that it approaches the optimum value for throuhput efficiency. In this paper, a simple and novel adaptive packet length allocation method is proposed which transmits the packets with variable length by dyanmically estimating the channel codition. The simulation results show that the average of throughput is improved by 315.4% in the stop-and-wait protocol, 41.4% in the go-back-N protocol and 155.9% in the selective repeat protocol respectively. And the throughput performances of adaptive packet length allocation method approximately approach the theoritically optimal throughput performances.

  • PDF

Dynamic Resource Allocation of Random Access for MTC Devices

  • Lee, Sung-Hyung;Jung, So-Yi;Kim, Jae-Hyun
    • ETRI Journal
    • /
    • v.39 no.4
    • /
    • pp.546-557
    • /
    • 2017
  • In a long term evolution-advanced (LTE-A) system, the traffic overload of machine type communication devices is a challenge because too many devices attempt to access a base station (BS) simultaneously in a short period of time. We discuss the challenge of the gap between the theoretical maximum throughput and the actual throughput. A gap occurs when the BS cannot change the number of preambles for a random access channel (RACH) until multiple numbers of RACHs are completed. In addition, a preamble partition approach is proposed in this paper that uses two groups of preambles to reduce this gap. A performance evaluation shows that the proposed approach increases the average throughput. For 100,000 devices in a cell, the throughput is increased by 29.7% to 114.4% and 23.0% to 91.3% with uniform and Beta-distributed arrivals of devices, respectively.

Throughput of Coded DS CDMA/Unslotted ALOHA Networks with Variable Length Data Traffic and Two User Classes in Rayleigh Fading FSMC Model

  • Tseng, Shu-Ming;Chiang, Li-Hsin;Wang, Yung-Chung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4324-4342
    • /
    • 2014
  • Previous papers analyzed the throughput performance of the CDMA ALOHA system in Rayleigh fading channel, but they assume that the channel coefficient of Rayleigh fading was the same in the whole packet, which is not realistic. We recently proposed the finite-state Markov channel (FSMC) model to the throughput analysis of DS uncoded CDMA/unslotted ALOHA networks for fixed length data traffic in the mobile environment. We now propose the FSMC model to the throughput analysis of coded DS CDMA/unslotted ALOHA networks with variable length data traffic and one or two user classes in the mobile environment. The proposed DS CDMA/unslotted ALOHA wireless networks for two user classes with access control can maintain maximum throughput for the high priority user class under high message arrival per packet duration.

Spectrum Sharing SDMA with Limited Feedback: Throughput Analysis

  • Jo, Han-Shin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.12
    • /
    • pp.3237-3256
    • /
    • 2012
  • In the context of effective usage of a scarce spectrum resource, emerging wireless communication standards will demand spectrum sharing with existing systems as well as multiple access with higher spectral efficiency. We mathematically analyze the sum throughput of a spectrum sharing space-division multiple access (SDMA) system, which forms a transmit null in the direction of other coexisting systems while satisfying orthogonal beamforming constraints. For a large number of users N, the SDMA throughput scales as log N at high signal-to-noise ratio (SNR) ((J-1) loglog N at normal SNR), where J is the number of transmit antennas. This indicates that multiplexing gain of the spectrum sharing SDMA is $\frac{J-1}{J}$ times less than that of the non-spectrum sharing SDMA only using orthogonal beamforming, whereas no loss in multiuser diversity gain. Although the spectrum sharing SDMA always has lower throughput compared to the non-spectrum sharing SDMA in the non-coexistence scenario, it offers an intriguing opportunity to reuse spectrum already allocated to other coexisting systems.

High-throughput identification of chrysanthemum gene function and expression: An overview and an effective proposition

  • Nguyen, Toan Khac;Lim, Jin Hee
    • Journal of Plant Biotechnology
    • /
    • v.48 no.3
    • /
    • pp.139-147
    • /
    • 2021
  • Since whole-genome duplication (WGD) of diploid Chrysanthemum nankingense and de novo assembly whole-genome of C. seticuspe have been obtained, they have afforded to perceive the diversity evolution and gene discovery in the improved investigation of chrysanthemum breeding. The robust tools of high-throughput identification and analysis of gene function and expression produce their vast importance in chrysanthemum genomics. However, the gigantic genome size and heterozygosity are also mentioned as the major obstacles preventing the chrysanthemum breeding practices and functional genomics analysis. Nonetheless, some of technological contemporaries provide scientific efficient and promising solutions to diminish the drawbacks and investigate the high proficient methods for generous phenotyping data obtaining and system progress in future perspectives. This review provides valuable strategies for a broad overview about the high-throughput identification, and molecular analysis of gene function and expression in chrysanthemum. We also contribute the efficient proposition about specific protocols for considering chrysanthemum genes. In further perspective, the proper high-throughput identification will continue to advance rapidly and advertise the next generation in chrysanthemum breeding.