Analysis of Planarity in Face-Routing

In this report we investigate the limits of routing according to leftor right-hand rule (LHR). Using LHR, a node upon receipt of a message will forward to the neighbour that sits next in counter-clockwise order in the network graph. When used to recover from greedy routing failures, LHR guarantees success if implemented over planar graphs. This is often… CONTINUE READING