• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.2
• /
• pp.133-139
• /
• 2017

Vehicles have increasingly evolved and become intelligent with convergence of information and communications technologies (ICT). Vehicle communications (VC) has become one of the major necessities for intelligent vehicles. However, VC suffers from serious security problems that hinder its commercialization. Hence, the IEEE 1609 Wireless Access Vehicular Environment (WAVE) protocol defines a security service for VC. This service includes Advanced Encryption Standard-Counter with CBC-MAC (AES-CCM) for data encryption in VC. A high-speed AES-CCM crypto module is necessary, because VC requires a fast communication rate between vehicles. In this study, we propose and implement an efficient AES-CCM hardware architecture for high-speed VC. First, we propose a 32-bit substitution table (S_Box) to reduce the AES module latency. Second, we employ key box register files to save key expansion results. Third, we save the input and processed data to internal register files for secure encryption and to secure data from external attacks. Finally, we design a parallel architecture for both cipher block chaining message authentication code (CBC-MAC) and the counter module in AES-CCM to improve performance. For implementation of the field programmable gate array (FPGA) hardware, we use a Xilinx Virtex-5 FPGA chip. The entire operation of the AES-CCM module is validated by timing simulations in Xilinx ISE at a speed of 166.2 MHz.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4568-4584
• /
• 2016

Steganography based on text generation has become a hot research topic in recent years. However, current text-generation methods which generate texts of normal style have either semantic or syntactic flaws. Note that texts of special genre, such as poem, have much simpler language model, less grammar rules, and lower demand for naturalness. Motivated by this observation, in this paper, we propose a text steganography that utilizes Markov chain model to generate Ci-poetry, a classic Chinese poem style. Since all Ci poems have fixed tone patterns, the generation process is to select proper words based on a chosen tone pattern. Markov chain model can obtain a state transfer matrix which simulates the language model of Ci-poetry by learning from a given corpus. To begin with an initial word, we can hide secret message when we use the state transfer matrix to choose a next word, and iterating until the end of the whole Ci poem. Extensive experiments are conducted and both machine and human evaluation results show that our method can generate Ci-poetry with higher naturalness than former researches and achieve competitive embedding rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.12
• /
• pp.2549-2554
• /
• 2011

This paper describes on development of integrated interface and applications to support stable digital data communication service for small and midium sized crafts exploiting SSB modems and HF wireless sets. Firstly, integrated interface module between GPS (Global Positioning System) and communication devices was developed. Secondly, maritime map was implemented into a display terminal to provide location tracking service and voyage planning function. In addition, condition monitoring service of crafts and fishing report functions as well as alarm functions were developed to support secure fishery. Results of performance measure on developed application services shows that error rate was less than 3% and communication delay was shorter than 1 second when a message length was less than 1 Kbyte along with one-to-many communication type.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.2849-2865
• /
• 2012

In order to block mobile junk messages automatically, many studies on spam filters have applied machine learning algorithms. Most previous research focused only on the accuracy rate of spam filters from the view point of the algorithm used, not on individual user's preferences. In terms of individual taste, the spam filters implemented on a mobile device have the advantage over spam filters on a network node, because it deals with only incoming messages on the users' phone and generates no additional traffic during the filtering process. However, a spam filter on a mobile phone has to consider the consumption of resources, because energy, memory and computing ability are limited. Moreover, as time passes an increasing number of feature words are likely to exhaust mobile resources. In this paper we propose a spam filter model distributed between a users' computer and smart phone. We expect the model to follow personal decision boundaries and use the uniform resources of smart phones. An authorized user's computer takes on the more complex and time consuming jobs, such as feature selection and training, while the smart phone performs only the minimum amount of work for filtering and utilizes the results of the information calculated on the desktop. Our experiments show that the accuracy of our method is more than 95% with Na$\ddot{i}$ve Bayes and Support Vector Machine, and our model that uses uniform memory does not affect other applications that run on the smart phone.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.1-17
• /
• 2016

The separated management and operation of commercial IP/optical multilayer networks makes network operators look for a unified control plane (UCP) to reduce their capital and operational expenditure. Software-defined networking (SDN) provides a central control plane with a programmable mechanism, regarded as a promising UCP for future optical networks. The general control and scheduling mechanism in SDN-based optical burst switching (OBS) networks is insufficient so the controller has to process a large number of messages per second, resulting in low network resource utilization. In view of this, this paper presents the burst-flow scheduling mechanism (BFSM) with a proposed scheduling algorithm considering channel usage. The simulation results show that, compared with the general control and scheduling mechanism, BFSM provides higher resource utilization and controller performance for the SDN-based OBS network in terms of burst loss rate, the number of messages to which the controller responds, and the average latency of the controller to process a message.

• Journal of KIISE:Information Networking
• /
• v.37 no.2
• /
• pp.157-161
• /
• 2010

Vehicular Ad-hoc NETworks (VANETs) suffer from frequent network disconnections due to obstacles such as buildings even in urban environments with high density of traffic. Thus, in this paper, we propose a routing algorithm that finds optimal end-to-end paths in terms of both traffic density and distance in the urban VANET and selects the next hop with the minimum distance, while maintaining the minimum hop counts over the path. The simulation results show that the proposed algorithm achieves higher throughput and smaller end-to-end delay than Greedy Perimeter Stateless Routing (GPSR) with message carrying.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.7
• /
• pp.1518-1523
• /
• 2005

With the expansion of service over the internet, the recent network demands the amount of the more bandwidth and fast transfer rate. Optical Burst Switching has considered as a promising solution for supporting high-speed Internet Service. Because of OBS architecture, it has the security threats such as eavesdropping, masquerading, denial of service and so on. In this Paper, We analyze OBS-specific security threats and requirement for supporting security protocol n OBS networks. We propose an authentication and key exchange protocol for supporting the security service. This protocol supports explicit key authentication by using the control messages and protects the control message by using the session key.

• Journal of Korea Multimedia Society
• /
• v.14 no.11
• /
• pp.1420-1430
• /
• 2011

This paper proposes a new method to optimize energy consumption in a wireless modem by setting up a transmission power value according to the distance between nodes and circumstance in the MAC layer of IEEE 802.15.4. The proposed method can dynamically find an optimal transmission power range using the binary search scheme and minimize overhead caused by multiple message transmissions when determining the optimal transmission power. The determined transmission power is used for transmitting data packets and can be modified dynamically depending on the changes in a network environment when exchanging data packets and acknowledgement signals. The results of the simulations show 30% reduction in energy consumption while 2.5 times increase in data transmission rate per unit of energy comparing with IEEE 802.15.4 standard.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.111-120
• /
• 2005

A mobile ad-hoc network is an autonomous system of mobile nodes which are free to move around randomly and organize themselves arbitrarily, hence a routing protocol that handles the dynamic network topology changes is required for the network. In this paper we present a multi -Path on-demand routing protocol called R-DSR (Robust Dynamic Source Routing), an extension to the existing IETF protocol DSR. The proposed protocol has it that every pair of 2-hop away nodes on the single route is additionally connected via an alternative node. Throughout mathematical analysis we show the proposed protocol reveals higher message delivery rate than that of the Das's multi-path protocol, currently known as one of the most typical approaches related to DSR.

• Journal of Positioning, Navigation, and Timing
• /
• v.9 no.3
• /
• pp.237-248
• /
• 2020

GNSS has been evolving dramatically in recent years. There are currently 6 GNSS (4 GNSS, AND 2 RNSS) constellations, which are GPS (USA), GLONASS (Russia), BeiDou (China), Galileo (EU), QZSS (Japan), and IRNSS (India). The Number of navigation satellites is expected to be over 150 by 2020. As the number of both constellations and satellites used for the improvement of positioning performance, high accuracy, and robustness of precise positioning is more promising. However, a large amount of the correction messages is required to support the augmentation system for the available satellites of all the constellations. Since bandwidth for the correction messages is generally limited, sending or scheduling the correction messages might be a critical issue in the near future. In this study, we analyze the relationship between the size of the bandwidth and Real-Time Kinematics (RTK) performance. Multiple Signal Messages (MSM), the only Radio Technical Commission for Maritimes (RTCM) message that supports multi-constellation GNSS, has been used for this assessment. Instead of the conventional method that broadcasts all the messages at the same time, we assign the MSM broadcasting interval for each constellation in 5 seconds. An open sky static and dynamic test for this study was conducted on the roof of Sejong University. Our results show that the RTK fixed position accuracy is not affected by the 5-second interval corrections, but the ambiguity fixing rate is degraded for poor DOP cases when RTK correction are transmitted intermittently.