Showing papers on "Static routing published in 2019"

Segment Routing with the MPLS Data Plane

Abstract: Segment Routing (SR) leverages the source routing paradigm. A node steers a packet through a controlled set of instructions, called segments, by prepending the packet with an SR header. In the MPLS dataplane, the SR header is instantiated through a label stack. This document specifies the forwarding behavior to allow instantiating SR over the MPLS dataplane.

Flash: efficient dynamic routing for offchain networks

Abstract: Offchain networks emerge as a promising solution to address the scalability challenge of blockchain. Participants make payments through offchain networks instead of committing transactions on-chain. Routing is critical to the performance of offchain networks. Existing solutions use either static routing with poor performance or dynamic routing with high overhead to obtain the dynamic channel balance information. In this paper, we propose Flash, a new dynamic routing solution that leverages the unique transactions characteristics in offchain networks to strike a better tradeoff between path optimality and probing overhead. By studying the traces of real offchain networks, we find that the payment sizes are heavy-tailed, and most payments are highly recurrent. Flash thus differentiates the treatment of elephant payments from that of mice payments. It uses a modified max-flow algorithm for elephant payments to find paths with sufficient capacity, and strategically routes the payment across paths to minimize the transaction fees. Mice payments are sent directly by looking up a routing table with a few precomputed paths to reduce probing overhead. Testbed experiments and trace-driven simulations show that Flash improves the success volume of payments by up to 2.3x compared to the state-of-the-art routing algorithm.

OSPF Extensions for Segment Routing

Abstract: Segment Routing (SR) allows a flexible definition of end-to-end paths within IGP topologies by encoding paths as sequences of topological sub-paths, called "segments". These segments are advertised by the link-state routing protocols (IS-IS and OSPF). This draft describes the OSPFv3 extensions required for Segment Routing with MPLS data plane.

IS-IS Extensions for Segment Routing

Abstract: Segment Routing (SR) allows for a flexible definition of end-to-end paths within IGP topologies by encoding paths as sequences of topological sub-paths, called "segments". These segments are advertised by the link-state routing protocols (IS-IS and OSPF). This draft describes the necessary IS-IS extensions that need to be introduced for Segment Routing operating on an MPLS data-plane.

A rule based delay constrained energy efficient routing technique for wireless sensor networks

Abstract: In wireless sensor networks (WSN), the nodes are used to collect and gather the data from different environments. Hence, the network consumes more energy which is the main and challenging issue in WSNs. Since the sensor is operating under battery, recharging is impossible and hence the lifetime of each sensor is an important issue. Therefore, it is necessary to introduce new and efficient techniques to extend the network lifetime. In this paper, a new delay constrained energy efficient routing technique is proposed for performing effective routing in WSNs. This approach introduces a delay constraint based reliable routing approach which reduces the energy consumption by constructing efficient clusters without increasing the end-to-end delay. Moreover, the proposed technique called the rule based clustering for routing model provides better performance in terms of network lifetime than the other existing techniques since they consume more energy during the formation of clusters and finding the shortest path. Moreover, additional overhead on the cluster head selection is tackled also using rules in this proposed model in an efficient manner by building balanced clusters. The main advantage of the proposed approach is that it extends the lifetime of the network and increases the throughput, energy efficiency, link quality and scalability. The experimental verification of this technique has been carried out using MATLAB simulations and proved that this model increases the packet delivery rate, network performance and reduces the delay and energy consumption.

DRADS: depth and reliability aware delay sensitive cooperative routing for underwater wireless sensor networks

Abstract: In this paper, depth and reliability aware delay sensitive (DRADS), interference aware DRADS (iDRADS) and cooperative iDRADS (Co-iDRADS) routing protocols are proposed for maximizing network good-put while minimizing end-to-end delay. We have introduced a new metric called depth threshold to minimize the number of hops between source and destination while ensuring successful packet delivery. Our interference aware and co-operative routing based algorithms select the best relay node at each hop. Extensive simulation results validate that the proposed routing techniques perform better than the selected existing ones in terms of good-put and energy cost of the network.

Fault-Tolerant Adaptive Routing in Dragonfly Networks

Abstract: Dragonfly networks have been widely used in the current high-performance computers or high-end servers. Fault-tolerant routing in dragonfly networks is essential. The rich interconnects provide good fault-tolerance ability for the network. A new deadlock-free adaptive fault-tolerant routing algorithm based on a new two-layer safety information model, is proposed by mapping routers in a group, and groups of the dragonfly network into two separate hypercubes. The new fault-tolerant routing algorithm tolerates static and dynamic faults. Our method can determine whether a packet can reach the destination at the source by using the new safety information model, which avoids dead-ends and aimless misrouting. Sufficient simulation results show that the proposed fault-tolerant routing algorithm even outperforms the previous minimal routing algorithm in fault-free networks in many cases.

A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem

Abstract: This article considers the heterogeneous fleet vehicle routing problem, as a variant of a well-known transportation problem: the vehicle routing problem. In order to solve this particular routing problem, a variable neighborhood search with a threshold accepting mechanism is developed and implemented. The performance of the algorithm was compared to other algorithms and tested on datasets from the available literature. Computational results show that our proposed algorithm is competitive and generates new best solutions.

Load balancing routing with queue overflow prediction for WSNs

Abstract: The ease of deployment of Wireless Sensor Networks (WSNs) makes them very popular and useful for data collection applications. Nodes often use multihop communication to transmit data to a collector node. The next hop selection in order to reach the final destination is done following a routing policy based on a routing metric. The routing metric value is exchanged via control messages. Control messages transmission frequency can reduce the network bandwidth and affect data transmission. Some approaches like trickle algorithm have been proposed to optimize the network control messages transmission. In this paper, we propose a collaborative load balancing algorithm (CoLBA) with a prediction approach to reduce network overhead. CoLBA is a queuing delay based routing protocol that avoids packet queue overflow and uses a prediction approach to optimize control messages transmission. Simulation results on Cooja simulator show that CoLBA outperforms other existing protocols in terms of delivery ratio and queue overflow while maintaining a similar end-to-end delay.

Particle Swarm Based Resource Optimized Geographic Routing for Improved Network Lifetime in MANET

Abstract: In a Mobile ad hoc network (MANET), scalability, dynamic topology and high mobility are the most significant challenges to perform the routing with improved network lifetime. According to the geographical location, geographic routing termed as position-based routing performs data transmission between source node and destination node in a MANET. But, geographic routing protocols were not able achieve effective routing with enhanced network lifetime by improving the resource optimization and optimal coverage performance. In order to improve the resource optimization and network lifetime, an efficient Particle Swarm based Resource Optimized Geographic Routing (PS-ROGR) technique is introduced in MANET. Initially, each particle (i.e. mobile node) movement in a network is controlled by its local best known position in the search space (i.e. geographic location). The PSO permits all the particles in the network to communicate with the other particles with minimum energy. The particle which has the better global best function is selected for energy efficient routing based on the fitness value. Therefore the entire particles share the similar best position to optimize the network resources. Thereby, the PS-ROGR technique prolong the lifetime of the network with minimum energy utilization. Simulation is carried out on the factors such as packet delivery ratio, average end to end delay, energy consumption and network lifetime. Thus, the proposed PS-ROGR technique improves the network lifetime by 22% and reduces the average end to end delay by 46%. Then, the packet delivery ratio is enhanced up to 11% and energy consumption is minimized to 16% with the help of proposed PS-ROGR technique.

IPv4 to IPv6 Migration and Performance Analysis using GNS3 and Wireshark

Abstract: The internet is a system of various interconnected networks accessible worldwide. IPv4, a layer 3 protocol enables two or more computers to share the data among them. At the beginning of 2011, all the IPv4 address space was exhausted and now we are going for IPv6. Migration techniques have been proposed in this project, to migrate to the IPv6 network. Dual stack transition and manual tunneling transition techniques have been proposed in this paper to transmit an IPv6 packet through an IPv4 network. These transition techniques have been simulated using Graphical Network Simulator (GNS3). The transfer of packets has been analyzed in both static and dynamic routing scenarios. Wireshark has been used to capture a live packet on the wire and to analyze the packet header. We investigate migration techniques performance in terms of success rate and the minimum, average and maximum round – trip time and latency and throughput.

Quality of Service for Traffic Monitoring System based on Static Routing using EoIP Tunnel over IPSec

Abstract: The development of internet networks requires a network administrator to implement various topology schemes on the location of the different network. It is intended to make each other enables to communicate in one area and monitor the use of traffic. This research aim is to create private network connection by ensuring its security and distributing public address through routing static algorithm. Network Development Life Cycle (NDLC) is utilized as the research method. Based on the implementation of EoIP tunnel network over IPSec, the researcher analysed the Quality of Service (QoS) for EoIP tunnel non-IPsec with EoIP tunnel over IPSec to find out the comparison. The Result revealed that EoIP tunnel over IPsec has throughput 93.04%, delay 1.43 ms, jitter 1.41 ms, and packet loss 0.43%. The data is fewer than the data of EoIP non-IPsec with throughput 94.85%, delay 1.39 ms, jitter 1.37 ms, and packet loss 0.52%. The differentiation caused by the encryption negotiation process during the network connected. Hopefully, this research has a contribution to make user is more accessible to communicate in the local area and monitor the traffic use centrally.

On Enhancing Network Dynamic Adaptability for Compressive Sensing in WSNs

Abstract: Both energy efficiency and network dynamic adaptability are crucial research issues in wireless sensor networks (WSNs). Compressive sensing has been widely adopted in WSNs for efficient data gathering. Random walk is a typical dynamic routing mechanism. Integrating compressive sensing with random walk offers the opportunity to achieve both efficiency and dynamic adaptability. However, there are still many problems in the existing schemes, such as semi-dynamic routing (which contains both dynamic and static routing), non-uniform sampling and relying on global coordinate information. In order to address these problems, we propose a dual random walk based compressive sensing. First, we design a dual random walk, which is a directed random walk but does not depend on the coordinate information of each node, and it also achieves a uniform sampling. Then, we construct a dynamic compressive sensing data gathering scheme based on the dual random walk, which effectively enhances the network dynamic adaptability. Both theoretical analysis and experimental evaluation are conducted. The experimental evaluation results demonstrate that it outperforms the most closely related work.

Formal modeling and analysis of ad hoc Zone Routing Protocol in Event-B

Abstract: Ad hoc routing protocols are responsible for searching a route from the source to the destination under the dynamic network topology. Hybrid routing protocols combine the features of proactive and reactive approaches. So, the formal specification of a hybrid routing protocol in the dynamic network environment is a challenge. In this paper, we formally analyze the Zone Routing Protocol (ZRP), a hybrid routing framework, using Event-B. We develop the formal specification by the refinement mechanism. It allows us to gradually model the network environment, the construction of routing zones, route discovery based on bordercasting service and routing update. We prove the stabilization property in the inactive environment. In addition, we demonstrate that discovered routes hold the loop freedom and validity in each reachable system state. To present that the formalization is consistent with the informally expressed requirements, we adopt an animator, ProB, to validate our model. Our work provides reference to analyze extensions of the ZRP and other hybrid routing protocols.

BGP-LS extensions for Segment Routing BGP Egress Peer Engineering

Abstract: Segment Routing (SR) leverages source routing A node steers a packet through a controlled set of instructions, called segments, by prepending the packet with an SR header A segment can represent any instruction, topological or service-based SR segments allow steering a flow through any topological path and service chain while maintaining per-flow state only at the ingress node of the SR domain This document describes an extension to BGP Link-State (BGP-LS) for advertisement of BGP Peering Segments along with their BGP peering node information so that efficient BGP Egress Peer Engineering (EPE) policies and strategies can be computed based on Segment Routing

Infrastructure-aided hybrid routing in CR-VANETs using a Bayesian Model

Abstract: With long delays due to sporadic routing links in cognitive vehicular communications systems, relay node selection is one of the key design factors, as it significantly improves end-to-end delay, thereby improving overall network performance. To this end, we propose infrastructure-aided hybrid routing that uses a roadside unit (RSU) to help vehicular nodes to select idle channels and relay nodes. Channel selection is done with a belief propagation algorithm, which aggregates individual beliefs with the help of vehicles and RSUs to make a final belief, providing high accuracy in hypotheses about spectrum availability. The selection of a relay node is determined by calculating the message delivery time—the source/relay node selects the one that has the minimum message delivery time from among all the neighboring nodes. This is a hybrid (vehicle-to-vehicle and vehicle-to-RSU) communications scheme where two nodes can communicate only when they have consensus about a common idle channel. The idea is to combine cognitive capabilities with a routing technique in order to simultaneously overcome spectrum scarcity and network connectivity issues. Therefore, both dense and sparse network conditions are considered in this routing protocol for both highway and city scenarios. To enhance the stability of cognitive routing links, different functions for vehicles and RSUs are considered. We prove better performance in delay, delivery ratio, and overhead by comparing the proposed technique with two existing techniques (one dealing with, and another without, RSUs).

Flash: Efficient Dynamic Routing for Offchain Networks

Abstract: Offchain networks emerge as a promising solution to address the scalability challenge of blockchain. Participants directly make payments through a network of payment channels without the overhead of committing onchain transactions. Routing is critical to the performance of offchain networks. Existing solutions use either static routing with poor performance or dynamic routing with high overhead to obtain the dynamic channel balance information. In this paper, we propose Flash, a new dynamic routing solution that leverages the unique characteristics of transactions in offchain networks to strike a better tradeoff between path optimality and probing overhead. By studying the traces of real offchain networks, we find that the payment sizes are heavy-tailed, and most payments are highly recurrent. Flash thus differentiates the treatment of elephant payments from mice payments. It uses a modified max-flow algorithm for elephant payments to find paths with sufficient capacity, and strategically routes the payment across paths to minimize the transaction fees. Mice payments are directly sent by looking up a routing table with a few precomputed paths to reduce probing overhead. Testbed experiments and data-driven simulations show that Flash improves the success volume of payments by up to 2.3x compared to the state-of-the-art routing algorithm.

Research of Adaptive Routing Scheme for LEO Network

Abstract: Low Earth Orbit (LEO) satellite network is becoming an increasingly hot topic in satellite communication since it provides shorter round-trip delays compared with Geostationary Earth Orbit (GEO) satellites. Due to the rapid topology changes in the LEO constellation, its routing protocol should be different from existing protocols harnessed for the terrestrial networks. Based on the periodicity and predictability characteristics of LEO network, static routing algorithms are most commonly used. The topology snapshots and corresponding forwarding tables are calculated in advance so as to save the on-board computing resources. However, the static routing algorithm is not compatible with sudden link failure, which reduces its robustness. In this paper, a static-dynamic combined routing strategy is proposed as an adaptive routing scheme to LEO satellite networks. The new scheme captures both the higher robustness compared with static routing algorithms and lower packet loss, higher throughput compared with dynamic routing algorithms.

An Adaptive Routing Scheme Based on Q-learning and Real-time Traffic Monitoring for Network-on-Chip

Abstract: In the Network on Chip (NoC), performance optimization has always been a research focus. Compared with the static routing scheme, dynamical routing schemes can better reduce the data of packet transmission latency under network congestion. In this paper, we propose a dynamical Q-learning routing approach with real-time monitoring of NoC. Firstly, we design a real-time monitoring scheme and the corresponding circuits to record the status of traffic congestion for NoC. Secondly, we propose a novel method of Q-learning. This method finds an optimal path based on the lowest traffic congestion. Finally, we dynamically redistribute network tasks to increase the packet transmission speed and balance the traffic load. Compared with the C-XY routing and DyXY routing, our method achieved improvement in terms of 25.6%-49.5% and 22.9%-43.8%.

GUARD: an intrusion detection framework for routing protocols in multi-hop wireless networks

Abstract: The Multihop Wireless Networks have received great attention in recent years, owing to the rapid proliferation of wireless devices. The wireless routing protocols assume that the nodes are cooperating and well-behaving. However, such networks are subject to several active routing attacks such as dropping, flooding, and modification. The primary intention of such attack is to thwart the objectives of routing protocols and cause network malfunction. This state of affairs motivates the recent research towards the development of a sophisticated security framework that works well against active routing attacks. This paper proposes GUARD, an intrusion detection framework that aims at detecting the active routing attacks efficiently with a considerable reduction in energy consumption. The GUARD incorporates three mechanisms such as a Restricted Directional Watchdog Selection, a Game Design, and an Incentive Estimation. Applying the Restricted Directional Watchdog Selection makes the GUARD a lightweight intrusion detection system (IDS) model, where only a limited number of nodes turn on IDS. The GUARD utilizes non-cooperative game design and exploits the advantage of Fuzzy q-learning to determine the malicious activity. The notion of Fuzzy q-learning determines the results of the player strategies of game design to measure the appropriate reward. The GUARD framework is incorporated into the popular protocols such as AODV and LEACH to validate the effectiveness of the defense mechanism. The simulation results show that these extended protocols outperform the existing protocols in terms of attack detection accuracy, throughput, delay, and network lifetime.

Routing Protocol for WMNs

Abstract: Wireless mesh networks are multi-hop networks. Therefore, a mechanism for finding a path between source and destination is needed. Static routing means that the path is set up manually, while dynamic routing requires a routing protocol which sets up routing tables. A router forwards packets to a next hop neighbor, which is chosen upon a routing metric. This process is called routing. Wired networks either uses distance vector or link state routing protocol. With distance-vector protocols each node keeps a vector of its neighbors and their distance. The router periodically broadcasts the distance-vector to its one-hop neighbors. Distance is usually the hop count or weighted hop count. Routing Information Protocol (RIP) and Border Gateway Protocol (BGP) are two famous distance vector protocols. On other hand link state routing protocols construct a map of the connectivity of the networks, in the form of a graph showing which nodes are connected to which other nodes.

Space-ground integrated network dynamic and static hybrid routing method

Abstract: The invention discloses a space-ground integrated network dynamic-static hybrid routing method, and aims to provide a dynamic-static integrated hybrid routing method which adapts to the characteristics of continuous dynamic change of space-ground integrated network topology, limited on-satellite load capacity of nodes, long inter-satellite link transmission time delay, unbalanced distribution of carried data flow and the like. According to the technical scheme, the method comprises the steps that a static route sends motion trail information of a satellite-based node to a ground operation andmaintenance management and control center, a routing request is initiated, and the motion trail information of the satellite-based node is obtained; the operation and maintenance management and control center performs time slice division, virtual topological graph construction and original routing table creation by adopting a time virtualization routing algorithm; and after the satellite-based node responds to the routing request and accepts the task, a task route is constructed according to the static routing table, an on-satellite load task is obtained, whether the sending of the data packetsucceeds or not is judged, if the packet sending fails, the route is dynamically reconstructed by adopting a DSR routing algorithm, and if the sending of the data packet succeeds, the transmission ofthe data packet is finished.

OSPFv3 Extensions for SRv6

Abstract: Segment Routing (SR) allows for a flexible definition of end-to-end paths by encoding paths as sequences of topological sub-paths, called "segments". Segment routing architecture can be implemented over an MPLS data plane as well as an IPv6 data plane. This draft describes the OSPFv3 extensions required to support Segment Routing over an IPv6 data plane (SRv6).

Multi-attached Network Topology with Different Routing Protocols and Stub Network Resolution in OSPF Routing

Abstract: The multi-homing technology has always been an area for research interest in computer networking after its implementation to the Internet. Various multi-homing topologies are proposed for better understanding and approach to solving the issues raised by multi-homing technology. Relating to one such issue caused by stub networks, the performances of various routing protocols are analyzed and packet flow is studied in a multi-homed network. This article aims toward a multi-attached network topology as a type in multi-homing technology which is configured using different routing protocols for backup routes and reliable data flow. This paper also compares the static routing protocol with all other dynamic routing protocols and analyses the performance using the proposed topology.

Extra-domain link detection method and device, storage medium and computer device

Abstract: The invention relates to an extra-domain link detection method which comprises after a next hop position is detected according to configured static routing information, causing a controlled switch tosend an ARP message according to a detection result; determining the next hop position according to the ARP response information sent by the controlled switch, transmitting a routing table to the controlled switch, and modifying a APR message forwarding behavior on the controlled switch; confirming that the next hop is unreachable after the link fault information between the controlled switch andan extra-domain device and reported by the controlled switch is received; deleting the routing table and modifying the APR message forwarding behavior on the controlled switch according to the routinginformation after a redundant backup link is automatically selected to generate the corresponding routing information. The method can quickly detect link faults, can dynamically configure and adjustthe extra-domain link, and can quickly select and switch a route when the link has a fault. An extra-domain link detection device, a storage medium and a computer device are also provided.

A Routing and Link Scheduling Strategy for Smart Grid NAN Communications

Abstract: As large scale deployment of smart devices in the power grid continues, research efforts need to increasingly focus on efficient communication of generated information. This paper describes a strategy for static routing and scheduling of messages in a multi-hop wireless Smart Grid Neighborhood Area Network (NAN) with multiple source nodes and a common set of destinations or gateways. The problem is formulated as a Mixed Integer Linear Program (MILP) and solved using commercial optimization solver CPLEX. Feasibility of the scheme is demonstrated using different network models, constraints, message injection rates, and initial conditions. It is shown that the proposed approach can be used to generate an optimal link schedule for collecting user-generated bids in a transactive energy market in the least possible time. It is also shown that the methodology is applicable to multiple destination nodes and that their location affects message delivery time.

Enhanced trust based encroachment discovery system for Mobile Ad-hoc networks

Abstract: The ultimate goal of this paper is to avoid inclusion of intruder node in the route and to ensure reliability. The trust metrics are used to provide the secure communication. Opportunistic routing scheme is used to ensure reliability or data consistency in the MANET. In the opportunistic routing, each and every node has the chance to select the next intermediate node. The best intermediate node is selected based on the trust value of a node. Each and every mobile node maintains the trust value for its neighbors. The trust value is calculated based on the node’s Quality of Service parameters. In the opportunistic routing, each and every node maintains the trust value for its neighbor nodes. The next forwarder node is selected from the neighbor list. The node with highest trust value is selected as next forwarder node. In the proposed method a node does not maintain the static route to reach the destination. Instead of that the node selects the next forwarder node during runtime. We present a Enhanced Light-weight Trust-based Routing protocol (ELTB). It is light-weight in the sense that the intrusion detection system (IDS) used for estimating the trust that one node has for another, consumes limited computational resource and finding the best optimal path for packet transmission. Moreover, it uses only local information thereby ensuring scalability. Our Enhanced Light-weight IDS takes care of two kinds of attacks, namely, the blackhole attack and the grey hole attack. It is beast suite for highly dynamic environment to handle the frequent link failure. So, the source node transmits the data to the destination node only via trusted node to ensure secure routing in the MANET. The authors have used AODV as the base routing protocol to evaluate our proposed approach and give a performance analysis.

Packet-Optical Integration in Segment Routing

Abstract: This document illustrates a way to integrate a new class of nodes and links in segment routing to represent transport/optical networks in an opaque way into the segment routing domain. An instance of this class would be optical networks that are typically transport centric by having very few devices with the capability to process packets. In the IP centric network, this will help in defining a common control protocol for packet optical integration that will include optical paths as 'transport segments' or sub-paths as an augmentation to packet paths. The transport segment option also defines a general mechanism to allow for future extensibility of segment routing into non-packet domains.

Load balancing-failover methods using static route with address list, ecmp, pcc, and nth for optimizing lan network : a comparison

Abstract: Internet network is a means of infrastructure to support the learning and working process. Some internet network problems that often occur are internet connection is lost, the connection is slow, and the output does not match the bandwidth that is owned. This can be accommodated by using 2 (two) internet modem units from different ISP combined with the Load Balancing process. Load Balancing used to combine two internet modems so that one connection can become a backup connection if the main connection is lost. Nowadays Load Balancing has 4 (four) methods, they are Static Router with Address List, ECMP, PCC, and Nth. The problem is choosing the best method for Load Balancing. This research uses the PPDIOO network development method. From the results of tests conducted in this research indicate the balance of internet access and bandwidth performance owned by ISP1 and ISP2 after the Load Balancing process is carried out. From testing 4 (four) Load Balancing methods, the results show that the Nth method produces 79.2% bandwidth by testing for 40 (forty) days. The conclusion is that the Nth method is more effective to be applied on a LAN network compared to other Load Balancing methods because it can divide the internet connection path when browsing, downloading, and can do a failover. Expectations going forward after applying Load Balancing Nth method can improve internet performance that is used every day for learning and working activities in an organization. Keywords : Load Balancing, Failover, Static Route with Address List, ECMP, PCC, Nth.

Novel routing protocol scheme for real-time applications in mobile Ad Hoc networks

Abstract: In mobile Ad Hoc networks (MANETs), flooding-based route discovery is usually preferred in order to set up the route with reliability between transmission pair. However, this approach may cause a serious contention in transmission between adjacent nodes and a considerable amount of control packets. In addition, most of Ad Hoc routing protocols establish the route with minimum hop count. Consequently, the performance of Ad Hoc routing protocol is considerably affected by link (or route) duration since the network comprises the nodes with unrestricted mobility and constrained range in transmission. This paper proposes novel routing protocol that aims to (1) minimize routing overhead in route discovery procedure, and (2) guarantee a reliable and fast packet delivery between source and destination, especially in providing real-time applications over MANETs. To achieve this objective, we introduce relay region (RR) within the transmission range of nodes in order to select optimal next relaying nodes for supporting specific application requirements in route discovery procedure. The RR is defined by the limited distance progress in transmission to next relaying node in order to maintain the established route for an arbitrary length of time (i.e., route duration) while meeting packet delivery reliability and delay constraints. In performance evaluation, the simulation results showed that the proposed scheme can significantly improve the performance in comparison with the previous routing algorithms in terms of packet delivery ratio and packet delivery latency, reducing transmission redundancy in route discovery procedure.