978 citations
- Massachusetts Institute of TechnologyUS22 papers
- Argonne National LaboratoryUS21 papers
- Brookhaven National LaboratoryUS20 papers
- University of California, Los AngelesUS19 papers
- Central China Normal UniversityCN18 papers
- Lawrence Berkeley National LaboratoryUS18 papers
- Nantes UniversitéFR18 papers
- Pennsylvania State UniversityUS18 papers
- Purdue University West LafayetteUS18 papers
- Texas A&M UniversityUS18 papers
- The Ohio State UniversityUS18 papers
- University of California, DavisUS18 papers
Showing 2006 · cs.DCShow all
2 papers · 2 filters
cs.DC2006
2FACE: Bi-Directional Face Traversal for Efficient Geometric Routing
Mark Miyashita, Mikhail Nesterenko
We propose bi-directional face traversal algorithm to shorten the path the message takes to reach the destination in geometric routing. Our algorithm combines the practical…
cs.DC2006★ 3 cited
Discovering Network Topology in the Presence of Byzantine Faults
Mikhail Nesterenko, Sébastien Tixeuil
We study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. We formally state the weak and strong versions of the problem. The weak version re…