Analysis of the performance of DSDV routing protocol in ad hoc wireless networks.
Patent Information
- Application Number
- IN202121024060
- Authority / Receiving Office
- IN · IN
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2021-05-30
- Publication Date
- 2026-07-14
- Estimated Expiration
- 2041-05-30
AI Technical Summary
Ad-hoc wireless networks face challenges in maximizing throughput capacity due to high mobility, limited resources, and high control overhead, with existing routing protocols often failing to optimize resource usage and handle dynamic network topologies effectively.
The Destination Sequenced Distance Vector (DSDV) routing protocol is enhanced to reduce control overhead and improve throughput capacity by using sequence numbers for loop-free routing and event-driven updates, allowing non-optimum routing paths to be maintained and updated only when necessary, thereby conserving bandwidth and power.
This approach results in improved throughput capacity by 54%, reduced end-to-end delay by 20%, and decreased average energy consumption by 54%, while maintaining scalability and adaptability in both mobility and non-mobility scenarios, addressing the limitations of existing protocols like AODV and DSR.
Abstract
Description
COMPLETE SPECIFICATION(See section 10 and rule 13)TITLE OF THE INVENTION:Analysis of the performance of DSDV routing protocol in adhoc wireless networks. FIELD OF THE INVENTIONOur Invention is related to a Analysis of the performance of DSDV routing protocol in ad hoc wireless networks.BACKGROUND OF THE INVENTIONThe wireless communication and networking technologies have witnessed tremendous growth in recent years and have their importance for both civilian and defence applications. These technologies are not only being used for the voice and data, but also for the multimedia applications such as video transfer, teleconferencing, web browsing, image sharing, etc.The other types of routing protocols by considering various parameters like, mobility, average throughput, end-to-end delay, average energy consumption etc. in ad-hoc wireless networks may be considered. While comparing the system and simulation model of various routing protocols in ad-hoc wireless networks, security aspects of various routing protocols may also be considered. Compatibility of IEEE 802.11 MAC layer with IEEE 802.15.4 on various parameters in different routing protocols in ad-hoc wireless networks may also be incorporated.Ad-hoc networks, also known as multi-hop packet-radio networks, typically consist of mobile hosts that are interconnected by routers that can also move. This architecture is used when there is no wired infrastructure in place. Examples of such networks are networks set up in disaster or military scenarios, and networks set up at temporary events such as a class lecture or business convention. In most instances, not all stations are within line of sight of each other or a base station. Therefore, packets have to be relayed several times over multiple-access channels. Due to limited transmission range, mobility causes frequent changes in connectivity; that is, the network topology is dynamic. All the stations are identical and serve as both sources and relays of data traffic.Due to the multihop and dynamic nature of ad-hoc networks, a distributed routing protocol is required to forward packets between mobile stations and to and from the Internet. Routers in an ad-hoc network can easily run routing protocols designed for wired networks, provided the routers contain proper stacks. However, wireless networks suffer from low bandwidth and high rates of interference.This implies that routing protocols should generate as few updates as possible, so as to use the least possible bandwidth for control traffic. Mobility also increases the bandwidth used for control packets. As links go up and down frequently, more updates need to be sent to maintain correct topology information. As congestion due to control overhead increases, the convergence time of the routing algorithm increases.OBJECTIVES OF THE INVENTION1. The objective of the invention is to a to satisfy the demand of high data rates with limited resources is a big challenge. One solution to this challenge is to optimize the use of available resources and hence it is required to enhance the performance of networks.2. The other objective of the invention is to a do extensive simulation survey in order to compare existing routing protocols for detailed study. It has to develop an analytical model to give theoretical bounds of throughput capacity to get more practical approach.3. The other objective of the invention is to a propose a Destination Sequenced Distance Vector (DSDV) routing protocol to increase the performance of throughput capacity by verifying on various parameters in ad-hoc wireless networks.4. The other objective of the invention is to check on proposed idea with detailed study of routing protocols to check the presence in different conditions. Finally, it has to do the performance analysis of proposed idea with mobility and without mobility.5. The other objective of the invention is to Analysis of the performance of DSDV routing protocol in ad hoc wireless networks is a ad-hoc wireless network is self-organizing & adaptive and also a Ad hoc nodes or devices should be able to detect the presence of other such devices & to perform the necessary handshaking for allowing communications.6. The other objective of the invention is to of the ad-hoc mobile device implies that battery capacity of such devices will also vary. Since ad hoc networks rely on forwarding data packets sent by other nodes, power consumption becomes the critical issue.7. The other objective of the invention is to has been discussed the general way to design a routing protocol in ad-hoc wireless network. The invention is a bandwidth efficient routing protocol for wireless ad-hoc networks and also a protocol can be used in ad-hoc networks because it considerably reduces control overhead thus increasing available bandwidth and conserving power at mobile stations.8. The other objective of the invention is to gives very good results in terms of the throughput seen by the user and the protocol is a table-driven distance-vector routing protocol that uses the same constraints used in on-demand routing protocols, i.e., paths are used as long as they are valid and updates are only sent when a path becomes invalid. 9. The other objective of the invention is to invented paths used by neighbors are maintained and this allows the design of a distance-vector protocol with non-optimum routing and event-driven updates, resulting in reduced control overhead.SUMMARY OF THE INVENTIONIt uses the destination sequence numbers to ensure that all the routes are looped free and that contain most recent route information. Each node maintains its own sequence number as well as a broadcast ID. The broadcast ID is incremented for every Route Request (RREQ) the node initiates, and together with the node’s IP address, uniquely identifies a Route Request (RREQ).Along with its very own sequence number and the broadcast ID, the source node includes in Route Request (RREQ) the most recent sequence number it has for destination. As Route Reply (RREP) is routed back along reverse path, nodes along this path set up forward route entries in their route table that point to node from which Route Reply (RREP) came. These forward routes entries indicate the active forward routes.This related work has studied in detail various routing algorithms of ad-hoc wireless network. Among them, the performances of Dynamic Source Routing (DSR) on low mobility and high density show better performance. But it is not compared with any other protocols to show the performance result. Therefore, a survey has been reviewed to compare Ad hoc On-demand Distance Vector Routing (AODV) & Dynamic Source Routing (DSR) protocol by considering different network performance metrics such as the mobility pattern, average end-to-end delay, throughput, packet delivery ratio.The packet drops and node density in ad-hoc networks. Depending on network size, traffic patterns and the local radio interactions, it is examined the interactions of the 802.11 MAC and the ad- hoc forwarding and the effect on capacity for several simple configurations and the traffic patterns. But it is very difficult to maximize the performance of throughput capacity without constructing a network model. To improve the network capacity of Mobile Ad-hoc Networks (MANETs) with enhancement of transmission reliability and bandwidth efficiency in wireless networks, a Capacity-Optimized topology control scheme is proposed by considering both upper layer network capacity and physical layer relay selection.The main limitations of the detailed survey are as follows:1. The surveys have discussed only upper and lower bound of system but not actual implementation. 2. They have proposed an analytical model based on ideal condition and not considering practical scenarios.3. Proposed work is in general or common form, not applicable to any specific research issues.4. Very few research papers have done comparison of routing protocols with limited parameters mostly in non-mobility environment.5. In many research papers, scalability is limited to few nodes and are not checked with various MAC protocols.Therefore, to overcome all these limitations, an improvement in Ad hoc On-demand Distance Vector Routing Protocol (AODV) routing protocols to increase the performance of throughput capacity is proposed in this research work. It also proposes an analytical model to give more accurate results on lower bound in ad-hoc wireless networks. Hence, it is also considered high scalability in mobility and non-mobility scenario.We have found that relaxing the requirement for shortest paths in a table driven routing protocol can lead to solutions whose performance is equivalent or even better than the performance of on-demand routing approaches. Accordingly, the present invention comprises a table-driven distance-vector routing protocol that uses the same constraints used in on-demand routing protocols, i.e., paths are used as long as they are valid and updates are only sent when a path becomes invalid.To this end, the present invention adapts WRP to provide non-optimum routing, which we refer to as bandwidth efficient source tracing (BEST). The reason why prior table-driven routing protocols have been unable to perform non-optimum routing is that these protocols have used either distances to destinations or topology maps to predict paths to destinations. However, none of these techniques allow a router to discern if the path picked by it conflicts with its neighbors, resulting in “counting to infinity” problems. Consequently, these protocols have to send updates in order to avoid loops, and the best that can be done is that the updates are sent periodically.However, in BEST, the paths used by neighbors are maintained and this allows the design of a distance-vector protocol with non-optimum routing and event-driven updates, resulting in reduced control overhead.Sets of wireless mobile nodes that dynamically form spontaneous networks that operate without a centralized administration are called Mobile Ad hoc Networks (MANET). The nodes are linked together via a special wireless that is utilised to send information between the source and destination nodes. Each node has limited battery power and low bandwidth during the delivery of messages from one node to otherThe invention is a implemented three routing protocols using Network Simulators with various node points then compared reactive protocols such as AODV and DSR with proactive protocols like DSDV on various network parameters and examined the efficiency of each protocol under a particular scenario in relation to performance metrics like Throughput, E2E Delay and Packet Loss Rate. Simulations based on the inspection of the protocols were carried out using NS-2. The approach, metrics and findings of each experiment are briefly described proactive better than reactive routing protocols.Relevance to social benefit by this R& D in the proposed area:Useful for wireless and networking technologies and the society at large as it will be useful for applications covering GSM 1800, 3G, 4G and Wi Fi band.BRIEF DESCRIPTION OF THE DIAGRAMFigure 1: Comparison of AODV and DSDV routing protocols of average throughputFigure 2: Comparison of AODV and DSDV routing protocols of end-to-end delayFigure 3: Comparison of AODV and DSDV routing protocols of average EnergyConsumptionFIG.4: DSDV routing protocol flow chartFIG.5: DSDV routing protocol checking flow chartFIG.6: ad hoc wireless networks flow chartDESCRIPTION OF THE INVENTION Methodology:Nowadays, 80 to 90% ongoing research works are based on Ad hoc On-demand Distance Vector Routing Protocol (AODV) & Dynamic Source Routing Protocol (DSR) routing protocols and since they are popular among the other available routing protocols in an ad hoc wireless network, therefore they are easy to the access.The Dynamic Source Routing Protocol (DSR) is the source-routed on-demand routing protocol. A node maintains route caches containing the source routes that it is aware of. The node updates entries in the route cache as & when it learns about the new routes. The two major phases of the protocol are: route discovery and route maintenance.When the source node wants to send a packet to a destination, it looks up its route cache to determine if it already contains a route to the destination. If it finds that an unexpired route to the destination exists, then it uses this route to send the packets. But if the node does not have such a route, then it initiates the route discovery process by broadcasting a route request packet. Dynamic Source Routing Protocol (DSR) uses two types of packets for route maintenance: - Route Error packet and Acknowledgements.When a node encounters the fatal transmission problem in its data link layer, it generates a Route Error packet. When a node receives a route error packet, it removes the hop in error from its route cache. All routes that contain the hop in error are truncated at that point. Acknowledgment packets are used to verify correct operation of the route links.Ad hoc On-demand Distance Vector Routing (AODV) minimizes the number of broadcasts by creating routes on-demand that maintains the list of all the routes. To find a path to the destination, the source broadcasts a route request packet. The neighbors in turn broadcast the packet to their neighbors till it reaches an intermediate node that has the recent route information about the destination or till it reaches the destination.A node discards a route request packet that it has already seen. The route request packet uses sequence numbers to ensure that the routes are loop free & to make sure that if intermediate nodes reply to route requests, they reply the latest information only. When a node forwards a route request packet to its neighbors, it also records in its tables the node from which the first copy of the request came. This information is used to construct the reverse paths for route reply packetAd hoc On-demand Distance Vector Routing Protocol (AODV) shows better performance. But there are some limitations of Ad hoc On-demand Distance Vector Routing Protocol (AODV) routing protocol in terms of performance due to high mobility, Scalability, overhead etc. Hence, as number of nodes (up to 100 nodes) increases, Destination Sequenced Distance Vector (DSDV) routing protocol is suggested to make better performance due to low mobility, scalability, low overhead etc.In Destination-Sequenced Distance-Vector (DSDV) Routing Algorithm, every mobile station maintains the routing table that lists all the available destinations, the number of hops to reach destination the sequence number assigned by the destination node. The sequence number used to distinguish stale route from new ones and so avoid formation of loops.There are the many network simulators that can simulate ad-hoc wireless network. There are three main traditional techniques for analyzing performances of wired and wireless networks: analytical method, computer simulation & physical measurement or a test bed measurement. However, comprehensive models for the wireless ad hoc network are mathematically intractable. Most physical or test bed measurements are not repeatable and require the high effort.Future Scope:The structures can be simulated with the available software MATLAB or NS-2.The expected results will deal with maximizing the performance of throughput capacity of ad-hoc wireless networks. It is mainly focused on addressing the throughput capacity of ad-hoc wireless network through theoretical and computational approach. It is revisited the aforementioned problem from the network layer prospective and this work suggest that improving routing protocol, it can improve the throughput capacity to a greater extant.The conclusion of this work may be as follows:1. To survey the existing work in detailed way and to study their proposals and limitations which do not exist in current literature survey as per best of knowledge.2. To simulation survey to compare existing routing protocols for detailed study.3. To develop an analytical model to give theoretical bounds on throughput capacity to the theoretical limits.4. To Destination Sequenced Distance Vector (DSDV) routing protocol to increase the performance of throughput capacity by verifying on various parameters like average throughput, end to end delay, average energy consumption etc.5. To analyze the performance of proposed idea with mobility and without mobility scenarios.6. To compare the results for the large scalability (100+ nodes) which has been addressed in very few research articles to the best of knowledge.It is possible to show that this proposed routing algorithm can improve the throughput capacity of ad-hoc wireless networks by 54 %, end-to-end delay by 20 %, and average energy consumption by 54% in dense scenario, respectively.This research work may extend the existing results by considering various other parameters like, asymmetrical link conditions, different transmission power levels, etc. In this work, comparison between AODV and DSR routing protocols in ad-hoc wireless networks has been taken. which can meet requirements for defense and long range wireless networking applications. To do so, these are three basic steps which are the route discovery, route path formation and the route maintenance. In route discovery procedure, when a source node sends a message to some destination node and that does not already have the valid path to the destination, it initiates the path discovery process to locate other node. It broadcasts the Route Request (RREQ) packet to its neighbor, which then forward the request to their neighbors, and so on, until either the destination or intermediate nodes with a new route to destination is located.
Claims
Claims:WE CLAIMS1. Our Invention Analysis of the performance of DSDV routing protocol in ad hoc wireless networks is a ad-hoc wireless network is self-organizing & adaptive. Ad hoc nodes or devices should be able to detect the presence of other such devices & to perform the necessary handshaking for allowing communications. The diversity of the ad-hoc mobile device implies that battery capacity of such devices will also vary. Since ad hoc networks rely on forwarding data packets sent by other nodes, power consumption becomes the critical issue. In this proposed idea, it has been discussed the general way to design a routing protocol in ad-hoc wireless network. The invention is a bandwidth efficient routing protocol for wireless ad-hoc networks and also a protocol can be used in ad-hoc networks because it considerably reduces control overhead thus increasing available bandwidth and conserving power at mobile stations. The invention is also a gives very good results in terms of the throughput seen by the user and the protocol is a table-driven distance-vector routing protocol that uses the same constraints used in on-demand routing protocols, i.e., paths are used as long as they are valid and updates are only sent when a path becomes invalid. The invented paths used by neighbors are maintained and this allows the design of a distance-vector protocol with non-optimum routing and event-driven updates, resulting in reduced control overhead.
2. According to claim1# the invention is to an Analysis of the performance of DSDV routing protocol in ad hoc wireless networks is a ad-hoc wireless network is self-organizing & adaptive and also a Ad hoc nodes or devices should be able to detect the presence of other such devices & to perform the necessary handshaking for allowing communications.
3. According to claim1,2# the invention is to an of the ad-hoc mobile device implies that battery capacity of such devices will also vary. Since ad hoc networks rely on forwarding data packets sent by other nodes, power consumption becomes the critical issue.
4. According to claim1,2,3# the invention is to a has been discussed the general way to design a routing protocol in ad-hoc wireless network. The invention is a bandwidth efficient routing protocol for wireless ad-hoc networks and also a protocol can be used in ad-hoc networks because it considerably reduces control overhead thus increasing available bandwidth and conserving power at mobile stations.
5. According to claim1,2,4# the invention is to a gives very good results in terms of the throughput seen by the user and the protocol is a table-driven distance-vector routing protocol that uses the same constraints used in on-demand routing protocols, i.e., paths are used as long as they are valid and updates are only sent when a path becomes invalid.
6. The invented paths used by neighbors are maintained and this allows the design of a distance-vector protocol with non-optimum routing and event-driven updates, resulting in reduced control overhead.Date: 30 / 5 / 21Dr. Sanjeev Kumar Srivastava , Description:Our Invention is related to a Analysis of the performance of DSDV routing protocol in ad hoc wireless networks.FORM 2THE PATENT ACT 1970 &The Patents Rules, 2003
