The Computer Journal
A tradeoff between space and efficiency for routing tables
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Interval routing schemes allow broadcasting with linear message-complexity (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Theoretical Computer Science
Space-efficiency for routing schemes of stretch factor three
Journal of Parallel and Distributed Computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Routing in distributed networks: overview and open problems
ACM SIGACT News
A Simple DFS-Based Algorithm for Linear Interval Routing
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Analysis of link reversal routing algorithms for mobile ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Localization from mere connectivity
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Compact name-independent routing with minimum stretch
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Virtual coordinates for ad hoc and sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Proceedings of the 2004 joint workshop on Foundations of mobile computing
LLS: a locality aware location service for mobile ad hoc networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Priority based adaptive coordination of wireless sensors and actors
Proceedings of the 2nd ACM international workshop on Quality of service & security for wireless and mobile networks
Sink mobility protocols for data collection in wireless sensor networks
Proceedings of the 4th ACM international workshop on Mobility management and wireless access
Interacting urns processes: for clustering of large-scale networks of tiny artifacts
Proceedings of the 2008 ACM symposium on Applied computing
An algorithmic approach to geographic routing in ad hoc and sensor networks
IEEE/ACM Transactions on Networking (TON)
Virtual coordinates with backtracking for void traversal in geographic routing
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Efficient and robust data dissemination using limited extra network knowledge
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
| Hi-index | 0.00 |
In this paper we propose a new routing paradigm, called pseudo-geometric routing. In pseudo-geometric routing, each node u of a network of computing elements is assigned a pseudo coordinate composed of the graph (hop) distances from u to a set of designated nodes (the anchors) in the network. On theses pseudo coordinates we employ greedy geometric routing. Almost as a side effect, pseudo-geometric routing is not restricted to planar unit disk graph networks anymore, but succeeds on general networks.