An Improved Schnyder Routing Algorithm for Node Failure in Wireless Sensor Networks

No abstract is available for this paper.

• Publication year

  2015

• Venue

  The Journal of Information and Computational Science

• Publication date

  2015-01-20

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.12733/JICS20105268
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On succinct convex greedy drawing of 3-connected plane graphs

  2011cited by this paper
• Schnyder Greedy Routing Algorithm

  2010cited by this paper
• Succinct greedy drawings do not always exist

  2009cited by this paper
• Some Results on Greedy Embeddings in Metric Spaces

  2008cited by this paper
• Greedy Drawings of Triangulations

  2008cited by this paper
• Succinct Greedy Geometric Routing in the Euclidean Plane

  2008cited by this paper
• On a conjecture related to geometric routing

  2004cited by this paper
• GPSR: greedy perimeter stateless routing for wireless networks

  2000cited by this paper
• Journal of Graph Algorithms and Applications More Canonical Ordering

  year unknowncited by this paper

• No citing papers are available for this paper.