Open Access
Greedy Perimeter Stateless Routing for Wireless Networks
Brad Karp
- 01 Jan 2000
pp 243-254
1.1K
TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet’s destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
read more
Abstract: We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet’s destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router’s immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility’s frequent topology changes, GPSR can use local topology information to find correct new routes quickly. We describe the GPSR protocol, and use extensive simulation of mobile wireless networks to compare its performance with that of Dynamic Source Routing. Our simulations demonstrate GPSR’s scalability on densely deployed wireless networks.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Opportunistic routing in wireless ad hoc networks: Upper bounds for the packet propagation speed
Philippe Jacquet,Bernard Mans,P. Muhlethaler,Georgios Rodolakis +3 more
- 28 Oct 2008
TL;DR: This paper provides upper bounds on the packet propagation speed for opportunistic routing, in a realistic network model where link conditions are variable and investigates the effects of mobility and of random fading.
Sensor Node Localization Using Uncontrolled Events
Ziguo Zhong,Dan Wang,Tian He +2 more
- 17 Jun 2008
TL;DR: This paper presents a practical design using totally uncontrolled events for stationary sensor node positioning that can effectively localize sensor nodes with excellent flexibility while adding no extra cost at the resource constrained sensor node side.
An efficient resiliency scheme for data centric storage in wireless sensor networks
R. Tanushetty,Lek Heng Ngoh,Pung Hung Keng +2 more
- 26 Sep 2004
TL;DR: An efficient data centric storage method for wireless sensor networks with increased resiliency for single node failures as well as clustered node failures is presented and a geometric area concept and node awareness inside the geometric shape are presented to make the system independent of underlying routing.
27
Energy-efficient beaconless geographic routing in energy harvested wireless sensor networks
TL;DR: The lower and upper bounds on hop count and the upper bound on energy consumption under EBGRES for source‐to‐sink routing are investigated and the expected total energy consumption along a route toward the sink is demonstrated including a lower bound onEnergy consumption when the node density increases.
27
Sink-oriented Dynamic Location Service Protocol for Mobile Sinks with an Energy Efficient Grid-Based Approach
TL;DR: A Sink-oriented Dynamic Location Service (SDLS) approach to handle sink mobility, an Eight-Direction Anchor system that acts as a location service server, and a Location-based Shortest Relay (LSR) that efficiently forwards data from a source node to a sink with minimal delay path are proposed.
References
Dynamic Source Routing in Ad Hoc Wireless Networks
David B. Johnson,David A. Maltz +1 more
- 01 Jan 1996
TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Charles E. Perkins,Pravin Bhagwat +1 more
- 01 Oct 1994
TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
A performance comparison of multi-hop wireless ad hoc network routing protocols
J. Broch,David A. Maltz,David B. Johnson,Yih-Chun Hu,Jorjeta G. Jetcheva +4 more
- 25 Oct 1998
TL;DR: The results of a derailed packet-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocols, which cover a range of designchoices: DSDV,TORA, DSR and AODV are presented.
Location-aided routing (LAR) in mobile ad hoc networks
Young-Bae Ko,Nitin H. Vaidya +1 more
- 25 Oct 1998
TL;DR: An approach to utilize location information (for instance, obtained using the global positioning system) to improve performance of routing protocols for ad hoc networks is suggested.
THE ALOHA SYSTEM: another alternative for computer communications
N. Abramson
- 17 Nov 1970
TL;DR: A remote-access computer system under development as part of a research program to investigate the use of radio communications for computer-computer and console-computer links and a novel form of random-access radio communications developed for use within THE ALOHA SYSTEM is described.
Related Papers (5)
Brad Karp,Hsiang-Tsung Kung +1 more
- 01 Aug 2000
C.E. Perkins,E.M. Royer +1 more
- 25 Feb 1999
David B. Johnson,David A. Maltz +1 more
- 01 Jan 1996
Young-Bae Ko,Nitin H. Vaidya +1 more
- 25 Oct 1998