2009 Global Information Infrastructure Symposium 2009
DOI: 10.1109/giis.2009.5307033
|View full text |Cite
|
Sign up to set email alerts
|

Performance evaluation of Location-Aided Routing protocols in ad hoc networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 16 publications
0
5
0
Order By: Relevance
“…DSR is an on-demand routing technique used in MANETs [8]. Route discovery and route maintenance are the mechanisms which works together to allow nodes to discover and maintain source routes to destination.…”
Section: A Dynamic Source Routing Protocol (Dsr)mentioning
confidence: 99%
See 2 more Smart Citations
“…DSR is an on-demand routing technique used in MANETs [8]. Route discovery and route maintenance are the mechanisms which works together to allow nodes to discover and maintain source routes to destination.…”
Section: A Dynamic Source Routing Protocol (Dsr)mentioning
confidence: 99%
“…Simulation has been performed in Qualnet 6.1. These protocols are compared and simulated in different scenarios as given in [8,11].…”
Section: Zone Routing Protocol (Zrp)mentioning
confidence: 99%
See 1 more Smart Citation
“…It differs from DSDV in table maintenance and in the update procedures [12]. While DSDV maintains only one topology table, WRP uses a set of tables to maintain more accurate information [21]. The tables that are maintained by a node are the following: distance table (DT), routing table (RT), link cost table (LCT), and a message retransmission list (MRL).…”
Section: Wrpmentioning
confidence: 99%
“…Some of the routing algorithms reduce expenditure on routediscovery through drawing upon needed the assistance of location information, e.g., Location-Aided Routing (LAR) algorithm, 2 Distance Routing Effect Algorithm for Mobility (DREAM) algorithm, 3 Greedy Perimeter Stateless Routing (GPSR) algorithm 4 and so on. Although these existing algorithms have their own advantages, they still suffered from some drawbacks.…”
Section: Introductionmentioning
confidence: 99%