Geographical routing using partial information for wireless ad hoc networks

By Rahul Jain, Anuj Puri, Raja Sengupta. IEEE wireless communications, 2001

471 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/e252eb4b382695d70be44a20cfcf2f9341fb06b5

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Position Based Routing Algorithms for Ad Hoc Networks: A Taxonomy (2004, background): “sparse no {alternate, disjoint} greedy [LS] yes localized single-path hop count yes no yes no c- {greedy,alternate,disjoint}[LS] yes localized multi-path hop count yes no yes no GRA[ JPS ], gatewayDFS[SRV] yes localized single-path hop count yes yes yes no zone based 2-level [JL] yes zonal single/fl”
Geometric spanners for routing in mobile networks (2001, background): “Simple geographical forwarding combined with GLS(scalable location service [4]) compares favorably with dynamic source routing (DSR) [ 5 ], [6].”
Position-based routing in ad hoc networks (2002, methodology): “It has been experimentally confirmed [5, 6] that routing protocols that do not use geographic location in the routing decisions, such as AODV , DSDV , or DSR (a recent survey is given in [7]) are not scalable.”
A location-based routing method for mobile ad hoc networks (2005, methodology): “GPSR [23], GFG [7], and GRA [33] use only neighbor location information for forwarding data packets.”
Design challenges for energy-constrained ad hoc wireless networks (2002, background): “Work on scalability in ad hoc wireless networks has mainly focused on self-organization [13, 106], distributed routing [ 107 ], mobility management [7], QoS support, and security [108].”
Survey on VANET security challenges and possible cryptographic solutions (2014, background): “Geocast routing protocols The basic principle of these protocols is to send messages to all vehicles in a specific geographic area [45].”
Connectivity of Wireless Multihop Networks in a Shadow Fading Environment (2003, background): “Such a setup is sometimes desired in simulation-based performance evaluation of routing protocols [16–18].”
On the Connectivity of Ad Hoc Networks (2004, background): “In fact, several simulation-based performance evaluations of routing protocols for ad hoc networks [26, 27, 28] assume that the topology is connected during most of the simulation time.”
Unreliable sensor grids: coverage, connectivity and diameter (2003, background): “In [15], the authors study a geographical routing strategy for GPS equipped sensor nodes.”
BLR: beacon-less routing algorithm for mobile ad hoc networks (2004, background): “GFG [11], GPSR [12], AFR [15] and GRA [31] try to overcome these drawbacks by applying greedy loop-free forwarding combined with a recovery strategy if a packet gets stuck.”