• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Routing with Guaranteed Delivery in ad hoc Wireless Networks (2001)

Cached

  • Download as a PDF

Download Links

  • [cg.scs.carleton.ca]
  • [www.site.uottawa.ca]
  • [www.site.uottawa.ca]
  • [www.cs.mun.ca]
  • [www.cs.mun.ca]
  • [www.scs.carleton.ca]
  • [www.site.uottawa.ca]
  • [cg.scs.carleton.ca]
  • [www.scs.carleton.ca]
  • [www.scs.carleton.ca]
  • [www.math.unam.mx]
  • [i11www.iti.uni-karlsruhe.de]
  • [www.dcg.ethz.ch]
  • [disco.ethz.ch]
  • [theory.csail.mit.edu]
  • [www.comp.nus.edu.sg]
  • [www.cs.iastate.edu]
  • [courses.csail.mit.edu]
  • [www.cs.iastate.edu]
  • [web.sau.edu]
  • [www.comp.nus.edu.sg]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Prosenjit Bose , Pat Morin , Ivan Stojmenovic , Jorge Urrutia
Citations:849 - 80 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Bose01routingwith,
    author = {Prosenjit Bose and Pat Morin and Ivan Stojmenovic and Jorge Urrutia},
    title = {Routing with Guaranteed Delivery in ad hoc Wireless Networks},
    year = {2001}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

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 require packet duplication. A byproduct of our results is a simple distributed protocol for extracting a planar subgraph of a unit graph. We also present simulation results on the performance of our algorithms.

Keyphrases

guaranteed delivery    ad hoc wireless network lambda    unit graph    fixed unit    planar subgraph    ad hoc wireless network    packet duplication    present simulation result   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University