Tableless Geographic Routing for Dynamic Networks

17 concepts12 papers1 proposal

In traditional networking, routing is a problem of graph topology. To send a packet from node A to node B, the network must map out a chain of logical addresses (like IP addresses) and maintain global routing tables. This works beautifully when the network structure is stable.

However, when nodes are highly mobile—such as drone swarms, autonomous vehicles, or low Earth orbit satellites—the underlying topology changes continuously. By the time a routing table updates and converges across the network, the physical nodes have already moved, rendering the path obsolete and causing severe packet loss.

Geographic routing solves this problem by shifting the paradigm from topology to geometry. Instead of asking "Which logical path through the network graph leads to the destination?", a node asks "Which of my immediate physical neighbors is closest to the destination's coordinates?" By embedding real-time spatial data directly into packets, networks can eliminate global routing tables entirely, achieving zero convergence delay and massive scalability.


The Intuition: Bypassing the Topology Convergence Bottleneck

To understand why geographic routing works, consider the computational burden of traditional routing protocols in a highly dynamic environment like a Flying Ad-hoc Network (FANET) or a satellite constellation. In these settings, maintaining a consistent map of the network requires constant broadcasting of topology updates.

Geographic routing bypasses this entirely through tableless forwarding. As long as a node knows its own location (via GPS or onboard positioning), the locations of its immediate neighbors, and the coordinates of the destination, it can make an instantaneous, localized forwarding decision.

[Source Node] ---> (Neighbor A) 
               ---> (Neighbor B) ----> [Destination Coordinates]

In this local view, the source node calculates the geometric distance from each neighbor to the destination, immediately selecting Neighbor B without needing a map of the entire network.

As demonstrated by Liu et al. in the context of satellite IP networks, routing packets dynamically based on real-time geometric coordinates and shortest-distance calculations makes the network immune to the disruptions caused by rapid node movement. Because there are no static or pre-calculated tables to update, there is no topology convergence delay.

Furthermore, this localizes the memory footprint. As reviewed by Dong et al., utilizing physical location coordinates rather than network addresses minimizes the memory overhead associated with maintaining massive routing tables, making it highly effective for the complex 3D trajectories of drone swarms.


Suppressing the Broadcast Storm

In ad-hoc networks, discovering a route traditionally requires "blind broadcasting"—flooding the entire network with query packets to locate a destination. In dense or highly mobile environments, this leads to severe network congestion, known as a broadcast storm.

Geographic routing mitigates this by using spatial coordinates to scope and direct query propagation. Meyer auf der Heide et al. show that integrating geographic positioning data into source route discovery significantly reduces network overhead. By replacing blind broadcasting with informed, coordinate-aided data transmission, the system avoids unnecessary signaling load.

To optimize group communication, the network can partition physical space into deterministic zones. Cheng et al. leverage this concept by propagating route requests outward from a source node in concentric layers using geometric rules.

   [ Zone 1 ]  -->  [ Zone 2 ]  -->  [ Zone 3 ]
(Queried Once)   (Queried Once)   (Queried Once)

By partitioning the network into non-overlapping geographic zones, the protocol ensures that each physical area is queried exactly once. This deterministic propagation eliminates redundant transmissions and prevents broadcast storms during multicast discovery.


Area-Based and Data-Centric Forwarding

The power of geographic routing becomes even more apparent when coupled with data-centric networking paradigms, such as Named Data Networking (NDN) or Publish/Subscribe systems. In these architectures, users care about what the data is or where it originates, rather than which specific device holds it.

Zhang introduces a "fetch-from-area" model that binds data names directly to geographic regions or grid coordinates. Forwarding tables are extended to map data prefixes to geographic destinations, effectively treating spatial areas as logical network interfaces:

Data Prefix Spatial Interface (Target Region)
/traffic/speed-cam Grid_Square_B4
/weather/temp Bounding_Box_Zone_A

This decoupling ensures that data remains reachable even as individual nodes move or disconnect. A request is simply routed toward a physical location.

Similarly, Al-qutwani et al. demonstrate that incorporating vehicle location information directly into packet names enhances routing efficiency in mobile vehicular ad-hoc networks (VANETs).

For publish/subscribe systems in wireless mesh networks, the authors of Efficient Event Delivery in Publish/Subscribe Systems for Wireless Mesh Networks leverage the stationary, high-capacity nature of a mesh backbone to route events using geographical coordinates rather than logical addresses. By utilizing the physical locations of base stations, the system delivers data to mobile endpoints without maintaining complex, fluctuating global routing tables.


Adapting to Real-World Constraints

Geographic routing is not confined to idealized, open geometric spaces; it actively adapts to physical constraints, heterogeneous mobility, and even security requirements.

  • Vehicular and Fog Environments: In dense urban settings, routing cannot happen in a straight line due to buildings and road layouts. Goncalves et al. address this by embedding physical coordinates, propagation direction, and road identifiers directly into the network layer packet header. This tightly couples routing decisions with real-world geography without requiring a centralized topology map. Similarly, Luan et al. highlight how routing protocols leverage the geographic coordinates of moving vehicles to dynamically select the most efficient relays, maintaining a stable network topology in vehicular fog computing.
  • Intermittent Connectivity: In Delay/Disruption Tolerant Networks (DTNs), paths are frequently broken. Cao 0002 et al. demonstrate that geographic routing schemes significantly outperform traditional topological routing in these environments by utilizing real-time location info to adapt on-the-fly to fluctuating node availability.
  • Physical Transport Networks: The principles of geographic routing even bridge the digital and physical worlds. Garg et al. design a system ("Postmanet") that routes physical storage media through the global postal network. They demonstrate that dynamic routing algorithms incorporating geographic awareness and actual postal latencies significantly outperform static routing methods when optimizing data movement through physical infrastructure.
  • Location-Based Trust: Beyond efficiency, spatial data can enhance network security. As noted by Choo et al., in dynamic wireless environments, authentication can be integrated directly with geo-location-oriented routing, using spatial data as a strict criterion for establishing trust and verifying authorized nodes.

By anchoring routing decisions to the immutable reality of physical space rather than the volatile state of network links, geographic routing provides a highly resilient, low-overhead framework for the next generation of mobile, ad-hoc, and cyber-physical networks.

Key Foundational Work

Mobile Computing, Mobile Networks (2002) — contributed 2 concept elements to this direction.
Bridging the digital divide: storage media + postal network = generic high-bandwidth communication (2005) — contributed 2 concept elements to this direction.
History & citationVersion 1 · 2026-10-04

Current · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_location_aware_routing_29beb809,
  title = {location-aware routing},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/location-aware-routing/rdr_29beb809d1a84ba8935a2e3d3210915c},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}

This exact version (version 1, frozen text):

@misc{lacuna_location_aware_routing_29beb809_v1,
  title = {location-aware routing},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/location-aware-routing/rdr_29beb809d1a84ba8935a2e3d3210915c/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}
About

These directions overlap with this one through shared papers.

See something wrong? Report a mistake