• Journal of the Korean Institute of Navigation
• /
• v.17 no.2
• /
• pp.75-106
• /
• 1993

GMDSS(Global Maritime Distress and Safety system) is a new communication system for the distress and safety at sea which is utilizing the recent advancements in satellite communication and positioning system, digital communication system, computer and microelectronic technology, etc., and will completely substitute the current communication system by 1999. Although the improvements of education for producing qualified Radio Operators as well as the establi-shments of policy for accepting the system are required, the educational institutions and relating administ-rations have not yet prepared the rational and concrete schemes on the educational methods and accepting procedures for the system. In this study, as the result of analyzing the GMDSS, courses of training and relating data, the authors suggested principles for improving the course and contents of education and rational schemes for balan-cing the demand and supply of Radio Operators. The authors expect not only the consequences of this study can be utilized as reference materials for the instruction to ratio communication in the organs of education but also that the following effects can be obtained by the study. 1. Security of distress and safety communication system at sea by the establishment of relating regula-tions. 2. Rationalization of the management of radio communication at sea and improvement of the communi-cation system on the vessel. 3. Upgrading the quality of Radio Operators and presenting schemes for current qualified persons. 4. Activation of industry producing radio instruments. 5. Balance of the demand and supply of Radio Operators and development of shipping industry.

• ETRI Journal
• /
• v.39 no.1
• /
• pp.116-123
• /
• 2017

Message-locked encryption (MLE) is a widespread cryptographic primitive that enables the deduplication of encrypted data stored within the cloud. Practical client-side contributions of MLE, however, are vulnerable to a poison attack, and server-side MLE schemes require large bandwidth consumption. In this paper, we propose a new client-side secure deduplication method that prevents a poison attack, reduces the amount of traffic to be transmitted over a network, and requires fewer cryptographic operations to execute the protocol. The proposed primitive was analyzed in terms of security, communication costs, and computational requirements. We also compared our proposal with existing MLE schemes.

• Journal of Satellite, Information and Communications
• /
• v.3 no.2
• /
• pp.48-53
• /
• 2008

In the future, satellite communication systems, such as ISDB in Japan and DVB in Europe, are required to support higher transmission date rate for providing multimedia services including HDTV, high rate data communication etc. Considering the effectiveness of OFDM technique in efficient usage of frequency bandwidth and its robustness to the multi-path fading, several OFDM based standards have been proposed for satellite communication. However, the problem of high Peak to Average Power Ratio is one of the main obstacles for the implementation of OFDM based system. Many PAPR reduction schemes have been proposed for OFDM systems. Among these, the partial transmit sequences (PTS) is attractive as they obtain better PAPR property by modifying OFDM signals without distortion. In this paper, considering the complexity issue, we present a simplified minimum maximum (minimax) criterion and Sub-Optimal PTS algorithm to optimize the phase factor. This algorithm can be dynamically made tradeoff`f between performance and complexity on demand. In addition, we integrate guided scrambling (GS) with this method. Simulation in multiple antenna based OFDM system proves that the proposed Hybrid schemes can get much more PAPR reduction and do not require transmission of side information (SI). Thus it is helpful when implementing OFDM technique in satellite communication system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.4
• /
• pp.89-96
• /
• 2016

In this paper, we study mobile data collector (MDC) based data-gathering schemes in wireless sensor networks. In Such networks, MDCs are used to collect data from the environment and transfer them to the sink. The majority of existing data-gathering schemes suffer from high data-gathering latency because they use only a single MDC. Although some schemes use multiple MDCs, they focus on maximizing network lifetime rather than minimizing packet delay. In order to address the limitations of existing schemes, this paper focuses on minimizing packet delay for given number of MDCs and minimizing the number of MDCs for a given delay bound of packets. To achieve the minimum packet delay and minimum number of MDCs, two optimization problems are formulated, and traveling distance and traveling time of MDCs are estimated. The interior-point algorithm is used to obtain the optimal solution for each optimization problem. Numerical results and analysis are presented to validate the proposed method.

• International Journal of Computer Science & Network Security
• /
• v.21 no.9
• /
• pp.1-10
• /
• 2021

The Internet of things (IoT) is the main advancement in data processing and communication technologies. In IoT, intelligent devices play an exciting role in wireless communication. Although, sensor nodes are low-cost devices for communication and data gathering. However, sensor nodes are more vulnerable to different security threats because these nodes have continuous access to the internet. Therefore, the multiparty security credential-based key generation mechanism provides effective security against several attacks. The key generation-based methods are implemented at sensor nodes, edge nodes, and also at server nodes for secure communication. The main challenging issue in a collaborative key generation scheme is the extensive multiplication. When the number of parties increased the multiplications are more complex. Thus, the computational cost of batch key and multiparty key-based schemes is high. This paper presents a Secure Multipart Key Distribution scheme (SMKD) that provides secure communication among the nodes by generating a multiparty secure key for communication. In this paper, we provide node authentication and session key generation mechanism among mobile nodes, head nodes, and trusted servers. We analyzed the achievements of the SMKD scheme against SPPDA, PPDAS, and PFDA schemes. Thus, the simulation environment is established by employing an NS 2. Simulation results prove that the performance of SMKD is better in terms of communication cost, computational cost, and energy consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3384-3400
• /
• 2021

With the advent of the data era, people pay much more attention to data corruption. Aiming at the problem that the majority of existing schemes do not support corruption detection of ciphertext data stored in cloud environment, this paper proposes a data corruption detection scheme based on ciphertexts in cloud environment (DCDC). The scheme is based on the anomaly detection method of Gaussian model. Combined with related statistics knowledge and cryptography knowledge, the encrypted detection index for data corruption and corruption detection threshold for each type of data are constructed in the scheme according to the data labels; moreover, the detection token for data corruption is generated for the data to be detected according to the data labels, and the corruption detection of ciphertext data in cloud storage is realized through corresponding tokens. Security analysis shows that the algorithms in the scheme are semantically secure. Efficiency analysis and simulation results reveal that the scheme shows low computational cost and good application prospect.

• Journal of Broadcast Engineering
• /
• v.27 no.1
• /
• pp.13-19
• /
• 2022

Video Object Segmentation (VOS) task requires an amount of labeled sequence data, which limits the performance of the current VOS methods trained with public datasets. In this paper, we propose two effective data augmentation schemes for VOS. The first augmentation method is to swap the background segment to the background from another image, and the other method is to play the sequence in reverse. The two augmentation schemes for VOS enable the current VOS methods to robustly predict the segmentation labels and improve the performance of VOS.

• ETRI Journal
• /
• v.27 no.1
• /
• pp.81-88
• /
• 2005

In this paper, interface circuits that are suitable for point-to-point interconnection with an over 1 Gbps data rate per pin are proposed. To achieve a successful data transfer rate of multi-gigabits per-second between two chips with a point-to-point interconnection, the input receiver uses an on-chip parallel terminator of the pass gate style, while the output driver uses the pullup and pulldown transistors of the diode-connected style. In addition, the novel dynamic voltage level converter (DVLC) has solved such problems as the access time increase and valid data window reduction. These schemes were adopted on a 64 Mb DDR SRAM with a 1.5 Gbps data rate per pin and fabricated using a 0.10 ${\mu}m$ dual gate oxide CMOS technology.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.502-512
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.500-500
• /
• 2002

Most of previous replication schemes assume lazy schemes, which asynchronously propagate replica updates to other nodes after the updating transaction commits. While lazy schemes are novel in the sense that they can resolve high deadlock frequencies of eager schemes, they suffer from the fact that users should be responsible for the data consistency. Recently replication schemes based on the messaging order of group communication have been studied. They can reduce the deadlock frequencies using the messaging order, but they have another problem of increasing execution overhead of aborted transactions at high degree of concurrency. This is because the sender node validates global serializability after multicasting replica update messages to other nodes. In this paper, we propose an efficient eager replication scheme for reducing the number of messaging and overhead of aborted transactions significantly. The proposed scheme validates any conflicts before multicasting and does not multicast when there is any conflict; hence, it can exploit performance improvement by alleviating the message traffic for replica update or by reducing the number of disk accesses and locking delay due to aborted transactions.