• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1133-1141
• /
• 2009

In this paper, we present a distributed fault-tolerant topology control protocol that configure a wireless sensor network to achieve k-connectivity and (k+1)-coverage. One fundamental issue in sensor networks is to maintain both sensing coverage and network connectivity in order to support different applications and environments, while some least active nodes are on duty. Topology control algorithms have been proposed to maintain network connectivity while improving energy efficiency and increasing network capacity. However, by reducing the number of links in the network, topology control algorithms actually decrease the degree of routing redundancy. Although the protocols for resolving such a problem while maintaining sensing coverage were proposed, they requires accurate location information to check the coverage, and most of active sensors in the constructed topology maintain 2k-connectivity when they keep k-coverage. We propose the fault-tolerant topology control protocol that is based on the theorem that k-connectivity implies (k+1)-coverage when the sensing range is at two times the transmission range. The proposed distributed algorithm does not need accurate location information, the complexity is O(1). We demonstrate the capability of the proposed protocol to provide guaranteed connectivity and coverage, through both geometric analysis and extensive simulation.

• Journal of Convergence Society for SMB
• /
• v.6 no.4
• /
• pp.17-23
• /
• 2016

With the advance of ICT, the Internet has been creating new services in various fields. However, due to the architectural problem of the Internet, it may inhibit the development of network architectures and various services. Network virtualization is being investigated as an alternative to overcome the architectural problem of the Internet and a virtual network resource allocation algorithm is a very important issue. In this paper, we propose a multiple path resource allocation algorithm with shared backup bandwidth in order to overcome single link failure. It will be improved survivability of the virtual networks. Through our experiments, we confirmed that the multi-path creation time of the proposed algorithm has about 50% performance improvement than previous works.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.6 s.348
• /
• pp.39-45
• /
• 2006

n a hybrid ad-hoc network, wired network and a mobile ad-hoc network are connected by the internet gateway. To provide seamless service for internet users in the hybrid ad-hoc network, an efficient internet gateway selection technique and a fast handover technique are needed. In this paper, we propose a seamless handoff technique for providing mobility of mobile hosts in hybrid ad-hoc networks. The proposed internet gateway re-registration algorithm improves general handoff performance. Moreover, the handoff processing time within certain range of area is reduced by using mobility management agent(MMA). In addition the packet loss is reduced when handoff occurs out of the range of MMA by tunneling technique.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.3
• /
• pp.7-12
• /
• 2016

DRAM is commonly used as a smartphone memory medium, but extending its capacity is challenging due to DRAM's large battery consumption and density limit. Meanwhile, smartphone applications such as social network services need increasingly large memory, resulting in long latency due to additional storage accesses. To alleviate this situation, we adopt emerging nonvolatile memory (NVRAM) as smartphone's buffer cache and propose an efficient management scheme. The proposed scheme stores all dirty data in NVRAM, thereby reducing the number of storage accesses. Moreover, it separately exploits read and write histories of data accesses, leading to more efficient management of volatile and nonvolatile buffer caches, respectively. Trace-driven simulations show that the proposed scheme improves I/O performances significantly.

• Convergence Security Journal
• /
• v.15 no.4
• /
• pp.91-97
• /
• 2015

General companies consider saving the information after enciphering as law. However, if the actual information is saved as enciphered, the decoding process must be conducted when the information is searched or edited in the ser ver. Therefore, process delay time occurs and is less efficient. This kind of work gives burden to the server, so the companies or managers handling the server do not save the information after enciphering. In this paper, the Networ k constructs and realizes an efficient security data management system that ensures safety and haste in operating u sing the homomorphic encryption technology, which collects information and decides quickly, and enables editing the encryption without a decoding process. To ensure the security of the embodied system, the existing encryption algo rithm can be used. Search method to use the keyword search. Additionally, by using a trapdoor, the keyword is not expose and it is changed whenever it is searched, and the formation of the keyword does not get exposed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.37-47
• /
• 2009

When H.264 encoded video streams are transmitted over wireless network, packet loss is unavoidable. Responding on this environment, we propose methods to recover missed motion vector in the decoder: At first, A candidate vector set for missing macroblock is estimated from high correlation coefficient of neighboring motion vectors and missing block vectors the algorithm clusters candidate vectors through distances amongst motion vectors of neighboring blocks. Then the optimal candidate vector is determined by the median value of the clustered motion vector set. In next stage, from the candidate vector set, the final candidate vector of missing block is determined it has minimum distortion value considering directions of neighboring pixels' boundary. Test results showed that the proposed algorithm decreases the candidate motion vectors $23{\sim}61%$ and reduces $3{\sim}4sec$ on average processing(decoding) time comparing the existing H.264 codec. The PSNR, in terms of visual quality is similar to existing methods.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.389-389
• /
• 2021

불투수면의 증가는 유량변화 및 지하수위와 기저유출의 감소로 이어질 수 있으며 기저유량의 감소는 건기 시 하천의 유량공급까지 영향을 줄 수 있다. 이런 이유로 기저유량에 대한 정확한 분석 및 검증은 반드시 필요하지만 지표수-지하수를 고려한 통합적 해석의 어려움과 기저유출 분석에 대한 불확실성 및 기술적 한계로 분석이 어려운 실정이다. 따라서 본 연구에서는 SWAT 해석을 통해 획득한 모의유량과 관측유량을 비교하여 R²값을 계산하였으며 SWAT-CUP을 이용하여 검보정을 실시한 후 기저유출량을 정량적으로 산정하고 비교하였다. 연구지역 모의기간은 실측 유량자료가 있는 4개년을 대상으로 모의 하였으며 SWAT-CUP을 이용한 검보정 시 모의 횟수는 연구자에 따라 다양한 기준을 제시하고 있지만 모의 시간 대비 최대 효율인 1,000회 수행하였다. 또한 관측유량에 대하여 SPE(Swat Parameter Estimator) 알고리즘으로 모의유량을 최적화하였다. 실측유량과 모의유량을 비교한 결과 SWAT 분석에 의한 R²값보다 SWAT-CUP을 이용하여 검보정을 수행한 R²값이 높게 나타나 검보정 효과를 확인하였다. 또한 검보정 전후에 대한 기저유량을 비교하기 위하여 SWAT Output Data를 이용하여 유역에 대한 지표수유출, 중간유출, 지하수유출 등을 추출하였다. 추출한 단위면적당 데이터를 단위환산을 통해 유출량으로 산정하였으며 검보전 전과 데이터를 비교하였다. 지표수-지하수를 고려한 통합적 해석의 어려움과 실측치의 부족, 분석에 대한 불확실성 등으로 기저유량에 대한 해석은 어렵지만 SWAT-CUP을 이용하여 검보정 및 불확실성 개선이 수행되면 좀더 정확한 유량을 계산할 수 있으며 이는 향후 연구지역 지표수-지하수 연계해석을 위한 기초자료로 활용될 수 있을 것으로 판단된다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2022.05a
• /
• pp.42-42
• /
• 2022

지금까지도 유역에서의 녹조 모니터링은 현장채수를 통한 점 단위 모니터링에 크게 의존하고 있어 기후, 유속, 수온조건 등에 따라 수체에 광범위하게 발생하는 녹조를 효율적으로 모니터링하고 대응하기에는 어려운 점들이 있어왔다. 또한, 그동안 제한된 관측 데이터로 인해 현장 측정된 실측 데이터 보다는 녹조와 관련이 높은 NDVI, FGAI, SEI 등의 파생적인 지수를 산정하여 원격탐사자료와 매핑하는 방식의 분석연구 등이 선행되었다. 본 연구는 녹조의 모니터링시 정확도와 효율성을 향상을 목표로 하여, 우선은 녹조 측정장비를 활용, 7000개 이상의 녹조 관측 데이터를 확보하였으며, 이를 바탕으로 동기간의 고해상도 위성 자료와 실측자료를 매핑하기 위해 다양한Machine Learning기법을 적용함으로써 그 효과성을 검토하고자 하였다. 연구대상지는 낙동강 내성천 상류에 위치한 영주댐 유역으로서 데이터 수집단계에서는 면단위 현장(in-situ) 관측을 위해 2020년 2~9월까지 4회에 걸쳐 7291개의 녹조를 측정하고, 동일 시간 및 공간의 Sentinel-2자료 중 Band 1~12까지 총 13개(Band 8은 8과 8A로 2개)의 분광특성자료를 추출하였다. 다음으로 Machine Learning 분석기법의 적용을 위해 algae_monitoring Python library를 구축하였다. 개발된 library는 1) Training Set과 Test Set의 구분을 위한 Data 준비단계, 2) Random Forest, Gradient Boosting Regression, XGBoosting 알고리즘 중 선택하여 적용할 수 있는 모델적용단계, 3) 모델적용결과를 확인하는 Performance test단계(R², MSE, MAE, RMSE, NSE, KGE 등), 4) 모델결과의 Visualization단계, 5) 선정된 모델을 활용 위성자료를 녹조값으로 변환하는 적용단계로 구분하여 영주댐뿐만 아니라 다양한 유역에 범용적으로 적용할 수 있도록 구성하였다. 본 연구의 사례에서는 Sentinel-2위성의 12개 밴드, 기상자료(대기온도, 구름비율) 총 14개자료를 활용하여 Machine Learning기법 중 Random Forest를 적용하였을 경우에, 전반적으로 가장 높은 적합도를 나타내었으며, 적용결과 Test Set을 기준으로 NSE(Nash Sutcliffe Efficiency)가 0.96(Training Set의 경우에는 0.99) 수준의 성능을 나타내어, 광역적인 위성자료와 충분히 확보된 현장실측 자료간의 데이터 학습을 통해서 조류 모니터링 분석의 효율성이 획기적으로 증대될 수 있음을 확인하였다.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.835-844
• /
• 2002

The number of channels available to a video server is limited since the number of channels a video server can support is determined by its communication bandwidth. Several approaches such as batching, piggybacking and patching have been proposed to reduce I/O demand on the video server by sharing multicast data. Patching has been shown to be efficient in the matter of the cost for VOD systems. Unlike conventional multicast techniques, patching is a dynamic multicast scheme which enables a new request to join an ongoing multicast. In addition, true VOD can be achieved since a new request can be served immediately without having to wait for the next multicast. In this paper. we propose two types of channel reservation patching algorithm : a fixed channel reservation patching and a variable channel reservation patching. To immediately schedule the requests for popular videos, these algorithms reserve the channels of video server for the fixed number of popular videos or for the variable number of popular videos which is determined dynamically according to the load of video server. The performance of the proposed algorithms is evaluated through simulations, and compared with that of simple patching. Our performance measures are average defection rate, average latency, service fairness and the amount of buffered data according to video server loads. Simulation results show that the proposed channel reservation patching algorithms provide better performance compared to simple patching algorithm.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.9
• /
• pp.397-406
• /
• 2017

In case of using the existing encrypted algorithm for massive data encryption service under the cloud environment, the problem that requires much time in data encryption come to the fore. To make up for this weakness, a partial encryption method is used generally. However, the existing partial encryption method has a disadvantage that the encrypted data can be inferred due to the remaining area that is not encrypted. This study proposes a partial encryption method of increasing the encryption speed and complying with the security standard in order to solve this demerit. The proposed method consists of 3 processes such as header formation, partial encryption and block shuffle. In step 1 Header formation process, header data necessary for the algorithm are generated. In step 2 Partial encryption process, a part of data is encrypted, using LEA (Lightweight Encryption Algorithm), and all data are transformed with XOR of data in the unencrypted part and the block generated in the encryption process. In step 3 Block shuffle process, the blocks are mixed, using the shuffle data stored with the random arrangement form in the header to carry out encryption by transforming the data into an unrecognizable form. As a result of the implementation of the proposed method, applying it to a mobile device, all the encrypted data were transformed into an unrecognizable form, so the data could not be inferred, and the data could not be restored without the encryption key. It was confirmed that the proposed method could make prompt treatment possible in encrypting mass data since the encryption speed is improved by approximately 273% or so compared to LEA which is Lightweight Encryption Algorithm.