2007
DOI: 10.1016/j.comcom.2007.04.007
|View full text |Cite
|
Sign up to set email alerts
|

Performance evaluation and comparison of different ad hoc routing protocols

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
34
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 66 publications
(34 citation statements)
references
References 18 publications
0
34
0
Order By: Relevance
“…Loop freedom is assured for a node by accepting alternate paths to destination if it has a less hop count than the advertised hop count for that destination. Because the maximum hop count is used, the advertised hop count therefore does not change for the same sequence number [18].…”
Section: International Journal Of Science and Research (Ijsr) India mentioning
confidence: 99%
“…Loop freedom is assured for a node by accepting alternate paths to destination if it has a less hop count than the advertised hop count for that destination. Because the maximum hop count is used, the advertised hop count therefore does not change for the same sequence number [18].…”
Section: International Journal Of Science and Research (Ijsr) India mentioning
confidence: 99%
“…It stores all the routes to the destination, unlike AODV which stores the best path. All these routes are linked disjoint means that there are no common links between the paths, whereas node disjoint means that there are no common nodes among paths [19].…”
Section: Ad-hoc On-demand Multipath Distance Vector Routing (Aomdv)mentioning
confidence: 99%
“…It computes disjoint multipath with having loop freedom [1]. In AOMDV, advertised_hopcount replaces hopcount in AODV.A route_list replaces the nexthop, and essentially defines multiple next hops with respective hopcounts.…”
Section: Ad-hoc On-demand Distance Vector Routingmentioning
confidence: 99%