• 한국정보통신학회논문지
• /
• 제20권9호
• /
• pp.1717-1722
• /
• 2016

가용도는 사용자에게 고가용 서비스를 제공하는 네트워크 시스템의 주요 성능지표로서 임의의 시간에 사용자에게 서비스를 제공할 수 있는 확률이다. 네트워크 서비스의 가용도를 향상시키는 대표적인 방법으로 다중화 방식과 재활기법이 있다. 본 논문에서는 2N redundancy와 시간 기반의 재활기법이 가용도에 미치는 영향을 분석한다. 2N redundancy는 active 시스템과 standby 시스템으로 구성하는 다중화 방식이다. 재활주기에 의존하는 시간기반의 재활기법이다. 본 논문은 시간기반의 재활기법을 적용한 2N redundnacy모델을 stochastic reward net으로 설계한다. 설계한 모델은 stochastic Petri net package를 이용하여 분석한다. 수치해석을 통해 재활기법을 적용한 시스템의 가용도가 적절한 주기에서 재활기법을 적용하지 않은 시스템의 가용도보다 높다는 것을 알 수 있다.

• 한국멀티미디어학회논문지
• /
• 제14권9호
• /
• pp.1138-1151
• /
• 2011

센서 네트워크 클러스터링 기법은 네트워크의 수명연장에 효율적인 방법이다. 그러나 이 방법은 센서노드의 수집 데이터가 중복되기 쉬운 환경에서 적용할 경우 중복된 데이터 전송에 불필요하게 에너지가 소모된다는 문제점이 있다. 이에 본 논문은 중복되는 데이터 전송을 배제하고 클러스터 헤드 노드와 멤버노드 사이의 전송을 최소화하기 위해 센서 노드가 수집하는 데이터를 예측할 수 있는 데이터 예측 기법을 제안하였다. 이 방법은 인접노드의 중복데이터 수집을 배제하여 에너지 효율적인 데이터 전송이 가능하다. 여기에 불필요한 전송을 줄이기 위해 데이터 예측 그래프를 이용하여 수집 데이터 분석을 통한 선택적인 전송을 하는 방법을 도입하였다. 성능분석 결과에 의하면 제안하는 방법은 기존의 클러스터링 방법에 비해 노드들의 에너지 소모가 줄어들었다. 그럼에도 불구하고 전송 효율과 수집 데이터의 정확도가 증가했으며 결과적으로 네트워크 수명이 증가하였다.

• 정보보호학회논문지
• /
• 제29권1호
• /
• pp.29-43
• /
• 2019

최근, IoT 무선 디바이스 등의 증가로 WSN(Wireless Sensor Network) 환경에서 네트워크 트래픽이 증가하면서 네트워크 자원을 안전하고 효율적으로 관리하는 SDN(Software-Defined Networking)을 WSN에 적용한 SDWSN(Software-Defined Wireless Sensor Networking)과 그에 대한 보안 기술에 대한 관심도가 증가하고 있다. 본 논문에서는 SDWSN 환경에서 PUF(Physical Unclonable Function) 기반 그룹 키 분배 방법을 안전하고 효율적으로 설계하는 방법을 서술한다. 최근에 Huang 등은 그룹 키 분배에 SDN의 장점과 PUF의 물리적 보안 기능을 이용하여 그룹 키 분배 방법을 설계하였다. 하지만, 본 논문에서는 Huang 등의 프로토콜이 보조 제어부 미인증과 불필요한 동기화 정보를 유지하는 취약점이 존재함을 발견하였다. 본 논문에서는 보조 제어부에 인증과정을 안전하게 설계하고, 불필요한 동기화 정보는 삭제하되 카운터 스트링과 랜덤 정보를 추가하여 Huang의 취약점을 개선하였다.

• 한국군사과학기술학회지
• /
• 제13권2호
• /
• pp.243-251
• /
• 2010

The military has been putting great efforts into applying data communication on existing voice communication systems being used in NCW(Network Centric Warfare). Data communication will be an effective choice in one of many effort to yield a minimum kill chain, comparing to legacy voice communications, when tactical units conduct their missions. However, the required budget will be enormous, in case of the replacement of a lot of legacy communication systems with new one. As a cost-effective alternative, the tactical data communication systems using the conventional radio systems instead of the development of new radio systems has been proposed. It is mandatory, though, to ensure QoS while maintaining data communication by making use of legacy radio systems already in use. This paper focuses on the performance issues experimented and analyzed for tactical data communication through the legacy radio systems as the first step towards guaranteed QoS. We have conducted various experiments such as the transmission error rate on certain tactical messages, performance evaluation of redundant transfers, the relationship between the transmission frame size and rate of error, the identification of error points in the transmission frame, and techniques to reduce the errors in both hopping and non-hopping modes. As a result of the performance experiments, The adaptive communication module which decides the redundant transmission or the Forward Error Correction(FEC) technique by analyzing channel status and current transmission status(hopping/non-hopping) of the legacy radio should be designed. the FEC technique in non-hopping, and the redundant transmission technique in hopping mode was recommended from the result of experiment with the frame size is 20bytes in non-hopping and 10Bytes frame size in hopping mode.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.1115-1120
• /
• 2003

The present paper shows the possible development of particle swarm optimization (PSO) based fuzzy-neural networks (FNN) which can be employed as an important building block in real life robot systems, controlled by voice-based commands. The PSO is employed to train the FNNs which can accurately output the crisp control signals for the robot systems, based on fuzzy linguistic spoken language commands, issued by an user. The FNN is also trained to capture the user spoken directive in the context of the present performance of the robot system. Hidden Markov Model (HMM) based automatic speech recognizers are developed, as part of the entire system, so that the system can identify important user directives from the running utterances. The system is successfully employed in a real life situation for motion control of a redundant manipulator.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권5호
• /
• pp.1013-1027
• /
• 2011

In this paper we propose ATCS, a practical TCP protocol coding scheme based on network coding for satellite IP networks. The proposal is specially designed to enhance TCP performance over satellite networks. In our scheme, the source introduces a degree of redundancy and transmits a random linear combination of TCP packets. Since the redundant packets are utilized to mask packet loss over satellite links, the degree of redundancy is determined by the link error rates. Through a simple and effective method, ATCS estimates link error rates in real time and then dynamically adjusts the redundant factor. Consequently, ATCS is adaptable to a wide range of link error rates by coding TCP segments with a flexible redundancy factor. Furthermore, the scheme is compatible with traditional TCP variants. Simulation results indicate that the proposal improves TCP performance considerably.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.917-921
• /
• 2004

Principle of mailing list was distributed messages to all subscribers in one time. But mailing list operation has constructed a network traffic problem. Because mailing list manager distributed mails without concentrate on subscriber network. If our network has many of subscribers, there will be redundant data in traffic channel. Submailing list has purpose to reduce problems. Analyses of mailing list characteristic in electronic mail were a feature of submailing list system, which manage by human hand (Network Administrator). That will cause trouble for network traffic if Network Administrator could not seek for mailing list characteristic from e-mails in due time. This article will present ideas and recognize methodology for automatic working in submailing list system. Recognize step begin with capture process, which use to trap e-mail information from transfer channel. Next process is preparing raw data into recognition format. Then the third one is recognize part and find out confidential factor. The last process is make decision and determine which electronic mail has properties of mailing list characteristic. Afterward deliver result to submailing list for carry on.

• 전자통신동향분석
• /
• 제8권3호
• /
• pp.39-52
• /
• 1993

This study involves a Common Cause Failure (CCF) problem on the ultra-high reliability required system development such as war game operations, nuclear power control, air traffic control, space shuttle missions, and large scale network communication system. The system situation problems are defined according to CCF, reliability and system fault identifications for the development cast verifications in the multi-version redundant software system. Then, CCF analysis of redundant system, system principles and statistical dependence are also described. This validation oh the CCF in the human software interaction system will notify software engineers to conceive what really is CCF contribution factor, not only the internal but the external ones.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권1호
• /
• pp.227-247
• /
• 2018

For intermittently connected wireless sensor networks deployed in hash environments, sensor nodes may fail due to internal or external reasons at any time. In the process of data collection and recovery, we need to speed up as much as possible so that all the sensory data can be restored by accessing as few survivors as possible. In this paper a novel redundant data storage algorithm based on minimum spanning tree and quasi-randomized matrix-QRNCDS is proposed. QRNCDS disseminates k source data packets to n sensor nodes in the network (n>k) according to the minimum spanning tree traversal mechanism. Every node stores only one encoded data packet in its storage which is the XOR result of the received source data packets in accordance with the quasi-randomized matrix theory. The algorithm adopts the minimum spanning tree traversal rule to reduce the complexity of the traversal message of the source packets. In order to solve the problem that some source packets cannot be restored if the random matrix is not full column rank, the semi-randomized network coding method is used in QRNCDS. Each source node only needs to store its own source data packet, and the storage nodes choose to receive or not. In the decoding phase, Gaussian Elimination and Belief Propagation are combined to improve the probability and efficiency of data decoding. As a result, part of the source data can be recovered in the case of semi-random matrix without full column rank. The simulation results show that QRNCDS has lower energy consumption, higher data collection efficiency, higher decoding efficiency, smaller data storage redundancy and larger network fault tolerance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권11호
• /
• pp.4268-4290
• /
• 2015

Future mobile communications face enormous challenges as traditional voice services are replaced with increasing mobile multimedia and data services. To address the vast data traffic volume and the requirement of user Quality of Experience (QoE) in the next generation mobile networks, it is imperative to develop efficient content distribution technique, aiming at significantly reducing redundant data transmissions and improving content delivery performance. On the other hand, in recent years cloud computing as a promising new content-centric paradigm is exploited to fulfil the multimedia requirements by provisioning data and computing resources on demand. In this paper, we propose a cooperative caching framework which implements State based Content Distribution (SCD) algorithm for future mobile networks. In our proposed framework, cloud service providers deploy a plurality of cloudlets in the network forming a Distributed Cloud Service Network (DCSN), and pre-allocate content services in local cloudlets to avoid redundant content transmissions. We use content popularity and content state which is determined by content requests, editorial updates and new arrivals to formulate a content distribution optimization model. Data contents are deployed in local cloudlets according to the optimal solution to achieve the lowest average content delivery latency. We use simulation experiments to validate the effectiveness of our proposed framework. Numerical results show that the proposed framework can significantly improve content cache hit rate, reduce content delivery latency and outbound traffic volume in comparison with known existing caching strategies.