Dynamic Source Routing in Ad Hoc Wireless Networks (original) (raw)
Related papers
DSR: The dynamic source routing protocol for multi-hop wireless ad hoc networks
Ad hoc networking, 2001
The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network infrastructure or administration. The protocol is composed of the two mechanisms of Route Discovery and Route Maintenance, which work together to allow nodes to discover and maintain source routes to arbitrary destinations in the ad hoc network. The use of source routing allows packet routing to be trivially loop-free, avoids the need for up-to-date routing information in the intermediate nodes through which packets are forwarded, and allows nodes forwarding or overhearing packets to cache the routing information in them for their own future use. All aspects of the protocol operate entirely on-demand, allowing the routing packet overhead of DSR to scale automatically to only that needed to react to changes in the routes currently in use. We have evaluated the operation of DSR through detailed simulation on a variety of movement and communication patterns, and through implementation and significant experimentation in a physical outdoor ad hoc networking testbed we have constructed in Pittsburgh, and have demonstrated the excellent performance of the protocol. In this chapter, we describe the design of DSR and provide a summary of some of our simulation and testbed implementation results for the protocol.
On-Demand Routing in Multi-hop Wireless Mobile Ad Hoc Networks
2001
An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any preexisting network infrastructure or centralized administration. Routing protocols used in ad hoc networks must automatically adjust to environments that can vary between the extremes of high mobility with low bandwidth, and low mobility with high bandwidth. This thesis argues that such protocols must operate in an on-demand fashion and that they must carefully limit the number of nodes required to react to a given topology change in the network. I have embodied these two principles in a routing protocol called Dynamic Source Routing (DSR). As a result of its unique design, the protocol adapts quickly to routing changes when node movement is frequent, yet requires little or no overhead during periods in which nodes move less frequently. By presenting a detailed analysis of DSR's behavior in a variety of situations, this thesis generalizes the lessons learned from DSR so that they can be applied to the many other new routing protocols that have adopted the basic DSR framework. The thesis proves the practicality of the DSR protocol through performance results collected from a full-scale 8 node testbed, and it demonstrates several methodologies for experimenting with protocols and applications in an ad hoc network environment, including the emulation of ad hoc networks.
IJERT-Performance Analysis Of Dynamic Source Routing Protocol In Wireless Mobile Ad Hoc Network
International Journal of Engineering Research and Technology (IJERT), 2012
https://www.ijert.org/performance-analysis-of-dynamic-source-routing-protocol-in-wireless-mobile-ad-hoc-network https://www.ijert.org/research/performance-analysis-of-dynamic-source-routing-protocol-in-wireless-mobile-ad-hoc-network-IJERTV1IS10403.pdf An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any pre-existing network infrastructure or centralized administration. Routing protocols used in ad hoc networks must automatically adjust to environments that can vary between the extremes of high mobility with low bandwidth, and low mobility with high bandwidth. I have analyzed a routing protocol called Dynamic Source Routing (DSR). As a result of its unique design, the protocol adapts quickly to routing changes when node movement is frequent, yet requires little or no overhead during periods in which nodes move less frequently. By presenting a detailed analysis of DSR's behaviour in a variety of situations, this paper generalizes the lessons learned from DSR so that they can be applied to the many other new routing protocols that have adopted the basic DSR framework. In the DSR protocol, a backup route will be initiated to transfer data (in route cache) when the initial route is broken. However, a backup route affects the overall network performance such as end-to-end delay, etc. In this paper, I showed the simulation results of the dynamic source routing protocol based on it's throughput, pause time, packet received, drop packet ratio, end to end delay, packet delivery fraction, and routing overhead. This results shows that dynamic source routing protocol is an efficient protocol to be used in Ad Hoc network and its performance is good when its pause time is increases.
International Journal of Electrical and Computer Engineering (IJECE), 2018
With the increase in the evolution of wireless communication, the ad-hoc networks are gaining attention and are significantly becoming the technology solutions to the various problems. Mobile ad-hoc Networks (MANETs) are envisaged to grow as a main component in the today 4G architecture, and ad hoc networks are projected to be a significant element of the whole future wireless communication. The MANETs are infrastructure less, self-forming and self-organizing network in which there is no control of any centralized entity. The nodes are free to move around the network with dynamic topology. But this self formation, flexibility and scalability create many challenges and design constraints like hidden terminal, limited bandwidth, limited energy of a node, unpredictable change in the topology etc. Bandwidth and energy are the scarce resources of the network. In order to effectively manage the consumption of bandwidth and energy, an algorithm is proposed which is the extension of traditional Dynamic Source Routing (DSR) reactive routing protocol. The extended protocol applies the mobile agents to carry the data. The proposed work is intended to optimize the bandwidth and making the protocol energy efficient. 1. INTRODUCTION With the increase in the evolution of wireless communication, the ad-hoc network is gaining attention and significantly becoming the technology solution to the various problems. Mobile ad-hoc networks (MANETs) are envisaged to grow as a main component in the 4G architecture, and projected to be a significant element of the whole future wireless communication. On a broad spectrum, mobile ad-hoc networks are created dynamically through the mobile devices that are linked with each other with wireless links with no pre-existing network infrastructure or any centralized entity. The mobile devices are liberal to roam around the network; thus, the network's topology can be changed swiftly and suddenly. The network can work as a standalone network or can be linked to the Internet. Mobile ad hoc networks don't require any infrastructure viz base station etc for their working. The nodes themselves act as a router and route the data packets through multiple hops. If there is no direct path between the source and the destination, the nodes in the network act as an intermediate node and forward the packets. The mobile device may be a handheld device, tablet, laptop etc. If a node is lying in the transmission range of another node, the two nodes can communicate directly. For interacting with the devices that are outside the transmission range the node take help of its neighbor nodes which forward the packets hop by hop. But this self-formation, flexibility, and scalability create the traditional problems also. The ad-hoc networks have limited bandwidth, energy, and
The Impact of Speed on the Performance of Dynamic Source Routing in Mobile Ad-Hoc Networks
2010
Ad-hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols plays an important role. Due to mobility in Ad-hoc network, the topology of the network may change rapidly. The mobility models represent the moving behavior of each mobile node in the MANET that should be realistic. This paper concerns performance of mobile Ad-hoc network (MANET) routing protocol with respect to the effects of mobility model on the performance of DSR protocol for the purpose of finding the optimal settings of node speed. In this paper, we evaluate the performance of DSR protocol using Random Waypoint Mobility Model in terms of node speed, number of connections, and number of nodes.
Routing protocols for ad hoc wireless networks
2011
An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. Due to the limitations in the wireless environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination. Thus, multiple network "hops" may be needed for one node to exchange data with another across the network. To accomplish this communication, a routing protocol is used to discover routes between these nodes. This paper presents a variety of results for packet-level simulations for two popular protocols -Dynamic Source Routing (DSR) and Direct-Sequenced Distance Vector Routing (DSDV) . The DSR protocol implements source routing, where each of the packets carries the route to its destination. The source of the packet maintains routing information about the route from itself to all the destinations in the network. DSR adapts quickly to routing changes when the host movement is frequent. Unlike DSR, in DSDV each host is viewed as a specialized router that periodically advertised its updates to other hosts in the network. A sequence number is associated with each update and the larger sequence number is always used in deciding the path. An infinite sequence number denotes a broken link. We carried out packet level simulations of DSR and DSDV using ns-2 and analyzed their performance. We also studied the performance implications of a minor variation made to DSDV and the effect of changing different parameters in DSDV.
Source routing in Mobile Ad hoc NETworks (MANETs)
International Journal of Recent …, 2009
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and selfadministrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks-the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
An Energy-Efficient Dynamic Source Routing Protocol for Mobile Ad Hoc Networks
The Dynamic Source Routing Protocol (DSR) is one of the most reliable and effective protocols in the Mobile Ad Hoc Networks (MANETs). It is also one of the few MANET protocols whose routing scheme can easily be optimized. But the routing overhead generated by its routing algorithm still leaves substantial amounts of energy being wasted. Route Request (RREQ) and Route Maintenance packets generate overhead control packets that occupy bandwidth, consume energy and may overwhelm a network if not controlled. This paper proposed EEDSR, an extension of DSR that reduces routing overhead by limiting the number of route discovery and maintenance packets in the MANET. The scheme involves bigger packet headers for the source route discovery packets since they contain information about the energy levels of the nodes in the route cache. In EEDSR, since the RREQ packets are flooded once for each communication period, routing overhead is minimized.
A Novel Routing Protocol For Mobile Ad Hoc Networks
A Mobile Ad-hoc Network (MANET) is a temporary wireless network composed of mobile nodes, in which an infrastructure is absent. If two mobile nodes are within transmission range, they can communicate with each other directly. Otherwise, the nodes in between them have to forward the packets. In such a case, every mobile node has to function as a router to forward the packets for others. Thus, routing is a basic operation for the MANET. With the dynamic and mobile nature of ad hoc wireless networks, links may fail due to topological changes by mobile nodes. As the degree of mobility increases, the wireless network would suffer by more link errors. Ad hoc routing protocols that use broadcast to discover routes may become inefficient due to frequent failures of intermediate connections in an end-to-end communication.
A review of current routing protocols for ad hoc mobile wireless networks
Personal Communications, IEEE, 1999
ince their emergence in the 1970s, wireless networks have become increasingly popular in the computing industry. This is particularly true within the past decade, which has seen wireless networks being adapted to enable mobility. There are currently two variations of mobile wireless networks. The first is known as the infrastructured network (i.e., a network with fixed and wired gateways). The bridges for these networks are known as base stations. A mobile unit within these networks connects to, and communicates with, the nearest base station that is within its communication radius. As the mobile travels out of range of one base station and into the range of another, a "handoff" occurs from the old base station to the new, and the mobile is able to continue communication seamlessly throughout the network. Typical applications of this type of network include office wireless local area networks (WLANs).