Greedy forwarding for hyperbolic space in MANET

A new routing method based on greedy advancement and hyperbolic transformation is proposed. In order to avoid the local minimum problem, bit addressing is proposed using a tree-like connection graph. Unlike the existing hyperbolic address spaces, the new distance metric is equal to the hops number of transitions over the graph. An algorithm for assigning variable-length bit addresses to a given node configuration has been developed. The process of assigning hyperbolic addresses is illustrated. A comparative performance analysis for a new routing method and traditional approaches is then performed.