• Title/Summary/Keyword: Reactive Routing

Search Result 66, Processing Time 0.022 seconds

A Reactive Routing Scheme based on the Prediction of Link State for Communication between UAV Squadrons in a Large-Scale FANET (대규모 FANET에서 UAV 편대간 통신을 위한 링크 상태 예측에 기반한 반응적 라우팅 기법)

  • Hwang, Heedoo;Kwon, Oh Jun
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.4
    • /
    • pp.593-605
    • /
    • 2017
  • In applications which are covered wide range, it is possible that one or more number of Unmanned Aerial Vehicle(UAV) squadrons are used to perform a mission. In this case, it is most important to communicate seamlessly between the UAV squadrons. In this paper, we applied the modified OLSR(OSLR-Pds) which can prediction for state of the link for the communication in UAV squadron, and applied the modified AOMDV which can build multi-path for the communication between UAV Squadrons. 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 state for in a squadron and between squadrons. An experiment for comparing AODV, AOMDV and the proposed routing protocol was conducted by three factors such as packet delivery ratio, end to end delay, and routing overhead. In experiment result, we make sure that the proposed protocol performance are superior in these three factors. However, if the density of the nodes constituting FANET are too low, and if the moving speed of node is very slow, there is no difference to others protocols.

Performance Variations of AODV, DSDV and DSR Protocols in MANET under CBR Traffic using NS-2.35

  • Chandra, Pankaj;Soni, Santosh
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.7
    • /
    • pp.13-20
    • /
    • 2022
  • Basically Mobile Ad Hoc Network (MANET) is an autonomous system with the collection of mobile nodes, these nodes are connected to each other by using wireless networks. A mobile ad hoc network poses this quality which makes topology in dynamic manner. As this type of network is Ad Hoc in nature hence it doesn't have fixed infrastructure. If a node wishes to transfer data from source node to a sink node in the network, the data must be passed through intermediate nodes to reach the destination node, hence in this process data packet loss occurs in various MANET protocols. This research study gives a comparison of various Mobile Ad Hoc Network routing protocols like proactive (DSDV) and reactive (AODV, DSR) by using random topology with more intermediate nodes using CBR traffic. Our simulation used 50, 100, and 150 nodes variations to examine the performance of the MANET routing protocols. We compared the performance of DSDV, AODV and DSR, MANET routing protocols with the result of existing protocol using NS-2 environment, on the basis of different performance parameters like Packet Delivery Ratio, average throughput and average end to end delay. Finally we found that our results are better in terms of throughput and packet delivery ratio along with low data loss.

A Performance Analysis of Region-based Overlay Multicast Routing Protocol for Ad Hoc Networks (Ad Hoc 네트워크를 위한 지역기반 오버레이 멀티캐스트 라우팅 프로토콜의 성능 분석)

  • Kim Kap-Dong;Park Jun-Hee;Lee Kwang-Il;Kim Hag-Young;Kim Sang-Ha
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.05a
    • /
    • pp.1037-1040
    • /
    • 2006
  • This paper presents an efficient overlay multicast routing protocol (ROMP) and its architecture. ROMP using GPS and region map stands on the basis of scalable 2-tiered multicast architecture and maintains a global overlay multicast tree through reactive fashion. With this approach, the coarse-grain location-awareness for an efficient overlay multicasting and the determination of hot-spot area for efficient data delivery are feasible. The simulation results show that the localized control packets of ROMP prevent the overlay control packets from squandering the physical network resources.

  • PDF

A Study on Voltage Stability Improvement by the Efficient Network Reconfiguration Algorithm

  • Kim, Byung-Seop;Shin, Joong-Rin;Park, Jong-Bae;Shin, Yong-Hak
    • KIEE International Transactions on Power Engineering
    • /
    • v.4A no.2
    • /
    • pp.58-68
    • /
    • 2004
  • This paper presents an optimal routing algorithm (ORA) for maximizing voltage stability as well as for minimizing power loss in radial power systems. In the proposed ORA, a novel voltage stability index (VSI) for real-time assessment is newly introduced based on the conventional critical transmission path framework. In addition, the suggested algorithm can automatically detect the critical transmission paths resulting in voltage collapse when additional real or reactive loads are added. To implement an effective ORA, we have developed an improved branch exchange (IBE) method based on a loss calculation index and tie-branch power flow equations, which are suggested for real-time applications. The proposed algorithm has been tested with IEEE test systems as well as a large-scale power system in Korea to demonstrate its effectiveness and efficiency.

Analyses of Security Model and Design of Protocol for Wireless Ad-Hoc Network (무선 Ad-Hoc 망의 프로토콜 설계 및 보안 모델 해석)

  • Kim, Jung-Tae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.860-863
    • /
    • 2005
  • Ad-Hoc networks are a new generation of networks offering unrestricted mobility without any underlying infrastructure. Primary applications of Ad-Hoc networks are in military, tractical and other security sensitive operations, where the environment is hostile. Hence, security is a critical issue. In this paper, we ahve identified certain misbehaviors caused by mallicious node for reactive routing protocol. We also discuss the intrusion detection and intrusion prevention model to prevent several identified attacks in the networks

  • PDF

Research on the Performance of Protocols and the Evaluation Metric for VIDEO Transmissions in an Ad Hoc Network

  • Chen, Ruey-Shin;Chao, Louis R.;Chen, Ching-Piao;Tsai, Chih-Hung
    • International Journal of Quality Innovation
    • /
    • v.10 no.1
    • /
    • pp.115-126
    • /
    • 2009
  • Video transmission effectiveness in the Ad Hoc network is becoming important recently, if different routing protocols are applied. Some researchers conclude that the reactive protocols are better for file transfer protocol (FTP) and constant bit rate (CBR) or hypertext transfer protocol (HTTP) transmission in an Ad Hoc wireless network but the performance report of video transmission is not much. This study adopts Qualnet (Network Simulator) as a simulation tool for environmental designing and performance testing, and employs an experimental design with eight groups. Our experiment shows that: (1) The performance of AODV (reactive) protocol is better than DSDV, ZRP and DSR when the transmission load has only one video stream; (2) Proactive (DSDV) and Hybrid protocols (ZRP) are better for a smaller Ad Hoc network when it transmits a video stream with some applications (VoIP, FTP and CBR). We conclude that packet loss rate is sensitive to the quality of video transmission and it has negative relationship with Peak Signal-to-Noise Ratio (PSNR) value. In addition, our experiment also shows that PSNR is a simple Metric for the performance evaluation of video transmission.

Modeling Geographical Anycasting Routing in Vehicular Networks

  • Amirshahi, Alireza;Romoozi, Morteza;Raayatpanah, Mohammad Ali;Asghari, Seyyed Amir
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1624-1647
    • /
    • 2020
  • Vehicular network is one of the most important subjects for researchers in recent years. Anycast routing protocols have many applications in vehicular ad hoc networks. The aim of an anycast protocol is sending packets to at least one of the receivers among candidate receivers. Studies done on anycast protocols over vehicular networks, however, have capability of implementation on some applications; they are partial, and application specific. No need to say that the lack of a comprehensive study, having a strong analytical background, is felt. Mathematical modeling in vehicular networks is difficult because the topology of these networks is dynamic. In this paper, it has been demonstrated that vehicular networks can be modeled based on time-expanded networks. The focus of this article is on geographical anycast. Three different scenarios were proposed including sending geographic anycast packet to exactly-one-destination, to at-least-one-destination, and to K-anycast destination, which can cover important applications of geographical anycast routing protocols. As the proposed model is of MILP type, a decentralized heuristic algorithm was presented. The evaluation process of this study includes the production of numerical results by Branch and Bound algorithm in general algebraic modeling system (GAMS) software and simulation of the proposed protocol in OMNET++ simulator. The comprehension of the result of proposed protocol and model shows that the applicability of this proposed protocol and its reactive conformity with the presented models based on presented metrics.

A Cluster-Based Multicast Routing for Mobile Ad-hoc Networks (모바일 Ad-hoc 네트워크를 위한 클러스터 기반 멀티캐스트 라우팅)

  • An, Beong-Ku;Kim, Do-Hyeun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.9 s.339
    • /
    • pp.29-40
    • /
    • 2005
  • In this paper, we propose a Cluster-based Multicast Routing (CMR) suitable for mobile ad-hoc networks. The main features that our proposed method introduces are the following: a) mobility-based clustering and group based hierarchical structure in order to effectively support stability and scalability, b) group based mesh structure and forwarding tree concepts in order to support the robustness of the mesh topologies which provides limited redundancy and the efficiency of tree forwarding simultaneously, and c) combination of proactive and reactive concepts which provide low route acquisition delay and low overhead. The performance evaluation of the proposed protocol is achieved via modeling and simulation. The corresponding results demonstrate the Proposed multicast protocol's efficiency in terms of packet delivery ratio, scalability, control overhead, end-to-end delay, as a function of mobility, multicast group size, and number of senders.

A Directional Route Discovery Protocol in Ad Hoc Multi-Hop Cellular Networks (Ad-hoc Multihop Cellular Network 에서의 방향성 Route Discovery 프로토콜)

  • Park, Yong-Suk
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.9
    • /
    • pp.8-15
    • /
    • 2009
  • Although traditional single-hop cellular networks had been serving well in past years, they are no longer economically feasible in supporting high data-rate, multimedia services of $4^{th}$Generation (4G) communications due to the requirement of high transmission power By contrast, multi-hop cellular networks (MCN) are capable of dramatically saving the transmission power by overlaying the capability of ad hoc networking among mobile terminals on the cellular network infrastructure. To achieve this performance gain as well as enable 4G services, an efficient routing protocol needs to be designed for MCN. In this paper, we propose a reactive route discovery protocol for MCN that uses directional information to the base station in the route discovery process. Our analysis/simulation results have demonstrated that the proposed protocol significantly reduces flooding overheads. In addition, we consider issues for 4G services in MCN and applications of the proposed protocol.

IDNet: Beyond All-IP Network

  • Jung, Heeyoung;Lim, Wan-Seon;Hong, Jungha;Hur, Cinyoung;Lee, Joo-Chul;You, Taewan;Eun, Jeesook;Kwak, Byeongok;Kim, Jeonghwan;Jeon, Hae Sook;Kim, Tae Hwan;Chun, Woojik
    • ETRI Journal
    • /
    • v.37 no.5
    • /
    • pp.833-844
    • /
    • 2015
  • Recently, new network systems have begun to emerge (for instance, 5G, IoT, and ICN) that require capabilities beyond that provided by existing IP networking. To fulfill the requirements, some new networking technologies are being proposed. The promising approach of the new networking technology is to try to overcome the architectural limitations of IP networking by adopting an identifier (ID)-based networking concept in which communication objects are identified independently from a specific location and mechanism. However, we note that existing ID-based networking proposals only partially meet the requirements of emerging and future networks. This paper proposes a new ID-based networking architecture and mechanisms, named IDNet, to meet all of the requirements of emerging and future networks. IDNet is designed with four major functional blocks-routing, forwarding, mapping system, and application interface. For the proof of concept, we develop numeric models for IDNet and implement a prototype of IDNet.