Related papers: Succint greedy routing without metric on planar tr…
Geographic routing is a routing paradigm, which uses geographic coordinates of network nodes to determine routes. Greedy routing, the simplest form of geographic routing forwards a packet to the closest neighbor towards the destination. A…
In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of always forwarding messages to nodes that are closer to the destination. We show that greedy geometric routing…
Large scale decentralized communication systems have introduced the new trend towards online routing where routing decisions are performed based on a limited and localized knowledge of the network. Geometrical greedy routing has been among…
A graph drawing is $\textit{greedy}$ if, for every ordered pair of vertices $(x,y)$, there is a path from $x$ to $y$ such that the Euclidean distance to $y$ decreases monotonically at every vertex of the path. Greedy drawings support a…
We present a novel geographical routing scheme for spontaneous wireless mesh networks. Greedy geographical routing has many advantages, but suffers from packet losses occurring at the border of voids. In this paper, we propose a flexible…
We introduce a measure of {\em greedy connectivity} for geographical networks (graphs embedded in space) and where the search for connecting paths relies only on local information, such as a node's location and that of its neighbors.…
Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each source-destination pair of nodes s, t in a greedy embedding there is always a neighbor u of s that is closer to t…
The stateless, low overhead and distributed nature of the Geographic routing protocols attract a lot of research attentions recently. Since the geographic routing would face void problems, leading to complementary routing such as perimeter…
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so that a message M between any pair of vertices may be routed…
Greedy navigation/routing plays an important role in geometric routing of networks because of its locality and simplicity. This can operate in geometrically embedded networks in a distributed manner, distances are calculated based on…
We show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. Hyperbolic geometry facilitates maximally efficient greedy forwarding in these networks. Greedy forwarding is topology-oblivious.…
Geographic routing with greedy relaying strategies have been widely studied as a routing scheme in sensor networks. These schemes assume that the nodes have perfect information about the location of the destination. When the distance…
Today's networks consist of many autonomous entities that follow their own objectives, i.e., smart devices or parts of large AI systems, that are interconnected. Given the size and complexity of most communication networks, each entity…
In this paper we study local routing strategies on geometric graphs. Such strategies use geometric properties of the graph like the coordinates of the current and target nodes to route. Specifically, we study routing strategies in the…
We analyze greedy routing in a random graph G_n constructed on the vertex set V = {1, 2, ..., n} embedded in Z. Vertices are inserted according to a uniform random permutation pi, and each newly inserted vertex connects to its nearest…
Finding the optimal embedding of networks into low-dimensional hyperbolic spaces is a challenge that received considerable interest in recent years, with several different approaches proposed in the literature. In general, these methods…
We present a local routing algorithm which guarantees delivery in all connected graphs embedded on a known surface of genus $g$. The algorithm transports $O(g\log n)$ memory and finishes in time $O(g^2n^2)$, where $n$ is the size of the…
Online routing in a planar embedded graph is central to a number of fields and has been studied extensively in the literature. For most planar graphs no $O(1)$-competitive online routing algorithm exists. A notable exception is the Delaunay…
A greedy embedding of a graph $G = (V,E)$ into a metric space $(X,d)$ is a function $x : V(G) \to X$ such that in the embedding for every pair of non-adjacent vertices $x(s), x(t)$ there exists another vertex $x(u)$ adjacent to $x(s)$ which…
Today we rely on networks that are created and maintained by smart devices. For such networks, there is no governing central authority but instead the network structure is shaped by the decisions of selfish intelligent agents. A key…