• Journal of Internet Computing and Services
• /
• v.20 no.5
• /
• pp.121-132
• /
• 2019

As the 4th industrial age enters, the number of IoT devices is exploding. Accordingly, the importance of security is also increasing in proportion to the increasing number of security incidents of IoT devices. However, due to the limited performance of IoT devices, there are limitations to applying existing security solutions. Therefore, a new automatic firmware distribution solution is needed to solve this problem. To solve this problem, we propose a new automatic firmware update system that uses a hybrid blockchain that combines a public blockchain and a private blockchain. The public blockchain allows various firmware providers to distribute firmware using a common system. Private blockchain solves the transaction overload problem of the public blockchain and facilitates the management of IoT devices. It also uses distributed file storage to ensure high availability without failing. Therefore, this system is expected to be very effective for improving the security of IoT devices.

• Journal of the Korean Recycled Construction Resources Institute
• /
• v.8 no.4
• /
• pp.444-449
• /
• 2020

In this study, On-Board Truck Scale was installed on the construction waste collection / transportation vehicles to monitor the weight of the waste at all stages from generation to final treatment. It was performed as a case study of a construction waste control technology that can efficiently manage the total generating and recycling amount using real-time weight/location information obtained by the On-Board Truck Scale device. As a result of the study, it was confirmed that the total amount of construction waste can be monitored in real time, and a plan for efficient logistics transportation can be derived through the analysis of operation patterns by managing the real-time transport volume, transport distance, and transport time of the construction waste collection / transportation vehicles. It was confirmed that overloading can be prevented in advance by controlling the loading also.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.3
• /
• pp.423-432
• /
• 2022

This paper addresses the safety concern that the SOH of batteries in electric vehicles decreases sharply when drivers change or their driving patterns change. Such a change can overload the battery, reduce the battery life, and induce safety issues. This paper aims to present the SOH as the changes on a dashboard of an electric vehicle in real-time in response to user pattern changes. As part of the training process I used battery data among the datasets provided by NASA, and built models incorporating linear regression and ARIMA, and predicted new battery data that contained user changes based on previously trained models. Therefore, as a result of the prediction, the linear regression is better at predicting some changes in SOH based on the user's pattern change if we have more battery datasets with a wide range of independent values. The ARIMA model can be used if we only have battery datasets with SOH data.

• Journal of Convergence for Information Technology
• /
• v.12 no.2
• /
• pp.23-29
• /
• 2022

Recently, due to the increase in the use of Internet of Things (IoT) devices, the amount of data transmitted and processed to cloud computing servers has increased rapidly. As a result, network problems (delay, server overload and security threats) are emerging. In particular, edge computing with lower computational capabilities than cloud computing requires a lightweight authentication algorithm that can easily authenticate numerous IoT devices.In this paper, we proposed a key-agreement protocol of a lightweight algorithm that guarantees anonymity and forward and backward secrecy between IoT and edge devices. and the proposed algorithm is stable in MITM and replay attacks for edge device and IoT. As a result of comparing and analyzing the proposed key-agreement protocol with previous studies, it was shown that a lightweight protocol that can be efficiently used in IoT and edge devices.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.1
• /
• pp.287-295
• /
• 2017

Recently, MTC (Machine Type Communication) is known as an important part to support IoT (Internet of Things) applications. MTC provides network connectivities between MTC devices without human intervention. In MTC, a large number of devices try to access over communication resource with a short period of time. Due to the limited communication resource, resource contention becomes severe and it brings about access failures of devices. To solve the problem, it needs to regulate device accesses. In this paper, we present an efficient access management scheme. We measure the number of devices which try to access in a certain time period and predict the change of the number of devices in the next time period. Using the predicted change, we control the number of devices which try to access. To verify our scheme, we conduct experiments in terms of success probability, failure probability, collision probability and access delay.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.452-461
• /
• 2005

In the star VPN (Virtual Private Network) topology, the traffic between the communicating two CPE(Customer Premise Equipment) VPN GW(Gateway)s nay be inefficiently transferred. Also, the Center VPN GW nav erperience the overload due to excessive packet processing overhead. As a solution to this problem, a direct tunnel can be established between the communicating two CPE VPN GWs using the IKE (Internet Key Exchange) mechanism of IPSec(IP Security). In this case, however, the tunnel establishment and management nay be complicated. In this paper, we propose a mechanism called' SVOT (Star VPN On-demand Tunnel)', which automatically establishes a direct tunnel between the communicating CPE VPN GWs based on demand. In the SVOT scheme, CPE VPN GWs determine whether it will establish a direct tunnel or not depending on the traffic information monitored. CPE VPN GW requests the information that is necessary to establishes a direct tunnel to the Center VPN GW Through a simulation, we investigate the performance of the scheme performs better than the SYST scheme with respect to scalability, traffic efficiency and overhead of Center VPN GW, while it shows similar performance to the FVST with respect to end-to-end delay and throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.730-742
• /
• 2014

In the case of On-demand routing protocol in cognitive radio ad-hoc networks, broadcasting of control packets may occur common control channel overload and packet collisions during the routing procedure. This situation is to increase the overhead of path finding and also limited to find the accurate and reliable path. Since reliable channel and path finding is restricted, path life time is shorten and path reliability is reduced. In this paper, we propose a new routing algorithm that reduces control channel overhead and increases path life time by considering the probability of appearance of primary user and channel status of neighbor nodes. Each node performs periodic local sensing to detect primary user signal and to derive primary user activity patterns. The probability of primary appearance on the current channel and the channel status can be obtained based on the periodic sensing. In addition, each node identifies the quality of the channel by message exchange through a common channel with neighbor nodes, then determines Link_Levels with neighbor nodes. In the proposed method, the Link Level condition reduces the number of control messages that are generated during the route discovery process. The proposed method can improve path life time by choosing a path through Path_Reliability in which stability and quality are weighted depending on the location. Through simulation, we show that our proposed algorithm reduces packet collisions and increases path life time in comparison with the traditional algorithm.

• Journal of KIISE:Databases
• /
• v.37 no.1
• /
• pp.22-32
• /
• 2010

Location-based services have been expanded rapidly in local and overseas markets due to technological advances and increasing applications of wireless internet. Various researches have been made to manage efficiently the location information of moving objects. A basic location-based alert service provides alerting messages automatically when either entering or leaving a specific location and it is expected to become one of the most important location-based services. Location-based alert services require a location polling method to acquire current locations for a large number of moving objects. However, a simple periodical location polling method causes severe system overload because a system should keep updating location information of the moving objects ceaselessly. Most location polling algorithms for location-based alerting services are not suitable for mobile users with dynamic and unsteady moving patterns. In this paper, we propose an improved location polling algorithm for location-based alerting services to reduce the amount of location information acquisition and therefore, to decrease the system load. Various experiments show that the proposed algorithm outperforms other algorithms.

• Spatial Information Research
• /
• v.23 no.4
• /
• pp.13-22
• /
• 2015

There has been much interest in the VWorld open platform with the addition of a variety of contents or services such as 2D map, 3D terrain, 3D buildings, and thematic map since 2012. However, the VWorld system architecture was not stable for the system overload. For example, the system was stopped due to the rapidly increasing user accesses when the 3D terrain service of the North Korea and the Baekdu mountain was launched at September 2012 and September 2013, respectively. It was because the system architect has just extended the server system and the network bandwidth whenever the rapid increase of user accesses occurs or new service starts. Therefore, this study proposes a new VWorld system architecture that can reliably serve the huge volume of National Spatial Data by applying the new technologies such as CDN, visualization and clustering. Finally, it is expected that the results of this study can be used as a basis for the next VWorld system architecture being capable of a huge volume of spatial data and users.

• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.705-714
• /
• 2001

The computing systems of today expanded business trade and distributed business process Internet. More and more systems are developed from components with exactly reusability, independency, and portability. Component based development is focused on advanced concepts rater than passive manipulation or source code in class library. The primary component construction in CBD. However, lead to an additional cost for reconstructing the new component with CBD model. It also difficult to serve component information with rapidly and exactly, which normalization model are not established, frequency user logging in Web caused overload. A lot of difficult issues and aspects of Component Based Development have to be investigated to develop good component-based products. There is no established normalization model which will guarantee a proper treatment of components. This paper elaborates on some of those aspects of web application to adapt user requirement with exactly and rapidly. Distributed components in this paper are used in the most tiny size on network and suggest the network-addressable interface based on business domain. We also discuss the internal and external specifications for grasping component internal and external relations of user requirements to be analyzed. The specifications are stored on Servlets after dividing the information between session and entity as an EJB (Enterprise JavaBeans) that are reusable unit size in business domain. The reusable units are used in business component through query to get business component. As a major contribution, we propose a systems model for registration, auto-arrange, search, test, and download component, which covers component reusability and component customization.