• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.8
• /
• pp.67-74
• /
• 2008

A compact and high-performance AES(Advanced Encryption Standard) encryption/decryption processor is designed by applying various hardware sharing and optimization techniques. In order to achieve minimized hardware complexity, sharing the S-Boxes for round transformation with the key scheduler, as well as merging and reusing datapaths for encryption and decryption are utilized, thus the area of S-Boxes is reduced by 25%. Also, the S-Boxes which require the largest hardware in AES processor is designed by applying composite field arithmetic on $GF(((2^2)^2)^2)$, thus it further reduces the area of S-Boxes when compared to the design based on $GF(2^8)$ or $GF((2^4)^2)$. By optimizing the operation of the 64-bit round transformation and round key scheduling, the round transformation is processed in 3 clock cycles and an encryption of 128-bit data block is performed in 31 clock cycles. The designed AES processor has about 15,870 gates, and the estimated throughput is 412.9 Mbps at 100 MHz clock frequency.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.76-89
• /
• 2014

In this paper, we propose a MAC(Media Access Control) protocol based on flexible RWT(RTS Waiting Time) for underwater mobile ad-hoc networks with a three-way handshaking mechanism. This protocol can solve a problem of collision between RTS(Request-To-Send) and CTS(Clear-To-Send) packets in existing MACA(Multiple Access with Collision Avoidance) protocol. This proposed MAC protocol is also an effective protocol which can apply to underwater mobile ad-hoc networks in a real field by using implementable technologies. We set flexible RTS Waiting Time called RWT, considering various characteristics of underwater environment. It is possible to support variable network size according to node mobility. Finally, we conduct a performance evaluation between proposed MAC protocol and existing MACA based MAC protocol through practical implementation and experiment. As a result, we verify the superiority of our proposed MAC protocol in terms of throughput, packet drop rate, average transmission time, energy consumption and channel utilization.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.8
• /
• pp.3-11
• /
• 2017

Research and development are being conducted to apply low-power Bluetooth (BLE) technology to IoT (Internet of Things) applications. The characteristic of this application environment is that many piconets can operate in the same space. Therefore, interference between homogeneous networks is likely to occur. In the BLE data channel, adaptive frequency hopping (AFH) scheme is used among the 37 frequency channels, and the master and the slave communicate while changing the carrier frequency. If there are multiple BLE piconets in the same space, there is a risk of frequency collision and packet errors will occur. In this paper, we analyze the packet collision probability due to cochannel interference in multiple asynchronous BLE piconet environments. Specifically, we analyzed packet collision probability according to the number of concurrently operating BLE piconets with the ratio of connection interval to connection event length as the main parameters. The analysis result can be used to set connection event related parameters for a desired packet collision probability according to the number of users having BLE devices in a given space.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.4
• /
• pp.168-180
• /
• 2018

Due to the spread of mobile devices and the introduction of high-quality services, mobile traffic is expected to increase sharply and overload of cellular networks is expected. D2D communication is a way to reduce the load and evolve to 5th generation. Since D2D communication directly communicates between the terminals, it can reduce the overload of the cellular network and improve energy efficiency, data rate and network performance. This paper proposes a D2D handover scheme for D2D communication in cellular networks. The cellular network is a 3GPP EPS, and the proposed D2D handover method improves the existing EPS handover process considering compatibility between existing EPS and D2D communication. We also demonstrate the superiority of the proposed handover scheme using the network simulator ns-3. Simulation results show that the proposed handover scheme is superior to existing handover methods in terms of CUE variation, packet transmission delay time, and throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12C
• /
• pp.240-248
• /
• 2001

This paper describes the design of a space-division switch which can support a self-healing operation of 2-fiber bidirectional line switched ring in 2.5Gb/s SDH-based transmission system. The switch having a 1.25Gb/s throughput has been designed and implemented with COMPASS tool and 0.87$\mu\textrm{m}$ CMOS gate-array. The proposed switch is suitable for the quickly self-healing operations when a failure occurs in a 2-fiber bidirectional switched ring composed of ADM transmission systems. The switch is composed of an add/drop control part, a cross-point switch, a frame-phase aligner, processor interface and an unequipped data framer. The test results of the switch adapted to 2.SGb/s SDH-based transmission system, show immediate restoration when a failure occurs.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.125-128
• /
• 2011

This paper describes an efficient hardware implementation of HIGHT block cipher algorithm, which was approved as standard of cryptographic algorithm by KATS(Korean Agency for Technology and Standards) and ISO/IEC. The HIGHT algorithm, which is suitable for ubiquitous computing devices such as a sensor in USN or a RFID tag, encrypts a 64-bit data block with a 128-bit cipher key to make a 64-bit cipher text, and vice versa. For area-efficient and low-power implementation, we optimize round transform block and key scheduler to share hardware resources for encryption and decryption. The HIGHT64 core synthesized using a $0.35-{\mu}m$ CMOS cell library consists of 3,226 gates, and the estimated throughput is 150-Mbps with 80-MHz@2.5-V clock.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2553-2562
• /
• 2013

It is difficult for TCP congestion control algorithm to ensure the bandwidth and delay bound required for media streaming services in broadband wireless network environments. In this paper, we propose the COIN TCP (COncave INcrease TCP) scheme for providing a high-quality media streaming services. The COIN TCP concavely increases the congestion window size by adjusting the increment rate of congestion window, that is inversely proportional to the amount of data accumulated in the router queue. As a result, our scheme can quickly occupy the available bandwidth and prevent the heavy congestion. It also improves the link utilization by adjusting the decrement rate of congestion window according to the packet loss rate with the random loss. Through the simulation results, we prove that our scheme improves the total throughput in broadband wireless network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.1
• /
• pp.35-41
• /
• 2017

To solve the shortage of radio spectrum and utilize spectrum resource more efficiently, cognitive radio technologies are proposed, and many studies on cognitive radio have been conducted. Multi-hop routing is one of the important technologies to enable the nodes to transmit data further with lower power in ad-hoc cognitive radio networks. In a multi-channel cognitive radio networks, each channel should be allocated to minimize interference to primary users. In the multi-hop routing, channel allocation should consider the inter-channel interference to maximize network throughput. In this paper, we propose multi-channel scheduling scheme which minimizes inter-channel interferences and avoids collision with primary users for the multi-hop multi-channel cognitive radio networks. The proposed scheduling is designed to determine both of routing path and channel selection. The performance of proposed channel allocation scheme is evaluated by the computer simulation in the aspect of capacity and collision rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8A
• /
• pp.830-836
• /
• 2006

One of the seminal operation parameters of AODV is the node-to-node travel time of data, which is currently set to fixed value of 40 ms in the RFC3561 and widely used to compute other parameters such as the expected round-trip time of the connection setup message, etc. We have naturally thought the network performance could be improved by dynamically varying the node-to-node travel time with respect to the traffic condition in the networt rather than using the fixed value, which motivates this work. To this end, we apply the idea of using timestamp; every node places the current time in the message before sending it out, and the receiver node computes the node travel time based on the moving average algorithm by considering not only the current value but also the previous ones in an accumulated and exponentially decreasing fashion with time. We evaluate the performance of the proposed scheme in respect of the number of RREQ messages generated, throughput, and delay as a function of traffic load and node mobility, and compare the result with the original AODV scheme. The results show that the proposed scheme presents noticeable performance improvements, expecially under the condition of high node mobility and high traffic load.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8A
• /
• pp.592-599
• /
• 2009

In this paper, we consider multiuser multi-input/multi-output antenna systems with zero-forcing receivers in downlink. In this case, to exploit multiuser diversity, spatial-division multiple access (SDMA) system allows to assign different users to a part of transmit antennas at the base station whereas spatial-division multiplexing (SDM) system assigns all antennas to single user's data stream. In this paper, we present analytical frameworks to evaluate performance of these systems. We first analyze the performance of these two systems by deriving closed-form expressions of achievable throughput. Numerical results show that the derived expressions are very tight. In addition, we approximate the capacity expression of SDM and SDMA systems and compare the SDM with the optimal case.