# Routing with guaranteed delivery in ad hoc wireless networks

@inproceedings{Bose1999RoutingWG, title={Routing with guaranteed delivery in ad hoc wireless networks}, author={Prosenjit Bose and Pat Morin and Ivan Stojmenovic and Jorge Urrutia}, booktitle={DIALM '99}, year={1999} }

We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than some fixed unit. We describe the first distributed algorithms for routing that do not require duplication of packets or memory at the nodes and yet guarantee that a packet is delivered to its destination. These algorithms can be extended to yield algorithms for broadcasting and geocasting that do not… Expand

#### 1,711 Citations

A Geo-Routing Algorithm in Planar Graph for Ad Hoc Wireless Networks

- Computer Science
- 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)
- 2007

A fully distributed algorithm to compute a planar subgraph for geo-routing in ad hoc wireless networks and the communication cost is O(d log d) bits, where d is the degree of a node. Expand

A Distributed Geometric Routing Algorithm for Ad HocWireless Networks

- Computer Science
- ITNG
- 2007

A fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph in the idealized unit disk graph model, in which nodes are assumed to be connected if and only if nodes are within their transmission range. Expand

Distributed construction of planar graph for position-based routing in ad hoc wireless networks

- Computer Science
- Proceedings 2007 IEEE SoutheastCon
- 2007

A fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph, based on the idealized unit disk graph model, to extract the connected, planar graph for routing in the wireless networks. Expand

A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks

- Computer Science
- J. Networks
- 2007

This work considered the idealized unit disk graph model in which nodes are assumed to be connected if, and only if, nodes are within their transmission range, and established its lower bound. Expand

Directional Geometric Routing on Mobile Ad Hoc Networks

- Computer Science
- COCOON
- 2009

A novel routing algorithm named directional routing algorithm is designed by using random local neighbors such that the information can be efficiently maintained if each node dynamically changes its position. Expand

Scalability of Routing Tables in Wireless Networks

- Computer Science
- IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications
- 2007

The paper investigates the size of routing tables as the number of nodes in the network increases, and establishes that there exists an information-efficient routing algorithm -routing is feasible even if each node in thenetwork is capable of storing information on a fixed number of destinations. Expand

Scalable Routing Protocol for Ad Hoc Networks

- Computer Science
- Wirel. Networks
- 2001

It is proved that the control packet overhead scales linearly with node speed and as N3/2 with increasing number of nodes and these results indicate that the protocol is well suited to relatively large ad hoc networks where nodes travel at high speed. Expand

Void traversal for guaranteed delivery in geometric routing

- Computer Science
- IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.
- 2005

This work proposes a void traversal algorithm that works on arbitrary geometric graphs and describes how to use this algorithm for geometric routing with guaranteed delivery and compare its performance with GFG. Expand

On Scalability of Routing Tables in Dense Flat-Label Wireless Networks

- Computer Science
- IEEE Transactions on Information Theory
- 2011

This paper investigates the size of routing tables as the number of nodes in the network increases and establishes that there exists an information-efficient algorithm that routes packets correctly even if each node in thenetwork is capable of storing information on a fixed number of destinations only. Expand

Scalable geographic routing algorithms for wireless ad hoc networks

- Computer Science
- IEEE Network
- 2004

This article provides a tutorial for this class of geographic routing algorithms, and discusses recent improvements to both greedy forwarding and routing in planar graphs. Expand

#### References

SHOWING 1-10 OF 33 REFERENCES

A novel routing algorithm for ad hoc networks

- Computer Science
- Proceedings of the 33rd Annual Hawaii International Conference on System Sciences
- 2000

A novel routing algorithm called GPSAL (GPS/ant-like routing algorithm) which is based on GPS and mobile software agents modeled on ants for routing in ad hoc networks is presented. Expand

Location-aided routing (LAR) in mobile ad hoc networks

- Computer Science
- MobiCom '98
- 1998

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. Expand

Geocasting in mobile ad hoc networks: location-based multicast algorithms

- Computer Science
- Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications
- 1999

The paper addresses the problem of geocasting in mobile ad hoc network (MANET) environments by presenting two different algorithms for delivering packets to a multicast group, and presenting simulation results. Expand

Location-Based Multicast in Mobile Ad Hoc Networks

- Computer Science
- 1998

This paper defines a location-based multicast group which is based on a specific region ( ``Multicast Region") in a mobile ad hoc network (MANET) and presents two algorithms for delivering packets to such a multicasts group, and presents simulation results. Expand

A distance routing effect algorithm for mobility (DREAM)

- Computer Science
- MobiCom '98
- 1998

A new routing protocol for ad hoc networks built around two novel observations, one of triggering the sending of location updates by the moving nodes autonomously, based on a node's mobility rate, and the other of minting the overhead used for maintaining routes using the two new principlw of update message frequency and distance. Expand

Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals

- Computer Science
- IEEE Trans. Commun.
- 1984

It is shown that the FM capture phenomenon with slotted ALOHA greatly improves the expected progress over the system without capture due to the more limited area of possibly interfering terminals around the receiver. Expand

GeoCast—geographic addressing and routing

- Computer Science
- MobiCom '97
- 1997

This paper proposes and evaluates a Touting and addressing method to integrate geographic coordinates into the Internet Protocol to enable the creation of location dependent services. Expand

Compass routing on geometric networks

- Computer Science
- CCCG
- 1999

A close look at maps of numerous cities around the world, show that the previous way to explore a new, and unknown city will in general yield walks that will be close to the optimal ones to travel from one location to another. Expand

Simple traversal of a subdivision without extra storage

- Computer Science
- SCG '96
- 1996

This paper shows how to traverse a subdivision and to report all cells, edges and vertices, without making use of mark bits in the structure or a stack, and extends the algorithm to answer related queries, such as windowing queries and reporting connected subsets of cells that have a common attribute. Expand

Graph Theory with Applications

- Computer Science
- 1977

The burgeoning of Graph Theory was first aware when I studied the 1940 paper of Brooks, Smith, Stone and Tutte in the Duke Mathematical Journal, ostensibly on squared rectangles, all in the Quest of the Perfect Square. Expand