• Title, Summary, Keyword: Routing Protocol

Search Result 1,357, Processing Time 0.036 seconds

A Study on Routing Protocol using C-NODE for Mobile Ad-Hoc Networking (Mobile Ad-hoc Networking에서의 C-NODE를 이용한 Routing Protocol에 관한 연구)

  • Choi, Bong-Han
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.1
    • /
    • pp.195-201
    • /
    • 2006
  • This thesis proposes hybrid routing protocol that mix proactive routing protocol and reactive routing protocol used in Ad hoc network. Proposed method is that establish special node offering network service of nods which construct Ad hoc network and do routing different from existing hybrid routing protocol, ZRP. Special node doing these parts is called C-node. Routing using C-node can accompany efficient routing by decreasing path institution time and flooding time than existing routing protocol.

  • PDF

An Efficient Context-aware Opportunistic Routing Protocol (효율적인 상황 인지 기회적 라우팅 프로토콜)

  • Seo, Dong Yeong;Chung, Yun Won
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.12
    • /
    • pp.2218-2224
    • /
    • 2016
  • Opportunistic routing is designed for an environment where there is no stable end-to-end routing path between source node and destination node, and messages are forwarded via intermittent contacts between nodes and routed using a store-carry-forward mechanism. In this paper, we consider PRoPHET(Probabilistic Routing Protocol using History of Encounters and Transitivity) protocol as a base opportunistic routing protocol and propose an efficient context-aware opportunistic routing protocol by using the context information of delivery predictability and node type, e.g., pedestrian, car, and tram. In the proposed protocol, the node types of sending node and receiving node are checked. Then, if either sending node or receiving node is tram, messages are forwarded by comparing the delivery predictability of receiving node with predefined delivery predictability thresholds depending on the combination of sending node and receiving node types. Otherwise, messages are forwarded if the delivery predictability of receiving node is higher than that of sending node, as defined in PRoPHET protocol. Finally, we analyze the performance of the proposed protocol from the aspect of delivery ratio, overhead ratio, and delivery latency. Simulation results show that the proposed protocol has better delivery ratio, overhead ratio, and delivery latency than PRoPHET protocol in most of the considered simulation environments.

Energy Aware Routing Protocol over Wireless Sensor Network (센서 네트워크에서 에너지 보유량을 고려한 라우팅 프로토콜)

  • Choi, Hae-Won;Yoo, Kee-Young
    • Journal of the Korea Industrial Information Systems Research
    • /
    • v.13 no.2
    • /
    • pp.28-34
    • /
    • 2008
  • This paper reports the problem in the previous routing protocol, EAR, and proposes an energy aware routing protocol to solve the problem in it. Proposed routing protocol considers the number of hops, the possibility of node exhaustion, and the node energy amount at the same time from the source to the sink. Thereby, it could efficiently solve the potential network separation problem and the sensing hole problem in EAR. Proposed routing protocol could remove the problems in the previous routing protocols but it still gets the advantages in them.

  • PDF

A Domain-based Reactive Routing Protocol for the Hybrid WMN (하이브리드 WMN을 위한 가상 도메인 기반의 반응형 라우팅 프로토콜)

  • Kim, Ho-Cheal
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.7
    • /
    • pp.59-70
    • /
    • 2014
  • This paper propose a new wireless multi-hop routing protocol that takes the hierarchical mesh of the hybrid WMN into account. WMN that is possible to provide various applications of wireless networks still has many open issues that should be solved despite the studies carried out over a decade. Especially, in routing protocol area, a problem degrading the routing efficiency by applying one of the routing protocols, which are designed for the MANET, to the hybrid WMN be solved above all. For the improvement of the routing performance, both good routing protocol and metric are essential. However, the recent studies are only concentrated in routing metric by use of the cross-layer design. Therefore, this paper is dedicated to the routing protocol that is essential for the performance of the routing but needed more studies. The proposed protocol in this paper is reactive, and designed to reorganize the hybrid WMN with several pseudo domains, and carry out domain-based route decision. By the simulation result for the performance analysis of the proposed protocol, the average delay for the route decision was decreased by 43% compared to AODV that is the typical reactive protocol.

Performance Analysis of Position Based Routing Protocol for UAV Networks (UAV 네트워크 환경에 적합한 위치기반 라우팅 프로토콜의 성능 분석)

  • Park, Young-Soo;Jung, Jae-Il
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.2C
    • /
    • pp.188-195
    • /
    • 2012
  • Many systems are developing for the realization of NCW(Network Centric Warfare). UAV(Unmanned Aerial Vehicle) Network is attracting attention in a lot of military applications. In general, UAVs have the potential to create an ad-hoc network and greatly reduce the hops from source to destination. However, UAV networks exhibit unique properties such as high mobility, high data rate, and real time service. The routing protocols are required to design the multi-hop routing protocols that can dynamically adapt to the requirements of UAV network. In this paper we analyse Geographic Routing Protocol is based on geographical distance between source and destination for efficient and reliable transmission. Geographic Routing Protocol is evaluated in video service scenarios with TDMA model in our simulation. The simulation results show that the performance of Geographic Routing Protocol is better than the MANET Routing Protocol in terms of packet received ratio, end to end delay, and routing traffic sent.

The Case Study for Path Selection Verification of IGP Routing Protocol (IGP 라우팅 프로토콜의 경로선택 검증을 위한 구현 사례)

  • Kim, No-Whan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.9
    • /
    • pp.197-204
    • /
    • 2014
  • RIP, EIGRP, OSPF are the interior gateway protocol for sending and receiving routing information among routers in AS(Autonomous System). Various path selection methods using the metric in regard to them have been studied recently but there are few examples that the contents learners understand theoretically are verified by the practice. The Best Path is determined by calculating the Cost value based on the relevant topology of each routing protocol. After implementing the virtual network, it is certain that the results tracking and verifying the relevant path selection of each routing protocol are consistent with the Best Path. If methods suggested in this paper are applied properly, the relevant path selection process of routing protocol can be understood systematically. And it is expected that the outstanding results of learning will be able to be achieved.

Enhanced OLSR Routing Protocol Using Link-Break Prediction Mechanism for WSN

  • Jaggi, Sukhleen;Wasson, Er. Vikas
    • Industrial Engineering and Management Systems
    • /
    • v.15 no.3
    • /
    • pp.259-267
    • /
    • 2016
  • In Wireless Sensor Network, various routing protocols were employed by our Research and Development community to improve the energy efficiency of a network as well as to control the traffic by considering the terms, i.e. Packet delivery rate, the average end-to-end delay, network routing load, average throughput, and total energy consumption. While maintaining network connectivity for a long-term duration, it's necessary that routing protocol must perform in an efficient way. As we discussed Optimized Link State Routing protocol between all of them, we find out that this protocol performs well in the large and dense networks, but with the decrease in network size then scalability of the network decreases. Whenever a link breakage is encountered, OLSR is not able to periodically update its routing table which may create a redundancy problem. To resolve this issue in the OLSR problem of redundancy and predict link breakage, an enhanced protocol, i.e. S-OLSR (More Scalable OLSR) protocol has been proposed. At the end, a comparison among different existing protocols, i.e. DSR, AODV, OLSR with the proposed protocol, i.e. S-OLSR is drawn by using the NS-2 simulator.

A Dynamic Routing Protocol for Energy Effectiveness in Wireless Sensor Networks (무선 센서 네트워크에서의 에너지 효율 개선을 위한 동적 라우팅 프로토콜)

  • Oh, Sei-Woong;Jun, Sung-Taeg
    • Journal of Information Technology Services
    • /
    • v.6 no.1
    • /
    • pp.141-149
    • /
    • 2007
  • Sensor node's mobility brings new challenges to data dissemination in large sensor networks. Frequent location updates of sensor nodes can lead to both excessive drain of sensor's limited battery supply and increased collisions in wireless transmissions. Conventional studies for routing protocols in wireless sensor networks are not enough to cover energy consumption and migration of sensor nodes. This study proposes a dynamic routing protocol based on the SPIN considering energy consumption and the migration, and also shows the effectiveness of the proposed routing protocol.

Routing Protocol using One-Way Hash Functions for Mobile Ad Hoc Networks

  • Park, Young-Ho
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • /
    • pp.26-31
    • /
    • 2007
  • An ad hoc network is a collection of mobile nodes without any Infrastructure. However, ad hoc networks are vulnerable to attacks such as routing disruption and resource consumption; thus, routing protocol security is needed This paper proposes a secure and efficient routing protocol for mobile ad hoc networks, where only one-way hash function are used to authenticate nodes in the ROUTE REQUEST, while additional public-key cryptography is used to guard against active attackers disguising a node in the ROUTE REPLY.

  • PDF

Security-Aware Optimized Link Routing Protocol for Mobile Ad-Hoc Networks

  • Dhir, Amandeep;Sengupta, Jyotsna
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.1
    • /
    • pp.52-83
    • /
    • 2009
  • In this technical report, we have examined the basic building blocks of mobile ad-hoc networks. The paper discusses various security requirements of ad-hoc networks, attacks in ad-hoc networks, Security Implementation and Routing Protocols. The primary purpose of the paper is to address the Optimized Link State Routing (OLSR) protocol in detail, along with the various possible attacks. Finally, algorithms for securing OLSR are proposed, via the addition of digital signatures, as well as more advanced techniques such as cross checking of advertised routing control data with the node's geographical position. The main aim of this research work is the addition of security features to the existing OLSR protocol. In order to effectively design a secure routing protocol, we present a detailed literature survey of existing protocols, along with the various attacks. Based on the information gathered from the literature survey, a secure routing protocol for OLSR is proposed. The proposed secure routing protocol involves the addition of a digital signature as well as more advanced techniques such as the reuse of previous topology information to validate the actual link state. Thus, the main objective of this work is to provide secure routing and secure data transmission.