Bipolar orientations revisited
Discrete Applied Mathematics - Special issue: Fifth Franco-Japanese Days, Kyoto, October 1992
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
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Internetworking with TCP/IP, Volume 1: Principles, Protocols, and Architectures, Fourth Edition
Internetworking with TCP/IP, Volume 1: Principles, Protocols, and Architectures, Fourth Edition
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
Computer Networks
Worst-Case optimal and average-case efficient geometric ad-hoc routing
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
Topological hole detection in wireless sensor networks and its applications
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Path Vector Face Routing: Geographic Routing with Local Face Information
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
On a conjecture related to geometric routing
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Distributed computation of virtual coordinates
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Geographic routing made practical
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
A Distributed Geometric Routing Algorithm for Ad HocWireless Networks
ITNG '07 Proceedings of the International Conference on Information Technology
Greedy drawings of triangulations
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Some Results on Greedy Embeddings in Metric Spaces
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Greedy routing with guaranteed delivery using Ricci flows
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Succinct Greedy Geometric Routing in the Euclidean Plane
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On the efficiency of a local iterative algorithm to compute Delaunay realizations
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Succinct greedy drawings do not always exist
GD'09 Proceedings of the 17th international conference on Graph Drawing
A simple routing algorithm based on Schnyder coordinates
Theoretical Computer Science
Hi-index | 5.23 |
Geometric routing by using virtual locations is an elegant way for solving network routing problems. In its simplest form, greedy routing, a message is simply forwarded to a neighbor that is closer to the destination. One main drawback of this approach is that the coordinates of the virtual locations require @W(nlogn) bits to represent, which makes this scheme infeasible in some applications. The essence of the geometric routing is the following: When an origin vertex u wants to send a message to a destination vertex w, it forwards the message to a neighbor t, solely based on the location information of u,w and all neighbors of u. In the greedy routing scheme, the decision is based on decreasing distance. For this idea to work, however, the decision needs not be based on decreasing distance. As long as the decision is made locally, this scheme will work fine. In this paper, we introduce a version of greedy routing which we call generalized greedy routing algorithm. Instead of relying on decreasing distance, a generalized greedy routing algorithm uses other criteria to determine routing paths, solely based on local information. We present simple generalized greedy routing algorithms based on st-coordinates (consisting of two integers between 0 and n-1), which are derived from an st-orientation of a 2-connected plane graph. We also generalize this result to arbitrary trees. Both algorithms are natural and simple to be implemented.