• Journal of IKEEE
• /
• v.23 no.1
• /
• pp.280-288
• /
• 2019

In the CR-enabled MANET, routing paths can be easily destroyed due to node mobility and channel unavailability (due to the emergence of the PU of a channel), resulting in significant overhead to maintain/recover the routing path. In this paper, network caching is actively used for route maintenance, taking into account the properties of the CR. In the proposed scheme, even if a node detects that a path becomes unavailable, it does not generate control messages to establish an alternative path. Instead, the node stores the packets in its local cache and 1) waits for a certain amount of time for the PU to disappear; 2) waits for a little longer while overhearing messages from other flow; 3) after that, the node applies local route recovery process or delay tolerant forwarding strategy. According to the simulation study using the OPNET simulator, it is shown that the proposed scheme successfully reduces the amount of control messages for path recovery and the service latency for the time-sensitive traffic by 13.8% and 45.4%, respectively, compared to the existing scheme. Nevertheless, the delivery ratio of the time-insensitive traffic is improved 14.5% in the proposed scheme.

• Korean Journal of Logic
• /
• v.18 no.2
• /
• pp.265-289
• /
• 2015

The idea that an effect counterfactually depends on its cause is simple and intuitive. However, this simple idea runs into various difficulties. The active route account, in order to avoid the difficulties, analyzes causation in terms of counterfactual dependence under certain control. In her recent article, Seahwa Kim criticizes Sungsu Kim's earlier attempt to defend the active route account from its counterexamples. Her criticisms are convincing, and defenders of the active route account or counterfactual analysis of causation in general need another defense. In response, a two-step defense is proposed. First, the scope of the active route account is restricted to 'proximate' causal relation. Second, a control over factors that are in proximate causal relation is offered to figure out 'distant' causal relation. The result is that with proper control, an effect indeed counterfactually depends on its cause.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3A
• /
• pp.337-346
• /
• 2004

Punctured convolutional codes increase transmission efficiency without increasing hardware complexity. However, Viterbi decoder supporting punctured codes requires long decoding length and large survivor memory to achieve sifficiently low bit error rate (BER), when compared to the Viterbi decoder for a rate 1/2 convolutional code. This Paper presents novel architecture adopting a pipelined trace-forward unit reducing survivor memory requirements in the Viterbi decoder. The proposed survivor path architecture reduces the memory requirements by removing the initial decoding delay needed to perform trace-back operation and by accelerating the trace-forward process to identify the survivor path in the Viterbi decoder. Experimental results show that the area of survivor path unit has been reduced by 16％ compared to that of conventional hybrid survivor path unit.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.6
• /
• pp.629-633
• /
• 2011

Recently, systems such as aircraft, trains and ships have become larger more complex. Therefore, the reliability calculation of these systems is more difficult. This paper presents a reliability calculation algorithm for a complex system with a solution that is difficult to analyze. When the system has a very complex structure, it is very difficult to find an analytical solution. In this case, we can assess system reliability using the failure enumeration method of the reliability path. In this research, we represent the reliability block diagram by an adjacent matrix and define the reliability path. We can find any system status by the failure enumeration of the reliability path, and thus we can calculate any kind of system reliability through this process. This result can be applied to RCM (Reliability-Centered Maintenance) and reliability information-management systems, in which the system reliability is composed of the reliabilities of individual parts.

• The Science & Technology
• /
• no.4 s.443
• /
• pp.78-79
• /
• 2006

• Monthly Duck's Village
• /
• s.70
• /
• pp.37-41
• /
• 2009

충청북도가 AI청정지역을 유지한 비결은 한발 앞선 적극적인 방역행정 추진이 가장 큰 원인으로 작용했다. 200년과 2002년 구제역, 2003년 AI 발생을 극복한 경험으로 실용적인 방역시스템 훈련을 강화하는 한편, 2004년 이후 청정지역을 달성할 수 있었던 것은 꾸준하게 친환경축산물 생산기반 구축을 위해 무항생제 면역증강 물질 및 가공장 지원(90억원)과 친환경축산 시설장비 지원(111억원), 생균제 및 가축분뇨자원화 사업(200억원) 지원과 양축농가와 행저이관이 함께 유기적인 협조체제를 유지하면서 사전 방역활동을 한 결과다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.3
• /
• pp.1522-1530
• /
• 2014

High-rise residential complex type is getting important as new town development and urban regeneration in the downtown area. However, literature review of high-rise residential complex and research on satisfaction analysis of real residents are lack. Therefore, this paper is analyzing environmental friendly planning elements of high-rise building as housing subdivision, inside of building, facility, and maintenance by a survey on experts. The purpose of this paper is to suggest improvement method of environmental-friendly planning elements of high-rise residential complex by M-IPA. First, as a result, the part of housing subdivision has to keep complex land utilization, environmental-friendly transportation. Second, the part of inside of building shows that ecological housing subdivision, indoor air environment urgent and indoor temperature environment keeps maintaining. Finally, the part of facility/maintenance shows that material and facility, and index of energy management are urgently needed.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1501-1504
• /
• 2005

Ad Hoc 네트워크의 QoS 관리를 위해서는 자원의 요청과 예약뿐만 아니라 최선형 패킷의 제어 또한 함께 이루어져야 한다. 기존에 제안된 Ad Hoc 네트워크 QoS 경로 설정 방법들은 이를 고려하지 않거나 고려할 경우에도 복잡한 정보 처리 및 전송률 제어를 통해서 문제를 해결한 경우가 대부분이다. 이 논문에서는 클러스터 가중치를 이용하여 최선형 패킷을 네트워크에 고루 분산시킴으로써 기존 QoS 트래픽을 유지할 수 있는 새로운 경로 설정 기법을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.676-678
• /
• 2004

이동 임시 무선망은 잦은 망 구성의 변화, 라우터의 수, 제한된 사용 자원 등 기존 유선 네트워크와는 다른 특성들을 가지게 된다. 따라서 기존의 유선 네트워크에서 사용하던 라우팅 프로토콜들을 이동 임시 무선망에 그대로 적용시킨다면 많은 문제점들이 발생하게 된다. 본 논문에서 제안하는 라우팅 프로토콜은 이동 임시 무선망의 특성을 고려하여, 네트워크 내의 이동 호스트를 멀티 홉을 갖는 클러스터로 묶고. 클러스터 헤드로 하여금 자신의 멤버 호스트들과 이웃 클러스터들의 헤드 정보를 유지하게 하여, 경로 설정에 대한 요구가 있을 때에 적은 지연 시간과 적은 패킷으로 목적지까지의 최단 경로를 설정할 수 있도록 한다. 또한 경로 설정과 데이터 전송 모두가 클러스터 헤드를 이용한다. 이러한 경우 모든 데이터와 경로설정 시 발생하는 패킷들이 클러스터 헤드로 집중되어 네트워크 부하가 발생하게 되는데 본 제안에서는 네트워크의 부하를 줄이기 위하여 후보 클러스터 헤드를 이용하는 방법을 제시한다.

• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.293-300
• /
• 2004

Ad hoc networks are groups of mobile hosts without any fixed infrastructure. Frequent changes in network topology owing to node mobility make these networks very difficult to manage. Therefore, enhancing the reliability of routing paths in ad hoc networks gets more important. In this paper, we propose a ZRP(Zone Routing Protocol)-based route discovery scheme that can not only reduce the total hops of routing path, but Improve security through authentications between two nodes. And to solve the problem in maintenance of routing paths owing to frequent changes of the network topology, we adopt a query control mechanism. The effectiveness of our scheme is shown by simulation methods.