• Title/Summary/Keyword: Throughput Data

Search Result 1,386, Processing Time 0.025 seconds

An Efficient Collision Resolution Method in Wireless Sensor Networks Based on IEEE 802.15.4 Slotted CSMA/CA (IEEE 802.15.4 Slotted CSMA/CA 기반 무선 센서 네트워크의 효율적인 충돌 해결 기법)

  • Jung, Kyoung-Hak;Suh, Young-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.9
    • /
    • pp.750-759
    • /
    • 2012
  • This paper addresses the collision resolution issue to enhance the performance of wireless sensor networks based on IEEE 802.15.4 slotted CSMA/CA. Some solutions in existing work try to solve this issue by adjusting Backoff Exponent (BE) value or Backoff Period (BP). In contrast to the existing solutions, the proposed scheme in this paper aims at providing high system throughput, but also achieving efficient energy consumption of sensor nodes by using Preamble Address (PA). For this, in the proposed scheme, only one sensor node begins data packet transmission by performing PA contention phase with other nodes before sending each data packet. Our simulation results show that the proposed scheme outperforms existing algorithms in terms of energy consumption and throughput.

Efficient Implementation of a Pseudorandom Sequence Generator for High-Speed Data Communications

  • Hwang, Soo-Yun;Park, Gi-Yoon;Kim, Dae-Ho;Jhang, Kyoung-Son
    • ETRI Journal
    • /
    • v.32 no.2
    • /
    • pp.222-229
    • /
    • 2010
  • A conventional pseudorandom sequence generator creates only 1 bit of data per clock cycle. Therefore, it may cause a delay in data communications. In this paper, we propose an efficient implementation method for a pseudorandom sequence generator with parallel outputs. By virtue of the simple matrix multiplications, we derive a well-organized recursive formula and realize a pseudorandom sequence generator with multiple outputs. Experimental results show that, although the total area of the proposed scheme is 3% to 13% larger than that of the existing scheme, our parallel architecture improves the throughput by 2, 4, and 6 times compared with the existing scheme based on a single output. In addition, we apply our approach to a $2{\times}2$ multiple input/multiple output (MIMO) detector targeting the 3rd Generation Partnership Project Long Term Evolution (3GPP LTE) system. Therefore, the throughput of the MIMO detector is significantly enhanced by parallel processing of data communications.

Bioinformatics for the Korean Functional Genomics Project

  • Kim, Sang-Soo
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2000.11a
    • /
    • pp.45-52
    • /
    • 2000
  • Genomic approach produces massive amount of data within a short time period, New high-throughput automatic sequencers can generate over a million nucleotide sequence information overnight. A typical DNA chip experiment produces tens of thousands expression information, not to mention the tens of megabyte image files, These data must be handled automatically by computer and stored in electronic database, Thus there is a need for systematic approach of data collection, processing, and analysis. DNA sequence information is translated into amino acid sequence and is analyzed for key motif related to its biological and/or biochemical function. Functional genomics will play a significant role in identifying novel drug targets and diagnostic markers for serious diseases. As an enabling technology for functional genomics, bioinformatics is in great need worldwide, In Korea, a new functional genomics project has been recently launched and it focuses on identi☞ing genes associated with cancers prevalent in Korea, namely gastric and hepatic cancers, This involves gene discovery by high throughput sequencing of cancer cDNA libraries, gene expression profiling by DNA microarray and proteomics, and SNP profiling in Korea patient population, Our bioinformatics team will support all these activities by collecting, processing and analyzing these data.

  • PDF

Efficient Multicast Tree Construction in Wireless Mesh Networks

  • Nargesi, Amir-Abbas;Bag-Mohammadi, Mozafar
    • Journal of Communications and Networks
    • /
    • v.16 no.6
    • /
    • pp.613-619
    • /
    • 2014
  • Multicast routing algorithms designed for wireline networks are not suitable for wireless environments since they cannot efficiently exploit the inherent characteristics of wireless networks such as the broadcast advantage. There are many routing protocols trying to use these advantages to decrease the number of required transmissions or increase the reception probability of data (e.g., opportunistic routing).Reducing the number of transmissions in a multicast tree directly decreases the bandwidth consumption and interference and increases the overall throughput of the network. In this paper, we introduce a distributed multicast routing protocol for wireless mesh networks called NCast which take into account the data delivery delay and path length when constructing the tree. Furthermore, it effectively uses wireless broadcast advantage to decrease the number of forwarding nodes dynamically when a new receiver joins the tree.Our simulation results show that NCast improves network throughput, data delivery ratio and data delivery delay in comparison with on demand multicast routing protocol. It is also comparable with multichannel multicast even though it does not use channeling technique which eliminates the interference inherently.

Enhanced Privacy Preservation of Cloud Data by using ElGamal Elliptic Curve (EGEC) Homomorphic Encryption Scheme

  • vedaraj, M.;Ezhumalai, P.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.11
    • /
    • pp.4522-4536
    • /
    • 2020
  • Nowadays, cloud is the fastest emerging technology in the IT industry. We can store and retrieve data from the cloud. The most frequently occurring problems in the cloud are security and privacy preservation of data. For improving its security, secret information must be protected from various illegal accesses. Numerous traditional cryptography algorithms have been used to increase the privacy in preserving cloud data. Still, there are some problems in privacy protection because of its reduced security. Thus, this article proposes an ElGamal Elliptic Curve (EGEC) Homomorphic encryption scheme for safeguarding the confidentiality of data stored in a cloud. The Users who hold a data can encipher the input data using the proposed EGEC encryption scheme. The homomorphic operations are computed on encrypted data. Whenever user sends data access permission requests to the cloud data storage. The Cloud Service Provider (CSP) validates the user access policy and provides the encrypted data to the user. ElGamal Elliptic Curve (EGEC) decryption was used to generate an original input data. The proposed EGEC homomorphic encryption scheme can be tested using different performance metrics such as execution time, encryption time, decryption time, memory usage, encryption throughput, and decryption throughput. However, efficacy of the ElGamal Elliptic Curve (EGEC) Homomorphic Encryption approach is explained by the comparison study of conventional approaches.

Assessment of the Reliability of Protein-Protein Interactions Using Protein Localization and Gene Expression Data

  • Lee, Hyun-Ju;Deng, Minghua;Sun, Fengzhu;Chen, Ting
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2005.09a
    • /
    • pp.313-318
    • /
    • 2005
  • Estimating the reliability of protein-protein interaction data sets obtained by high-throughput technologies such as yeast two-hybrid assays and mass spectrometry is of great importance. We develop a maximum likelihood estimation method that uses both protein localization and gene expression data to estimate the reliability of protein interaction data sets. By integrating protein localization data and gene expression data, we can obtain more accurate estimates of the reliability of various interaction data sets. We apply the method to protein physical interaction data sets and protein complex data sets. The reliability of the yeast two-hybrid interactions by Ito et al. (2001) is 27%, and that by Uetz et at.(2000) is 68%. The reliability of the protein complex data sets using tandem affinity purification-mass spec-trometry (TAP) by Gavin et at. (2002) is 45%, and that using high-throughput mass spectrometric protein complex identification (HMS-PCI) by Ho et al. (2002) is 20%. The method is general and can be applied to analyze any protein interaction data sets.

  • PDF

System Performance Analysis on HAPS-HSDPA Mobile System (HAPS 기반의 HSDPA 시스템 성능 분석)

  • Kim, Nam-Kyeom;Sohn, In-Soo;Lee, Jin-Gu
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.6
    • /
    • pp.20-26
    • /
    • 2008
  • Today, there are many high speed data access systems that provide the truly "anytime and anywhere" services. Especially, HSDPA (High Speed Data Packet Access), one of the main third generation mobile communication systems, provides 14.4Mbps maximum data throughput. However, HSDPA will fail to provide high data throughput in hostile multipath fading environments due to lack of LOS (Line of Sight). HAPS (High Altitude Platform Station) is one of the solutions to this problem. HAPS system not only provides Los, but it can also provide high data rate services to the conventional terrestrial systems. This paper proposes HAPS-HSDPA system model and compares performance of HSDPA and HAPS-HSDPA.

QoS Fairness in Multimedia Service using Wireless LAN (무선 랜 멀티미디어 서비스의 QoS 공정성 보장)

  • Jin, Hyun-Joon;Park, Nho-Kyung
    • Journal of IKEEE
    • /
    • v.12 no.4
    • /
    • pp.196-203
    • /
    • 2008
  • The IEEE 802.11e working group has announced a new distributed MAC(Medium Access Control) called EDCA(Enhanced Distributed Channel Access) to provide service differentiation among classified traffics. In comparison with the 802.11 legacy MAC, the EDCA provides QoS mechanism by differentiated channel access which is called AC(Access Category) to the frames with different priorities. In multimedia applications, however, the EDCA has some difficulties to achieve QoS throughput because of using fixed AC parameters and never considers overall throughputs, i.e. fairness, for classified services. In this paper, AC parameter control technique is proposed to achieve overall QoS throughputs with differentiated services. The proposed technique controls AC parameters dynamically in real time. Simulation is used to verify the technique and the simulation shows that QoS fairness is improved by 13% in throughput deviation in multimedia environments including voice, video and data service.

  • PDF

Throughput Improvement and Power-Interruption Consideration of Fly-By-Wire Flight Control Computer (비행제어 컴퓨터의 Throughput 향상 및 Power-Interuption 대처 설계)

  • Lee, Cheol;Seo, Joon-Ho;Ham, Heung-Bin;Cho, In-Je;Woon, Hyung-Sik
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.35 no.10
    • /
    • pp.940-947
    • /
    • 2007
  • For the performance upgrade of a supersonic jet fighter, the processor and FLCC(Flight Control Computer) Architecture were upgraded from a baseline FLCC. Prior to the hardware implementation phase, the exact CPU throughput estimation is necessary. For this purpose, an experimental method for new FLCC throughput estimation was introduced in this study. While baseline FLCC operating, the CPU address bus was collected with logic analyzer, and then decoded to get the exact access times to each memory-memory and the number of program Instruction branches. Based on these data, a throughput test in CPU demo-board of the new FLCC configuration was performed. From test results, the CPU-Memory architecture was design-changed before FLCC hardware implementation phase. To check the flight stability degradation due to power-interrupt problem due to CPU-Memory architecture change, the piloted HILS (Hardware-In-the Loop Simulator) test was conducted.

Multiple-Class Dynamic Threshold algorithm for Multimedia Traffic (멀티미디어 트래픽을 위한 MCDT (Multiple-Class Dynamic Threshold) 알고리즘)

  • Kim, Sang-Yun;Lee, Sung-Chang;Ham, Jin-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.12
    • /
    • pp.17-24
    • /
    • 2005
  • Traditional Internet applications such as FIP and E-mail are increasingly sharing bandwidth with newer, more demanding applications such as Web browsing, IP telephony, video conference and online games. These new applications require Quality of Service (QoS), in terms of delay, loss and throughput that are different from QoS requirements of traditional applications. Unfortunately, current Active Queue Management (AQM) approaches offer monolithic best-effort service to all Internet applications regardless of the current QoS requirements. This paper proposes and evaluates a new AQM technique, called MCDT that provides dynamic and separated buffer threshold for each Applications, those are FTP and e-mail on TCP traffic, streaming services on tagged UDP traffic, and the other services on untagged UDP traffic. Using a new QoS metric, our simulations demonstrate that MCDT yields higher QoS in terms of the delay variation and a packet loss than RED when there are heavy UDP traffics that include streaming applications and data applications. MCDT fits the current best-effort Internet environment without high complexity.