• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.1
• /
• pp.43-56
• /
• 2012

Wireless sensor networks consist of numerous small-sized nodes equipped with limited computing power and storage as well as energy-limited disposable batteries. In this networks, nodes are deployed in a large given area and communicate with each other in short distances via wireless links. For energy efficient networks, dynamic clustering protocol is an effective technique to achieve prolonged network lifetime, scalability, and load balancing which are known as important requirements. this technique has a characteristic that sensing data which gathered by many nodes are aggregated by cluster head node. In the case of cluster head node is exposed by attacker, there is no guarantee of safe and stable network. Therefore, for secure communications in such a sensor network, it is important to be able to encrypt the messages transmitted by sensor nodes. Especially, cluster based sensor networks that are designed for energy efficient, strongly recommended suitable key management and authentication methods to guarantee optimal stability. To achieve secured network, we propose a key management scheme which is appropriate for hierarchical sensor networks. Proposed scheme is based on polynomial key pool pre-distribution scheme, and sustain a stable network through key authentication process.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.12
• /
• pp.1646-1653
• /
• 2020

In case that the train driving with diverse high-speeds is manipulates by real-time remote control in long-term evolution-railway (LTE-R) system with frequent handovers, the real-time safe transmission of train control messages is important element. The handover delay time stability method regardless of train speed in order to enhance the real-time remote train control stability in LTE-R system is proposed in the paper. Furthermore, the variable speeds and altitudes of train collected by real measurements are applied for upgrading simulation accuracy. The simulation results inform that not only there are stable and unstable ranges to A3 offset values, but the optimal offset value for average handover delay is in unstable range. However, the late handover with A3 offset values in stable range should be chosen to get the predictable handover delay regardless of train speed rather than the early handover with A3 offset values in unstable range, since the key value of high-speed Korea railway system is the stability.

• Journal of the Korea Convergence Society
• /
• v.13 no.4
• /
• pp.45-51
• /
• 2022

Fear of contact exists due to the prevention of the spread of infectious diseases such as COVID-19. When using the common entrance door of an apartment, access is possible only if the resident enters a password or obtains the resident's permission. There is the inconvenience of having to manually enter the number and password for the common entrance door to enter. Also, contactless entry is required due to COVID-19. Due to the development of ICT, users can be easily identified through the development of face recognition and voice recognition technology. The proposed method detects a visitor's face through a CCTV or camera attached to the common entrance door, recognizes the face, and identifies it as a registered resident. Then, based on the registered information of the resident, it is possible to operate without contact by interworking with the elevator on the server. In particular, if face recognition fails with a hat or mask, the visitor is identified by voice or additional authentication of the visitor is performed based on the voice message. It is possible to block the spread of contagiousness without leaving any contactless function and fingerprint information when entering and exiting the front door of an apartment house, and without the inconvenience of access.

• Journal of Intelligence and Information Systems
• /
• v.22 no.1
• /
• pp.107-118
• /
• 2016

The advent of 5G mobile communications, which is expected in 2020, will provide many services such as Internet of Things (IoT) and vehicle-to-infra/vehicle/nomadic (V2X) communication. There are many requirements to realizing these services: reduced latency, high data rate and reliability, and real-time service. In particular, a high level of reliability and delay sensitivity with an increased data rate are very important for M2M, IoT, and Factory 4.0. Around the world, 5G standardization organizations have considered these services and grouped them to finally derive the technical requirements and service scenarios. The first scenario is broadcast services that use a high data rate for multiple cases of sporting events or emergencies. The second scenario is as support for e-Health, car reliability, etc.; the third scenario is related to VR games with delay sensitivity and real-time techniques. Recently, these groups have been forming agreements on the requirements for such scenarios and the target level. Various techniques are being studied to satisfy such requirements and are being discussed in the context of software-defined networking (SDN) as the next-generation network architecture. SDN is being used to standardize ONF and basically refers to a structure that separates signals for the control plane from the packets for the data plane. One of the best examples for low latency and high reliability is an intelligent traffic system (ITS) using V2X. Because a car passes a small cell of the 5G network very rapidly, the messages to be delivered in the event of an emergency have to be transported in a very short time. This is a typical example requiring high delay sensitivity. 5G has to support a high reliability and delay sensitivity requirements for V2X in the field of traffic control. For these reasons, V2X is a major application of critical delay. V2X (vehicle-to-infra/vehicle/nomadic) represents all types of communication methods applicable to road and vehicles. It refers to a connected or networked vehicle. V2X can be divided into three kinds of communications. First is the communication between a vehicle and infrastructure (vehicle-to-infrastructure; V2I). Second is the communication between a vehicle and another vehicle (vehicle-to-vehicle; V2V). Third is the communication between a vehicle and mobile equipment (vehicle-to-nomadic devices; V2N). This will be added in the future in various fields. Because the SDN structure is under consideration as the next-generation network architecture, the SDN architecture is significant. However, the centralized architecture of SDN can be considered as an unfavorable structure for delay-sensitive services because a centralized architecture is needed to communicate with many nodes and provide processing power. Therefore, in the case of emergency V2X communications, delay-related control functions require a tree supporting structure. For such a scenario, the architecture of the network processing the vehicle information is a major variable affecting delay. Because it is difficult to meet the desired level of delay sensitivity with a typical fully centralized SDN structure, research on the optimal size of an SDN for processing information is needed. This study examined the SDN architecture considering the V2X emergency delay requirements of a 5G network in the worst-case scenario and performed a system-level simulation on the speed of the car, radius, and cell tier to derive a range of cells for information transfer in SDN network. In the simulation, because 5G provides a sufficiently high data rate, the information for neighboring vehicle support to the car was assumed to be without errors. Furthermore, the 5G small cell was assumed to have a cell radius of 50-100 m, and the maximum speed of the vehicle was considered to be 30-200 km/h in order to examine the network architecture to minimize the delay.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.625-634
• /
• 2003

More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.377-386
• /
• 2003

This study suggested a technique to maintain an efficient core-based multicast tree using weighted clustering factors in mobile Ad-hoc networks. The biggest problem with the core-based multicast tree routing is to decide the position of core node. The distance of data transmission varies depending on the position of core node. The overhead's effect on the entire network is great according to the recomposition of the multicast tree due to the movement of core node, clustering is used. A core node from cluster head nodes on the multicast tree within core area whose weighted factor is the least is chosen as the head core node. Way that compose multicast tree by weighted clustering factors thus and propose keeping could know that transmission distance and control overhead according to position andmobility of core node improve than existent multicast way, and when select core node, mobility is less, and is near in center of network multicast tree could verification by simulation stabilizing that transmission distance is short.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.4
• /
• pp.35-42
• /
• 2011

Link quality assessment is a crucial part of sensor network formation to stably operate large-scale wireless sensor networks (WSNs). A stability of path consisting of several nodes strongly depends on all link quality between pair of consecutive nodes. Thus it is very important to assess the link quality on the stage of building a routing path. In this paper, we present a link quality assessment method, Hybrid Link Quality Metric (HQLM), which uses both of LQI and RSSI from RF chip of sensor nodes to minimize set-up time and energy consumption for network formation. The HQLM not only reduces the time and energy consumption, but also provides complementary cooperation of LQI and RSSI. In order to evaluate the validity and efficiency of the proposed method, we measure PDR (Packet Delivery Rate) by exchanging multiple messages and then, compare PDR to the result of HQLM for evaluation. From the research being carried out, we can conclude that the HQLM performs better than either LQI- or RSSI-based metric in terms of recall, precision, and matching on link quality.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.324-328
• /
• 2007

유비궈터스 헬스케어는 단일화된 서비스가 아니라 다양한 기술들이 복합적으로 결합되어 운용되는 서비스이다. 따라서 서비스의 형태가 고정적이지 않고 매우 다양하게 나타난다. 하지만 실제로 차이가 발생하는 부분은 서비스의 구현에 관한 세부적 내용에서 나타나고, 서비스 운용을 위한 기본 구성요소에 있어서는 큰 차이가 없이 유사한 형태를 가진다. 그 결과 유비쿼터스 헬스케어 서비스 개발 과정에서는 실제 서비스의 구현 외의 통신과 데이터베이스의 이용, 메시지 전달과 같은 중복되는 항목에 대한 고려가 매번 이루어져야 한다. 이것은 개발 과정에 있어 불필요한 비용의 증가를 불러온다. 본 논문에서는 이와 같은 불필요한 비용을 감소시키며 서비스의 개발과 운용이 가능한 유비쿼터스 헬스케어 서비스의 제공을 위한 아키텍처와 서비스 개발을 위한 프레임워크를 제안한다. 제안하는 서비스 제공 아키덱처는 크게 이용자 단말, 유비궈터스 헬스케어 서비스 센터, 외부 기관으로 구성된다. 서비스 개발 프레임워크는 서버와 클라이언트 프레임워크로 구분된다. 서비스 개발 프레임워크는 서비스를 제공하는 서버에서 필요한 유비쿼터스 헬스케어 서비스의 공통 구성요소를 가진다. 서비스의 개발을 위해 우선 프로세스에 대한 정의를 수행하고, 정의된 내용에 따라 필요한 코드 템플릿을 결합하여 서비스의 초기 형태를 만들어낸다. 여기에 각 서비스가 필요로 하는 세부 사항을 작성하는 것으로 서비스의 개발을 수행하게 된다. 제안된 서비스 제공 아키텍처와 서비스 개발 프레임워크를 실제 적용해보기 위해 전림선비대증 환자 진료를 위한 시스템을 설계하고 구현하였다.JSHOP2 계획수립기내에 구현하였다. 계획 실행 방법으로는 주어진 강건한 계획에 대하여 행위들이 직접 실행하수 있도록 한다.며 용량에 의존하는 양상을 보였다. $H_2O_2$에 의해 유발(誘發)된 DNA의 손상은 catalase와 deferoxamine에 의해 억제되었지만 DPPD는 억제시키지 못했다. 배기음(排氣飮)은 $H_2O_2$에 의해 유발(誘發)된 ATP의 소실을 회복시켰다. 이러한 실험결과 $H_2O_2$에 의해 유발(誘發)된 세포(細胞)의 손상(損傷)은 지질(脂質)의 과산화(過酸化)와는 다른 독립적인 기전에 의해 일어남을 나타낸다. 결론 : 이러한 결과들로 볼 때 Caco-2 세포(細胞)에서 배기음(排氣飮)이 항산화작용(亢酸化作用)보다는 다른 기전을 통하여 Caco-2 세포안에서 산화제(酸化劑)에 의해 유발(誘發)된 세포(細胞)의 사망(死亡)와 DNA의 손상(損傷)을 방지할 수 있다는 것을 가리킨다. 따라서 본 연구(硏究)는 배기음(排氣飮)이 반응성산소기(反應性酸素基)에 의해 매개된 인체(人體) 위장관질환(胃腸管疾患)의 치료(治療)에 사용할 수 있을 가능성(可能性)이 있음을 제시하고 있다.에 이를 이용하여 유가배양시 기질을 공급하는 공정변수로 사용하였다 [8]. 생물학적인 폐수처리장치인 활성 슬러지법에서 미생물의 활성을 측정하는 방법은 아직 그다지 개발되어있지 않다. 본 연구에서는 슬러지의 주 구성원이 미생물인 점에 착안하여 침전시 슬러지층과 상등액의 온도차를 측정하여 대사열량의 발생량을 측정하고 슬러지의 활성을 측정할 수 있는 방법을

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.591-602
• /
• 2003

Delay and discontinuance phenomenon of service are cause by sudden increase of the network communication amount and the quantity consumed of resources when Internet users are driven excessively to a conventional single large database sewer. To solve these problems, spatial database cluster consisted of several single nodes on high-speed network to offer high-performance is risen. But, research about spatial join operation that can reduce the performance of whole system in case process at single node is not achieved. So, in this paper, we propose efficient parallel spatial join processing method in a spatial database cluster system that uses data partitions and replications method that considers the characteristics of space data. Since proposed method does not need the creation step and the assignment step of tasks, and does not occur additional message transmission between cluster nodes that appear in existent parallel spatial join method, it shows performance improvement of 23% than the conventional parallel R-tree spatial join for a shared-nothing architecture about expensive spatial join queries. Also, It can minimize the response time to user because it removes redundant refinement operation at each cluster node.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.9
• /
• pp.369-380
• /
• 2013

Recently, role-based distributed system models have been proposed to support adaptive interactions in ubiquitous application environment. A Role-based distributed model regards an application as an organization composed of roles, and separate players running role processes from the roles. When an application is running, it binds a role with a player, and the player runs dynamically assigned role processes provided by an application for supporting adaptability. However, there has not been much attention on researches about development and runtime environment for role-based distributed systems. In this paper we suggest an application framework as an environment for developing and executing role-base distributed systems. The application framework is divided into two parts: an organization framework to manage and construct an organization composed of roles necessary in the application, and a player framework to provide running environment for players. In this paper, we focus on the organization framework which supports the creation and management of organizations, directory service for players and allocation of players to roles, and message brokering between roles and players. The proposed framework makes developers to be able to develop highly adaptive distributed systems in the ubiquitous environment.