We present a new approach for generating virtual coordinates that produces usable coordinates quickly and improves the routing performance of existing geographic routing algorithms. Starting from a set of initial coordinates derived from a set of elected perimeter nodes, Greedy Embedding Spring Coordinates (GSpring) detects possible dead ends and uses a modified spring relaxation algorithm to i...

Vehicular Ad Hoc Networks (VANETs) have attracted the interest of the scientific community, since many issues remain open, especially in the research area of routing techniques. In this work we propose a new position-based routing algorithm called Junction-Based Routing (or JBR). The algorithm makes use of selective greedy forwarding up to the node that is located at a junction and is closer to...

VANETs (Vehicular Ad hoc Networks) are highly mobile wireless ad hoc networks and will play an important role in public safety communications and commercial applications. Routing of data in VANETs is a challenging task due to rapidly changing topology and high speed mobility of vehicles. Conventional routing protocols in MANETs (Mobile Ad hoc Networks) are unable to fully address the unique cha...

He introduced the structure of small-world in a grid and shows with a greedy algorithm using only local information able to find route between source and target in delivery time O(log 2 n). His fundamental model for distributed system uses a two-dimensional grid with long-range random links added between any two node u and v with a probability proportional to distance d(u,v)-2. We propose with ...

In this work, we propose APLASIA, an holistic architecture with a radical design. Aiming at simplifying the inner network devices (and so their cost), we tradeoff node architectureand algorithmic-complexity for an increased (but tunable) communication cost. The main ingredients of our recipe are (i) the use of complete paths directly in the frames header, that allows core devices to perform dat...

In this thesis we study two research aspects of geographical routing: efficient geographical addressing and a new routing scheme. In the first part we offer a novel geographical routing algorithm that relies on a well known data structure called Quadtree. Quadtree is an efficient method of mapping a twodimensional area by recursively partitioning it to disjoint squares. We present a greedy, gua...

Greedy Forwarding algorithm is a widely-used routing algorithm for wireless networks. However, it can fail if the wireless network topologies contain void scenarios (or simply called voids). Since Yao Graph and Theta Graph are two types of geometric graphs exploited to construct wireless network topologies, this paper studies whether these two types of graphs can contain voids. Specifically, th...

Today’s material is based on three papers, which describe related routing methods. All of these methods proceed by defining virtual coordinates for the nodes, which are approximations to real Euclidean coordinates but are not actually Euclidean coordinates. These virtual coordinates are defined by means of hop-count distances from certain “landmark” (or “beacon”, or “perimeter”) nodes. The node...

We consider the problem of all-to-one selfish routing in the absence of a payment scheme in wireless sensor networks, where a natural model for cost is the power required to forward, referring to the resulting game as a Locally Minimum Cost Forwarding (LMCF). Our objective is to characterize equilibria and their global costs in terms of stretch and diameter, in particular finding incentive comp...

Geographic routing is a well established solution for scaling in large wireless ad-hoc networks. A fundamental issue is forwarding packets around voids to reach destinations in networks with sparse topologies. All general known solutions need first to get into a dead end, at link level, to be able afterwards to apply a recovery algorithm. These techniques can lead to very inefficient forwarding...