3 citations · 9 across the 11 of their papers we have counts for
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…