• Title/Summary/Keyword: Network Routing Protocol

Search Result 1,135, Processing Time 0.027 seconds

Trust-aware secure routing protocol for wireless sensor networks

  • Hu, Huangshui;Han, Youjia;Wang, Hongzhi;Yao, Meiqin;Wang, Chuhang
    • ETRI Journal
    • /
    • v.43 no.4
    • /
    • pp.674-683
    • /
    • 2021
  • A trust-aware secure routing protocol (TSRP) for wireless sensor networks is proposed in this paper to defend against varieties of attacks. First, each node calculates the comprehensive trust values of its neighbors based on direct trust value, indirect trust value, volatilization factor, and residual energy to defend against black hole, selective forwarding, wormhole, hello flood, and sinkhole attacks. Second, any source node that needs to send data forwards a routing request packet to its neighbors in multi-path mode, and this continues until the sink at the end is reached. Finally, the sink finds the optimal path based on the path's comprehensive trust values, transmission distance, and hop count by analyzing the received packets. Simulation results show that TSRP has lower network latency, smaller packet loss rate, and lower average network energy consumption than ad hoc on-demand distance vector routing and trust based secure routing protocol.

A Delay Tolerant Vehicular Routing Protocol for Low Vehicle Densities in VANETs (차량 밀도가 낮은 VANET 환경을 위한 지연 허용 차량 라우팅 프로토콜)

  • Cha, Si-Ho;Ryu, Min-Woo;Cho, Kuk-Hyun
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.49 no.4
    • /
    • pp.82-88
    • /
    • 2012
  • A VANET (Vehicular Ad Hoc Network), a subclass of MANET (Mobile Ad Hoc Network), is an ad hoc network using wireless communication between vehicles without fixed infrastructure such as base station. VANET suffers a frequent link breakage and network topology change because of the rapid movement of vehicles and the density change of vehicles. From these characteristics of VANET, geographical routing protocols such as GPSR (Greedy Perimeter Stateless Routing) using only the information of neighbor nodes are more suitable rather than AODV and DSR that are used in existing MANETs. However, GPSR may have a transmission delay and packet loss by frequent link disconnection and continual local maxima under the low vehicle density conditions. Therefore, in this paper, we propose a DTVR (Delay Tolerant Vehicular Routing) algorithm that perform a DTN-based routing scheme if there is no 2-hop neighbor nodes for efficient routing under the low vehicle densities in VANETs. Simulation results using ns-2 reveal that the proposed DTVR protocol performs much better performance than the existing routing protocols.

Effective Routing Protocol Implementation Framework on Riverbed (OPNET) Modeler and its Example for AntHocNet (Riverbed (OPNET) Modeler의 효과적인 라우팅 프로토콜 추가 프레임워크 및 이를 이용한 AntHocNet 라우팅 구현)

  • Kim, Kwangsoo;Lee, Cheol-Woong;Shin, Seung-hun;Roh, Byeong-hee;Roh, Bongsoo;Han, Myoung-hun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.8
    • /
    • pp.974-985
    • /
    • 2016
  • Riverbed Modeler, which is a commercial packet-level discrete event simulator is used to model, design, and simulate complicated communication protocols and large-scale network. Riverbed Modeler got credit for its reliability in field of network simulation. In the MANET simulation environment using Riverbed Modeler, it is very complicated to add a new routing protocol into existing architecture of routing protocols because it is required lots of modifications of protocol recognition. In this paper, we propose Routing Adding Framework which can reduce errors or mistakes during modifying the existing routing support architecture. Routing Adding Framework is provided as a adapter API for protocol recognition. and it is only minimum modifications for protocol identifiers when a new routing protocol is added to the child process of manet_mgr process which manages routing protocols for IP layer. With Routing Adding Framework, we can reduce less than half modification. Then, we shows an example of implementation of a hybrid routing protocol AntHocNet using Routing Adding Framework, and we verify its design and application of the Routing Adding Framework by obtaining simulation result with similar result given by AntHocNet.

A Routing Protocol supporting QoS in WiMAX based Wireless Mesh Networks (WiMAX 기반의 무선 메쉬 네트워크에서 QoS를 지원하는 라우팅 프로토콜)

  • Kim, Min;Kim, Hwa-Sung
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.1
    • /
    • pp.1-11
    • /
    • 2009
  • In this paper, we propose a QoS routing protocol for WiMAX based wireless mesh networks. The proposed routing protocol is a proactive hop-by-hop QoS routing protocol. It can find an optimal route that satisfies QoS requirements using bandwidth and delay as QoS parameters. In this paper, we first present a network model for WIMAX based wireless mesh networks and explain why QoS routing protocol is the most appropriate for WiMAX based wireless mesh networks. Then, we propose a proactive hop-by-hop QoS routing protocol that meets QoS requirements of traffic flowing between mesh client and the gateway. The simulation results show that the proposed routing protocol outperforms QOLSR protocol in terms of end-to-end delay, packet delivery ratio and routing overhead.

Minimum LQI based On-demand Routing Protocol for Sensor Networks (Minimum LQI 기반의 On-demand 센서 네트워크 라우팅 프로토콜)

  • Lee, Wan-Jik;Lee, Won-You;Heo, Seok-Yeol
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.11
    • /
    • pp.3218-3226
    • /
    • 2009
  • A number of on-demand routing protocols for sensor networks have been proposed yet. However, the majority of proposed on-demand routing protocols for sensor networks are not suitable for a relatively poor wireless environment and sensor applications requiring reliable data transmission due to using a hop-count metric for their protocols. In this paper, we proposed a minimum LQI(Link Quality Indicator) based on-demand sensor network routing protocol that is suitable for a relatively poor wireless environment and implemented the proposed routing protocol on a TinyOS. We also compared the implemented protocol with typical hop count based routing protocol by carrying out performance experiments on a multi-hop testbed. The results from these experiments showed that the successful transmission rate of the proposed routing protocol is higher than that of typical hop count based routing protocol over a poor wireless link.

Performance Evaluation of Directional AODV Routing Protocol for Wireless Mesh Networks (무선 메쉬 네트워크를 위한 방향섬 AODV 라우팅 프로토콜의 성능 평가)

  • Choi, Jae-In;Kim, Dae-Hwan;Le, Anh Ngoc;Lee, In-Soo;Cho, You-Ze
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.9B
    • /
    • pp.795-801
    • /
    • 2008
  • Wireless Mesh Networks (WMNs) are popular due to their low cost and rapid deployment. Currently, many WMN researchers often considers the use of ad-hoc routing protocols because WMNs are similar to the ad-hoc networks. Some of currently deployed WMNs consider to use on-demand routing protocols such as Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR). But, AODV are not appropriate for Wireless Mesh Networks (WMNs), because flooding-based route discovery is both redundant and expensive in terms of control message overhead. In this paper, we propose a directional AODV (D-AODV) routing protocol based on hop count to a gateway. We implement the D-AODV routing protocol and evaluate the performance of the D-AODV on the testbed. The measurement results show that the D-AODV can enhance the network throughput by reducing the routing overhead.

Large Scale Failure Adaptive Routing Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 대규모 장애 적응적 라우팅 프로토콜)

  • Lee, Joa-Hyoung;Seon, Ju-Ho;Jung, In-Bum
    • The KIPS Transactions:PartA
    • /
    • v.16A no.1
    • /
    • pp.17-26
    • /
    • 2009
  • Large-scale wireless sensor network are expected to play an increasingly important role for the data collection in harmful area. However, the physical fragility of sensor node makes reliable routing in harmful area a challenging problem. Since several sensor nodes in harmful area could be damaged all at once, the network should have the availability to recover routing from node failures in large area. Many routing protocols take accounts of failure recovery of single node but it is very hard these protocols to recover routing from large scale failures. In this paper, we propose a routing protocol, which we refer to as LSFA, to recover network fast from failures in large area. LSFA detects the failure by counting the packet loss from parent node and in case of failure detection LSFAdecreases the routing interval to notify the failure to the neighbor nodes. Our experimental results indicate clearly that LSFA could recover large area failures fast with less packets than previous protocols.

Performance Improvement of Efficient Routing Protocol Based on Small End-to-End Sequence Numbers (작은 종단연결 순차번호를 이용한 효율적인 라우팅 프로토콜의 성능향상)

  • Kim, Jang-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.7
    • /
    • pp.1565-1570
    • /
    • 2014
  • In networking communication, nodes and base station send data to each nodes and destination nodes. In this perspective, it is very important to determine the direction in which data sent to each nodes or destination nodes. Ad-hoc routing protocol is a standard routing protocol that determines how the packets sent to destination. Ad-hoc routing protocol includes protocols such as Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR). In our efficient proposed protocol based on small end-to-end sequence numbers, route direction can be changed properly with the assistance of helper nodes. In this paper, we focus on the simulation analysis of proposed protocol and comparison with other routing protocol models such as AODV and DSR. We simulated using Network Simulator (NS-2) by parameters such as simulation time, number of nodes and packet size based on our metrics (packet delivery fraction, routing load, data throughput). Our proposed protocol based on small end-to-end sequence numbers shows better performance and superior to other two protocols.

Adaptive Multi-routing Protocol for a High Mobility MANET (변동성이 높은 이동 애드 혹 네트워크를 위한 적응적 다중 라우팅 프로토콜 적용 기법)

  • Deepak, G.C.;Heo, Ung;Choi, Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.2
    • /
    • pp.103-110
    • /
    • 2008
  • When there is uncertainty in topological rate of change, motility model and terrain condition, the performance severely degrades in MANET. The concept of transition of routing protocol on the fly according to the network parameters such as coverage, connectivity and mobility etc. may counterbalance the problems stated above. The mathematical modeling of feedback parameters has been derived, and the architecture for the multi-routing protocol system providing an adaptation from one routing protocol to another is also investigated. This paper is extensively devoted on the analysis of mobility, connectivity and their effects on the network and finally transition into another routing protocol according to them.

Resilient Routing Protocol Scheme for 6LoWPAN (6LoWPAN에서 회복력 있는 라우팅 프로토콜 기법)

  • Woo, Yeon Kyung;Park, Jong Tae
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.11
    • /
    • pp.141-149
    • /
    • 2013
  • IETF 6LoWPAN standard technique has been studied in IoT environment to support the IPv6 packet communication. 6LoWPAN protocol for transmission of packets mainly in the AODV routing protocol and a variety of extended techniques have been investigated. In particular, consisting of nodes with limited resources in a network error occurs when the 6LoWPAN reliable data transfer and fast routing method is needed. To this end, in this paper, we propose resilient routing protocol and extension of IETF LOAD algorithm, for optimal recovery path, More specifically, the optimal recovery path setup algorithm, signal flow, and detailed protocols for the verification of the reliability of packet transmission mathematical model is presented. The proposed protocol techniques to analyze the performance of the NS-3 performance through the simulation results that is end-to-end delay, throughput, packet delivery fraction and control packet overhead demonstrated excellence in comparison with existing LOAD.