• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.797-803
• /
• 2012

Recently demands in construction of the stand-alone networks and interconnection between convergence devices have led an increase in research on and much attention has been paid to the application of MANET as a Ubiquitous network which is growing fast. With performance both as hosts and routers, easy network configuration, and fast response, mobile nodes participating in MANET are suitable for Embedded computing, but have vulnerable points, such as lack of network scalability and dynamic network topology due to mobility, passive attacks, active attacks, which make continuous security service impossible. In this study, hashed AODV routing is used to protect from counterfeiting messages by malicious nodes in the course of path finding and setting, and disguising misrouted messages as different mobile nodes and inputting them into the network.

• The KIPS Transactions:PartC
• /
• v.17C no.4
• /
• pp.379-384
• /
• 2010

Mobile nodes in high mobility ad hoc networks might come together in specific areas. In non-uniformly distributed networks, traffic load can be concentrated to intermediate nodes between dense clusters, and networks performance can be degraded. In this paper, we proposed a cluster based routing protocol that heavy traffic nodes adaptively react according to traffic load. The simulation result shows that the proposed protocol reduce packet loss and end-to-end delay.

• The KIPS Transactions:PartA
• /
• v.10A no.5
• /
• pp.453-462
• /
• 2003

IP address lookup of router searches and decide proper output link using destination address of IP packet that arrie into router. The IP address lookup is essential part in te development of high-speed router needed to high-speed backbone network as one of bottleneck of router performance. This paper introduces DTC data structure that can support gigabit IP address lookup by dynamic trie compression technique that just uses small memory in conventional Pentium CPU. When make a forwarding table by trie compression, the DTC can dynamically select a size of data structure with considering correlation between table's size and searching speed. Also, when compress the prefix trie, DTC makes IP address lookup on the forwarding table of a search on the high speed SRAM cache by minimizing the size of data structure reflecting the structure of the trie. In the experiment result, the DTC data structure recorded performance of maximum $12.5{\times}10^5$ LPS (lookup per second) in conventional Pentium CPU through a dynamic building of most suitable compression over variety of routing tables.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1085-1095
• /
• 2000

In this paper, we have defined the rules and the algorithm for diagnosis and recovery of routing configuration fault on a system. By using them, we have implemented the Java-based system that can manage routing configuration fault automatically. To manage routing configuration fault, the production rule for network configuration management, the production rule for routing configuration fault diagnosis, and the production rule for routing configuration fault recovery have been proposed. Rule-based routing configuration fault management system has been implemented on the basis of backward chaining algorithm and applied for meta rules for the purpose of interconnecting the production rules. We have derived the experimental result from transition process of the rules, the Blackboard, the goals based on scenarios. Through the implementation of dynamically applicable system in heterogeneous and rapidly changing network environments, we have proposed the methodology for network configuration fault management. Also, we expect that network configuration manager can reduce time and cost wasted for routing configuration fault management.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.812-815
• /
• 2008

이동 호스트의 이동에 따른 단절 또는 장애는 애드혹 네트워크에서 중요한 이슈중 하나이다. 응답 메시지를 전송하기 위해, DSR 이나 AODV 에서는 메시지 전송 요청을 위해 설정된 경로를 재사용한다. 즉, 설정된 경로를 이용해서 역방향으로 응답 메시지를 전송 하는 방식이다. 이러한 경우, 설정된 경로상에 있는 이동 호스트의 이동에 따른 장애는 매우 치명적이다. 이동 호스트에 의한 장애는 예측 가능성에 따라 예측 가능한 장애와 예측 불가능한 장애로 구분할 수 있다. 예측 가능한 장애는 이동 호스트가 스스로 장애의 발생 여부를 파악 할 수 있는 경우를 의미한다. 예를 들면, 이동호스트의 제한된 전원 또는 이동 호스트의 이동성에 의해 발생하는 장애가 대표적인 예이다. 반면에 예측 불가능한 장애는 이동 호스트가 스스로 장애를 예측 할 수 없는 경우를 의미하며, 이러한 장애의 대부분은 문제를 해결할 충분한 시간이 주어지지 않을 만큼 급작스럽게 발생한다. 본 논문에서는 예측 가능한 장애에 대해 능동적이고 지능적으로 대처할 수 있도록 하는 새로운 방법을 제안한다. 이는 회사 내에서 업무를 인수 인계하는 방식과 매우 유사하다. 또한 본 논문에서 제안하는 방법은 앞서 언급한 이동 호스트의 이동에 따른 장애 문제를 해결함에 있어서, DSR 또는 AODV 처럼 메시지 전송 요청 시 설정된 경로가 응답 메시지 전송을 위해 다시 사용되는 라우팅 알고리즘에 비해 경로 재설정 시간과 전송 되는 메시지의 총량 측면에서 매우 효과적이고, 이동 호스트들이 스스로 장애를 예측하고 이에 대해 능동적이고 지능적으로 대처 할 수 있도록 한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.728-731
• /
• 2008

Recently demands in construction of the stand-alone networks and interconnection between convergence devices have led an increase in research on IETF MANET working group, Bluetooth, and HomeRF working group and much attention has been paid to the application of MANET as a Ubiquitous network which is growing fast. With performance both as hosts and routers, easy network configuration, and fast response, mobile nodes participating in MANET are suitable for Embedded computing, but have vulnerable points, such as lack of network scalability and dynamic network topology due to mobility, passive attacks, active attacks, which make continuous security service impossible. For perfect MANET setting, routing is required which can guarantee security and efficiency through secure routing. In routing in this study, hashed AODV is used to protect from counterfeiting messages by malicious nodes in the course of path 'finding and setting, and disguising misrouted messages as different mobile nodes and inputting them into the network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.9
• /
• pp.1250-1256
• /
• 2018

Recently, wireless networks are becoming an important infrastructure for the critical large-scale applications such as cyber-physical systems and next generation industrial automations. However, the fundamental performance uncertainty of wireless networks may incur the serious instability problem of the overall systems. This paper proposes the proactive network optimizer to guarantee the application demands without any real-time link monitoring information of the networks. In particularly, the proposed proactive optimizer is the cross-layer approach to jointly optimize the routing path and traffic distribution in order to guarantee the performance demand within a maximum k number of link faults. Through the simulations, the proposed proactive network optimizer provides better robustness than the traditional existing reactive networks. Furthermore, the proactive network does not expose to the major weakness of the reactive networks such as the performance degradation due to the erroneous link monitoring information and the network reconfiguration cost.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.550-554
• /
• 2002

In this paper, we design the CORBA-based Mobile-Agent Model (CMAM) which has the capability of the efficient work processing in distributed environment through sensing network traffic and searching the optimal path for migration nodes of mobile agent. In case existing mobile agent model is given various works from user, the network overhead and traffic are increased by increasing of execution module size. Also, if it happens a large quantity of traffics due to migration of nodes according to appointment of the passive host(node) muting schedule by user, it needs much cost for node search time by traffic. Therefore, in this paper, we design a new mobile agent model that assures the reliability of agent's migration through dynamic act on the specific situation according to appointment of the active routing schedule and can minimize agent's work processing time through optimal path search. The proposed model assigns routing schedule of the migration nodes actively using an extended MAFFinder. Also, for decreasing overhead of network by agent's size, it separated by mobile agent including oかy agent calling module and push agent with work executing module based on distributed object type of CORBA. Also, it can reduce the required time for round works of mobile agent through the optimal path search of migration nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.11
• /
• pp.2199-2214
• /
• 1994

In order to sufficiently utilize the potential effectiveness of ATM networks, systematic and effective network management and control systems must be employed. In addition to network design, planning, and call routing techniques used in traditional circuit-switched networks. ATM networks can provide logical VP(Virtual Path) reconfiguration capabilities which can adapt to changes in the network environment. With a proper application of the VP reconfiguration technique, ATM networks can reduce the overhead of frequent network redesign and the overhead of call routing processing. However, ATM VP reconfiguration is a very complex and difficult problem which consists of many facets of optimization subproblems such as VP routing. VP sizing, VP terminating point location and VC routing. Most previous research on the ATM logical network reconfiguration problem dealt with the subset of the problem. This paper mathematically formulates the ATM network reconfiguration problem completely considering all subproblems. Since it is very difficult to derive the optimal solution of the formulated problem, we develop a heuristic method based on a Max min bandwidth allocation principle. We show the feasibility of the proposed heuristic method with a simple example.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.630-635
• /
• 2008

Recently, in order to improve the energy efficiency of WSN(Wireless Sensor Network), widely research have teen carried on. But, up to the present, Majority of methods are based on direct communication between CH(cluster head) and sink node, and based on the assumption that node can regulate signal energy actively according to the distance between nodes. So it's hard to implement those methods. Based on the theory that node has fixed radio wave radius, this paper present a multi leveling routing protocol. According to the simulation of the presented protocol, we have proved the energy saving efficiency and the implementation in real WSN.