• Title/Summary/Keyword: on-demand routing

Search Result 287, Processing Time 0.025 seconds

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.

Dynamic Reverse Route for On-Demand Routing Protocol in MANET

  • Zuhairi, Megat;Zafar, Haseeb;Harle, David
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.5
    • /
    • pp.1354-1372
    • /
    • 2012
  • Route establishment in Mobile Ad Hoc Network (MANET) is the key mechanism to a successful connection between a pair of source and destination nodes. An efficient routing protocol constructs routing path with minimal time, less routing overhead and capable of utilizing all possible link connectivity. In general, most on-demand MANET routing protocols operates over symmetrical and bidirectional routing path, which is infeasible due to the inherent heterogeneous properties of wireless devices. Simulation results show that the presence of unidirectional links on a network severely affect the performance of a routing protocol. In this paper, a robust protocol independent scheme is proposed, which enable immediate rediscovery of alternative route for a path blocked by a unidirectional link. The proposed scheme is efficient; route rediscovery is locally computed, which results in significant minimization of multiple route packets flooding. Nodes may exploit route information of immediate neighbors using the local reply broadcast technique, which then redirect the control packets around the unidirectional links, therefore maintaining the end-to-end bidirectional connection. The proposed scheme along with Ad Hoc On-demand Distance Vector (AODV) and AODV-Blacklist routing protocol is investigated over three types of mobility models. Simulation results show that the proposed scheme is extremely reliable under poor network conditions and the route connectivity can be improved by as much as 75%.

AOZDV(Ad Hoc On-demand Zone and Distance-Vector) : A Routing Protocol with Novel Zone Mechanism in Wireless Ad hoc Networks (무선 Ad hoc 망의 새로운 Zone 기법을 적용한 AOZDV(Ad Hoc On-demand Zone and Distance-Vector) 라우팅 프로토콜)

  • Kim Yong-Woo;Choi Sung-Jae;Lee Hong-Ki;Song Joo-Seok
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.4
    • /
    • pp.299-309
    • /
    • 2006
  • In Mobile ad hoc networks, AODV is one of the famous on-demand routing protocol, which use the routing tables in the nodes if possible, or Route Discovery Process (RDP) is triggered to find a new route. However increasing the traffic of RDP causes dropping of the network performance in the large size of ad hoc networks. In this paper, we propose a novel routing protocol, named as AOZDV (Ad hoc On-demand Zone and Distance-Vector Routing), which enhances the AODV protocol with zone routing. AOZDV creates a Zone with neighbor nodes of the source/destination using traffic and power information, and utilizes Destination-Vector Table for internal routing in the Zone. We show by simulations that AOZDV can reduce the occurrence rate of route fail and RDP caused by route fail compared to existing routing protocols such as DSR and AODV.

Advanced On-Demand Multicast Routing Protocol For Multimedia Contents (멀티미디어 컨텐츠를 위하여 개선된 ODMRP)

  • Kim, Do-Yeon;Cho, Jin-Woong;Park, Sung-Kwon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.5
    • /
    • pp.13-19
    • /
    • 2008
  • A mobile ad-hoc network routing protocols for transmission of multimedia contents need to have low delay time and to maintain the established route because it should secure quality of service(QoS) of the network. In this paper, the proposed protocol, termed HODMRP (History-based On-Demand Multicast Routing Protocol), is enhanced On-Demand Multicast Routing Protocol (ODMRP) by adding the criterion which is the session history for establishing route. The characteristic of this protocol is that data can be transmitted using the redundant route which is already selected by session history, if it occurs that the route is broken, HODMRP have better Packet Delivery Ratio (PDR) value and lower delay time than ODMRP by the simulation results.

  • PDF

Performance Evaluation of On-Demand Routing Protocol using Look-ahead Selective Flooding in Ad-hoc Network (Ad-hoc 네트워크에서 Look-ahead Selective Flooding을 이용한 On-Demand 라우팅 프로토콜 성능 개선)

  • Yo-chan Ahn
    • Journal of Information Technology Applications and Management
    • /
    • v.10 no.2
    • /
    • pp.61-71
    • /
    • 2003
  • Ad-hoc networks are characterized by multi-hop wireless links, frequently changing network topology and the need for efficient dynamic routing protocols. In an Ad-hoc network, each host assumes the role of a router and relays packets toward final destinations Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. tn this paper 1 point out the more important cost factor than the number of links in the Ad-hoc network. A class routing protocols called on-demand protocols has recently found attention because of their low routing overhead since it performs a blind flooding to look for a path. In this paper, 1 propose the method which reduces overhead by using the information of neighboring nodes and doing a selective flooding. Simulation results demonstrate better reduction of routing overheads with this scheme.

  • PDF

Performance Comparison of On-demand Routing Protocol to Supply Secure Service for Mobile Ad Hoc Networks (MANET에서 안전한 서비스 제공을 위한 On-demand 라우팅 프로토콜의 성능 비교)

  • Heo, Jin-Kyoung;Yang, Hwan-Seok
    • Journal of Digital Contents Society
    • /
    • v.10 no.2
    • /
    • pp.349-355
    • /
    • 2009
  • MANET is network that attach importance to not only service of large network as internet but also support of communication among each nodes because infrastructure constitution is disadvantage economically or difficult physically. The most important part in protection of systems constitute MANET is that authenticate each nodes securely and offer reliable service. Well defined routing technique is necessity to this. In this paper, in order to offer safe service, we compare capacity of present security routing protocol, analyze to solve weakness of existing on-demand routing protocol and existing routing protocol and argue with study course of hereafter security routing protocol.

  • PDF

Associativity-Based On-Demand Multi-Path Routing In Mobile Ad Hoc Networks

  • Rehman, Shafqat Ur;Song, Wang-Cheol;Park, Gyung-Leen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.5
    • /
    • pp.475-491
    • /
    • 2009
  • This paper is primarily concerned with multi-path routing in Mobile Ad hoc Networks (MANETs). We propose a novel associativity-based on-demand source routing protocol for MANETs that attempts to establish relatively stable path(s) between the source and the destination. We introduce a new notion for gauging the temporal and spatial stability of nodes, and hence the paths interconnecting them. The proposed protocol is compared with other unipath (DSDV and AODV) and multi-path (AOMDV) routing protocols. We investigate the performance in terms of throughput, normalized routing overhead, packet delivery ratio etc. All on-demand protocols show good performance in mobile environments with less traffic overhead compared to proactive approaches, but they are prone to longer end-to-end delays due to route discovery and maintenance.

An Efficient On-Demand Routing Approach with Directional Flooding for Wireless Mesh Networks

  • Kum, Dong-Won;Le, Anh-Ngoc;Cho, You-Ze;Toh, Chai Keong;Lee, In-Soo
    • Journal of Communications and Networks
    • /
    • v.12 no.1
    • /
    • pp.67-73
    • /
    • 2010
  • Current on-demand ad-hoc routing protocols 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 an efficient on-demand routing approach with directional flooding (DF), which is suitable for the WMNs with limited mobility. In the route discovery process to reach a gateway, our DF scheme can reduce the number of route request (RREQ) packets broadcast by using a restricted directional flooding technique. Simulation results show that ad hoc on-demand distance vector (AODV) with DF (AODV-DF) can significantly reduce routing overhead by RREQ packets and enhance overall performance compared with the original AODV.

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.

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.