• Proceedings of the Korean Society of Computer Information Conference
• /
• 2013.07a
• /
• pp.81-82
• /
• 2013

무센 센서 네트워크는 개방된 환경에서 운영되기 때문에 허위 보고서와 허위 투표 삽입 공격으로부터 쉽게 노출되어 있다. 두 공격을 감지하기 위해 확률적 투표-기반 여과 기법은 보고서가 전달되는 동안 그 보고서의 투표 검증을 이용하여 허위 범위 경계 값을 통해 두 공격을 감지한다. 본 논문에서 제안 기법은 네트워크의 상황을 고려하여 센서 노드의 에너지 잔여량, 홉 수, 전달된 보고서의 수를 통해 퍼지 시스템의 입력 요소로 결정하고 나온 결과를 허위 범위 경계 값을 결정을 통해 기존 기법보다 에너지 효율을 증가시킨다. 그러므로 우리의 제안 기법은 기본 기법보다 비교했을 때 전체 네트워크 수명 연장을 기대한다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2015.01a
• /
• pp.271-272
• /
• 2015

센서 네트워크에서 센서는 제한적인 자원 때문에 다양한 공격으로부터 취약하다. 이러한 공격 중 하나인 허위 보고서 삽입 공격은 불필요한 에너지 소모와 허위 알람을 유발한다. 이 공격의 피해를 줄이기 위한 확률적 투표 여과 기법은 검증 노드를 통해 보고서의 맥들을 검증한다. 그러나 허위 보고서가 검증 노드까지 도달하는 데 불필요한 에너지가 소비된다. 본 논문에서, 우리의 제안 기법은 소스의 다음 노드에 키를 배포하여 허위 보고서 삽입 공격을 효율적으로 감지한다. 따라서 제안 기법은 기존 기법보다 에너지 효율성 향상을 기대할 수 있다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.4
• /
• pp.157-162
• /
• 2010

The cart-pole balancing problem is a pseudo-standard benchmark problem from the field of control methods including genetic algorithms, artificial neural networks, and reinforcement learning. In this paper, we propose a novel approach by using online reinforcement learning(OREL) to solve this cart-pole balancing problem. The objective is to analyze the learning method of the OREL learning system in the cart-pole balancing problem. Through experiment, we can see that approximate faster the optimal value-function than Q-learning.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.11a
• /
• pp.276-281
• /
• 1998

도입이 가속화되고 있는 초고속통신망에서 데이터통신망 서비스 사업자 시스템에 적용될 번호체계, 상호 접속 기준에 대한 기본적 요건과 기술적 표준/규정 등에 대한 정의가 미비한 실정이다. 초고속 통신망에 접속 및 운용될 데이터 통신망 중에서 초고속망의 번호 계획을 위하여 연동을 고려할 대상 망은 기존의 인터넷망, 패킷 데이터망, 및 ISDN 둥이 있다. 본 고에서는 ITU-T 표준 규격을 따르는 B-ISDN망과 데이터통신망간 연동을 위한 번호 체계에 대하여 논한다. 특히 현재 제정된 ITU-T 표준 규격을 중심으로 현존하는 데이터망, 인터넷망과 초고속망들의 번호 체계를 중심으로 상호 연동 방안을 기술하였다. 또한 초고속망에서의 번호이동성 방안도 검토하였다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.6
• /
• pp.117-123
• /
• 2009

There are two types of survivability. We find the characteristics of them for networks. And using the dual homing, we analysis the routing cost and link cost. Also we propose the cost-efficient heuristic design method of network topology in order to use survivability. By design samples, we analysis the cost efficiency and show that the new design method can be used to design network topology for survivability easily.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.51-58
• /
• 2017

This paper deals with the improvement of cluster head selection method in L-SEP for heterogeneous nodes among hierarchical routing protocols of wireless sensor network. Wireless sensor networks are classified into homogeneous and heterogeneous network. In heterogeneous network, SEP, L-SEP are mainly used because cluster head selection probability is different depending on node type. But, since protocol based on SEP has different cluster head selection probabilities depending on the node type, clusters that transmit data inefficiently can be formed. to improve this, it is necessary to select the cluster head that minimizes the transmission distance of member node and the cluster head. Therefore, we propose a protocol that improve the cluster head selection method.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.45-50
• /
• 2020

A Language model with neural networks commonly trained with likelihood loss. Such that the model can learn the sequence of human text. State-of-the-art results achieved in various language generation tasks, e.g., text summarization, dialogue response generation, and text generation, by utilizing the language model's next token output probabilities. Monotonous and boring outputs are a well-known problem of this model, yet only a few solutions proposed to address this problem. Several decoding techniques proposed to suppress repetitive tokens. Unlikelihood training approached this problem by penalizing candidate tokens probabilities if the tokens already seen in previous steps. While the method successfully showed a less repetitive generated token, the method has a large memory consumption because of the training need a big vocabulary size. We effectively reduced memory footprint by encoding words as sequences of subword units. Finally, we report competitive results with token level unlikelihood training in several automatic evaluations compared to the previous work.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.4
• /
• pp.658-667
• /
• 2009

NEMO (Network Mobility) introduces the concept of mobile router in order to supply users with group mobility over wireless and mobile networks. This paper investigates the advantages and disadvantages of NEMO in terms of the overhead of group mobility management. This paper proposes the additional requirements to enhance NEMO performance. Moreover, we analyze the main communication paths, CN-HA, HA-MR, and MR-MNN, in the real NEMO testbed.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.304-307
• /
• 2015

Virtualization lacks capabilities for enabling the application to scale efficiently because of new applications components which are raised to be configured on demand. In this paper, we propose an architecture that affords mobile app based on nomadic smartphone using not only mobile cloud computing-cloudlet architecture but also a dedicated platform that relies on using virtual private mobile networks to provide reliable connectivity through Long Term Evolution (LTE) wireless communication. The design architecture lies with how the cloudlet host discovers service and sends out the cloudlet IP and port while locating the user mobile device. We demonstrate the effectiveness of the proposed architecture by implementing an android application responsible of real time analysis by using a vehicle to applications smart phones interface approach that considers the smartphones to act as a remote users which passes driver inputs and delivers outputs from external applications.

• Journal of information and communication convergence engineering
• /
• v.16 no.3
• /
• pp.142-147
• /
• 2018

We present a practical design algorithm for quantizers at nodes in distributed systems in which each local measurement is quantized without communication between nodes and transmitted to a fusion node that conducts estimation of the parameter of interest. The benefits of vector quantization (VQ) motivate us to incorporate the VQ strategy into our design and we propose a low-complexity design technique that seeks to assign vector codewords into sets such that each codeword in the sets should be closest to its associated local codeword. In doing so, we introduce new distance metrics to measure the distance between vector codewords and local ones and construct the sets of vector codewords at each node to minimize the average distance, resulting in an efficient and independent encoding of the vector codewords. Through extensive experiments, we show that the proposed algorithm can maintain comparable performance with a substantially reduced design complexity.