The Dynamic Source Routing (DSR) algorithm finds out the shortest path of communication between a source node and a destination node based on number of hops. However, a shortest path does not necessarily guarantee a stable path. This is because, the topology of a mobile ad hoc network changes dynamically and frequently due to the random motion of the nodes. Mobility of the nodes results in the breakage of the existing communication path. Thus, highly mobile nodes constitute a highly unstable path, whereas less mobile nodes form a relatively stable path. In this paper we propose an enhancement of the Route Discovery phase of the DSR algorithm. Instead of choosing the shortest path, we regard a path having minimum number of hops as well as high stability as the best path. The stability of the path is determined based on the mobility of the nodes. We also suggest the use of multiple routes for routing instead of a single route to reduce the communication path breakage possibilities and thereby ensure a more continuous communication process between the source and destination nodes.
[...] of intermediate nodes Motion time 5 10s Pause time Total time 2s after every 10s 200s Figure-02: Probability of communication breakage reduces when parallel routes are used 5. REFERENCES 1. Susmit Maity, Soumen Saha, Sk. Sahnawaj, Barun Kumar Saha and C. T. Bhunia" Preemptive Dynamic Source Routing: A Repaired Back up Approach and Stability Based DSR With Multiple Routes", Journal of Computing and Information Technology - CIT pp. D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad-Hoc Wireless Networks”, Mobile Computing, T. Imielinski and H. Korth, Eds. Kulwer pp. 151- H. Hassanein, H. [...]
[...] Proactive routing algorithms (example, DSDV) determine paths to all the other nodes in the network in advance and maintain those data in their routing tables. They periodically exchange routing data to maintain the paths. Hence there is minimum delay in determining the route to be taken to send the packets. Reactive routing protocols (e.g. DSR), on the other hand, determine a route to some destination node only when it is required to send some data to that node. The source node makes a global flooding of the route request message and waits for a route reply. [...]
[...] A performance comparison of multi-hop wireless ad hoc network routing protocols. MobiCom'98, Proceedings of 4th Annual CM/IEEE Inter. Conf. on Mobile Computing and Networking, pages October 1998. The figure shows that when multiple parallel routes are used, the communication between the source node and the destination node reduces exponentially. That is, more the number of parallel routes, more stable are the communication. This is due to the reason that when multiple routes are used, dependency on a single route reduces. [...]
[...] Below we show that if multiple routes are used, the probability of communication breakage decreases Related Calculations Assumptions To show that use of multiple routes provide increased stability to the communication process, we make the following assumptions: 1. Number of intermediate nodes in a route between the source and destination nodes is always fixed, say n Every node has the same mobility and therefore, every link has the same probability of breakage The lifecycle of each node consists of alternate periods of motion and rest. [...]
[...] Whenever the primary route fails, the backup route is used. The problem with this approach is that, while the source is still using the primary route, the backup route might fail and the source would remain unaware of that. If after sometime the primary route fails and the source node switches to the backup route, it discovers that the backup route has been already broken. But if multiple routes are used in parallel, the source node will be informed of the route failure immediately whenever it occurs. [...]
APA Style reference
For your bibliographyOnline reading
with our online readerContent validated
by our reading committee
