• Title/Summary/Keyword: Network Routing Protocol

Search Result 1,135, Processing Time 0.036 seconds

An Enhanced Routing Protocol for Supporting Node Mobility in Multi-hop Ad-hoc Networks (다중 홉 Ad-hoc 네트워크에서 노드이동성을 고려한 라우팅 프로토콜에 관한 연구)

  • Kim, Kwan-Woong;Kim, Byun-Gon;Kim, Yong-Kab
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.9
    • /
    • pp.1665-1671
    • /
    • 2007
  • Mobile Ad hoc Networks (MANETs) refer to autonomous networks in which wireless data communications are established between multiple nodes in a given coverage area without a base station or centralized administration. Because of node mobility and limited battery life, the network topology may changes frequently. Selecting the most reliable path during route discovery process is important to improve performance in ad-hoc networks. In this study, we proposed an enhanced routing protocol based on AODV by monitoring variation of receiving signal strength. New metric function that consists of node mobility and hops of path is used for routing decision. From extensive experiments by using NS-2, The performance of the proposed routing scheme has been imp개ved by comparison to AODV protocol.

Highly-reliable Multi-path Protocol by MANET (MANET에 의한 신뢰성 높은 다중 경로 프로토콜)

  • Lee, Yang-Min;Lee, Jae-Kee
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.4
    • /
    • pp.352-362
    • /
    • 2008
  • In the mobile ad hoc network, network nodes are continuously capable of movement, but have battery limitations and these characteristics of MANET cause network link failure. Therefore, when performing ubiquitous services with the application of MANET, a technique is required to improve the packet transmission rates as to enable continuous packet transmission while flexibly adapting to topology changes caused by the mobility of nodes. In this paper, we are proposing PAOMDV(Possibility based AOMDV) and OLSR-ME(OLSR with Modified Energy Efficiency) which are mixed-type protocols to solve the problem for design a more efficient protocol. Especially by classifying mobile ad hoc networks as clusters, OLSR-ME protocol is implemented on communication within the clusters, while PAOMDV is used in protocols between clusters. In addition, a selection algorithm for forwarding nodes that responding packet relays in the case of increased hops was proposed for designing a more efficient protocol than existing protocols. We verified the performance of the proposed protocols through a comparative experiment with AODV, AOMDV, ZRP, and the existing protocols. We confirmed the results of the experiment revealed that the proposed protocol had the best packet transmission rate, the shortest delay between nodes, and showed better results in routing overhead.

A Study of Optimization Using State Space Survey in Ad Hoc Network (상태공간 측정을 통한 AD HOC 네트워크의 최적화 연구)

  • Kim, Hyun-Chang;Chung, Suk-Moon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.8 no.4 s.23
    • /
    • pp.68-76
    • /
    • 2005
  • In this paper, Ad-hoc network is a collection of mobile nodes without any wired infrastructure. Design of efficient routing protocols in ad-hoc network is a challenging issue. An AODV routing protocol for wireless ad hoc networks one that searches for and attempts to discover a route to some destination node. We propose a technique that reduce the number of Routing packet. Our technique use variable values reflecting the condition of network. This also contributes to improve throughput.

A Study on Multicast Routing Metric for Wireless Mesh Network (WMN의 멀티캐스트 라우팅 메트릭에 대한 연구)

  • Gao, Hui;Lee, Hyung-Ok;Nam, Ji-Seung
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2012.01a
    • /
    • pp.101-103
    • /
    • 2012
  • This paper gives an introduction to multicast in wireless mesh networks. The factors to be addressed when designing a multicast protocol for wireless mesh network are presented. Emphases are paid on selection of multicast routing metrics in wireless mesh networks. Also details of adapting these metrics to gain high-throughput multicast in wireless mesh network are described in the paper.

  • PDF

A Study on the Route Optimization in MARNET Routing Protocol application Nested NEMO (MANET 라우팅 프로토콜을 적용한 중첩 이동 네트워크의 경로 최적화 방안 연구)

  • Jang, Sung-Jin;Park, Yong-Jin
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.137-138
    • /
    • 2006
  • NEMO(Network MObility) is a complex model of mobile network which refers to a forming of Nested Mobile Network by a moving transportation like vessel, bus, or a train which then moves a Mobile Node, or by a movement of a PAN(Personal Area Network). In a Nested NEMO, pinball routing is the primary obstacle as exemplified by the IPv6 environment. This paper will focus on improving such models as RRH, RBU+ and MANET Approach, that attempted to solve pinball routing by route optimization.

  • PDF

Traffic Analysis of a Power Infrastructure Defense System Simulator According to Network Routing (네트워크 연결 경로에 따른 광역방어 시스템 시뮬레이터의 트래픽 분석)

  • Kim, Ki-Ho;Yi, Keon-Young
    • Proceedings of the KIEE Conference
    • /
    • 2007.07a
    • /
    • pp.431-432
    • /
    • 2007
  • It is necessary for the stabilized operation of the power system even if a severe condition in system operation takes place. There is the need to develop the intelligent Power grid Monitoring System. In this system, the PMU(Phasor Measurement Unit) measures the synchrophasor and transmits it to the PIDS(Power Infrastructure Defense System). The IEEE PC37.118 protocol defines the message format to implement the communication both the PMU and the PIDS. In this paper, We measure and analyze the network traffic from simulated the PMU to simulated the PIDS according to network routing. And, We present the finest network routing in developing the intelligent Power grid Monitoring System.

  • PDF

Fault Tolerant Routing Algorithm Based On Dynamic Source Routing

  • Ummi, Masruroh Siti;Park, Yoon-Young;Um, Ik-Jung;Bae, Ji-Hye
    • Annual Conference of KIPS
    • /
    • 2009.11a
    • /
    • pp.223-224
    • /
    • 2009
  • A wireless ad hoc network is a decentralized wireless network. The network is ad hoc because each node is willing to forward data for other nodes, and so the determination of which nodes forward data is made dynamically based on the network connectivity. In this paper, we proposed new route maintenance algorithm to improve the efficiency and effective in order to reach destination node. In this algorithm we improve existing route maintenance in Dynamic Source Routing protocol, to improve the algorithm we make a new message we call Emergency Message (EMM). The emergency message used by the node moved to provide information of fault detection.

An Efficient Cluster Routing Protocol Based on 2-level Tree for Wireless Ad Hoc Networks (무선 애드 혹 네트워크에서 에너지 효율적인 2-level 트리 기반의 클러스터 라우팅 프로토콜)

  • Lee, Young Joon;Kim, Sung Chun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.5
    • /
    • pp.155-162
    • /
    • 2014
  • We proposed a 2 level tree based cluster based routing protocol for mobile ad hoc networks. it is our crucial goal to establish improved clustering's structure in order to extend average node life-time and elevate the average packet delivery ratio. Because of insufficient wireless resources and energy, the method to form and manage clusters is useful for increasing network stability. but cluster-head fulfills roles as a host and a router in clustering protocol of Ad hoc networks environment. Therefore energy exhaustion of cluster-head causes communication interruption phenomenon. Effective management of cluster-head is key-point which determines the entire network performance. The scheme focuses on improving the performance the life time of the network and throughput through the management of cluster-heads and its neighbor nodes. In simulation, we demonstrated that it would obtain averagely better 17% performance than LS2RP.

Design and Implementation of USN Protocol for Managing Rooms in a Large Building (대형 건축물 객실 관리를 위한 USN 프로토콜 설계 및 구현)

  • Jeong, Woo-Jeong;Yoo, Kwan-Hee;Kim, Jong-Heon;Kim, Tae-Ho;Choi, Sung-Chul;Jeong, Kyu-Seuk
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2009.05a
    • /
    • pp.491-496
    • /
    • 2009
  • In this paper, we propose USN Protocol of Room Control with high efficiency and new routing techniques. I establish a network of cluster hierarchy structure under bases standard for IEEE 802.15.4 and another networks to manage each room use a control packet transmitted and The proposed protocol does not perform BroadCast over a network and transmits a packet to same layer to the destination and then passes the packet after doing searches. If a destination to be transmitted cannot be looked up, the protocol transmits AODV routing packet so that not only traffic load of a wireless network is decreased, but also efficient routing path can be obtained.

  • PDF

Reliable Data Aggregation Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 신뢰성 있는 데이터 병합 프로토콜)

  • Shin Sang-Ryul;Lee Jong-Il;Baek Jang-Woon;Seo Dae-Wha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4B
    • /
    • pp.303-310
    • /
    • 2006
  • In sensor network environments, a sensor node has a limited power because of their resource constraints. Therefore it is important to efficiently use its power in sensor networks. Power consumption of sensor node is closely related to its amount of transmission data. So, we need to reduce the transmission data in order to minimize the power consumption. And sensor networks are inherently unreliable because radio transmission can fail, node can move, and so on. In this paper, we propose the reliable data aggregation protocol in order to these problems. This protocol performs the routing and the query inserting process at the same time to minimize the packet loss caused by network changes. And, this protocol removes the unnecessary routing caused by the periodic routing without query. Additionally, we suggest the countermeasure algorithm against the frequent errors in sensor networks.