• The Journal of Aerospace Industry
• /
• s.53
• /
• pp.95-104
• /
• 2000

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.611-620
• /
• 2007

Distributing the routing path over the entire network is an important factor to maintain the lifetime of wireless sensor network as long as possible. This paper proposes a fuzzy routing protocol that decides a routing path based on the fuzzy control rules. The fuzzy controller receives the energy values, distances, and hop counts of possible route paths as input, and the inference engine produces the contribution factors for each of route paths. The route path with the largest contribution factor is elected as the final routing path. The nodes contained in the routing path reduce their energy after transmitting a data packet so as to prevent the same route path from being selected repeatedly. It makes the network traffic spreaded over the network resulting longer network lifetime. The computer simulations on TinyOS have shown that the fuzzy routing protocol is more energy efficient and has longer network lifetime compared to the existing routing protocols.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.4
• /
• pp.55-61
• /
• 2020

In this paper, we present a novel approach to efficiently control the location of NPC(Non-playable characters) in the interactive virtual world such as game, virtual reality. To control the NPC's movement path, we first calculate the main trajectory based on the user's path, and then move the NPC based on the weight map. Our method constructs automatically a navigation mesh that provides new paths for NPC by referencing the user trajectories. Our method enables adaptive changes to the virtual world over time and provides user-preferred path weights for smartagent path planning. We have tested the usefulness of our algorithm with several example scenarios from interactive worlds such as video games, virtual reality. In practice, our framework can be applied easily to any type of navigation in an interactive world.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.142-144
• /
• 2006

MANET(Mobile Ad hoc Network)은 기지국(Base Station)이나 AP(Access Point)와 같은 고정된 네트워크 인프라의 도움 없이 임시망을 구성하는 무선 단말 노드들의 집합이다. MANET의 단말들은 단말로서의 데이터 전송 역할 뿐만 아니라 라우터, 서버로서의 역할도 동시에 수행 하여야 한다. 또한 노드의 이동 패턴, 링크 품질, 잔존 배터리의 양 등에 따라 네트워크 토폴로지가 변할 수 있으므로, 모바일 노드들 간의 통신을 위한 경로 설정과 유지가 매우 어렵다. 따라서 효과적으로 모바일 노드 간에 경로를 설정하고 유지하기 위한 라우팅 프로토콜에 대한 많은 연구가 이루어지고 있다. 본 논문에서는 대표적인 On-demand 방식인 AODV 프로토콜을 개선하여 목적지 노드에서 경로 복구 절차를 시작함으로써 기존 설정된 경로를 최대한 이용하여 경로복구 과정에서 제어 트래픽 오버헤드 및 데이터 패킷의 손실을 최소화하기 위한 라우팅 프로토콜을 제안한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.6
• /
• pp.706-721
• /
• 1999

망의 초기 설계 후에 입력환경의 변화로 인하여 망의 트래픽 요구량이 변화할 때 이를 용량 재분배를 통해 해결하는 방안을 제시하고 실험을 통해 분석해 보았다. 이용자 트래픽의 변동에 효율적으로 대처하고 이용자 연결의 통신 품질을 유지시키기 위하여 운용 경로 및 보호경로의 경로 및 용량 재할당방법을 연구하였다. 기존의 운용 VP만을 고려한 방안과 보호 경로의 용량을 함께 고려하는 방안의 비교를 통해 제안 방안의 특성을 조사하였다. 망의 제어 비용을 줄이기 위한 효과적인 방안으로 보호 경로의 용량을 운용 경로 용량보다 어느 정도 초과해서 할당하는 방안을 제시하였다. 제안 방안이 비록 소폭의 비용상승을 유발하지만, 트래픽이 빨리 변하는 환경에서는 오히려 비용 절감의 효과를 유발할 수 있어 효과적 방안이 될 수 있음을 알 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.277-279
• /
• 2005

무선 멀티 홉 네트워크는 기지국 없이 중간의 무선 단말기를 경유해서 메세지를 전송하므로 무선 단말기의 전력 상태나 이동에 따라 그 토폴로지가 자주 변한다. 따라서 목적지까지 경로를 탐색하고 유지하기 위해 효율적인 경로 탐색 기법에 대한 연구가 필요하다. 그러나 경로 탐색 과정은 경로 탐색 메세지를 네트워크 전체로 전파하는 플러딩으로 인해 네트워크의 처리율을 크게 감소시킨다. 플러딩으로 발생하는 트래픽을 억제하기 위해 제안된 선별적인 플러딩 기법 중 이웃 노드 정보에 기반 한 접근 방식은 비교적 정확하게 재전송에 필요한 노드를 선별할 수 있으나 HELLO 패킷을 주기적으로 발생시켜야 한다. 본 논문은 이웃 노드의 맥(MAC) 계층에서 발생하는 제어 메세지를 청취해서 이웃 노드의 트래픽 정보를 수집하고 이것을 이용해서 재전송에 필요한 노드를 선별하는 기법을 제안 한다.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.126-129
• /
• 2007

Recently the use of wireless network increases according to it solves the hand-off and with path loss, pading, noise etc of wireless network the research for transmission error improvement is developed. TCP and SCTP of standard where it guarantees the reliability of wire network apply in wireless network the congestion control, flow control mechanism used it decreases the efficiency of data transfer throughputs. In this paper, It mixes SCTP and SNOOP for SCTP apply on wireless network, to improve BS(Basic Station) operation processes when the transmission error occurs in wireless network. BS send ZWP(Zero Window Probe) to MN(Mobile Node) when the transmission error occurs so, check path and status and update RWND and error status checked. It selects the new path, send ZWA(Zero Window Advertisement) to FH(Fixed Host) and the prevents call to congestion control or flow control and it does to make wait status standing. Continuously of data transfer after the connection of wireless network is stabilized, it make increase about 10% the transmission throughput of data.

• Journal of the Institute of Convergence Signal Processing
• /
• v.10 no.1
• /
• pp.80-85
• /
• 2009

The performance of the robot is very limited in the conventional model-based control methods when the environments around a robot are not structured or are varying dynamically. The reason for that is the methods are based on the model of the environments which is very difficult to match with the real environments and on a path planning which is complex and time-consuming. On the other hand, the behavior-based control methods are not dependant on the model of the environments nor a complex planning. In those methods, a specific behavior is coupled with a specific sensor output, so the response of a robot is quite reactive and timely in dynamic and unstructured environments. In this thesis, we propose a situation dependant behavior based control architecture, in which a robot may behave differently to the same sensor output depending on various situations. We also show some experimental results to show the feasibility of the proposed control architecture.

• The KIPS Transactions:PartC
• /
• v.13C no.3 s.106
• /
• pp.353-358
• /
• 2006

Unlike TCP Reno, TCP Vegas recognizes network congestion through the measuring of RTT (Round Trip Time) and decides the main congestion control parameters, such as Windows size. But, congestion avoidance scheme of Vegas poorly reflects asymmetric characteristics of packet path because TCP Vegas uses the measuring of RTT that reflects forward/backward packet transmission delay as a forward delay. The RTT can't infer the forward/backward transmission delay variation because it only measures the packet's turn around time. In this paper, We have designed and implemented a new Vegas congestion control algorithm that can distinguish forward/backward network congestion. We have modified the source codes of TCP Vegas in Linux 2.6 kernel and verified their performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.2
• /
• pp.397-406
• /
• 2000

Genetic algorithm is used as a means of search, optimization md machine learning, its structure is simple but it is applied to various areas. And it is about an active and effective controller which can flexibly prepare for changeable circumstances. For this study, research about an action base system evolving by itself is also being considered. There is to have a problem that depended entirely on heuristic knowledge of expert forming membership function and control rule for fuzzy controller design. In this paper, for forming the fuzzy control to perform self-organization, we tuned the membership function to the most optimal using a genetic algorithm(GA) and improved the control efficiency by the self-correction and generation of control rules.