• Title/Summary/Keyword: 라우팅 성능개선

Search Result 163, Processing Time 0.027 seconds

Improvement of OLSR Through MIMC's Decreased Overhead in MANET (모바일 애드 혹 네트워크 환경 하에서 멀티인터페이스 멀티채널의 오버헤드 감소를 통한 OLSR의 성능 개선)

  • Jang, Jae-young;Kim, Jung-ho
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.3
    • /
    • pp.55-70
    • /
    • 2016
  • The most critical research issue in MANET environment is on supporting reliable communication between various devices. Various Multi-Hop Routing Protocol studies have proceeded. However, some problems you might have found when you use the existing link state routing technique are that it increases Control Message Overhead and it is unstable when node moves in CR circumstance which has transformation of using channel and MIMC circumstance which uses a number of interfaces. This essay offers a technique which is based on On-Demand Hello and the other technique which used Broadcast Interface of optimization as a solution to decrease Control Message Overhead. Also it proposes Quick Route Restoration technique which is utilized by GPS and MPR Selection technique which consider mobility as a solution of stable communication when node moves. Those offered Routing Protocol and OPNET based simulator result will be expected to be an excellent comparison in related research fields.

An Improvement of Fast Handoff Protocol using Modified Local Registration in Mobile Computing Environment (이동 컴퓨팅 환경에서 수정된 지역 위치등록을 이용한 고속 핸드오프 프로토콜 개선)

  • Han, Seung-Jin;Choe, Seong-Yong;Lee, Jeong-Hyeon
    • The KIPS Transactions:PartC
    • /
    • v.9C no.2
    • /
    • pp.267-276
    • /
    • 2002
  • By using wireless terminal, User that want to transmit multimedia traffic as well as simple text and voice have a tendency to increase. This paper proposes a fast handoff protocol that is suitable transmission for real-tim of multimedia traffic by using modified local registration. The proposed protocol solves the Triangle Routing Protocol that is one of existing opened issues without modifying protocol of CN, and we propose the method that MN is able to received a packet by real-time, even if MN is being handoff. We compare fast handoff protocol proposed in this paper with existing method n the registration cost and data packet transmission cost. As a result, we showed that fast handoff protocol proposed in this paper outperforms existing method.

Performance Improvement for Increased Communication Speed in Anonymous Network using GeoIP (GeoIP를 이용한 익명 네트워크에서 통신 속도 향상을 위한 성능 개선)

  • Park, Kwang-Cheol;Lim, Young-Hwan;Lim, Jong-In;Park, Won-Hyung
    • The Journal of Society for e-Business Studies
    • /
    • v.16 no.4
    • /
    • pp.75-85
    • /
    • 2011
  • Although progress in information technology has made our life prosperous. But it accompanied a number of adverse effects in various aspects. Especially, internet according to the increasing requirements for privacy and security, IP concealment network technologies to ensure the anonymity are constantly being developed. IP concealment network technologies is aiding the user to bypass the blocked sites can be used to access for information gathering, and they could be used for a malicious hacker to hide his attacks. However, due to complex routing path, local communication bandwidth sangyiham, and internode encryption there are also disadvantages that communication speed is significantly less. In this paper, the research for improving the performance of anonymous networks is to proceed by the communication speed measurement that using GeoIP the particular country with high-bandwidth is Specified or path length is limited.

A Restoration Method for Improving Fault Recovery in MPLS Networks Routing Protocol (패킷망에서 NGN을 위한 라우팅 프로토콜MPLS망에서 장애 개선을 위한 복구 기법)

  • In Chi-Hyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11B
    • /
    • pp.956-966
    • /
    • 2004
  • Nowadays, NGN(Next Generation Network) is evolving into network with packet based QoS.\ulcorner This paper presents the recovery method as a selecting way of more efficient path in MPLS network that reduces the service interruption time. In order to increase the efficiency of usage of recovering resource which is one of major functions of disorder recovering, it opens the state information of each Node both to fault detector and bandwidth broker so that it reduces message transmission time for recovery when functional disorder occurs. in addition, by effective management and adjustment of required bandwidth of entire network depending on the changes of traffic load, it improves the efficiency of bandwidth usage. and in MPLS network supporting priority selection function, it allocates domains depending on the traffic relating to priority order to the entire network so that\ulcorner it efficiently allocates proper resources to the restoring process between the entry and the end for the traffic of high priority and for low priority traffic, it restores path oかy inside disordered domain. by doing this, it reduces resetting time and unnecessary massage transmission.

A Route Repair Scheme for Reducing DIO Poisoning Overhead in RPL-based IoT Networks (RPL 기반 IoT 네트워크에서 DIO Poisoning 오버헤드를 감소시키는 경로 복구 방법)

  • Lee, Sung-Jun;Chung, Sang-Hwa
    • Journal of KIISE
    • /
    • v.43 no.11
    • /
    • pp.1233-1244
    • /
    • 2016
  • In the IoT network environments for LLNs(Low power and Lossy networks), IPv6 Routing Protocol for Low Power and Lossy networks(RPL) has been proposed by IETF(Internet Engineering Task Force). The goal of RPL is to create a directed acyclic graph, without loops. As recommended by the IETF standard, RPL route recovery mechanisms in the event of a failure of a node should avoid loop, loop detection, DIO Poisoning. In this process, route recovery time and control message might be increased in the sub-tree because of the repeated route search. In this paper, we suggested RPL route recovery method to solve the routing overhead problem in the sub-tree during a loss of a link in the RPL routing protocol based on IoT wireless networks. The proposed method improved local repair process by utilizing a route that could not be selected as the preferred existing parents. This reduced the traffic control packet, especially in the disconnected node's sub tree. It also resulted in a quick recovery. Our simulation results showed that the proposed RPL local repair reduced the recovery time and the traffic of control packets of RPL. According to our experiment results, the proposed method improved the recovery performance of RPL.

Load-Aware Channel Switching Algorithm for Multi-Channel Multi-Hop Wireless Network (멀티 채널 멀티 홉 무선 네트워크에서 부하 인지 채널 변경 기술)

  • Kang, Min-Su;Lee, Young-Suk;Kang, Nam-Hi;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.110-118
    • /
    • 2007
  • In multi-hop wireless network, multi-channel makes it possible to enhance network performance because it reduces channel interferences md contentions. Recently several schemes have been proposed in the literatures to use multi-channel. Especially, MCR(Multi channel routing protocol), which utilize hybrid interface assignment, is a prominent routing protocol. MCR uses simple way to change channel but efficiently reduce channel interferences. In this paper, we propose a load-aware channel selection algorithm called LCS that enhances the channel switching algerian used in MCR protocol. In LCS, channel of a node is assigned based on collected information about queue length of neighbors. Moreover this paper evaluates the performance of in by using simulation test and testbed demonstration. Test results show that the MCR with LCS outperforms the naive MCR.

Optimization Protocol using Load Balancing for Hierarchical Wireless Sensor Network (무선센서네트워크에서 부하 균등화를 위한 클러스터링 최적화 프로토콜)

  • Choi, Hae-Won;Kim, Sang-Jin;Pye, Su-Young;Chang, Chu-Seock
    • Journal of Digital Convergence
    • /
    • v.11 no.10
    • /
    • pp.419-429
    • /
    • 2013
  • The Wireless sensor network(WSN) consisting of a large number of sensors aims to gather data in a variety of environments. The sensor nodes operate on battery of limited power. so, To extend network life time is major goals of research in the WSN. In this paper, we state the key point of a energy consumption with minimum&load balancing. The proposed protocol guarantee balance of number of cluster member nodes using the node memory threshold and optimization of distribution of cluster head using the optimized clustering method. The results show that the proposed protocol could support the load balancing and high energy efficiency by distributing the clusters with a reasonable number of member nodes. The simulation results show that our schme ensure longer life time in WSN as compare with existing schemes such as LEACH and CBLM.

An Improved CBRP using Secondary Header in Ad-Hoc network (Ad-Hoc 네트워크에서 보조헤더를 이용한 개선된 클러스터 기반의 라우팅 프로토콜)

  • Hur, Tai-Sung
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.1
    • /
    • pp.31-38
    • /
    • 2008
  • Ad-Hoc network is a network architecture which has no backbone network and is deployed temporarily and rapidly in emergency or war without fixed mobile infrastructures. All communications between network entities are carried in ad-hoc networks over the wireless medium. Due to the radio communications being extremely vulnerable to propagation impairments, connectivity between network nodes is not guaranteed. Therefore, many new algorithms have been studied recently. This study proposes the secondary header approach to the cluster based routing protocol (CBRP). The primary header becomes abnormal status so that the primary header can not participate in the communications between network entities, the secondary header immediately replaces the primary header without selecting process of the new primary header. This improves the routing interruption problem that occurs when a header is moving out from a cluster or in the abnormal status. The performances of proposed algorithm ACBRP(Advanced Cluster Based Routing Protocol) are compared with CBRP. The cost of the primary header reelection of ACBRP is simulated. And results are presented in order to show the effectiveness of the algorithm.

  • PDF

A Study on Routing Performance Improvement through Cooperation Authentication Technique (협력기반 인증 기법을 통한 라우팅 성능 개선에 관한 연구)

  • Yang, Hwanseok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.12 no.1
    • /
    • pp.71-79
    • /
    • 2016
  • The main security threats in MANET are integrity and non-repudiation. In the meantime, a lot of secure routing protocols have been designed in order to block these security threats. In this paper, partnership-based authentication technique is proposed in order to provide participation exclusion of network and non-repudiation for the nodes. The proposed technique is a technique that participates in data communication for only the nodes receiving the authentication through the authentication process for the nodes. For this, the proposed technique is largely consists of two steps. The first step is the process that issued the certificate after the reliability for the nodes participating in the network is evaluated. And in the second step, the key exchange agreement with the neighbor nodes is performed and data communication is made after setting security path with responding nodes. The level of security in data transmission is improved because the process of path setting is performed through cooperation with a neighboring nodes having high reliability during the course of these two steps. The superiority of proposed technique in this paper was confirmed through the comparative experiment.

Design and Performance Evaluation of a 3-Dimensional Nonblocking Copy Network for Multicast ATM Switches (ATM 멀티캐스트 스위치를 위한 3차원 논블럭킹 복사망의 설계 및 성능평가)

  • 신재구;손유익
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.6
    • /
    • pp.696-705
    • /
    • 2002
  • This paper presents a new copy network for multicast ATM switches. Many studies have been carried out up to date since the proposition of Lee's copy network. However, the overflows and cell conflicts within the switch have still been raised a problem in argument. In order to reduce those problems, we proposed a 3-dimensional multicast switching architecture which has shared buffers in this paper. The proposed architecture can reduce the overflows and cell conflicts through multiple paths and output ports even in the high load environments. Also, we proposed a cell splitting algorithm which handles the cell in the case of large fan-out, and a copy network to increase throughput by expanding the Lee's Broadcast Banyan Network(BBN). Cell copy uses the Boolean interval splitting algorithm and the multicast pattern of the cells according to the self-routing characteristics of the network. In the proposed copy network, we improve the problems such as overflow, cell splitting of large fanout, cell conflicts, etc., which were still existed in the Lee's network. The results of performance evaluation by computer simulation show that the proposed scheme has better throughput, cell loss rate and cell delay than the conventional method.