• Title/Summary/Keyword: efficient throughput

Search Result 709, Processing Time 0.025 seconds

ECMA-392 Cooperative MAC Protocol for QoS Guarantee in Multi-Hop Wireless Bridge in Ship Area (선박 내 멀티 홉 무선 브릿지에서 QoS 보장을 위한 ECMA-392 협력 MAC 프로토콜)

  • Lee, Seung Beom;Jeong, Hwan-Jong;Jeong, Min-A;Lee, Yeonwoo;Lee, Seong Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.12
    • /
    • pp.1289-1297
    • /
    • 2014
  • In this paper, we use the ECMA-392 standard, the first cognitive radio networks to meet the demand for IT services in the ship. We propose a ECMA-392 cooperative MAC protocol to ensure QoS to support multimedia services in the ship area in a multi-hop wireless bridge using ECMA-392 networks. Because the proposed protocol transmits directly or relay transmission by selecting efficient routes based on the information of the ECMA-392 devices, it provides communication to ensure QoS of the device. The simulation results show that the proposed cooperative MAC protocol improves a throughput of devices compared to the existing method.

Efficient Regular Expression Matching Using FPGA (FPGA를 이용한 효율적 정규표현매칭)

  • Lee, Jang-Haeng;Lee, Seong-Won;Park, Neung-Soo
    • The KIPS Transactions:PartC
    • /
    • v.16C no.5
    • /
    • pp.583-588
    • /
    • 2009
  • Network intrusion detection system (NIDS) monitors all incoming packets in the network and detects packets that are malicious to internal system. The NIDS should also have ability to update detection rules because new attack patterns are unpredictable. Incorporating FPGAs into the NIDS is one of the best solutions that can provide both high performance and high flexibility comparing with other approaches such as software solutions. In this paper we propose and design a novel approach, prefix sharing parallel pattern matcher, that can not only minimize additional resources but also maximize the processing performance. Experimental results showed that the throughput for 16-bit input is twice larger than for 8-bit input but the used LEs/Char in FPGA increases only 1.07 times.

High Throughput Screening on Angiogenesis Inhibitor and Promoter of Medicinal Plants using a Protein Microarray Chip

  • In, Dong-Su;Lee, Min-Su;Bang, Kyong-Hwan;Kim, Ok-Tae;Hyun, Dong-Yun;Ahn, Young-Sup;Cha, Seon-Woo;Seong, Nak-Sul;Kim, Eung-Youn;Shin, Yoo-Soo;Kang, In-Cheol
    • Korean Journal of Medicinal Crop Science
    • /
    • v.15 no.2
    • /
    • pp.89-94
    • /
    • 2007
  • The effects of angiogenesis inhibitor from the extract libraries of Korean and Chinese medicinal plants were investigated using a protein microarray chip. Protein chip was constructed by immobilization of integrin ${\alpha}_5{\beta}_1$ on protein chip base plates and employed far screening active extracts that inhibit the integrin-fibronectin interaction from the extract libraries. The 100 extracts of medicinal plants were obtained from extract bank of National Institute of Crop Science, RDA. The 14 extracts among 100 extract libraries were shown efficient inhibition activity for the interaction between integrin-fibronectin. The medicinal plants of 14 extracts were Vitex negundo var. incisa (Lam.) C.B. Clarke, Epimedium koreanum Nakai, Cedrela sinensis A. Juss, Ipomea aquatica Forsk, Schisandra chinensis Baill, Pulsatilla koreana Nakai, Paeonia lactiflora Pall. var.hortensis Makino, Oenothera odorata, Allium chinense, Allium victorialis var. platyphyllum MAKINO, Polygonatum odoratum Druce var. pluriflorum Ohwi, Hosta lancifolia, Agrimonia pilosa L. var. japonica Nakai and Potentilla chinensis SER. The Paeonia lactiflora, Oenothera, and Agrimonia pilosa from these 14 extracts libraries were shown strong inhibition activity of integrin ${\alpha}_5{\beta}_1$.

Comparison and Analysis of Cycling Packet Drop Algorithms and RIO as Packet Drop for the Congestion Control (혼잡제어용 패킷 폐기를 위한 사이클링 패킷 폐기 기법과 RIO 알고리즘의 비교 분석)

  • Kim, Su-Yeon;Gang, Hyeon-Guk
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.2
    • /
    • pp.59-68
    • /
    • 2002
  • In this paper, we compared and analyzed two new models of cyclic packet dropping algorithm, Adaptive Cyclic Packet Dropping algorithm (ACPD), and Non-adaptive Cyclic Packet Dropping algorithm (NCPD) with RIO. The ACPD algorithm drops adaptively packets for the congestion control, as predicting traffic pattern between each cycle. Therefore the ACPD algorithm makes up for the drawback of RIO algorithm and minimizes the wastes of the bandwidth being capable of predicting in the NCPD algorithm. We modelled two cyclic packet drop algorithms and executed a simulation and analyzed the throughput and packet drop rate based on Sending Priority changing dynamically depending on network traffic. In this algorithm, applying the strict drop precedence policy, we get better performance on priority levels. The results show that two new algorithms may provide more efficient and stricter drop precedence policy as compared to RIO independent of traffic load. The ACPD algorithm can provide better performance on priority levels and keep stricter drop policy than other algorithms.

A Design of Low Power Digital Matched Filter using Rounding for IMT-2000 Communication Systems (IMT-2000 통신시스템에서의 라운딩을 이용한 저전력 디지털 정합필터의 설계)

  • Park, Ki-Hyun;Ha, Jin-Suk;Nam, Ki-Hun;Cha, Jae-Sang;Lee, Kwang-Youb
    • Journal of IKEEE
    • /
    • v.8 no.1 s.14
    • /
    • pp.145-151
    • /
    • 2004
  • For wide-band spread spectrum communication systems such as IMT-2000, a digital matched filter is a key device for rapid spreading code synchronization. Although a digital matched filter can be implemented easily, large power consumption at the higher chip rate and large summation delay of longer chip length are the bottleneck of practical use. In this paper, we propose a optimized partial correlation digital matched filter structure which can be constructed of the so-called generalized hierarchical Golay sequence. a partial correlation structure can reduce the number of correlators, but enlarge the size of flip-flops. In this paper, The proposed approach focuses on efficient circuit size, power dissipation, maintaining the operating throughput. A proposed digital matched filter reduce the size of flip-flops by rounding method. and it reduces about 45 percentages of power dissipation and chip area as compared with digital matched filter which is not rounded. rounding. The proposed architecture was verified by using Xilinx FPGA.

  • PDF

UTrustDisk: An Efficient Data Protection Scheme for Building Trusted USB Flash Disk

  • Cheng, Yong;Ma, Jun;Ren, Jiangchun;Mei, Songzhu;Wang, Zhiying
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.2276-2291
    • /
    • 2017
  • Data protection of removable storage devices is an important issue in information security. Unfortunately, most existing data protection mechanisms are aimed at protecting computer platform which is not suitable for ultra-low-power devices. To protect the flash disk appropriately and efficiently, we propose a trust based USB flash disk, named UTrustDisk. The data protection technologies in UTrustDisk include data authentication protocol, data confidentiality protection and data leakage prevention. Usually, the data integrity protection scheme is the bottleneck in the whole system and we accelerate it by WH universal hash function and speculative caching. The speculative caching will cache the potential hot chunks for reducing the memory bandwidth pollution. We adopt the symmetric encryption algorithm to protect data confidentiality. Before mounting the UTrustDisk, we will run a trusted virtual domain based lightweight virtual machine for preventing information leakage. Besides, we prove formally that UTrustDisk can prevent sensitive data from leaking out. Experimental results show that our scheme's average writing throughput is 44.8% higher than that of NH scheme, and 316% higher than that of SHA-1 scheme. And the success rate of speculative caching mechanism is up to 94.5% since the access pattern is usually sequential.

A traffic control system to manage bandwidth usage in IP networks supporting Differentiated Service (차별화서비스를 제공하는 IP네트워크에서 대역폭관리를 위한 트래픽 제어시스템)

  • 이명섭;박창현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.3B
    • /
    • pp.325-338
    • /
    • 2004
  • As the recent rapid development of internet technology and the wide spread of multimedia communication, massive increase of network traffic causes some problems such as the lack of network paths and the bad quality of service. To resolve these problems, this paper presents a traffic control agent that can perform the dynamic resource allocation by controlling traffic flows on a DiffServ network. In addition, this paper presents a router that can support DiffServ on Linux to support selective QoS in IP network environment. To implement a method for selective traffic transmission based on priority on a DiffServ router, this paper changes the queuing discipline in Linux, and presents the traffic control agent so that it can efficiently control routers, efficiently allocates network resources according to service requests, and relocate resources in response to state changes of the network. Particularly for the efficient processing of Assured Forwarding(AF) Per Hop Behavior(PHB), this paper proposes an ACWF$^2$Q$^{+}$ packet scheduler on a DiffServ router to enhance the throughput of packet transmission and the fairness of traffic services.s.

Wireless Internet DiffServ Packet Scheduling Algorithm over Wireless Networks with Location-dependent Channel Errors (위치 종속적 채널 에러 특성을 갖는 무선망에서 인터넷 DiffServ QoS 제공을 위한 패킷 스케줄링 알고리즘)

  • 신강식;유상조
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.12
    • /
    • pp.46-58
    • /
    • 2003
  • The recent Internet is changing from its best-effort service and needs the network structure and traffic engineering, which can support various applications requiring differentiated traffic processing and high quality of service. The extension of the Internet from wired to wireless system generating location-dependent and burst errors make more difficult to support a good service with the existing packet scheduling algorithm. In this paper, we propose a wireless diffserv packet scheduling (WDSPS) algorithm that can provide reliable service in the differentiated wireless internet service network. The proposed scheduling algorithm solves the HOL(head of line) blocking problems of class queue occurred in wireless network, supports the differentiated service for each class which is defined in differentiated service networks and makes possible the gradual and efficient service compensation not only among classes but also among flows to prevent the monopoly of one class or one flow. Through simulations, we show that our proposed WDSPS scheduling algorithm can provide the required QoS differentiation between classes and enhance the service throughput in various wireless network conditions.

Improvement of MAC Protocol to Reduce the Delay Latency in Real-Time Wireless Sensor Networks (실시간 무선 센서 네트워크에서 전송 지연 감소를 위한 MAC 개선 방안)

  • Jang, Ho;Jeong, Won-Suk;Lee, Ki-Dong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.8A
    • /
    • pp.600-609
    • /
    • 2009
  • The traditional carrier sense multiple access (CSMA) protocol like IEEE 802.11 Distributed Coordination Function (DCF) does not handle the constraints adequately, leading to degraded delay latency and throughput as the network scales are enlarged. We present more efficient method of a medium access for real-time wireless sensor networks. Proposed MAC protocol is like the randomized CSMA protocol, but unlike previous legacy protocols, it does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports, we carefully decide to select a fixed-size contention window with non-uniform probability distribution of transmitting in each slot. We show that the proposed method can offer up to severaansimes latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using widely using network simulation package,caS-2. We finally show that proposed MAC scheme comes close to meet bounds on the best latency being achieved by a decentralized CSMA-based MAC protocol for real-time wireless sensor networks which is sensitive to delay latency.

Performance Evaluation of Turbo Codes by Soft Detection Metrics of STBC over an IEEE 802.16e Link (IEEE 802.16e 링크에서 시공간 블록 부호의 연판정 검출에 따른 터보 부호의 성능평가)

  • Kim, Young-Min;Kim, Soo-Young;Lim, Kwang-Jae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.2
    • /
    • pp.1-8
    • /
    • 2010
  • Multi antenna techniques using space-time codes can achieve diversity gains in a multi-path environment without additional bandwidth requirement. Most of the 4G candidate standards including the IEEE 802.16e adopt multi-input multi-output (MIMO) schemes to achieve either high throughput performance or diversity gains. In these 4G candidate standards, turbo codes using an iterative decoder with soft input soft output are used to overcome serious channel fading. For this reason, the estimated signal values from MIMO detectors should be soft decision detection values. In this paper, we propose efficient methods to estimate soft decision detection values for various space time coding schemes, and provide the simulation results of turbo coded space time coding scheme over an IEEE 802.16e link.