• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.4
• /
• pp.691-699
• /
• 2009

Recently, the ERO protocol has been adopted as a standard to protect the routing optimization mode introduced by MIPv6. This protocol uses the public key cryptography and the early binding update method to improve the Return Routeability protocol while optimizing both security and performance. On the other hand, though various security approaches including the ERO protocol have been proposed for MIPv6, they lack formal verification. Especially, to our best knowledge, there is no formal analysis on the ERO protocol. In order to provide a good example for formal analysis on MIPv6 security protocols, this paper verifies the correctness of the ERO protocol through BAN-logic. For this goal, BAN-logic is extended to consider the address tests on the mobile nodes's CoA and HoA. It is expected that the analysis presented in this paper will be useful for the formal verifications on the security protocols related to MIPv6.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.444-452
• /
• 2017

Recently, a demand of Internet-of-things (IoT) rises dramatically and an interest in Low Power Wide Area (LPWA) grows larger accordingly. In this paper, performance in LoRa which is included in LPWA standard is analyzed. Particularly, after measuring Received Signal Strength Indication (RSSI) of received signal on Line-of-sight (LoS) and Non-line-of-sight (NLoS) environment and it is compared with RSSI which theoretical path loss model is applied to. Among many path loss models, the simulation for theoretical RSSI use Log-distance, Two-ray model and Okumura-Hata model that is based on the test database. Consequently, the result of Okumura-Hata model is the most similar with the measured RSSI. When a network based on LoRa is built, this result can used to decide optimal node arrangement.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.1-7
• /
• 2009

When constructing various mobile networks including sensor networks, the problem of finding the layout or graph to interconnect the terminals or nodes of the network may come up. Providing a common scheme that can be applied to the kind of problems, and formulating the bounds of the run time and the result of the algorithm from the scheme, one may evaluate precisely the plan of constructing analogous network systems. This paper, dealing with EMST(Euclidean Minimum Spanning Tree) that represents such problems, provides the scheme for constructing EMST by parallel processing over distributed environments, and the ground for determining the maximum difference of the layout or the graph produced from the scheme: the difference from EMST. In addition, it provides the upper bound of the run time of the algorithm from the scheme.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.119-124
• /
• 2014

In this paper, we propose the active rule system applying with emotional margin for power saving control. The proposed system in this paper is a part of the system which derives smart power saving by adjusting the illuminance using active rules within compromising the user's emotion. For this, we set the specific range of standard illuminance and the lower bound of user's emotional margin of illuminance based on measurements and analysis, and use these data in design of active rules. And then, we design and implement the active rule system using mobile agent. The mobile agent in the proposed system migrates to the destination sensor nodes, acquires and transmits sensor data according to the purpose and needs through the active rules, and directly executes the actions corresponding to the optional events(changed sensor data and/or time etc.). And then, we show the potential applicability of the proposed active rule system in various active sensor network applications through the interaction with the rule base and mobile sensor network middleware system.

• The Journal of the Acoustical Society of Korea
• /
• v.11 no.3
• /
• pp.5-13
• /
• 1992

Taking devantage of the property that Korean digit is a mono-syllable word, we proposed a spoken Korean-digit recognition scheme using the multi-layer perceptron. The spoken Korean-digit is divided into three segments (initial sound, medial vowel, and final consonant) based on the voice starting / ending points and a peak point in the middle of vowel sound. The feature vectors such as cepstrum, reflection coefficients, ${\Delta}$cepstrum and ${\Delta}$energy are extracted from each segment. It has been shown that cepstrum, as an input vector to the neural network, gives higher recognition rate than reflection coefficients. Regression coefficients of cepstrum did not affect as much as we expected on the recognition rate. That is because, it is believed, we extracted features from the selected stationary segments of the input speech signal. With 150 ceptral coefficients obtained from each spoken digit, we achieved correct recognition rate of 97.8%.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.285-292
• /
• 2013

This study proposes a network matching method based on a network division technique. The proposed method generates polygons surrounded by links of the original network dataset, and detects corresponding polygon group pairs using a intersection-based graph clustering. Then corresponding sub-network pairs are obtained from the polygon group pairs. To perform the geometric correction between them, the Iterative Closest Points algorithm is applied to the nodes of each corresponding sub-networks pair. Finally, Hausdorff distance analysis is applied to find link pairs of networks. To assess the feasibility of the algorithm, we apply it to the networks from the KTDB center and commercial CNS company. In the experiments, several Hausdorff distance thresholds from 3m to 18m with 3m intervals are tested and, finally, we can get the F-measure of 0.99 when using the threshold of 15m.

• Journal of Digital Convergence
• /
• v.14 no.2
• /
• pp.209-216
• /
• 2016

In these days, considering the trend to make various information blended based on spatial information like road, buildings and geography, it is to be very important to visualize maps for showing the information efficiently. However, geometry which is composed with line, polygon commonly used on web service has limitation to express information by limit of usage as well as spending certain time to show the information via map. That's why this study develops the efficient way to visualize huge and complex spatial information. This way is to bring partial space with spatial query, and then query and expand information excluded the former area after detecting movement event based on client. When the way is implemented, it will be expected to make efficient visualization in entire system by not bringing unnecessary information but shortening spending time to show area because it just shows areas which clients want to see.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.9
• /
• pp.1-10
• /
• 1998

This paper is to propose an algorithm named as DYSAC to find the critical path(the longest sensitizable path) in a large digital circuit, whose purpose is to reduce the time to find critical path and to find critical paths of the circuits for which the previous methods could not find one. Also a set of path sensitization criteria named as DYPSEC is proposed, which is used to select a path from input to the output inside the DYSAC. The DYSAC consists of two sub-algorithms; the level assignment algorithm to assign a level to each node and the critical path selection algorithm to select the sensitizable path. The proposed algorithm was implemented with C-language on SUN Sparc and applied to the ISCAS'85 benchmark circuits to make sure if it works correctly and finds the correct critical path. Also, the results from the experiments were compared to the results from the previous works. The comparison items were the ability to find the critical path and the speed, in both of which the proposed algorithm in this paper shows better results than others.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.11-16
• /
• 2004

Recently, collaborative works are increased more and more over the distributed heterogeneous computing environments. The availability of high-speed wide-area networks has also enabled collaborative multimedia applications such as video conferencing, distributed interactive simulation and collaborative visualization. Distributed high performance computing and collaborative multimedia applications, it is extremely important to efficiently perform group communication over a heterogeneous network. Typical group communication patterns are broadcast and Multicast. Heuristic algorithms such as FEF, ECEF, look-ahead make up the message transmission tree for the broadcast and multicast over the distributed heterogeneous systems. But, there are some shortcomings because these select the optimal solution at each step, it may not be reached to the global optimum In this paper, we propose a new heuristic algerian that constructs tree for efficiently collective communication over the previous heterogeneous communication model which has heterogenity in both node and network. The previous heuristic algorithms my result in a locally optimal solution, so we present more reasonable and available criterion for choosing edge. Through the performance evaluation over the various communication cost, improved heuristic algorithm we proposed have less completion time than previous algorithms have, especially less time complexity than look-ahead approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7B
• /
• pp.677-685
• /
• 2009

There are a number of studies that propose transmission power control algorithms in wireless sensor networks. However, these algorithms have a lot of overhead in the initialization phase since a number of packets have to be transmitted to determine the optimal transmission power level. This paper proposes the transmission power control technique considering the shortest-path to minimize the hop-count without the occurrence of any power control messages. We applied the proposed technique on tree-based network component implemented on TinyOS. And we evaluated the performance including transmission energy and average network depth with 21 motes. Compared to before, the proposed technique reduces about 24.7% of the average electric current on transmitting. As a result of considering the shortest-path, the hop-count considering the shortest-path was about 41% less than a normal network.