• Title/Summary/Keyword: DSDV routing algorithm

Search Result 10, Processing Time 0.028 seconds

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.

Design and Implementation of Location Information System and User Mapping System using DSDV Routing Algorithm in Ad-hoc Network Environment (Ad-hoc 네트워크 환경에서 DSDV 라우팅 알고리즘을 이용한 위치 정보 시스템 및 사용자 맵핑 시스템의 설계 및 구현)

  • Kwak, Jong Wook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.3
    • /
    • pp.1-9
    • /
    • 2014
  • In this paper, we design and implement location information system and user mapping system using DSDV(Destination Sequenced Distance Vector) routing algorithm in ad-hoc network environment to efficient manage a number of mobile devices. The software part in proposed system construct ad-hoc network using DSDV routing algorithm and it activate alarm system, such as vibration, when one of devices disappears in the network. The hardware system, called u_LIN (User Location Information Node) construct ad-hoc network and it helps to find a disappeared device by using warning system. When we evaluate the performance of our prototype system, we have checked a correct operation, within the range of 250m in case of 1:1 communication and within the range of 100m in case of 1:N communication. The implemented system in this paper is highly expected to flexibly use in juvenile protection system, stray-child protection system, tourist guide system and so on.

Design and Performance Analysis of Multi-hop Routing Protocol for WiMedia (WiMedia를 위한 멀티홉 라우팅 프로토콜 개발 및 성능분석)

  • Jung, Jin-Uk;Lee, Seung-Jin;Jin, Kyo-Hong;Hwang, Min-Tae;Jeon, Young-Ae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.7
    • /
    • pp.1406-1415
    • /
    • 2012
  • Though WiMedia supports the higher data rates than other WPAN technologies, a WiMedia device cannot reach other devices which are apart from it more than 10 meter; the limited transmission range of the WiMedia protocol. In this paper, we propose a multi-hop QoS routing protocol to enable WiMedia devices to transmit real-time data to devices that is located out of transmission range. The proposed routing protocol is a hybrid routing protocol, which is the mixed protocol of table-driven and on-demand routing algorithm. In the proposed protocol, a route for a device within 2-hop is established by using the table-driven routing algorithm and a route for the device beyond 2-hop is established by using the on-demand routing algorithm. We perform ns-2 simulation to investigate the performance of the proposed routing protocol with AODV and DSDV. The simulation results show that the proposed protocol's performance is better than AODV and DSDV in terms of the throughput and delay.

Implementation of Node Transition Probability based Routing Algorithm for MANET and Performance Analysis using Different Mobility Models

  • Radha, Sankararajan;Shanmugavel, Sethu
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.202-214
    • /
    • 2003
  • The central challenge in the design of ad-hoc networks is the development of dynamic routing protocol that efficiently finds route between mobile nodes. Several routing protocols such as DSR, AODV and DSDV have been proposed in the literature to facilitate communication in such dynamically changing network topology. In this paper, a Node Transition Probability (NTP) based routing algorithm, which determines stable routes using the received power from all other neighboring nodes is proposed. NTP based routing algorithm is designed and implemented using Global Mobile Simulator (GloMoSim), a scalable network simulator. The performance of this routing algorithm is studied for various mobility models and throughput, control overhead, average end-to-end delay, and percentage of packet dropped are compared with the existing routing protocols. This algorithm shows acceptable performance under all mobility conditions. The results show that this algorithm maximizes the bandwidth utilization during heavy traffic with lesser overhead.

A Novel Adaptive Routing Algorithm for Delay-Sensitive Service in Multihop LEO Satellite Network

  • Liu, Liang;Zhang, Tao;Lu, Yong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3551-3567
    • /
    • 2016
  • The Low Earth Orbit satellite network has the unique characteristics of the non-uniform and time-variant traffic load distribution, which often causes severe link congestion and thus results in poor performance for delay-sensitive flows, especially when the network is heavily loaded. To solve this problem, a novel adaptive routing algorithm, referred to as the delay-oriented adaptive routing algorithm (DOAR), is proposed. Different from current reactive schemes, DOAR employs Destination-Sequenced Distance-Vector (DSDV) routing algorithm, which is a proactive scheme. DSDV is extended to a multipath QoS version to generate alternative routes in active with real-time delay metric, which leads to two significant advantages. First, the flows can be timely and accurately detected for route adjustment. Second, it enables fast, flexible, and optimized QoS matching between the alternative routes and adjustment requiring flows and meanwhile avoids delay growth caused by increased hop number and diffused congestion range. In addition, a retrospective route adjustment requesting scheme is designed in DOAR to enlarge the alternative routes set in the severe congestion state in a large area. Simulation result suggests that DOAR performs better than typical adaptive routing algorithms in terms of the throughput and the delay in a variety of traffic intensity.

Implementation of Location Information System using DSDV Routing Algorithm in Ad-hoc Network Environment (Ad-hoc 네트워크 환경에서 DSDV 라우팅 알고리즘을 이용한 위치 정보 시스템 구현)

  • Lim, Hyo-Young;Lee, Jeong-Gu;Kwak, Jong-Wook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.625-628
    • /
    • 2011
  • 본 논문에서는 다수의 이동 가능한 관리 대상을 소수의 관리자가 효율적으로 관리하기 위하여 Ad-hoc 네트워크 환경에서 DSDV(Destination Sequenced Distance Vector) 라우팅 알고리즘을 활용하는 위치 정보 시스템을 구현한다. 제안된 시스템에서는 다수의 위치 정보 노드들이 Ad-hoc 네트워크 환경에서 DSDV 라우팅 알고리즘으로 네트워크를 구축하고, 구축된 네트워크에서 하나 이상의 위치 정보 노드가 사라지면 진동과 같은 경고 시스템을 활성화한다. 또한 제안된 시스템은 안드로이드 환경에서 블루투스 통신을 통해 시각적으로 노드들의 위치를 확인시켜 주어 관리 대상에 대한 관리를 도와준다. 본 시스템으로 모의 성능 평가를 수행한 결과, 사용자 위치 정보 노드 간 1:1 통신을 직선거리에서 수행하였을 때, 약 250m까지 통신이 가능하였으며, 1:N 통신의 경우 약 100m 이내의 거리에서 정상적으로 통신이 이루어지는 것을 확인하였다. 본 논문에서 구현된 시스템은 유치원 아동 관리 시스템, 놀이공원 미아 방지 시스템, 관광객 관리 시스템 등 여러 시스템에 매우 유연하게 적용이 가능하여, 그 활용도가 높을 것으로 예상된다.

A Comparative Analysis on Performance of Wireless Sensor Networks Routing Protocols

  • KRISHNA, KONDA. HARI;NAGPAL, TAPSI;BABU, Y. SURESH
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.7
    • /
    • pp.240-244
    • /
    • 2022
  • The common goals of designing a routing algorithm are not only to reduce control packet overhead, maximize throughput and minimize the end-to-end delay, but also take into consideration the energy consumption. Scalability is an important factor in designing an efficient routing protocol for wireless sensor networks (WSN's). Three metrics (power consumption, time of transmission and packet loss rate) are used in order to compare three routing protocols which are AODV, DSDV and LEACH.

Evaluation of MANET Protocol Scheme for TICN System (TICN체계하 MANET 프로토콜 분석)

  • Son, Hye-Joung;Kwon, Tae-Wook
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.12 no.4
    • /
    • pp.469-475
    • /
    • 2009
  • TMMR(Tactical Multiband Multirole Radio) is one of the important equipments for TICN which is our next military tactical communication system and it supplies to the distribution of traffic of C2(Command & Control) and SA(Situation Awareness) for unit of Brigade and below. In this paper, we define the tactical needs of military communication, and evaluate MANET(Mobile Ad-hoc Network) protocol for the future digital battle-field through performance comparison with a network simulator.

Social-relation Aware Routing Protocol in Mobile Ad hoc Networks (이동 애드 혹 네트워크를 위한 사회적 관계 인식 라우팅 프로토콜)

  • An, Ji-Sun;Ko, Yang-Woo;Lee, Dong-Man
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.8
    • /
    • pp.798-802
    • /
    • 2008
  • In this paper, we consider mobile ad hoc network routing protocols with respect to content sharing applications. We show that by utilizing social relations among participants, our routing protocols can improve its performance and efficiency of caching. Moreover, in certain situation which we can anticipate pattern of user's content consumption, our scheme can help such applications be more efficient in terms of access time and network overhead. Using NS2 simulator, we compare our scheme to DSDV and routing protocol using shortest path algorithm.

A Study on Environment Management System in Tunnel using Wireless Sensor Networks (무선 센서 네트워크를 이용한 터널 내 환경 관리 시스템에 관한 연구)

  • Joo, Yang-Ick;Kim, Jae-Wan
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.10
    • /
    • pp.1196-1203
    • /
    • 2013
  • In general, the cost of transceiver for wireless network configuration is more expensive than that for wired network. However, in case of environmental management system in a tunnel, the cost can be minimized by adopting low rate tranceiver because the amount of the exchanged data for tunnel monitoring is very small. When the obtained data from sensor node is sent directly to the corresponding command node, there is no need to consider routing problem of the data transfer. However in this case, sensor nodes are required to be implemented with high power transmitter and experience high energy consumption. To tackle this problem, relay nodes can be used to transfer the data of tunnel monitoring, and suitable routing protocols for selecting optimum path are needed. Therefore, in this paper, we propose a routing algorithm and a self-configuration protocol for environment management system in tunnel.