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
State-centric programming for sensor-actuator network systems
TL;DR: A state-centric, agent-based design methodology to mediate between a system developer's mental model of physical phenomena and the distributed execution of DSAN applications is described and the notion of collaboration groups is introduced, which abstracts common patterns in application-specific communication and resource allocation.
Sparse data aggregation in sensor networks
Jie Gao,Leonidas J. Guibas,Nikola Milosavljevic,John Hershberger +3 more
- 25 Apr 2007
TL;DR: This work shows how to build nearly optimal aggregation structures that can further deal with network volatility and compensate for the loss or duplication of data by exploiting probabilistic techniques.
Replacing Failed Sensor Nodes by Mobile Robots
Yongguo Mei,Changjiu Xian,Saumitra Mohan Das,Y.C. Hu,Yung-Hsiang Lu +4 more
- 04 Jul 2006
TL;DR: This paper proposes to use a small number of mobile robots to replace failed sensors in a large-scale static sensor network, and studies algorithms for detecting and reporting sensor failures and coordinating the movement of robots that minimize the motion energy of mobile Robots and the messaging overhead incurred to the sensor network.
Topology Inference of Unknown Networks Based on Robust Virtual Coordinate Systems
TL;DR: A simple measurement model in which a small subset of source nodes collect hop distance information from networked nodes is investigated to generate a virtual coordinate system (VCS) for networks of unknown topology and a robust analytical algorithm is presented to derive the VCS against practical issues of missing and corrupted measurements.
Impact of Transmission Power on the Performance of UDP in Vehicular Ad Hoc Networks
Behrooz Khorashadi,A. Chen,Dipak Ghosal,Chen-Nee Chuah,Michael Zhang +4 more
- 24 Jun 2007
TL;DR: Results show that the major mitigating factor in VANETs multi-hop environment is the number of hops between the source and the destination, and that the effect of vehicle densities is only important at lower transmission ranges to provide the required connectivity.
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