• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2015년도 춘계학술대회
• /
• pp.113-115
• /
• 2015

본 논문에서는 Delay Tolerant Networks(DTNs)에서 노드의 속성 정보 변화율을 이용한 이동 예측 알고리즘인 WRC(Weighted Rate Control)알고리즘을 제안한다. 기존 DTN에서 예측기반 라우팅 기법은 노드의 이전 속성 정보를 이용하여 목적 노드와 연결성이 높은 노드를 중계 노드로 선정하여 통신한다. 따라서 이동 노드는 유동적이므로 노드의 이후 속성 정보를 반영하지 않는 예측 기법은 신뢰성이 낮아진다. 본 논문에서는 이전 속성 정보로부터 이후 속성정보까지의 시간에 따른 변화율과 속성의 가중치 정보를 이용하여 노드의 이동 경로를 예측하는 WRC알고리즘을 제안한다. 본 논문에서 제안하는 알고리즘은 노드의 속성 정보 중 노드의 속도와 방향성을 근사한 후, 변화율을 분석하고 이로부터 제안된 가중치를 이용하여 노드의 이동 경로를 예측하는 알고리즘이다. 주어진 모의실험 환경에서 노드의 이동 경로 예측을 통해 중계 노드를 선정하여 라우팅 함으로써 네트워크 오버헤드와 전송 지연 시간이 감소함을 보여주고 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권10호
• /
• pp.4678-4702
• /
• 2018

Traffic Matrix estimation has always caught attention from researchers for better network management and future planning. With the advent of high traffic loads due to Cloud Computing platforms and Software Defined Networking based tunable routing and traffic management algorithms on the Internet, it is more necessary as ever to be able to predict current and future traffic volumes on the network. For large networks such origin-destination traffic prediction problem takes the form of a large under- constrained and under-determined system of equations with a dynamic measurement matrix. Previously, the researchers had relied on the assumption that the measurement (routing) matrix is stationary due to which the schemes are not suitable for modern software defined networks. In this work, we present our Compressed Sensing with Dynamic Model Estimation (CS-DME) architecture suitable for modern software defined networks. Our main contributions are: (1) we formulate an approach in which measurement matrix in the compressed sensing scheme can be accurately and dynamically estimated through a reformulation of the problem based on traffic demands. (2) We show that the problem formulation using a dynamic measurement matrix based on instantaneous traffic demands may be used instead of a stationary binary routing matrix which is more suitable to modern Software Defined Networks that are constantly evolving in terms of routing by inspection of its Eigen Spectrum using two real world datasets. (3) We also show that linking this compressed measurement matrix dynamically with the measured parameters can lead to acceptable estimation of Origin Destination (OD) Traffic flows with marginally poor results with other state-of-art schemes relying on fixed measurement matrices. (4) Furthermore, using this compressed reformulated problem, a new strategy for selection of vantage points for most efficient traffic matrix estimation is also presented through a secondary compression technique based on subset of link measurements. Experimental evaluation of proposed technique using real world datasets Abilene and GEANT shows that the technique is practical to be used in modern software defined networks. Further, the performance of the scheme is compared with recent state of the art techniques proposed in research literature.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• pp.450-453
• /
• 2005

A forest fire occurs mainly as natural factor such as wind, temperature or human factor such as light. Recently, the most of forest fire prevention is prediction or prevision against forest fire by using remote sensing technology. However in order to forest fire prevention, the remote sensing has many limitations such as high cost and advanced technologies and so on. Therefore, we need to multisensor integration system that utilize not only remote sensing but also in-situ sensing in order to reduce large damage of forest fire though analysis of happen cause and prediction routing of occurred forest fire. In this paper we propose a multisensor integration system that offers prediction information of factors and route of forest fire by integrates collected data from remote sensor and in-situ sensor for forest fire prevention. The proposed system is based on wireless sensor network for collect observed data from various sensors. The proposed system not only offers great quality information because firstly, raw data level fuse different format of collected data from remote and in-situ sensor but also accomplish information level fusion based on result of first stage. Offered information from our system can help early prevention of factor and early prevision against occurred forest fire which transfer to SMS service or alert service into monitoring interface of administrator.

• Journal of Communications and Networks
• /
• 제16권4호
• /
• pp.465-474
• /
• 2014

Wireless sensor network (WSN) is considered to be one of the most important research fields for ubiquitous healthcare (u-healthcare) applications. Healthcare systems combined with WSNs have only been introduced by several pioneering researchers. However, most researchers collect physiological data from medical nodes located at static locations and transmit them within a limited communication range between a base station and the medical nodes. In these healthcare systems, the network link can be easily broken owing to the movement of the object nodes. To overcome this issue, in this study, the fast link exchange minimum cost forwarding (FLE-MCF) routing protocol is proposed. This protocol allows real-time multi-hop communication in a healthcare system based on WSN. The protocol is designed for a multi-hop sensor network to rapidly restore the network link when it is broken. The performance of the proposed FLE-MCF protocol is compared with that of a modified minimum cost forwarding (MMCF) protocol. The FLE-MCF protocol shows a good packet delivery rate from/to a fast moving object in a WSN. The designed wearable platform utilizes an adaptive linear prediction filter to reduce the motion artifacts in the original electrocardiogram (ECG) signal. Two filter algorithms used for baseline drift removal are evaluated to check whether real-time execution is possible on our wearable platform. The experiment results shows that the ECG signal filtered by adaptive linear prediction filter recovers from the distorted ECG signal efficiently.

• Environmental Sciences Bulletin of The Korean Environmental Sciences Society
• /
• 제2권1호
• /
• pp.29-36
• /
• 1998

An instantaneous unit sediment graph (IUSG) model is investigated for prediction of sediment yield from an upland watershed in Northwestern Mississippi. Sediment yields are predicted by convolving source runoff with an IUSG. The IUSG is the distribution of sediment from an instantaneous burst of rainfall producing one unit of runoff. The IUSG, defined as a product of the sediment concentration distribution (SCD) and the instantaneous unit hydrograph (IUH), is known to depend on the characteristics of the effective rainfall. The IUH is derived by the Nash model for each event. The SCD is assumed to be an exponential function for each event and its parameters were correlated with the effective rainfall characteristics. A sediment routing function, based on travel time and sediment particle size, is used to predict the SCD.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2013년도 추계학술대회
• /
• pp.522-523
• /
• 2013

Delay Tolerant Network (DTN)란 노드 간 통신의 지연 시간이 길고 연결 단절이 자주 일어나는 네트워크 상황에서 데이터를 안정적으로 전달할 수 있도록 지원할 수 있는 네트워크를 말한다. DTN은 노드들 간의 연결 정도의 강약을 파악하여 연결 정도가 높은 노드를 통해 목적 노드로 메시지를 전달하는 방식을 사용한다. 노드들의 움직임이 빠르고 서로간의 거리가 멀어 지속적인 종단 간 연결성이 보장 되지 않는 상황일 때 DTN을 사용하면 안정적인 전송이 가능하다. 이때 이 노드들의 움직임을 예측 할 수 있다면 더 효과적인 메시지 전달이 가능 할 것이다. 이 논문에서는 이동 노드의 속도와 목적지 등과 같은 이동성 정보를 이용해 노드의 위치를 예측하여 효과적인 메시지 전달 경로를 결정하는 이동 예측 기반의 DTN 알고리즘을 제안한다. 이 알고리즘은 Mobility Strategy Sharing Location Service Protocol을 발전시켜 위치 정보 업데이트의 오버헤드를 최소화한다.

• 한국환경과학회지
• /
• 제2권1호
• /
• pp.29-36
• /
• 1993

An instantaneous unit sediment graph (IUSG) model is investigated for prediction of sediment yield from an upland watershed In Northwestern Mississippi. Sediment yields are predicted by convolving source runoff with an IUSG. The IUSG is the distribution of sediment from an instantaneous burst of rainfall producing one unit of runoff. The IUSG, defined as a product of the sediment concentration distribution (SCD) and the instantaneous unit hydrograph (IUH), is known to depend on the characteristics of the effective rainfall. The IUH is derived by the Nash model for each event. The SCD is assumed to be an exponential function for each event and its parameters were correlated with the effective rainfall characteristics. A sediment routing function, based on travel time and sediment particle size, is used to predict the SCD.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2011년도 춘계학술발표대회
• /
• pp.1064-1067
• /
• 2011

선박경제운항이란 파도와 바람과 같은 해양 기상정보 예측을 바탕으로 선박의 운항방법에 따른 연료 소모량과 운항시간을 예상해보고, 가장 경제적인 운항을 하는 것을 말한다. 본 논문에서는 실용화할 수 있는 범용의 경제운항시스템 개발에 중점을 두었다. 기존의 시스템들을 살펴보면 임의의 정해진 경로를 대상으로 실험하는 경우가 많은데, 이를 개선하여 임의의 출발점과 도착점이 주어지면 A*알고리즘을 통해서 지리상 최단경로를 찾아내도록 하여 시스템을 자동화하였으며 적용범위를 세계 전역으로 확대 하였다. 그리고 기존의 엔진출력을 고정하거나 속력을 일정하게 운항한다는 가정에서 벗어나서 엔진출력을 탐색하여 보다 효율적인 운항 솔루션을 찾아내도록 하였다. 그리고 사용측면에서는 운항사들에게 보다 효용성 높은 시스템이 되기 위해서, 일방적인 권고보다는 연료소모량과 운항시간 별로 다양한 솔루션들을 제공하여 운항사의 판단을 존중함과 동시에 운항보조시스템으로서의 역할에 충실할 수 있도록 하였다.

• 인터넷정보학회논문지
• /
• 제15권3호
• /
• pp.53-62
• /
• 2014

DTN(Delay/Disruption Tolerant Network)은 행성과 행성 간의 통신, 행성과 인공위성과의 통신과 같이 종단 간 연결이 보장되지 않고, 빈번한 연결 부재가 발생하고 기존 인터넷 인프라가 충분히 갖춰지지 않는 네트워크에 적합한 차세대 네트워크이다. 본 논문에서는 DTN 환경에서의 노드 간에 접촉한 기록 데이터를 이용하여 주기적으로 만나는 것을 확인하고, 향후 만나는 시간을 예측하여, 예측한 시간을 토대로 메시지를 누구에게 보내야 효율적인지를 선별하여, 메시지를 보내도록 한다. 또한 기존 라우팅 기법인 Spray and Wait 라우팅을 선별된 노드에게 적용하는 Hybrid Spray and Wait 알고리즘을 제안한다. 제안 알고리즘을 검증하기 위해 헬싱키 대학의 ONE(Opportunistic Network Environment) Simulator를 이용하여 이를 실험하였다. 제안하는 알고리즘의 전달성공률을 Binary Spray and Wait 라우팅의 성능과 비교하였고, 10% 적은 오버헤드를 보임을 확인하였다. 또한 불필요한 메시지의 복사를 줄일 수 있음을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2499-2522
• /
• 2017

Multi-hop networks are a low-setup-cost solution for enlarging an area of network coverage through multi-hop routing. Carrier sense multiple access with collision avoidance (CSMA/CA) is frequently used in multi-hop networks. Multi-hop networks face multiple problems, such as a rise in contention for the medium, and packet loss under heavy-load, saturated conditions, which consumes more bandwidth due to re-transmissions. The number of re-transmissions carried out in a multi-hop network plays a major role in the achievable quality of service (QoS). This paper presents a statistical, analytical model for the end-to-end delay of contention-based medium access control (MAC) strategies. These strategies schedule a packet before performing the back-off contention for both differentiated heterogeneous data and homogeneous data under saturation conditions. The analytical model is an application of Markov chain theory and queuing theory. The M/M/1 model is used to derive access queue waiting times, and an absorbing Markov chain is used to determine the expected number of re-transmissions in a multi-hop scenario. This is then used to calculate the expected end-to-end delay. The prediction by the proposed model is compared to the simulation results, and shows close correlation for the different test cases with different arrival rates.