2013
DOI: 10.1016/j.jnca.2012.10.008
|View full text |Cite
|
Sign up to set email alerts
|

A qualitative comparison evaluation of the greedy forwarding strategies in Mobile Ad Hoc Network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(17 citation statements)
references
References 37 publications
0
17
0
Order By: Relevance
“…In [12,13] and [16] a performance comparative study was conducted between two types of topology-based routing protocols; on-demand routing protocols DSR, AODV and TORA and table driven protocol DSDV. Considering packet delivery, DSR and AODV perform the best independent of the number of sources.…”
Section: Recent Classification and Comparison Of Manet Routing Protocolsmentioning
confidence: 99%
“…In [12,13] and [16] a performance comparative study was conducted between two types of topology-based routing protocols; on-demand routing protocols DSR, AODV and TORA and table driven protocol DSDV. Considering packet delivery, DSR and AODV perform the best independent of the number of sources.…”
Section: Recent Classification and Comparison Of Manet Routing Protocolsmentioning
confidence: 99%
“…Therefore, several forwarding mechanisms enhanced packet forwarding by involving new parameters and metrics (e.g. speed and direction [17]) in the next forwarder selection process. However, with all the available enhancement of greedy forwarding, there is still a possibility for packet forwarding problems to occur but with lower probability [9].…”
Section: Forwarding Mechanismsmentioning
confidence: 99%
“…Usually the evaluation process (i.e measurement process) at each junction is based on sending information collector packets through roads, in order to collect information about road network and traffic conditions. Junction-based routing has less overhead compared to full path routing [17], as packets only carry the position of the destination and next-intersection. In addition, it adapts more efficiently to variable VANET conditions as routing decision is done sequentially at each junction.…”
Section: Junction-based or Anchor-based Strategymentioning
confidence: 99%
“…Forwarding using next-junction has less overhead compared to the full path selection [12,13], because forwarding packets only carry the position of the destination and sequence of next-junctions that packets should be passed through. • Next-hop selection: Each node forwards the packet to one of the neighbor vehicles (node) that is close to destination.…”
Section: ) Routing Strategymentioning
confidence: 99%
“…There are many parameters and policies are involved such as node direction, node speed and so on. Several approaches are proposed by adding some policies for greedy forwarding to overcome the path selection problem [13]. An example of these approaches is to forward the packet to the node that moves toward the destination only, or toward junction, in case of full path selection.…”
Section: ) Routing Strategymentioning
confidence: 99%