Luis A. Hernando

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A fundamental problem of future networks is to get fully self-organized routing protocols with good scalability properties that produce good paths in a wide range of network densities. Current approaches, geographic routing and table based routing, fail to provide very good scalability with good paths in sparse networks. We propose a method based on the(More)
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(More)
  • 1