• Title/Summary/Keyword: Proactive routing

Search Result 65, Processing Time 0.027 seconds

Virtual Cluster-based Routing Protocol for Mobile Ad-Hoc Networks (이동 Ad-hoc 네트워크를 위한 가상 클러스터 방식의 경로 설정 프로토콜)

  • 안창욱;강충구
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.6C
    • /
    • pp.544-561
    • /
    • 2002
  • In this paper, we propose a new hybrid type of the routing protocol (Virtual Cluster-based Routing Protocol: VCRP) for mobile ad-hoc networks, based on a virtual cluster, which is defined as a narrow-sense network to exchange the basic information related to the routing among the adjacent nodes. This particular approach combines advantage of proactive routing protocol (PRP), which immediately provides the route collecting the network-wide topological and metric information, with that of reactive routing protocol, which relies on the route query packet to collect the route information on its way to the destination without exchanging any information between nodes. Furthermore, it also provides the back-up route as a byproduct, along with the optimal route, which leads to the VCBRP (Virtual Cluster-based Routing Protocol with Backup Route) establishing the alternative route immediately after a network topology is changed due to degradation of link quality and terminal mobility, Our simulation studies have shown that the proposed routing protocols are robust against dynamics of network topology while improving the performances of packet transfer delay, link failure ratio, and throughput over those of the existing routing protocols without much compromising the control overhead efficiency.

Performace Evaluation of Global MANET adapted to Internet Access solution (인터넷 억세스 솔루션을 적용한 Global MANET의 성능 분석)

  • Jung, Chan-Hyuk;Oh, Se-Duk;Kim, Hyun-Wook;Lee, Kwang-Bae;Yu, Choung-Ryoul;Mun, Tae-Su
    • Journal of IKEEE
    • /
    • v.10 no.1 s.18
    • /
    • pp.75-86
    • /
    • 2006
  • The MANET that can make autonomous distributed Network with Routing function has many differences than past wireless communication. For upcoming ALL-IP environment, MANET device should be connected with wired Internet Network and MANET is required to have a gateway to bridge two different networks to share information from any place. In this paper, Using the GMAHN Algorithm proposed Proactive, Reactive, Hybrid method that provides Inteface between Wired Internet network and MANET, we learned each method's the advantage and disadvantage through the various network environments. And also, we presented the optimization method of Hybrid combined Proactive with Reactive.

  • PDF

Load Balancing for Zone Routing Protocol to Support QoS in Ad Hoc Network

  • Chimmanee, Sanon;Wipusitwarakun, Komwut;Runggeratigul, Suwan
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1685-1688
    • /
    • 2002
  • Application Routing Load Balancing (ARLB) is a novel load balancing mode that combines QoS routing and load balancing in per application to support QoS far real-time application based on wired network. Zone Routing Protocol (ZRP) is a recent hybrid proactive/reactive routing approach in an attempt to achieve scalability of ad-hoc network. This routing approach has the potential to be efficient in the generation of control traffic than traditional routing schemes. Up to now, without proper load balancing tools, the ZRP can actually guarantee QoS for delay-sensitive applications when congestion occurred in ad-hoc network. In this paper, we propose the ARLB to improve QoS fur delay-sensitive applications based on ZRP in ad-hoc network when congestion occurred and to be forwarding mechanism fur route coupling to support QoS for real-time applications. The critical point is that the routing metric of ARLB is originally designed for wired network environment. Therefore, we study and present an appropriate metric or cost computation routing of ARLB for recently proposed ZRP over ad-hoc network environment.

  • PDF

Multi-Path DSDV Routing Protocol using Bypass Information in Wireless Mesh Network (무선메쉬 네트워크에서 우회정보를 이용한 다중경로 DSDV 라우팅기법)

  • Lee, Do-Yup;Kim, Jung-Gyu
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.5 no.3
    • /
    • pp.157-167
    • /
    • 2010
  • One of the most famous proactive routing protocols, DSDV (Destination -Sequenced Distance-Vector), is based on the minimum hop count. This paper suggests BIMP(Bypass Information Multi-Path) DSDV routing protocol that this protocol could route reliably as it can take the information of the bypass for the solution of the problem on EHMP DSDV. In this paper, the protocol checks throughput, packet delivery delay, packet delivery ratio, number of management messages, packet transmit finish time, etc on the traffic compared to DSDV, HMP DSDV, and EHMP DSDV protocols.

A new Dynamic Hybrid Routing Scheme for Ad Hoc Network (Ad Hoc 망에서 새로운 다이나믹 하이브리드 라우팅 연구)

  • Lee, Hyun-Ju;Choi, Mun-Suk;Rhee, Chung-Sei
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2002.04b
    • /
    • pp.1591-1594
    • /
    • 2002
  • 이 논문에서는 기존의 Ad Hoc 네트워크 라우팅 방법 중 proactive routing 과 reactive routing 의 장점을 접목시켜 2-tier 계층구조위에서 효율적인 routing 기법을 제안한다. 또한 제한된 tier-2 네트워크에서 기존의 3GPP 서비스와 상호 연동 가능성을 고려하여 네트워크의 형태 변화에 따른 클러스터 헤더의 효율적인 생성 및 안정적인 경로 확보와 함께 클러스터 헤더의 신뢰성을 제공하기 위한 키 분배 메커니즘을 고찰한다.

  • PDF

Scalability Analysis of MANET IPv6 Address Auto-configuration Protocols based on Link Error Modeling (링크 에러 모델링을 이용한 MANET 환경에서의 IPv6 자동주소 설정 방식의 확장성 분석)

  • Kim, Sang-Chul
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.4
    • /
    • pp.282-291
    • /
    • 2008
  • This paper focuses on message complexity performance analysis of MANET AAPs in reference to link errors generated by the mobile wireless nodes. To obtain the message complexity performance of AAPs in reference to the link error probability ($P_e$), an enhancement was made by proposing the retransmission limit (S) to be computed for error recovery (based on the link error probability), and then for each of the AAPs the control procedures for the retransmission limit have been properly included. The O-notation has been applied in analyzing the upper bound of the number of messages generated by a MANET group of N nodes. Based on a link error probability range of $P_e=0$ to 0.8, the AAPs investigated in this paper are Strong DAD, Weak DAD with proactive routing protocol (WDP), Weak DAD with on-demand routing protocol (WDO), and MANETconf. Based on the simulation results and analysis of the message complexity, for nominal situations, the message complexity of WDP was lowest, closely followed by WDO. The message complexity of MANETconf is higher than that of WDO, and Strong DAD results to be most complex among the four AAPs.

Proactive Network Optimizer for Critical Applications (크리티컬한 응용을 위한 능동형 네트워크 최적화기)

  • Park, Bongsang;Park, Pangun
    • 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.

Selective Query Node for On-Demand Routing (On-Demand Routing의 성능향상을 위한 쿼리 수신 노드 선택)

  • Son, Dong-Hyoun;Kim, Dae-Hee
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.616-618
    • /
    • 2005
  • On-Demand routing protocol들은 Route를 셋업하기 위해 network-wide flooding scheme을 사용한다. 이 경우 않은 수의 overhead가 쿼리 패킷들이 생산되어 네트웍 퍼포먼스가 저하되는 결과를 초래한다. 우리는 이것을 일컬어 " 8roadcast storm problem" 이라고 한다. 여기에 우리는 Selective Query Node라는 scheme을 제안하여 flooding시에 발생하는 broadcast storm 문제를 완화하려고 한다. SQN은 이웃노드의 topology를 고려하여 proactive한 라우팅 정보를 제공하여 세가지 제한요소를 두어 쿼리를 받은 이웃노드가 받은 쿼리를 중지할 수 있도록 하며 퍼포먼스 향상을 기할 수 있도록 한다.

  • PDF

Routing Method based on Prediction of Link State between UAVs in FANET (FANET에서 UAV간 링크 상태 예측에 기반한 라우팅 기법)

  • Hwang, HeeDoo
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.11
    • /
    • pp.1829-1836
    • /
    • 2016
  • Today, the application area and scope of FANET(Flying Ad Hoc Network) has been extended. As a result, FANET related research are actively conducted, but there is no decision yet as the routing protocol for FANET. In this paper, we propose the OLSR-Pds (Prediction with direction and speed) which is added a method to predict status of link for OLSR protocol. The mobility of nodes are modeled using Gauss-Markov algorithm, and relative speed between nodes were calculated by derive equation of movement, and thereby we can predict link status. An experiment for comparing AODV, OLSR and, OLSR-Pds was conducted by three factors such as packet delivery ratio, end to end delay, and routing overhead. In experiment result, we were confirm that OLSR-Pds performance are superior in these three factors. OLSR-Pds has the disadvantage that requires time-consuming calculations for link state and required for computing resources, but we were confirm that OLSR-Pds is suitable for routing to the FANET environment because it has all the characteristics of proactive protocol and reactive protocol.

A Propose of the Extended AODV Ad Hoc Routing Protocol using the Heterogeneties of Const ituent Nodes (구성노드의 이질적 특성을 활용한 확장된 AODV Ad-Hoc 라우팅 프로토콜 제안)

  • 유환석;박준희;김상하
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.04a
    • /
    • pp.127-129
    • /
    • 2002
  • 인터넷에는 다른 하드웨어적 특성을 갖는 다양한 형태의 이동노드가 존재한다. 이러한 특성이 무선통신 과정에 반영되어 다양한 문제가 발생한다. 이동 노드로만 구성된 무선 ad-hoc 네트웍은 이와 같은 특성에 큰 영향을 받게 된다. 기존의 ad-hoc 네트웍 라우팅 프로토콜은 목적 노드에 도달하기 위한 경로의 발견과 관리에 연구가 집중되었으며, 최근 이동노드의 특성을 라우팅 과정에 반영하기 위한 연구가 시작되고 있다. 본 논들은 ad-hoc 라우팅 프로토콜에서 이동노드가 갖는 이질적 특성을 라우팅에 반영하고, 이를 AODV 라우팅 프로토콜에 적용하기 위한 메커니즘을 제안한다. 본 메커니즘은 이동노드의 특성을 이용한 Proactive 방식의 노드가 추가되어 일반 이동노드에게 다중 홉의 경로에 대한 패킷 전송을 대신하며 주변 이동 노드에게 다중 홉의 라우팅 정보를 제공한다. Reactive 방식의 노드는 Proactive 방식의 노드를 발전하고 이용하기 위해 기능을 확장하였다. 이를 통하여 안정적인 경로를 선택 할 수 있으며 ad-hoc 네트워크 망의 확장이 가능하다.

  • PDF