• Title/Summary/Keyword: efficient throughput

Search Result 709, Processing Time 0.028 seconds

Algorithm of Holding Time Control Using Delay-Tolerant Packet for Energy-Efficient Transmission (에너지 효율적인 전송을 위한 지연 허용 패킷의 유지시간 제어 알고리즘)

  • Ryu, Seung Min;Choi, Won Seok;Choi, Seong Gon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.4
    • /
    • pp.87-94
    • /
    • 2016
  • This paper proposes an energy transmission method to maximize energy efficiency of a based station. This method makes use of classification of service type to solve an inefficient use of transmission power, which is from exponential relationship between the legacy data throughput and transmission power. The proposed one is a way to find the most energy-efficiency points with the transmitted optimal amount of data on users in a base station of wireless network environment. For this, we propose EETA (Energy-Efficient Transmission Algorithm) which can control the amount of data and the holding time at the base station. As a result, the proposed method can improve the energy efficiency of about 10% compared to the legacy base station.

Operational Efficiency Analysis of ODCYs as Logistic Facilities in the Hinterland of Busan North Port : Based on DEA Modeling (DEA모형을 이용한 부산항 배후물류시설 ODCY의 운영효율성 분석)

  • Seo, Dong-Gyun
    • Journal of Korea Port Economic Association
    • /
    • v.27 no.4
    • /
    • pp.51-71
    • /
    • 2011
  • The purpose of this study is to use DEA modeling to make an analysis on 12 ODCYs in the hinterland of Busan North Port, so that it may propose possible ways to efficiently operate them. For analysis, this study adopted 3 input factors such as CY area, number of employees and number of cargo work equipments and also adopted 1 output factor, i.e. container throughput. According to the analysis DEA-CCR model, it was found that Chunil(YongDang CY) was the most efficient one among companies engaged in the operation of ODCY. And it was found that KCTC(YongDang CY), Kukbo(U-Am CY), KORAIL(BusanJin CY) and Hanjin (JaeSong CY) would need to boost the container throughput 5 or more times higher than current throughput with a view to improving cargo handling efficiency, while Sebang(U-Am CY), KCTC(U-Am CY), KCTC(YongDang CY), Hyopsung(YongDang CY) and Kukbo(U-Am CY) need to work on personnel restructuring targeted to current employees. Based on the analysis DEA-BCC model, it was found that Chunil(YongDang CY), Dongbu(ShinYoung GamMan CY), Intergis(GamMan CY) and Sebang(U-Am CY) were efficient companies, but KCTC(YongDang CY), Kukbo(U-Am CY), KORAIL(BusanJin CY) and Hanjin(JaeSong CY) were inefficient companies. Particularly, it was found that both KCTC(U-Am CY) and Kukbo(U-Am CY) would need to try harder to carry out personnel reshuffle than other comparable companies.

Implementation of WLAN Baseband Processor Based on Space-Frequency OFDM Transmit Diversity Scheme (공간-주파수 OFDM 전송 다이버시티 기법 기반 무선 LAN 기저대역 프로세서의 구현)

  • Jung Yunho;Noh Seungpyo;Yoon Hongil;Kim Jaeseok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.42 no.5 s.335
    • /
    • pp.55-62
    • /
    • 2005
  • In this paper, we propose an efficient symbol detection algorithm for space-frequency OFDM (SF-OFDM) transmit diversity scheme and present the implementation results of the SF-OFDM WLAN baseband processor with the proposed algorithm. When the number of sub-carriers in SF-OFDM scheme is small, the interference between adjacent sub-carriers may be generated. The proposed algorithm eliminates this interference in a parallel manner and obtains a considerable performance improvement over the conventional detection algorithm. The bit error rate (BER) performance of the proposed detection algorithm is evaluated by the simulation. In the case of 2 transmit and 2 receive antennas, at $BER=10^{-4}$ the proposed algorithm obtains about 3 dB gain over the conventional detection algorithm. The packet error rate (PER), link throughput, and coverage performance of the SF-OFDM WLAN with the proposed detection algorithm are also estimated. For the target throughput at $80\%$ of the peak data rate, the SF-OFDM WLAN achieves the average SNR gain of about 5.95 dB and the average coverage gain of 3.98 meter. The SF-OFDM WLAN baseband processor with the proposed algorithm was designed in a hardware description language and synthesized to gate-level circuits using 0.18um 1.8V CMOS standard cell library. With the division-free architecture, the total logic gate count for the processor is 945K. The real-time operation is verified and evaluated using a FPGA test system.

Common Spectrum Assignment for low power Devices for Wireless Audio Microphone (WPAN용 디지털 음향기기 및 통신기기간 스펙트럼 상호운용을 위한 채널 할당기술에 관한 연구)

  • Kim, Seong-Kweon;Cha, Jae-Sang
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.5
    • /
    • pp.724-729
    • /
    • 2008
  • This paper presents the calculation of the required bandwidth of common frequency bandwidth applying queueing theory for maximizing the efficiency of frequency resource of WPAN(Wireless Personal Area Network) based Digital acoustic and communication devices. It assumed that LBT device(ZigBee) and FH devices (DCP, RFID and Bluetooth) coexist in the common frequency band for WPAN based Digital acoustic and communication devices. Frequency hopping (FH) and listen before talk (LBT) have been used for interference avoidance in the short range device (SRD). The LBT system transmits data after searching for usable frequency bandwidth in the radio wave environment. However, the FH system transmits data without searching for usable frequency bandwidth. The queuing theory is employed to model the FH and LBT system, respectively. As a result, the throughput for each channel was analyzed by processing the usage frequency and the interval of service time for each channel statistically. When common frequency bandwidth is shared with SRD using 250mW, it was known that about 35 channels were required at the condition of throughput 84%, which was determined with the input condition of Gaussian distribution implying safety communication. Therefore, the common frequency bandwidth is estimated with multiplying the number of channel by the bandwidth per channel. These methodology will be useful for the efficient usage of frequency bandwidth.

System Throughput of Cognitive Radio Multi-hop Relay Networks (무선인지 멀티홉 릴레이 네트워크의 시스템 스루풋)

  • Hassan, I.;Rho, Chang-Bae;Song, Ju-Bin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.4
    • /
    • pp.29-39
    • /
    • 2009
  • The need for radio spectrum is recently considered as a huge hurdle towards the rapid development of wireless networks. Large parts of the spectrum are allocated to licensed radio services in proprietary way. However, enormous success of the wireless services and technologies in the unlicensed bands has brought new ideas and innovations. In recent years cognitive radio has gained much attention for solving the spectrum scarcity problem. It changes the way spectrum is regulated so that more efficient spectrum utilization is possible. Multi-hop relay technology on the other hand has intensively been studied in the area of ad hoc and peer-to-peer networks. But in cellular network, only recently the integration of multi-hop capability is considered to enhance the performance significantly. Multi-hop relaying can extend the coverage of the cell to provide high data rate service to a greater distance and in the shadowed regions. Very few papers still exist that combine these methods to maximize the spectrum utilization. Thus we propose a network architecture combining these two technologies in a way to maximize the system throughput. We present the throughput capacity equations for the proposed system model considering various system parameters like utilization factor by the primary users and primary users' transmission radius and through extensive numerical simulations we analyze the significance of work.

Parallel Rabin Fingerprinting on GPGPU for Efficient Data Deduplication (효율적인 데이터 중복제거를 위한 GPGPU 병렬 라빈 핑거프린팅)

  • Ma, Jeonghyeon;Park, Sejin;Park, Chanik
    • Journal of KIISE
    • /
    • v.41 no.9
    • /
    • pp.611-616
    • /
    • 2014
  • Rabin fingerprinting used for chunking requires the largest amount computation time in data deduplication, In this paper, therefore, we proposed parallel Rabin fingerprinting on GPGPU for efficient data deduplication. In addition, for efficient parallelism in Rabin fingerprinting, four issues are considered. Firstly, when dividing input data stream into data sections, we consider the data located near the boundaries between data sections to calculate Rabin fingerprint continuously. Secondly, we consider exploiting the characteristics of Rabin fingerprinting for efficient operation. Thirdly, we consider the chunk boundaries which can be changed compared to sequential Rabin fingerprinting when adapting parallel Rabin fingerprinting. Finally, we consider optimizing GPGPU memory access. Parallel Rabin fingerprinting on GPGPU shows 16 times and 5.3 times better performance compared to sequential Rabin fingerprinting on CPU and compared to parallel Rabin fingerprinting on CPU, respectively. These throughput improvement of Rabin fingerprinting can lead to total performance improvement of data deduplication.

Contention-Free Access Protocol Based Energy-Efficient Transmission for Wireless PANs (비경쟁 접근 프로토콜 기반 WPAN을 위한 에너지 효율적인 전송기법)

  • Joo, Yang-Ick;Lee, Yeon-Woo;Jung, Min-A;Choi, Myeong-Soo;Kim, Seo-Gyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4A
    • /
    • pp.450-457
    • /
    • 2008
  • One of very essential techniques for enlarging lifetime of energy-constrained wireless personal area network (WPAN) devices is energy-efficient transmission technique. If the WPAN is operated based on a TDMA protocol, the satisfaction of QoS requirements at each allocated time slot is another important factor to be considered. We therefore propose an energy-efficient transmission scheme for WPANs operating with a contention-free medium access protocol such as TDMA, as well as satisfying QoS requirement. The proposed algorithm determines the optimum combination of transmit power, physical data rate and fragment size required to simultaneously minimize the energy consumption and satisfy the required QoS in each assigned time duration, considering all the possible energy-minimization related parameters. The proposed algorithm demonstrated the improved performance results in terms of throughput and energy consumption via computer simulation.

Link Energy Efficiency Routing Strategy for Optimizing Energy Consumption of WBAN (WBAN의 에너지 소비 최적화를 위한 링크 에너지 효율 라우팅 전략)

  • Lee, Jung-jae
    • Journal of Internet Computing and Services
    • /
    • v.23 no.5
    • /
    • pp.1-7
    • /
    • 2022
  • IoT technology that utilizes wireless body area networks (WBAN) and biosensors is an important field in the health industry to minimize resources and monitor patients. In order to integrate IoT and WBAN, a cooperative protocol that constitutes WBAN's limited sensor nodes and rapid routing for efficient data transmission is required. In this paper we propose an we propose an energy efficient and cooperative link energy-efficient routing strategy(LEERS) to solve the problems of redundant data transmission detection and limited network sensor lifetime extention. The proposed scheme considers the hop count node congestion level towards the residual energy sink and bandwidth and parameters. In addition, by determining the path cost function and providing effective multi-hop routing, it is shown that the existing method is improved in terms of residual energy and throughput

FTCARP: A Fault-Tolerant Routing Protocol for Cognitive Radio Ad Hoc Networks

  • Che-aron, Zamree;Abdalla, Aisha Hassan;Abdullah, Khaizuran;Rahman, Md. Arafatur
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.2
    • /
    • pp.371-388
    • /
    • 2014
  • Cognitive Radio (CR) has been recently proposed as a promising technology to remedy the problems of spectrum scarcity and spectrum underutilization by enabling unlicensed users to opportunistically utilize temporally unused licensed spectrums in a cautious manner. In Cognitive Radio Ad Hoc Networks (CRAHNs), data routing is one of the most challenging tasks since the channel availability and node mobility are unpredictable. Moreover, the network performance is severely degraded due to large numbers of path failures. In this paper, we propose the Fault-Tolerant Cognitive Ad-hoc Routing Protocol (FTCARP) to provide fast and efficient route recovery in presence of path failures during data delivery in CRAHNs. The protocol exploits the joint path and spectrum diversity to offer reliable communication and efficient spectrum usage over the networks. In the proposed protocol, a backup path is utilized in case a failure occurs over a primary transmission route. Different cause of a path failure will be handled by different route recovery mechanism. The protocol performance is compared with that of the Dual Diversity Cognitive Ad-hoc Routing Protocol (D2CARP). The simulation results obviously prove that FTCARP outperforms D2CARP in terms of throughput, packet loss, end-to-end delay and jitter in the high path-failure rate CRAHNs.

An Efficient Hardware Implementation of ARIA Block Cipher Algorithm (블록암호 알고리듬 ARIA의 효율적인 하드웨어 구현)

  • Kim, Dong-Hyeon;Shin, Kyung-Wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.91-94
    • /
    • 2012
  • This paper describes an efficient implementation of ARIA crypto algorithm which is a KS (Korea Standards) block cipher algorithm. The ARIA crypto-processor supports three master key lengths of 128/192/256-bit specified in the standard. To reduce hardware complexity, a hardware sharing is employed, which shares round function in encryption/decryption module with key initialization module. It reduces about 20% of gate counts when compared with straightforward implementation. The ARIA crypto-processor is verified by FPGA implementation, and synthesized with a 0.13-${\mu}m$ CMOS cell library. It has 33,218 gates and the estimated throughput is about 640 Mbps at 100 MHz.

  • PDF