Succinct and practical greedy embedding for geometric routing
Authors:
- Yanbin SunYSYanbin Sun
- Yu ZhangYZYu Zhang
- Binxing FangBFBinxing Fang
- Hongli ZhangHZHongli Zhang
- 1 December 2017
- journal article
- Published by Elsevier in Computer Communications
- Vol. 114, 51-61
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61702223, 61702220, 61202457)
This publication has 12 references indexed in Scilit:
- Space lower bounds for low-stretch greedy embeddingsTheoretical Computer Science, 2016
- Efficient Geometric Routing in Large-Scale Complex Networks with Low-Cost Node DesignIEICE Transactions on Communications, 2016
- Geometric Routing With Word-Metric SpacesIEEE Communications Letters, 2014
- Succinct Greedy Geometric Routing Using Hyperbolic GeometryIEEE Transactions on Computers, 2010
- Greedy Drawings of TriangulationsDiscrete & Computational Geometry, 2009
- Some Results on Greedy Embeddings in Metric SpacesDiscrete & Computational Geometry, 2009
- Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed EnvironmentTheory of Computing Systems, 2004
- Routing with Guaranteed Delivery in Ad Hoc Wireless NetworksWireless Networks, 2001
- Compact Routing with Minimum StretchJournal of Algorithms, 2001
- Extensions of Lipschitz mappings into a Hilbert space1984