Succinct Greedy Graph Drawing in the Hyperbolic Plane
Graph Drawing
Succinct Greedy Geometric Routing in the Euclidean Plane
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A generalized greedy routing algorithm for 2-connected graphs
Theoretical Computer Science
Greedy routing via embedding graphs onto semi-metric spaces
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
On succinct convex greedy drawing of 3-connected plane graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A lower bound on greedy embedding in euclidean plane
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
Schnyder greedy routing algorithm
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
An optimal greedy routing algorithm for triangulated polygons
Computational Geometry: Theory and Applications
A simple routing algorithm based on Schnyder coordinates
Theoretical Computer Science
Greedy routing via embedding graphs onto semi-metric spaces
Theoretical Computer Science
Category-based routing in social networks: Membership dimension and the small-world phenomenon
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper, we presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. We considered the idealized unit disk graph model in which nodes are assumed to be connected if, and only if, nodes are within their transmission range. The main contribution of this work is a fully distributed algorithm to extract the connected, planar graph for routing in the wireless networks. The communication cost of the proposed algorithm is O(d log d) bits, where d is the degree of a node. In addition, this paper also presented a geometric routing algorithm. The algorithm is fully distributed and nodes know only the position of other nodes and can communicate with neighboring nodes in their transmission range.