Properties of greedy geographical routing in spontaneous wireless mesh networks

Abstract—We analyze greedy geographical routing in sponta-neous wireless mesh networks to show several interesting prop-erties. First, we can approximate the dependence of packet loss probability on the mean node rank with a Fermi-Dirac function. When the mesh network grows, it becomes opaque to packets regardless of the average node rank. We also show that packet loss probability in mesh networks with greedy geographical routing does not exhibit the behavior of percolating systems. Finally, we propose an analytical model of greedy geographical routing and use it to derive packet loss probability. I