Mobile communication has enjoyed an incredible rise in quality throughout the last decade. Network dependability is most important concern in wireless Ad-hoc network. a serious challenge that lies in MANET (Mobile Ad-hoc network) is that the unlimited mobility and lots of frequent failure because of link breakage. Standard routing algorithms are insufficient for Ad-hoc networks. as a results of major drawback in MANET is limited power provide, dynamic networking. In MANET each node works as a router and autonomously performs mobile practicality. The link connectivity changes ceaselessly because of mobility to reflect this routing information additionally needs to get changed ceaselessly. AODV protocol is projected for this extraordinarily mobile network. In ancient AODV if any node fails in middle of transmission the method starts from the source node but in our propose scheme the transmission starts from the closest neighbor node therefore shows very important reduction in delay and improvement in packet delivery ratio are achieved. It also reduces the routing overhead by reducing the frequency of route discovery process.
Table of Contents
I. INTRODUCTION
II. COMPARISON OF ROUTING PROTOCOL
III. AODV BASICS AND RELATED WORK
A. RREQ:
B. RREP:
C. RERR:
IV. ENERGY CONSUMPTION MODEL
V. PROPOSED WORK
VI. CONCLUSION
Objectives and Topics
The primary objective of this research is to enhance the performance of the AODV routing protocol in Mobile Ad-hoc Networks (MANETs) by introducing an adaptive mechanism that mitigates the impact of frequent link breakages and reduces the overhead associated with the traditional route discovery process.
- Optimization of the AODV routing protocol for dynamic network environments.
- Analysis of routing protocols (AODV, DSR, TORA) and their operational characteristics.
- Implementation of an energy-aware communication and node failure handling model.
- Reduction of packet loss and end-to-end delay during transmission.
- Comparison of traditional reactive routing versus the proposed neighbor-based adaptive routing scheme.
Excerpt from the book
V. PROPOSED WORK
AODV is source initiate protocol but in this when any link break the process starts from its source node , again broadcasting take place and then link established, after getting RREP the actual communication take place.
So in my propose work: If any node fails between source and destination then The Process starts from its nearest neighbor node. Neighbor have link to the source node which have already received RREP. So to find the destination process starts from its neighbor nodes. Neighbor broadcast RREQ and finding path to destination. So in this scheme when node fails at that time we do not have to go to source we can start process from the neighbor nodes.
Now if there are only 2 nodes in network then process is same but at this time source broadcast the RREQ because at that time nearest neighbor is source.
Summary of Chapters
I. INTRODUCTION: Provides an overview of MANET architecture, the challenges of mobility and link breakage, and introduces the AODV protocol's role in route discovery.
II. COMPARISON OF ROUTING PROTOCOL: Categorizes routing protocols into proactive, reactive, and hybrid types and evaluates their performance metrics such as route computation and loop freedom.
III. AODV BASICS AND RELATED WORK: Details the operational mechanisms of AODV, including RREQ, RREP, and RERR messages, while surveying existing fault-tolerant and energy-efficient research.
IV. ENERGY CONSUMPTION MODEL: Defines the power usage states (Transmit, Receive, Idle, Sleep) and provides mathematical formulas to calculate energy consumption during node activity.
V. PROPOSED WORK: Describes the novel adaptive routing algorithm that initiates route recovery from the nearest neighbor instead of the source node upon link failure.
VI. CONCLUSION: Summarizes the improvements in packet delivery ratio and throughput achieved by the proposed scheme compared to standard AODV.
Keywords
MANET, Wireless, Routing Protocol, AODV, DSR, ZRP, Link Breakage, Packet Delivery Ratio, Throughput, Node Mobility, Route Discovery, Network Performance, Energy Consumption, Fault Tolerance, Adaptive Routing
Frequently Asked Questions
What is the primary focus of this research?
The research focuses on improving the performance of the AODV routing protocol within Mobile Ad-hoc Networks, specifically by addressing the challenges caused by frequent link failures due to node mobility.
What are the main categories of routing protocols discussed?
The work discusses three categories: proactive (table-driven) protocols like DSDV and OLSR, reactive (on-demand) protocols like AODV and DSR, and hybrid protocols like ZRP.
What is the core research question?
The study asks how the performance of the AODV routing protocol can be enhanced, specifically regarding routing overhead and delay, when a link breakage occurs in a highly mobile network.
What methodology is employed in this paper?
The author proposes an adaptive routing algorithm that changes the route recovery procedure, starting it from the nearest neighbor node rather than the source node, and validates this through a comparison of network performance metrics.
What topics are covered in the main section?
The main sections cover the basics of AODV message types (RREQ, RREP, RERR), literature surveys of fault-tolerant mechanisms, a mathematical model for energy consumption, and the description of the proposed adaptive scheme.
Which keywords characterize this paper?
Key terms include MANET, AODV, Link Breakage, Packet Delivery Ratio, Throughput, and Adaptive Routing.
How does the proposed algorithm differ from traditional AODV?
In traditional AODV, a link failure triggers a route discovery process starting from the source node; the proposed algorithm shifts this initiation to the nearest neighbor that has a link to the source, significantly reducing signaling overhead and delay.
How is node energy consumption calculated in this model?
Energy is calculated as the product of power and time, with separate equations for the transmission (Etx) and reception (Erx) states.
What specific network scenarios does the proposed model handle?
The model is designed for MANETs where nodes move independently and frequently change their wireless links, causing unpredictable link failures between source and destination.
- Quote paper
- Jagrut Solanki (Author), 2015, A Reinforcement Learning Network based Novel Adaptive Routing Algorithm for Wireless Ad-Hoc Network, Munich, GRIN Verlag, https://www.hausarbeiten.de/document/293242
