• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.9
• /
• pp.760-766
• /
• 2012

In this paper, we propose an efficient flooding process on link-state routing protocol. It is possible to exchange information using typical link-state routing protocol; for example, OSPF(Open Short Path First) or IS-IS(Intermediate system routing protocol) that floods LSA between nodes when the network topology change occurs. However, while the scale of network is getting bigger, it affects the network extensibility because of the unnecessary LSA that causes the increasing utilization of CPU, memory and bandwidth. An existing algorithm based on the Minimum spanning tree has both network instability and inefficient flooding problem. So, we propose algorithm for efficient flooding while maintaining network stability. The simulation results show that the flooding of proposed algorithm is more efficient than existing algorithm.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.1
• /
• pp.40-48
• /
• 2005

A hydraulic hose is an important part of the hydraulic system which transmits power using pressurized fluids. It allows relative motion between components at each end of the hose assembly, and it is much easier to route a hose assembly than it is to bend and install a rigid tubing assembly. Unnecessary loads, which drop the hose's pressure capability and shorten service life, depend on a hose-routing. Therefore, the Hydraulic system designers must be aware to consider unnecessary load does not affect the here. For this consideration in an early stage of the design process, CAD system must support the hose assembly routing design function which is to generate routing path and design fitting angle properly. This paper proposes 2 methods. One is to generate curves that are similar to routing paths of the real hose assembly using the energy minimization method and the optimization method. The other is to design fitting angles that are important design elements of a hose assembly using the Parallel Transport Frame. To implement the proposed methods above, commercial CAD software, CATIA has been integrated with our program.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1160-1170
• /
• 2010

Existing multipath routing mechanism has much overhead to maintain the state of nodes on the multipath route and does not guarantees completely disjoint multipath construction from source to destination. In this paper, we propose an Explicit Disjoint Multipath (EDM) routing algorithm to enhance energy efficiency through removing the flooding mechanism for route discovery process, minimizing the number of nodes participating in route update and balancing the traffic load for entire network. EDM constructs logical pipelines which can create disjoint multipaths in logical way. Then it physically performs anchor node based geographic routing along the logical pipeline in order to build multipath to the destination. EDM can provide the distribution effect of traffic load over the network, help to balance the energy consumption and therefore extend the network lifetime.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4644-4661
• /
• 2015

Wireless sensor networks are often organized in the form of clusters leading to the new framework of WSN called cluster or hierarchical WSN where each cluster head is responsible for its own cluster and its members. These hierarchical WSN are prone to various routing layer attacks such as Black hole, Gray hole, Sybil, Wormhole, Flooding etc. These routing layer attacks try to spoof, falsify or drop the packets during the packet routing process. They may even flood the network with unwanted data packets. If one cluster head is captured and made malicious, the entire cluster member nodes beneath the cluster get affected. On the other hand if the cluster member nodes are malicious, due to the broadcast wireless communication between all the source nodes it can disrupt the entire cluster functions. Thereby a scheme which can detect both the malicious cluster member and cluster head is the current need. Abnormal energy consumption of nodes is used to identify the malicious activity. To serve this purpose a learning based energy prediction algorithm is proposed. Thus a two level energy prediction based intrusion detection scheme to detect the malicious cluster head and cluster member is proposed and simulations were carried out using NS2-Mannasim framework. Simulation results achieved good detection ratio and less false positive.

• ETRI Journal
• /
• v.37 no.6
• /
• pp.1108-1119
• /
• 2015

Multicast communication of mobile ad hoc networks is vulnerable to internal attacks due to its routing structure and high scalability of its participants. Though existing intrusion detection systems (IDSs) act smartly to defend against attack strategies, adversaries also accordingly update their attacking plans intelligently so as to intervene in successful defending schemes. In our work, we present a novel indirect internal stealthy attack on a tree-based multicast routing protocol. Such an indirect stealthy attack intelligently makes neighbor nodes drop their routing-layer unicast control packets instead of processing or forwarding them. The adversary targets the collision avoidance mechanism of the Medium Access Control (MAC) protocol to indirectly affect the routing layer process. Simulation results show the success of this attacking strategy over the existing "stealthy attack in wireless ad hoc networks: detection and countermeasure (SADEC)" detection system. We design a cross-layer automata-based stealthy attack on multicast routing protocols (SAMRP) attacker detection system to identify and isolate the proposed attacker. NS-2 simulation and analytical results show the efficient performance, against an indirect internal stealthy attack, of SAMRP over the existing SADEC and BLM attacker detection systems.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.94-96
• /
• 2021

Software-Defined Networking (SDN), which has emerged to overcome the limitations of existing network architectures, makes routing management simpler and more efficient through a central controller. SR (Segment Routing) is a flexible and scalable way of doing source routing, and defines the information path of the network through a list of segments arranged in the packet header. In an SDN environment, the performance of each router is almost the same, but packets tend to be concentrated on routes that are frequently used depending on routing algorithms. Routers in that path have a relatively high frequency of failure and are more likely to become bottlenecks. In this paper, we propose a routing algorithm that allows the router, which is a resource in the network, to evenly process packets in the SDN with SR, so that the administrator can utilize the resources in the network without idle routers, and at the same time facilitate the management of the router.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.387-396
• /
• 2004

One of the main problems associated with MANETs is that mobility and the associated route discovery and maintenance procedures of reactive routing protocols cause severe interruptions on real-time video streams. Some of these interruptions are too large to be concealed using any sort of video technology, resulting in communications breaks unpleasant for the final end user. We present a solution for enhanced video transmission that increases route stability by using an improved route discovery process based on the DSR routing protocol, along with traffic splitting algorithms and a preventive route discovery mechanism. We also present some video adaptative mechanisms that improve the overall performance of multipath routing in terms of video data replication and video packet splitting strategies. Combining our proposals, we achieve up to 97% less interruptions on communication with high mobility and over 1.2 dB of improvements in terms of video distortion.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.119-122
• /
• 2004

This mobile oriented Ad-hoc network yet steps on development level, related issues and standardization are progressing. This paper presented ad-hoc network's overview and overall property, followed by routing scheme that must be setup for communication between each nodes. Among several routing scheme proposed for standardization, ZRP that is foaled by this paper, is hybrid type algorithm, and only includes advantages of others This paper presented running process and implementation method, result that is made from network simulation, shows analysis of each parameter values's change. Each parameters changed with many differences according to Zone radius and communication node's location from simualtion that was performed changing a number of nodes and a velocity of nodes.

• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.235-249
• /
• 2008

On-demand routing protocol in ad hoc network is that establishes a route to a destination node only when it is required by a source node. But, it is necessary to reestablish a new route when an active route breaks down. The reconstruction process establishes another route by flooding messages from the source to the destination, cause not only heavy traffic but also long delays in route discovery. A good method for analyzing performance of protocols is important for deriving better systems. In this paper, we suggest the numerical formulas of a representative on-demand routing protocol AODV, ARMP, and RRAODV to estimate the performance of these routing protocols for analyzing the performance of these protocols. The proposed analytical models are very simple and straightforward. The results of analysis show good agreement with the results of computer simulations.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.5
• /
• pp.582-594
• /
• 2016

Various test data compression techniques have been developed to reduce the test costs of system-on-a-chips. In this paper, a scan chain reordering algorithm for code-based test data compression techniques is proposed. Scan cells within an acceptable relocation distance are ranked to reduce the number of conflicts in all test patterns and rearranged by a positioning algorithm to minimize the routing overhead. The proposed method is demonstrated on ISCAS '89 benchmark circuits with their physical layout by using a 180 nm CMOS process library. Significant improvements are observed in compression ratio and test power consumption with minor routing overhead.