1 Routing with guaranteed delivery in geometric and wireless networks

@inproceedings{Urrutia20021RW,
  title={1 Routing with guaranteed delivery in geometric and wireless networks},
  author={Jorge Urrutia},
  year={2002}
}
In this paper we study on-line local routing algorithms for communication networks. Our algorithms take advantage of the geometric properties of planar networks. We pay special attention to on-line local routing algorithms which guarantee that a message reaches its destination. A message cosists of packets of data that have to be sent to a destination node, i.e. the message itself plus a finite amount of space used to record a constant amount of data to aid it in its traversal, e.g. the address… CONTINUE READING
Highly Cited
This paper has 59 citations. REVIEW CITATIONS
34 Citations
28 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 34 extracted citations

59 Citations

051015'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 59 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 28 references

On line routing in geometric graphs

  • P. R. Morin
  • Ph.D. Thesis,
  • 2000
Highly Influential
8 Excerpts

Lin,“Power aware localized routing in wireless networks

  • Ivan Stojmenovic, Xu
  • IEEE International Parallel and Distributed…
  • 2000
1 Excerpt

GEDIR: loop free location based routing in wireless communication network

  • I. Stojmenovic, X. Lin
  • IASTED Int. Conf. on Parallel and Distributed…
  • 1999
3 Excerpts

Similar Papers

Loading similar papers…