• Journal of KIISE:Databases
• /
• v.36 no.5
• /
• pp.352-365
• /
• 2009

Recently, data access control policies have not been applied for authorized or unauthorized persons properly and information leakage incidents have occurred due to database security vulnerabilities. In the traditional database access control methods, administrators grant permissions for accessing database objects to users. However, these methods couldn't be applied for diverse access control policies to the database. In addition, another database security method which uses data encryption is difficult to utilize data indexing. Thus, this paper proposes an enhanced database access control system via a packet analysis method between client and database server in network to apply diverse security policies. The proposed security system can be applied the applications with access control policies related to specific factors such as date, time, SQL string, the number of result data and etc. And it also assures integrity via a public key certificate and MAC (Message Authentication Code) to prevent modification of user information and query sentences.

• Korean Journal of Optics and Photonics
• /
• v.23 no.4
• /
• pp.143-146
• /
• 2012

All-optical data extraction, one of the key technologies for all-optical computing and optical communication to perform add-drop, packet switching, and data reset, etc., is experimentally demonstrated by using cross-gain modulation (XGM) of semiconductor optical amplifiers (SOAs). Also, all-optical data extraction based on numerical simulation is performed by using the VPI simulation tool. In this paper, the suggested optical system based on SOAs shows the potential for high speed, and highly integrable and low power optical data computing.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1116-1121
• /
• 2019

Networking services based on the flying drones may cause many handover events because the coverage radius is narrower than that of the existing infrastructure, such as cellular networks. Therefore, it copes with frequent handover by pre-caching data to target network provider before handover using a content store. As a result of the simulation, it can be confirmed that the delay is lowered. This is because the data that was requested before the handover is delivered to the target drones, and the car that has completed the handover receives the data through the target drones. On the other hand, if the proposed method is not used, it can be confirmed that the delay is increased. This is because it can not cope with the path change due to the handover and re-sends the packet requesting the data.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.6
• /
• pp.1375-1386
• /
• 2016

This paper presents an efficient hash chain-based data authentication mechanism which can considerably reduce the overhead of processing and transmission for authenticating segments in CCN. The proposed method makes use of hash chain and MHT(Merkle Hash Tree). At first, it applies hash chain methods for data segments and encodes them to Data part. Then, it constitutes Meta part with the hash values generated at the previous step and properly applies both hash chain method and MHT-based signing for not only achieving efficiency, but also mitigating the drawback(data-loss, out-of-order transmission) of hash chain method. We have implemented our method in the CCNx library and measured the performance. When transmitting 100Mbyte of content, the proposed method generates only 2.596% of processing overhead and 1.803% of transmission overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.10
• /
• pp.1889-1899
• /
• 2015

In this paper, we propose a multiple slot reservation scheme to transmit data rapidly in the satellite random access channel. In the R-CRDSA (Reservation scheme with Contention Resolution Diversity Slotted ALOHA), each satellite terminal can use only one slot in a frame. Therefore, many slots are wasting in the low traffic load and the satellite terminals which have large date needs many frame to transmit their data although there are unused slots. In the multiple slot reservation scheme, each satellite terminal transmits a packet with their data size and reserves many slots in the light of data size and slot reservation status. Therefore, each satellite terminal transmits their data faster than R-CRDSA. This is because they can reserve many slots in a frame. Furthermore, we simulate proposed scheme and validate the performance of proposed scheme.

• Journal of Communications and Networks
• /
• v.11 no.4
• /
• pp.337-349
• /
• 2009

In this paper, we introduce a novel mobility model for mobile sinks in which the sinks move towards randomly distributed destinations, where each destination is associated with a mission. The novel mobility model is termed the random mobility with destinations. There have been many studies on mobile sinks; however, they merely support two extreme cases of sink mobility. The first case features the most common and general mobility, with the sinks moving randomly, unpredictably, and inartificially. The other case takes into account mobility only along predefined or determined paths such that the sinks can gather data from sensor nodes with minimum overhead. Unfortunately, these studies for the common mobility and predefined path mobility might not suit for supporting the random mobility with destinations. In order to support random mobility with destination, we propose a new protocol, in which the source nodes send their data to the next movement path of a mobile sink. To implement the proposed protocol, we first present a mechanism for predicting the next movement path of a mobile sink based on its previous movement path. With the information about predicted movement path included in a query packet, we further present a mechanism that source nodes send energy-efficiently their data along the next movement path before arriving of the mobile sink. Last, we present mechanisms for compensating the difference between the predicted movement path and the real movement path and for relaying the delayed data after arriving of the mobile sink on the next movement path, respectively. Simulation results show that the proposed protocol achieves better performance than the existing protocols.

• Industry Promotion Research
• /
• v.2 no.2
• /
• pp.1-6
• /
• 2017

SCADA (Supervisory Control and Data Acquisition) System was first introduced to the Seoul Electricity Authority, which manages the transportation part among the three business fields that produce, transport and supply electric power in Korea. Has been using the data link with 1200 bps and 9600 bps in 5 protocols such as HARRIS 6000, BSC, HDLC, L & N and Toshiba by configuring 3 layers of EMS, SCADA and RTU computer equipments in 1: N radial form. This paper presents the OSI standard network packet flow, analyzing DataLink and Network Layer, and presents a KEPCO SCADA network model composed of X.25 high - speed communication network using 3 layers of network. We proposed a future SCADA communication structure that improved the current SCADA communication structure, defined the SCADA DB structure, introduced the concept of the remote SCADA gateway to the SCADA functional structure, applied the standard communication protocol, Multiplexing of surveillance and control in other local facilities and ensuring communication openness.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.146-153
• /
• 2006

It is required to have researches on efficient resource allocation schemes in an integrated voice and data CDMA system with the spreading of high-speed wireless internets. In this paper, we proposed a efficient resouce allocation scheme for providing a high speed data service in an integrated CDMA system. In an integrated voice/data CDMA system, resources for voice users are allocated with high priority and residual resources are allocated to the data service. In this case, it is necessary to use a resource allocation scheme for minimizing interference. In this paper, we first explain about a interference minimizing method and define QoS requirements. Based on the method, we proposed a efficient resource allocation scheme which satisfy the QoS requirements. The proposed scheme controls the transmission rate and delay of data users with a priority information such as the number of packets in a queue. From the simulation results, we show that the proposed scheme reduce the blocking probability and delay and improve the performance.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.222-230
• /
• 2009

A sensor network is an important element of the ubiquitous and it consists of sensor fields that contain sensor nodes and sink nodes that collect data from sensor nodes. Since each sensor node has limited resources, one of the important issues covered in the past sensor network studies has been maximizing the usage of limited energy to extend network lifetime. However, most studies have only considered fixed sink nodes, which created various problems for cases with multiple mobile sink nodes. Accordingly, while maintaining routes to mobile sink nodes, this study aims to deploy the hybrid communication mode that combines single and multi-hop modes for intra-cluster and inter-cluster transmission to resolve the problem of failed data transmission to mobile sink nodes caused by disconnected routes. Furthermore, a 2-level hierarchical routing protocol was used to reduce the number of sensor nodes participating in data transmission, and cross-shape trajectory forwarding was employed in packet transmission to provide an efficient data dissemination method.

• The Journal of the Korea Contents Association
• /
• v.21 no.3
• /
• pp.68-79
• /
• 2021

On the Social Internet of Things (SIoT), social activities occur through which the vehicle generates a variety of data, shares them with other vehicles, and sends and receives feedbacks. In order to share reliable information between vehicles, it is important to determine the reliability of a vehicle. In this paper, we propose a vehicle trust evaluation scheme to share reliable information among vehicles. The proposed scheme calculates vehicle trust by considering user reputation and network trust based on inter-vehicle social behaviors. The vehicle may choose to scoring, ignoring, redistributing, etc. in the social activities inter vehicles. Thereby, calculating the user's reputation. To calculate network trust, distance from other vehicles and packet transmission rate are used. Using user reputation and network trust, local trust is calculated. It also prevents redundant distribution of data delivered during social activities. Data from the Road Side Unit (RSU) can be used to overcome local data limitations and global data can be used to calculate a vehicle trust more accurately. It is shown through various performance evaluations that the proposed scheme outperforms the existing schemes.