Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic algorithms for geometric spanners of small diameter: randomized solutions
Computational Geometry: Theory and Applications
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Sparse communication networks and efficient routing in the plane
Distributed Computing
Routing in distributed networks: overview and open problems
ACM SIGACT News
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Fault-tolerant routing in peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Practical, distributed network coordinates
ACM SIGCOMM Computer Communication Review
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Distance estimation and object location via rings of neighbors
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Small hop-diameter sparse spanners for doubling metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Hierarchical topological network design
IEEE/ACM Transactions on Networking (TON)
Optimal-stretch name-independent compact routing in doubling metrics
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Distributed algorithms for stable and secure network coordinates
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Phoenix: Towards an Accurate, Practical and Decentralized Network Coordinate System
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes
Mobile Networks and Applications
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Secure latency estimation with treeple
Proceedings of the 17th ACM conference on Computer and communications security
The Frog-Boiling Attack: Limitations of Secure Network Coordinate Systems
ACM Transactions on Information and System Security (TISSEC)
An optimal-time construction of sparse Euclidean spanners with tiny diameter
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The emergence of sparse spanners and greedy well-separated pair decomposition
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
On the efficiency of routing in sensor networks
Journal of Parallel and Distributed Computing
NCShield: securing decentralized, matrix factorization-based network coordinate systems
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
KoNKS: konsensus-style network koordinate system
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
Sparse Euclidean Spanners with Tiny Diameter
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
| Hi-index | 0.00 |
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ε stretch, logarithmic diameter, and constant out degree. This improves upon the best known result so far that requires a logarithmic out-degree. Furthermore, our scheme is asymptotically optimal in Euclidean metrics whose diameter is polynomial.