2011
DOI: 10.5120/4397-6105
|View full text |Cite
|
Sign up to set email alerts
|

On demand Local Link Repair Algorithm for AODV Protocol

Abstract: MANET (Mobile Ad hoc Network) is a wireless self-organized distributed network. This paper gives a general survey of research on local repair of link, if it is broken during communication for MANET and proposes a new local repair scheme in order to make up the deficiency of the existing local repair schemes. The improved local repair scheme concerns about the over head requirement and end to end delay in transmission. Nodes are required to keep the next two-hop node address for each route entry in routing tabl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
14
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
4
4

Relationship

1
7

Authors

Journals

citations
Cited by 16 publications
(14 citation statements)
references
References 22 publications
0
14
0
Order By: Relevance
“…During local repair, the repairing node use Ant algorithm for finding new routes for next to next node in the link considering that other part of the link is already in existence. The idea is based on F-ANT and B-ANT will give details of a data packet in overhead [4]. This repairing node not only provide the discovery of a route to the target node of a data packet, it finally attempts to establish the route to its downstream node.…”
Section: Related Studymentioning
confidence: 99%
See 1 more Smart Citation
“…During local repair, the repairing node use Ant algorithm for finding new routes for next to next node in the link considering that other part of the link is already in existence. The idea is based on F-ANT and B-ANT will give details of a data packet in overhead [4]. This repairing node not only provide the discovery of a route to the target node of a data packet, it finally attempts to establish the route to its downstream node.…”
Section: Related Studymentioning
confidence: 99%
“…Once this the scenario is generated for communication 4. Each node has a pre-defined range, for which it can find the presence of other nodes.…”
Section: Threshold Oriented Preemptive Route Repair Algorithmmentioning
confidence: 99%
“…al. in [4] gives a general survey of research on local repair of link, if it is broken during communication for MANET and proposes a new local repair scheme in order to make up the deficiency of the existing local repair schemes. The improved local repair scheme concerns about the over head requirement and end to end delay in transmission.…”
Section: Related Studymentioning
confidence: 99%
“…The constraints of MANETs demand the need of specialized routing algorithms that can work in a decentralized and self-organizing way. The routing protocol of a MANET must dynamically adapt to the variations in the network topology & can be classified into two major categories -Proactive and Reactive [4]. The proactive or table driven routing protocols maintain routes between all node pairs all the time.…”
Section: Introductionmentioning
confidence: 99%
“…A node does not have to discover and maintain a route to another node until the two needs to communicate. When the local connectivity of the mobile node is of interest, each mobile node can become aware of the other nodes in its neighborhood by the use of several techniques, including local broad-casts known as TTL values [3]. Route finding in AODV protocol is based on a route discovery cycle involving a broadcast network search and a unicast reply containing discovered paths.…”
Section: Introductionmentioning
confidence: 99%