• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.116-122
• /
• 2009

Mobile Wireless Sensor Network is an organized collection of sensor nodes and mobile sink nodes, in which the sensor node transmits the signal to the sink node. In real environment, there are many cases in which sinks have mobility caused by the people, the vehicle and etc. Since all nodes in the sensor networks have limited energy, many researches have been done in order to prolong the lifetime of the entire network. In this paper we propose Dynamic Local Update-based Routing Protocol(D-LURP) that prolong the lifetime of the entire network to efficiently maintain frequent location update of mobile sink static sensor nodes in Mobile WSNs. When the sink node moves out of the local broadcasting area the proposed D-LURP configures dynamically the local update area consisted of the new local broadcasting area and the previous dissemination node(DN) and find the path between the DN and the sink node, instead of processing a new discovering path like LURP. In this way the processing of broadcasting sink node's location information in the entire network will be omitted. and thus less energy will be consumpted. We compare the performances of the proposed scheme and existing Protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1188-1197
• /
• 2010

A most important thing in a connected dominating set(CDS)-based routing in a wireless ad-hoc network is to select a minimum number of dominating nodes and then build a backbone network which is made of them. Node failure in a CDS is an event of non-negligible probability. For applications where fault tolerance is critical, a traditional dominating-set based routing may not be a desirable form of clustering. It is necessary to minimize the frequency of reconstruction of a CDS to reduce message overhead due to message flooding. The idea is that by finding alternative nodes within a restricted range and locally reconstructing a CDS to include them, instead of totally reconstructing a new CDS. With the proposed algorithm, the resulting number of dominating nodes after partial reconstruction of CDS is not changed and also its execution time is faster than well-known algorithm of construction of CDS by 20~40%. In the case of high mobility situation, the proposed algorithm gives better results for the performance metrics, packet receive ratio and energy consumption.

• The Journal of the Korea Contents Association
• /
• v.15 no.5
• /
• pp.582-591
• /
• 2015

Late-Koryeo people networks were constructed from four different history books that were written by various historic aspects in the period from king Kongmin to the final king of the Koryeo, Kongyang. All networks constructed in this study show scale free network properties as if most social networks do. Tajo-sillok preface is one of subjectively written history book that described personal history of the Lee Seong-gye and his ancestors. It is confirmed that the book is one of the most biased-written history books through network study. Jeong Do-jeon known as a Chosun dynasty projector is not greatly contributed for founding of a Chosun dynasty in network study and various historical documents as well. In this network study, we provide objective historical information in the historical situations of the late-Koryeo and during establishment procedure of Chosun dynasty. Hub nodes in network is denoted highly linked nodes, called degree. Stress centrality is a unit to measure positional importancy in the network. If we employ two factors, degree and stress centrality to determine hub node, it represents high connectivity and importancy as well. As comparing values of the degree and stress centrality, we elucidate more objective historical facts from late-Koryeo situations in this study. If we further develop and employ a new algorithm that is considered both degree and stress centrality, it is a very useful tool for determining hub node.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2441-2446
• /
• 2009

Wireless Sensor Network collects a data from the specific area and the control is composed of small sensor nodes. Like this sensors to after that is established at the beginning are operated with the battery, the operational duration until several years must be continued from several months and will be able to apply the resources which is restricted in efficiently there must be. In this paper RHC (rounting history cache) applies in Directed Diffusion which apply a data central concept a reliability and an efficiency in data transfer course set. RHC algorithms which proposes each sensor node updated RHC of oneself with periodic and because storing the optimization course the course and, every event occurrence hour they reset the energy is wasted the fact that a reliability with minimization of duplication message improved.

• The Journal of the Convergence on Culture Technology
• /
• v.8 no.2
• /
• pp.379-384
• /
• 2022

In a wireless sensor network, a large number of sensor nodes are deployed in an environment where direct access is difficult. It is difficult to supply power, such as replacing the battery or recharging it. It is very important to use the energy with the sensor node. Therefore, an important consideration to increase the lifetime of the network is to minimize the energy consumption of each sensor node. If the energy of the wireless sensor node is exhausted and discharged, it cannot function as a sensor node. Therefore, it is a method proposed in various protocols to minimize the energy consumption of nodes and maintain the network for a long time. We consider the center point and residual energy of the cluster, and the plot point and K-means (WSN suggests optimal clustering). We want to evaluate the performance of the KOCED protocol. We compare protocols to which the K-means algorithm, one of the latest machine learning methods, is applied, and present performance evaluation factors.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.3
• /
• pp.534-539
• /
• 2005

The key in wireless sensor networks, which consist of a number of sensor nodes, is an energy efficiency. Many routing protocols have been proposed for prolonging network lifetime and reducing traffic in wireless sensor networks. Wireless sensor networks usually use wireless ad-hoc network protocols for routing, but these protocols are not well-suited for wireless sensor networks due to many reasons. In this paper, RM-flooding protocol is proposed for reducing routing overhead occurred when packet flooding. The nodes using this routing protocol can consume the limited energy effectively, and exchange information with remote nodes usulg information receiving from multipath. So, RM-flooding prolongs the network's lifetime.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.1031-1034
• /
• 2008

최근 원하는 정보를 수집하기 위한 무선 센서 네트워크(WSN) 사용이 증가하고 있으며, 이때 여러개의 작은 센서들이 배터리의 용량에 한정되어 있기 때문에 가장 우선적으로 고려해야 할 부분은 에너지 효율성이다. Directed Diffusion(DD)은 데이터 중심 기반 라우팅 알고리즘으로 싱크는 모든 센서 노드에게 인터레스트(Interest)를 전송(Flooding)하면 Interest를 받은 노드들은 경사(Gradient)를 만들어서 그 경로들 중 최적화 경로를 강화(Reinforce)한다. 이 경로는 센서 네트워크 전체적으로 볼 때는 에너지를 최소화 하지만, 매 Flooding시 에너지 고갈과 시간 낭비의 문제점이 나타난다. 본 논문에서는 DD의 문제점을 개선하여 싱크가 Interest를 Flooding할 때 마다 여러 번의 Flooding으로 노드의 에너지 고갈과 시간 낭비가 심각해지는 것을 방지하기 위해 중간노드가 Interest를 기억하도록 Middle-Interest Node(MIN)를 두어 데이터를 전달하는 새로운 기법을 제안한다. 본 기법의 성능은 DD와 제안기법인 MIN에 대한 수학적 분석에 기반 하여 측정하였다.

• 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.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2015.05a
• /
• pp.20-20
• /
• 2015

최근 기후변화의 영향으로 전 세계적으로 홍수와 가뭄의 발생빈도가 증가하고 있다. 특히, 가뭄은 우리나라에서 겨울과 봄철을 중심으로 매년 발생되고 있다. 가뭄의 정확한 발생을 판단하기는 어려우나, 가뭄이 발생되면 그 진행속도는 홍수보다 느리기 때문에 초기에 가뭄의 발생가능성을 예측한다면 가뭄에 대한 피해를 줄일 수 있다. 따라서 최근 가뭄 예측에 대한 다양한 연구가 이루어지고 있다. 본 연구에서는 가뭄발생의 불확실성을 내포하기 위하여 Bayesian Network (BN) 모형과 SPI의 자기상관성을 바탕으로 가까운 미래의 가뭄 발생확률을 예측하는 방법을 제안하였다. BN은 변수들 간의 인과관계를 확률적으로 나타낼 수 있는 네트워크 모형으로, 자연현상에 대한 위험도 분석 및 의학 분야에서 질병추정을 위한 모형으로 활용되고 있다. 본 연구에서는 가까운 미래의 가뭄 예측을 위하여 APEC 기후센터(APEC Climate Center, APCC)에서 제공하는 다중모형앙상블(Multi-model Ensemble, MME) 강우예측 결과로 도출한 미래 SPI 및 과거 강우량 자료로 구축한 SPI를 부모노드로, 예측 SPI를 자식노드로 BN을 구축하였다. BN의 각각의 노드를 Gaussian 확률분포모형으로 가정한 뒤, Likelihood weighting 방법으로 주변사후분포확률(Marginal posterior distribution)을 추정하여 미래의 SPI의 발생확률을 계산하였다. 2008년부터 2013년의 BN 가뭄 예측값과 MME 강우예측 결과로 도출한 SPI를 실제 관측 강우량으로 산정한 SPI와 비교하였으며, BN이 실제 관측결과에 가까운 결과가 도출되었다. 본 연구에서는 BN을 활용하여 가까운 미래의 가뭄 발생가능성을 확률적으로 나타낼 수 있는 방법을 제시하였으며, 그 결과 가뭄상태별 가뭄 발생확률이 산정되었다.

• Review of KIISC
• /
• v.13 no.1
• /
• pp.32-41
• /
• 2003

보안 제품의 개발이 많아지면서 각 제품에 대한 통합의 필요성이 대두되고 있다. 예를 들어, 침입탐지 시스템에서 침입을 시도하는 노드를 판별한 경우, 실제 그 노드로부터의 접속을 차단할 수 있는 기능을 방화벽 시스템에서 제공하고 있기 때문에, 방화벽 시스템으로 접속 차단 명령을 보낼 수 있는 기능이 제공된다면 보다 자연스럽게 통합 관리가 이루어 질 수 있을 것이다. 그러나, 현재 보안 시장은 많은 종류의 보안 제품이 존재하기 때문에 이러한 통합이 쉽게 이루어지지는 않고 있다. 정보보호에 대한 관심이 높아지면서 많은 기업이 각종 보안시스템을 도입하고 있지만, 각 보안 시스템의 개별 관리에 중점을 두고 있어 이기종 보안 시스템간의 연동에 기반한 통합 관리 차원의 필요성이 증가된다. 따라서, 국내외의 많은 보안 업체들이 이기종 보안 제품의 연동을 위한 방안들을 제시하고 있으며, IETF(Internet Engineering Task Force)를 중심으로 표준화 작업이 진행되고 있다. 본 논문에서는 국내외 각 보안 업체 혹은 보안 업체간 컨소시엄 형태로 제안된 이기종 보안 솔루션 연동 방식 및 공개 API(Application Programming Interface) 형식들을 분석하고, 표준화 동향에 대해 살펴본다.