• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4C
• /
• pp.581-593
• /
• 2004

The interest in wireless LAN security is on the increase owing to a role of high-speed wireless Internet infrastructure of wireless LAN. Wi-Fi has released WPA standard in order to overcome drawbacks of WEP algorithm that is security element of current IEEE 802.11-based wireless LAN system. Pairwise key management and group key management in a mixed-mode which supports both terminals running WPA and terminals running original WEP security are very complicate. In this paper, we analyze flaws in WPA authenticator key management state machine for key distribution and propose the countermeasures to overcome the analyzed problems. Additionally, WPA authenticator key management state machine to which the solutions are applied is described. The reconstructed WPA authenticator key management state machine helps the AP perform efficiently group key exchange and group key update in the mixed-mode.

• Journal of the Korea Society for Simulation
• /
• v.20 no.4
• /
• pp.149-155
• /
• 2011

This paper presents simulations of advance evacuation analysis using a cellular automata model for passenger behavior in an emergency of passenger ship. The proposed cellular automata model divides the space in a uniform grid called "cell." Each passenger is located in a cell and moves to another cell according to a set of local rules assumed to be associated with the individual and crowd behaviors of the passengers. To verify the usefulness of the proposed cellular automata model, 11 tests, all of which are specified in International Maritime Organization Maritime Safety Committee/ Circulation 1238 (IMO MSC/Circ. 1238), were implemented, and it was confirmed that all the requirements of these tests had been met.

• The KIPS Transactions:PartC
• /
• v.10C no.4
• /
• pp.433-440
• /
• 2003

According as the real economic activities are carried out in the cyber world and the identity problem of a trade counterpart emerges, digital signature has been diffused. Due to the weakness for real-time validation using the validation method of digital signature, Certificate Revocation List, On-line Certificate Status Protocol was introduced. In this case, every transaction workload requested to verify digital signature is concentrated of a validation server node. Currently this method has been utilized on domestic financial transactions, but sooner or later the limitation will be revealed. In this paper, the validation method will be introduced which not only it can guarantee real-time validation but also the requesting node of certificate validation can maintain real-time certificate status information. This method makes the revocation management node update the certificate status information in real-time to the validation node while revoking certificate. The characteristic of this method is that the revocation management node should memorize the validation nodes which a certificate holder uses. If a certificate holder connects a validation node for the first time, the validation node should request its certificate status information to the above revocation management node and the revocation management node memorizes the validation node at the time. After that, the revocation management node inform the revocation information in real-time to all the validation node registered when a request of revocation happens. The benefits of this method are the fact that we can reduce the validation time because the certificate validation can be completed at the validation node and that we can avoid the concentration of requesting certificate status information to a revocation node.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.56-56
• /
• 2021

하천단면이나 하상변동 추적 등 하천공간정보는 유량이나 강우 등 수문시계열 정보와 더불어 계획홍수위 산정이나 하천구조물 신설로 인한 하천의 변화를 추적하는 데 있어 근간을 이루는 주요 정보로 국가차원의 유지 및 관리가 필요하다. 국내의 하천공간정보는 RIMGIS, WAMIS, 하천 일람, WINS와 같은 웹기반 시스템에서 정보화 되어 관리되고 있다. 그러나, RIMGIS는 여러 가지 문제점을 노정하고 있어 개선을 적극적으로 검토해볼 시점이라고 볼 있다. 우선, RIMGIS는 구축이 10년 이상된 기술로 구성되어 온라인 시스템 실행속도가 느리고, 물관리 일원화 와중에 관리주체가 불분명해진 상태이며, 제공되는 정보도 하천망이나 유역 정도로 차원 및 정확도도 낮고 활용도 및 현행화도 부족한 상태이다. 또한 공간정보 관리 DB표준으로 효율적인 관계형 구조 대신 하천대장 등을 수치화한 개념의 레이어 단위의 주제도로 관리하다보니 자료중복이 불가피하여 시스템이 무겁고, 자료간 연관검색이 거의 불가하고, 신속한 하천지형 변화 업데이트가 어려운 상태이다. 최근 진행되고 있는 RIMGIS 개선 사업은 여전히 종래의 레이어 단위의 주제도들을 추가하거나 개정하는 데 머물고 있는 상태이다. 이러다 보니 현재 우리나라의 대표적인 하천정보시스템인 RIMGIS의 실무 활용도는 낮은 것으로 알려져 있다. 가장 실무활용도를 저하시키고 현행화 상의 문제로 지적되는 부분은 하천정비기본계획 수립 시 발생한 공간자료 관리 부실이다. 현재 RIMGIS에서는 하천기본계획보고서만 PDF 형태로 제공할 뿐, 실제 지형자료는 과업을 수행한 설계사에 개별 보관되어 활용도뿐만아니라 망실의 우려가 높은 상황이다. 본 연구에서는 하천기본계획수립 시 측량되는 단면을 포함한 다양한 공간자료를 관계형으로 표준화 DB에 효율적으로 저장할 수 있게 하는 방안을 제시하고자 한다.

• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.327-338
• /
• 2010

Complete Subtree scheme(CS) is a well known broadcast encryption scheme to perform group rekeying in a stateless manner. However, statelessness comes at a cost in terms of storage and message overhead in transmitting key material. We propose a Merged Complete Subtree scheme(MCS) to reduce the communication overhead. It is more practical to make broadcast encryption schemes in network environments with limited bandwidth resources. We define all possible subset unions for ever two subsets of CS as new subsets having own key. The modification causes more storage overhead. Nevertheless, it is possible to make the size of a header, including key materials, half using subset unions of MCS, because the size of a header depends on the number of used subsets. Our evaluation therefore shows that the proposed scheme significantly improves the communication overhead of CS, reducing by half the rekey communication cost. The proposed scheme has the advantage of rekey communication cost when the number of revoked users is significant percentage of the number of potential users. The proposed scheme is fully collusion resistant.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.2
• /
• pp.267-277
• /
• 2017

One of fundamental problems in developing robust distributed services is how to achieve distributed consensus agreeing some data values that should be shared among participants in a distributed service. As one of algorithms for distributed consensus, Raft is known as a simple and understandable algorithm by decomposing the distributed consensus problem into three subproblems(leader election, log replication and safety). But, the algorithm dose not mention any types of dynamic configuration of participant peers such as adding new peers to a consensus group or deleting peers from the group. In this paper, we present a new consensus algorithm named Raft-D, which supports the dynamic configuration of participant peers by extending the Raft algorithm. For this, Raft-D manages the additional information maintained by participant nodes, and provides a technique to check the connection status of the nodes belonging to the consensus group. Based on the technique, Raft-D defines conditions and states to deal with adding new peers to the consensus group or deleting peers from the group. Based on those conditions and states, Raft-D performs the dynamic configuration process for a consensus group through the log update mechanism of the Raft algorithm.

• Journal of KIISE
• /
• v.42 no.4
• /
• pp.434-441
• /
• 2015

Next generation memory technologies, which we denote as 'new memory', have both non-volatile and byte addressable properties. These characteristics are expected to bring changes to the conventional computer system structure. In this paper, we propose a fast boot technique for hybrid main memory architectures that have both new memory and DRAM. The key technique used for fast booting is write-tracking. Write-tracking is used to detect and manage modified data detection and involves setting the kernel region to read-only. This setting is used to trigger intentional faults upon modification requests. As the fault handler can detect the faulting address, write-tracking makes use of the address to manage the modified data. In particular, in our case, we make use of the MMU (Memory Management Unit) translation table. When a write occurs to the boot completed state, write-tracking preserves the original state of the modified address of the kernel region to a particular location, and execution continues. Upon booting, the fast booting process restores the preserved data to the original kernel region allowing rapid system boot-up. We develop the fast booting technique in an actual embedded board equipped with new memory. The boot time is reduced to less than half a second compared to around 15 seconds that is required for the original system.

• Journal of Korea Multimedia Society
• /
• v.8 no.3
• /
• pp.372-378
• /
• 2005

When a mobile node changes a sub network using Mobile IP, it must register its current location to the home agent. If a mobile node is far from its home network, the Binding Update (BU) time delay is longer and affects its connection state. To solve such a BU delay problem, a new component in HMIPv6, called MAP, supports the mobility of mobile node to reduce the signaling delay in handover However, in hierarchical MAP architecture, the register concentration to a specific MAP may be occurred, which affects the network management wholly. In this paper, we propose a MAP selection scheme based on ioad balancing by the mobility factor and the traffic property. By the mobility factor and the traffic property, a mobile node can select a adequate MAP on its mobility factor and traffic characteristic.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.1-10
• /
• 2008

Once the sensor node in wireless sensor networks is installed, it usually operates without human intervention for a long time. The remote code update scheme is required because it is difficult to recall the sensor node in many situations. Therefore, studies on the reliable and efficient transport protocol for code propagation in wireless sensor networks have been increasingly done. However, by considering only the stability aspect of transmission, most of previous works ignore the consideration on the fast code propagation. This results the energy inefficiency by consuming unnecessary energy due to the slow code propagation. In this paper, in order to overcome limitation of the previous code propagation protocols, we propose a new code propagation protocol called "FCPP(Fast Code Propagation Protocol)". The FCPP aims at improving the reliability at well as performance. For this purpose, the FCPP accomplishes the fast code propagation by using the RTT-based transmission rate control and NACK suppression scheme, which provides a better the network utilization and avoids a unnecessary transmission delay. Based on the ns-2 simulation result, we prove that the FCPP Improves significantly both reliability and performance.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.6
• /
• pp.388-396
• /
• 2007

In this paper, a ubiquitous parking management system(UPMS) using sensor network is proposed. Ubiquitous parking management system provides information on free space in the parking lot through PDA or cellular phone connected to wireless LAN. For the implementation of UPMS, we have developed sensor node, sensor application and web server application. The proposed system periodically updates parking space data and monitors in real-time according to the user's request from the personal internet device. Collected parking data are stored onto the database for further analysis. The implemented UPMS system was installed on campus parking lot using 10 sensor nodes and we successfully demonstrated its feasibility by accessing the web server from out of the campus.