• Title/Summary/Keyword: Data Throughput

Search Result 1,378, Processing Time 0.035 seconds

A Study on the Data Throughput of ALOHA and Slotted-ALOHA Method in an RFID System (무선인식 시스템에서의 알로하 기법과 슬롯-알로하 기법의 데이터 처리량에 관한 연구)

  • Yun Shang-Moon;Lee Key-Sea
    • Proceedings of the KSR Conference
    • /
    • 2003.10c
    • /
    • pp.594-599
    • /
    • 2003
  • This paper proposed to compare and analyze the data throughput of ALOHA and Slotted-ALOHA method which were used to the communication of satellites in an early stage and apply to the data throughput of a transponder in an RFID system. The ALOHA method is the operation priority to a transponder but the Slotted ALOHA method is the operation priority to an reader in an RFID system. Because ALOHA method transmits the data to an reader as a authority of a transponder at random time when generating collisions, therefore, it seems reasonable to conclude that ALOHA method is inefficient for the data throughput and the efficiency of collision interval than Slotted-ALOHA method that synchronizes and controls the transponder in an reader.

  • PDF

Snowball Scheme: An Alternative Admission Control Scheme for 3GPP ARQ (Snowball 방식: 3GPP ARQ를 위한 대체 수락 제어 방식)

  • Shin, Woo-Cheol;Park, Jin-Kyung;Ha, Jun;Choi, Cheon-Won
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.8
    • /
    • pp.51-61
    • /
    • 2007
  • For provisioning reliable data transmission, the 3GPP RLC specification adopted a selective-repeat ARQ scheme assisted by a window-based admission control scheme. In the 3GPP ARQ, which is a member of the selective-repeat ARQ clan, inheres the reordering problem A long and irregular reordering time results in the degradation of throughput and delay performance, and may incur the overflow of the reordering buffer. Furthermore, the reordering time must be regulated to meet the requirements of some services which are loss-sensitive and delay-sensitive as well. Perceiving the reordering hazard, we propose an alternative, identified as snowball scheme, to the original admission control scheme of the 3GPP ARQ with aiming at deflating the occupancy of the reordering buffer. A unique feature of the snowball scheme is to reject a new DATA PDU if it is non-adjacent to any DATA PDU sojourning at the reordering buffer. Such an intentional rejection apparently reduces the occupancy of the reordering buffer while it may deteriorate the throughput and delay performance. Developing an analytical approximation method, we investigate the effect of snowball scheme on the saturated occupancy and throughput. Also, we, using a simulation method, evaluate the peak occupancy, normalized throughput and average delay in the practical environment. From the simulation results, we reveal that the snowball scheme is able to enhance occupancy performance as well as throughput performance compared with the original admission control scheme of the 3GPP ARQ.

Network Coding-based Maximum Lifetime Algorithm for Sliding Window in WSNs

  • Sun, Baolin;Gui, Chao;Song, Ying;Chen, Hua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.3
    • /
    • pp.1298-1310
    • /
    • 2019
  • Network coding (NC) is a promising technology that can improve available bandwidth and packet throughput in wireless sensor networks (WSNs). Sliding window is an improved technology of NC, which is a supplement of TCP/IP technology and can improve data throughput and network lifetime on WSNs. This paper proposes a network coding-based maximum lifetime algorithm for sliding window in WSNs (NC-MLSW) which improves the throughput and network lifetime in WSN. The packets on the source node are sent on the WSNs. The intermediate node encodes the received original packet and forwards the newly encoded packet to the next node. Finally, the destination node decodes the received encoded data packet and recovers the original packet. The performance of the NC-MLSW algorithm is studied using NS2 simulation software and the network packet throughput, network lifetime and data packet loss rate were evaluated. The simulations experiment results show that the NC-MLSW algorithm can obviously improve the network packet throughput and network lifetime.

DCF Throughput Analysis of the MAC Layer in the IEEE 802.11 Wireless LAN (IEEE 802.11a 무선 LAN의 MAC 계층DCF 처리율 분석)

  • Jung, Jin-Wook;Ha, Eun-Sil;Lee, Ha-Chul
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.4
    • /
    • pp.509-515
    • /
    • 2005
  • This paper explores the throughput of DCF protocol with both the traffic intensity and MSDU size at the MAC layer in the 802.11a wireless LAN. By exploring the throughput of DCF protocol with the data rate of 6Mbps, 12 Mbps, 24 Mbps and 54 Mbps, we find the fact that the less the data rate be, the higher the throughput be. We also find, from the throughput calculation by means of traffic intensity and MSDU size, that the longer the MSDU size is, the higher the throughput is. We also found the traffic intensity that the throughput is at the maximum point with the fixed MSDU size.

  • PDF

Elementary MAC Scheme Based on Slotted ALOHA for Wireless Passive Sensor Networks (무선 수동형 센서 망을 위한 Slotted ALOHA 기반의 기본적인 MAC 방식)

  • Choi, Cheon Won;Seo, Heewon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.4
    • /
    • pp.20-26
    • /
    • 2016
  • A wireless passive sensor network is a network which, by letting RF sources supply energy to sensor nodes, is - at least theoretically - able to live an eternal life without batteries. Due to the technological immaturity, however, a wireless passive sensor network still has many difficulties; energy scarcity, non-simultaneity of energy reception and data transmission and inefficiency in data transmission occurring at sensor nodes. Considering such practical constraints, in this paper, we propose an elementary MAC scheme supporting many sensor nodes to deliver packets to a sink node. Based on a time structure in which a charging interval for charging capacitors by using received and an acting interval for communicating with a sink node are alternately repeated, the proposed MAC scheme delivers packets to a sink node according to slotted ALOHA. In general, a contention-type scheme tends to exhibit relatively low throughput. Thus, we multilaterally evaluate the throughput performance achieved by the proposed MAC scheme using a simulation method. Simulation results show that the network-wide throughput performance can be enhanced by properly setting the length of acting interval.

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

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.

Coverage Extension of Non-transparent Mode in IEEE 802.16j Mobile Multi-hop Relay Networks (IEEE 802.16j MMR 네트워크에서 Non-transparent 모드의 커버리지 확대)

  • Lee, Ju-Ho;Lee, Goo-Yeon;Jeong, Choong-Kyo
    • Journal of Industrial Technology
    • /
    • v.32 no.A
    • /
    • pp.3-8
    • /
    • 2012
  • In IEEE 802.16j standard document, two modes about usage of RS are proposed; one is transparent mode to enhance data throughput and the other is non-transparent mode to extend coverage. In this paper, we focus on non-transparent mode and find that the mode also affects data throughput. We analyze data throughput on various RS topology and their extended coverage area in non-transparent mode. From the analysis, we see that higher throughput can be obtained when MR-BS and RS are located distantly.

  • PDF

Differentiated Control of Power and Spreading Gain in CDMA Data Service Networks (CDMA 데이터 서비스망의 전력 및 확산 이득 차별제어)

  • 정광섭;박은영;강병호;신한섭;홍순목
    • Proceedings of the IEEK Conference
    • /
    • 2002.06a
    • /
    • pp.73-76
    • /
    • 2002
  • In this paper, we consider an algorithm for effectively providing data services for mobile users with different levels of priorities in a DS-CDMA system. The priority level of a user is specified by a factor that is a weighting on the instantaneous data throughput of the user. We define tile weighted instantaneous aggregate data throughput and use it to characterize the performance of the prioritized data service. Our prioritized data service is implemented so that the weighted instantaneous aggregate data throughput is maximized via efficient power and spreading gain allocation. We present efficient algorithms for computing tile optimal power and spreading gain allocation.

  • PDF

A Study on The Throughput Improvement of Go-Back-N AR in digital Data Transmission (디지털 데이터 전송에서의 G-Back-N-ARQ 방식에 대한 Throughput 효율개선에 관 한 연구)

  • 송평중;한영열
    • Proceedings of the Korean Institute of Communication Sciences Conference
    • /
    • 1982.10a
    • /
    • pp.37-39
    • /
    • 1982
  • In this paper, we deal with theoretical tools to improve the throughput efficiency of the conventional Go-Back-N ARQ system by performing block retransmission efficiently under high error rate, and two variations of the system is proposed.

  • PDF