• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.687-695
• /
• 2005

With increasing demand of using mobile Internet, HMIPv6 is proposed by IETF to reduce location management traffics due to micro mobility and to provide IP-based movement. A paging mechanism combined with HMIPv6 can reduce the signaling traffics of a mobile node. We propose a dynamic paging mechanism in HMIPv6 which decides an optimal paging area for each mobile node by considering its characteristics. Total costs of a static paging mechanism and a dynamic paging mechanism are analyzed by mathematical formulas. As a result, we proved that the dynamic paging mechanism reduced total signal traffic costs more than a static paging mechanism.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.10 no.6 s.52
• /
• pp.103-114
• /
• 2006

Forced vibration testing is important for correlating the mathematical model of a structure with the real one and for evaluating the performance of the real structure. There exist various techniques available for evaluating the seismic performance using dynamic and static measurements. In this paper, full scale forced vibration tests simulating earthquake response are implemented by using a hybrid mass damper. The finite element (FE) model of the structure was analytically constructed using ANSYS and the model was updated using the results experimentally measured by the forced vibration test. Pseudo-earthquake excitation tests showed that HMD induced floor responses coincided with the earthquake induced ones which were numerically calculated based on the updated FE model.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.11
• /
• pp.67-77
• /
• 2007

In sensor networks, it is very important to refresh communication keys of sensors in a periodic or on-demand manner. To perform a dynamic key management efficiently, sensor networks usually employ cluster architecture and each CH (Cluster Head) is responsible for key management within its cluster. In cluster-based sensor networks, CHs are likely to be targets of capture attacks, and capture of CHs threatens the survival of network significantly. In this paper, we propose a periodical key refreshment scheme which counteracts against capture of CHs. First, the proposed scheme reduces the threat caused by compromise of CHs by forcing each CH to manage a small number of sensors and changing CH role nodes periodically. Second, the proposed scheme flings attackers into confusion by involving other nodes in a key establishment between BS (Base Station) and a CH. Our numerical analyses showed that the proposed scheme is more secure than other schemes and robust against compromise of CHs.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.339-350
• /
• 2004

A broadcast method in mobile computing environments which have very large client populations solves the problem of low bandwidth. But most of previous proposed concurrency control protocols are restricted to read-only transactions from mobile client. In this paper, we propose the UTSM-ARM method which uses caching and broadcast method, and allows update transactions in mobile client. The UTSM-ARM decides the validation of cache data consistency with the dynamic update pattern ratio of accessed cached data. Also, the timestamps of accessed cached data and transaction in mobile client guarantee the serializable execution of mobile transactions. As a result, UTSM-ARM makes efficiently use of the asymmetric bandwidth of broadcast environment and can Increase the transaction throughput.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.437-455
• /
• 2009

In the near future, various multicast based services will be provided over clustered wireless networks. To provide multicast services in secure manner, multicast messages are encrypted by using group key which is shared by group members. Therefore, various group key management schemes have been introduced until now. Among them, tree based approach is one of the most representative paradigms in group key management. Traditional tree based approaches effectively reduce rekeying message transmissions of the key distribution center. However, they do not consider the network bandwidth used for transmitting the rekeying messages. In this paper, we firstly present formulas that describe bandwidth consumption of tree based group key management scheme. Based on our formulations, we propose a bandwidth efficient key tree management scheme for clustered wireless networks where membership changes occur frequently. Simulation results show that our scheme effectively reduces the bandwidth consumption used for rekeying compared to existing key tree schemes.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.6
• /
• pp.208-218
• /
• 2017

This study aims to develop the Vehicle Local Dynamic Map (V-LDM) and demonstrate its performance for providing dynamic map data efficiently to the vehicle control module. Firstly, the concept of the in-vehicle LDM has been established and then the system has been carefully designed according to the international standards. The high-precision digital map embedded in LDM has been designed to incorporate the lane-level information of road network, and the Dynamic Map protocol (DM protocol) which is a message protocol including the road data with dynamic traffic event data has been defined. The performance test of the proposed system has been conducted in the uninterrupted road section of Kyungbu expressway, showing that both of the data size and the elapsed time to finish the process are almost linearly proportional to the length of target road. Finally, it is recommended that the length of target road for DM protocol be less than 250m.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.394-406
• /
• 2004

Even the document resources offered from web server can be represented in the form of URL/URI, it can not necessarily be guaranteed that corresponding resources exist due to a dynamic change of sewer environment In this paper, integrated document administration system is therefore proposed and modeled using the XML-RPC technology which guarantees the reliance of resources, and handles a dynamic server resource management and request of clients. The proposed system is composed of middleware and server systems. The former system manages dynamic server resources, and the latter reports the updated information of documentations stored in server by client from the server to middleware system. As a result, effective storing management of dynamic resource in distributed server could be archived and building cost of a new web server could be reduced due to an applicability to current web sewer. In addition platform independent and efficient data management was obtained by using the XML-RPC protocol.

• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.150-167
• /
• 2009

XML has become the new standard for storing, exchanging, and publishing of data over both the internet and the ubiquitous data stream environment. As demand for efficiency in handling XML document grows, labeling scheme has become an important topic in data storage. Recently proposed labeling schemes reflect the dynamic XML environment, which itself provides motivation for the discovery of an efficient labeling scheme. However, previous proposed labeling schemes have several problems: 1) An insertion of a new node into the XML document triggers re-labeling of pre-existing nodes. 2) They need larger memory space to store total label. etc. In this paper, we introduce a new labeling scheme called a Circle Labeling Scheme. In CLS, XML documents are represented in a circular form, and efficient storage of labels is supported by the use of concepts Rotation Number and Parent Circle/Child Circle. The concept of Radius is applied to support inclusion of new nodes at arbitrary positions in the tree. This eliminates the need for re-labeling existing nodes and the need to increase label length, and mitigates conflict with existing labels. A detailed experimental study demonstrates efficiency of CLS.

• Journal of Korean Society of Transportation
• /
• v.27 no.1
• /
• pp.143-155
• /
• 2009

A dynamic traffic assignment (DTA) has recently been implemented in many practical projects. The core of dynamic model is the inclusion of time scale. If excluding the time dimension from a DTA model, the framework of a DTA model is similar to that of static model. Similar to static model, with given exogenous travel demand, a DTA model loads vehicles on the network and finds an optimal solution satisfying a pre-defined route choice rule. In most DTA models, the departure pattern of given travel demand is predefined and assumed as a fixed pattern, although the departure pattern of driver is changeable depending on a network traffic condition. Especially, for morning peak commute where most drivers have their preferred arrival time, the departure time, therefore, should be modeled as an endogenous variable. In this paper, the authors point out some shortcomings of current DTA model and propose an alternative approach which could overcome the shortcomings of current DTA model. The authors substitute a traditional definition for time-dependent OD table by a new definition in which the time-dependent OD table is defined as arrival time-based one. In addition, the authors develop a new DTA model which is capable of finding an equilibrium departure pattern without the use of schedule delay functions. Three types of objective function for a new DTA framework are proposed, and the solution algorithms for the three objective functions are also explained.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.6
• /
• pp.269-273
• /
• 2010

Massively Multiplayer Online Game (MMOG) is one of diverse applications where more than hundreds of users enjoy experiencing virtual worlds. Voronoi-based Overlay Network (VON) is proposed to reduce a bandwidth consumption in P2P MMOGs and Vorocast also is made using message forwarding in VON. We propose a dynamic area of interest (AOI) management method that solves problems such as less consistency and high latency due to sending position updates to more neighbor nodes from the message originator in forwarding scheme. Our scheme provides the higher consistency and reduces latency by combining direct connection scheme and Vorocast scheme compared to existing schemes. The proposed model is evaluated through simulations.