• Journal of information and communication convergence engineering
• /
• 제14권1호
• /
• pp.14-20
• /
• 2016

The AODV protocol uses many RREQ messages and one RREP message in the path-discovery process. This protocol has only one metric, the number of hops. Although it is simple, this protocol is not efficient. To avoid this problem, we propose a new AODV with two auxiliary metrics (AuM-2-AODV). The AuM-2-AODV protocol tries multiple route replies, which reduces the chance of path failure and helps the network obtain a better data rate. It has two auxiliary metrics, the remaining energy of its nodes and the number of HELLO messages received at the nodes. With these two metrics, the reliable path from the source node to the destination node will be chosen. In this paper, the performance of the AuM-2-AODV is evaluated using the NS-3 simulator. The performance results show that AuM-2-AODV provides greater throughput and packet delivery ratio by 20% and up to 50% and about 100% in some cases, respectively, than previous protocols.

• 산업경영시스템학회지
• /
• 제20권41호
• /
• pp.51-60
• /
• 1997

In this paper, A Connection Admission Control(CAC) algorithm by Dynamic Bandwidth Allocation is proposed. The B-ISDN will be required to carry traffic generated by a various traffic sources. These source will have all traffic flow characteristics and quality of services requirements. When a connectionless message with burstiness arrives at a node during a renewal period, CAC will be dynamically determined connection request by using the predetermined connection admission bounds in estimating the number of input arriving cells. The proposed algorithm estimates the available bandwidth by observing cell streams of the aggregate traffic. A connection request is accepted if the available bandwidth is larger than declared peak rate, and otherwise rejected. The proposed CAC scheme is shown to be promising and practically feasible in obtaining efficient transmission of burst traffic with guaranteed quality of services.

• 한국멀티미디어학회:학술대회논문집
• /
• 한국멀티미디어학회 2000년도 춘계학술발표논문집
• /
• pp.449-452
• /
• 2000

This paper proposes a new, adaptive Dead Reckoning model, called Dynamic Dead Reckoning , for Distributed Interactive Simulation and humanoid avatar systems. The proposed model can overcome the weak points of traditional Dead Reckoning caused by a fixed threshold and strong dependency on rotation event. This paper introduces new criteria for update message filtering , named as Update lifetime. The Dynamic Dead Reckoning keeps the balance between extrapolation fidelity and filtering performance by two component models, Variable Threshold Mechanism and Rotation Event model. The experimental results show that the proposed model can lower the increment rate of update traffic to the increase of rotation frequency without any significant loss of accuracy.

• Journal of Mechanical Science and Technology
• /
• 제18권4호
• /
• pp.718-730
• /
• 2004

The solution for the natural convection in internally finned horizontal annuli is obtained by using a numerical simulation of time-dependent and two-dimensional governing equations. The fins existing in annuli influence the flow pattern, temperature distribution and heat transfer rate. The variations of the On configuration suppress or accelerate the free convective effects compared to those of the smooth tubes. The effects of fin configuration, number of fins and ratio of annulus gap width to the inner cylinder radius on the fluid flow and heat transfer in annuli are demonstrated by the distribution of the velocity vector, isotherms and streamlines. The governing equations are solved efficiently by using a parallel implementation. The technique is adopted for reduction of the computation cost. The parallelization is performed with the domain decomposition technique and message passing between sub-domains on the basis of the MPI library. The results from parallel computation reveal in consistency with those of the sequential program. Moreover, the speed-up ratio shows linearity with the number of processor.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2015년도 하계학술대회
• /
• pp.113-115
• /
• 2015

각종 자연적 사회적 재난 위험의 증가와 함께 국내에서도 선진국과 같은 대국민 경보 전달체계의 정비가 진행중이다. 본 연구는 경보 전달 체계에 대한 시민들의 인식 실태를 조사 분석하고, 시민들의 인식을 바탕으로 한 시스템 개선 방향점을 찾아보고자 했다. 조사 결과에 의하면 현재 시민들의 경보 전달에 관한 인식은 매우 낮은 것으로 나타났다. 이런 경보 전달의 문제를 해결하는 시스템적 방법으로는 도심형의 야외 디지털 전달체계와 구내방송을 활용한 건물내 전달 체계 개선이 필요한 것으로 파악되었다. 또 한편으로는 경보 상황에서 사람들의 실질적 대응 행동 유발의 전략적 사회 맥락을 제공하는 연구가 필요하다는 것이 나타났다. 예를 들어 왜 사람들은 실제 경보 메시지를 받으면 방송에 주목하게 되는지, 또 그런 시민에게 어떤 식으로 대응 행동 가이드를 제공할지가 앞으로의 과제로 부각되었다.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2003년도 추계종합학술대회 논문집
• /
• pp.144-148
• /
• 2003

기존의 Snort와 같은 침입탐지시스템은 수없이 많은 경고 메시지를 관리자의 화면상에 표시함으로써 해당 관리자를 혼란에 빠트려 해킹 초기 대응능력을 무력하게 만드는 문제점과 함께 false positive오류 가능성을 내포하고 있다. 이에 본 논문에서는 이러한 문제점들을 해결하기 위해 상관성을 이용한 웹기반의 침입 탐지 트래픽 분석 시스템을 설계하였으며 Libpcap, Snort, ACID, Nmap, Nessus를 도구로 사용, 트래픽을 일반 트래픽과 침입 트래픽으로 구분하여 관리자가 전체 침입 탐지 트래픽 상황을 웹 상에서 쉽게 확인할 수 있도록 구현하였다. 그 결과 경고메시지 및 false positive 오류를 최소화시킬 수 있었다.

• 전기전자학회논문지
• /
• 제21권2호
• /
• pp.130-135
• /
• 2017

Normally, in data transmission, extra parity bits are added to the input message which were derived from its input and a pre-defined algorithm. The same algorithm is used by the receiver to check the consistency of the delivered information, to determine if it is corrupted or not. It recovers and compares the received information, to provide matching and correcting the corrupted transmitted bits if there is any. This paper aims the following objectives: to use an alternative error detection-correction method, to lessens both the fixed number of the required redundancy bits 'r' in cyclic redundancy checking (CRC) because of the required polynomial generator and the overhead of interspersing the r in Hamming code. The experimental results were synthesized using Xilinx Virtex-5 FPGA and showed a significant increase in both the transmission rate and detection of random errors. Moreover, this proposal can be a better option for detecting and correcting errors.

• 한국통신학회논문지
• /
• 제9권4호
• /
• pp.153-156
• /
• 1984

Nopersistent CSMA제어절차에 의하여 지역망 콘트롤러를 제작하였으며 버퍼 레지스터를 사용하여 마이크로 컴퓨터와 인터페이스 시켰다. 네트워크는 로우드의 변화에 대한 버스의 이용률을 최적화시키기 위하여 패킷 재송신 시간을 $2^n$의 함수로 조정하였다. 메시지는 패킷으로 만들어져 128바이트씩 버스에 전송되며 물리층에서 최대 데이터 전송 속도는 19,200bps를 얻었다.

• Journal of Communications and Networks
• /
• 제10권2호
• /
• pp.194-203
• /
• 2008

This paper considers the multi-input multi-output (MIMO) relay channel where multiple antennas are employed by each terminal. Compared to single-input single-output (SISO) relay channels, MIMO relay channels introduce additional degrees of freedom, making the design and analysis of optimal cooperative strategies more complex. In this paper, a partial cooperation strategy that combines transmit-side message splitting and block-Markov encoding is presented. Lower bounds on capacity that improve on a previously proposed non-cooperative lower bound are derived for Gaussian MIMO relay channels.

• 전자공학회논문지A
• /
• 제33A권5호
• /
• pp.55-64
• /
• 1996

This paper presents performance evaluation of a new high speed inter-processor communication(HIPC) network for large capacity and high performance digitral switching system. The HIPC structure implements the fast reservation and concurrent arbitration technique (modified round-robin arbitration). The performance evaluation of HIPC was performed by not only computer simulation but also numerical approximation method which was derived for a single server multi-queue system with nonexhaustive cyclic service. The approximation results are almost same with that of computer simulation. The TDX-10 basic callscenario was applied to the HIPC netowrk and analyzed. these results were compared with TDX-10 IPC and shows that the difference of th emean waiting time in the TX buffer of NTP node increases sharply according to the increase of the message arrival rate.