Geohyperbolic Routing for IoT Scalability
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing Internet routing architecture faces scalability issues due to the linear or superlinear growth of Forwarding Information Base (FIB) sizes and protocol overhead with increasing network size, making it unsuitable for dynamic networks like the Internet of Things (IoT), which requires sublinearly scalable routing protocols.
Innovation Solution
A network architecture that assigns network addresses based on geographic positions of nodes using latitude, longitude, and centrality, allowing for efficient greedy geometric routing in hyperbolic spaces, reducing FIB sizes and routing overhead by connecting nodes based on hyperbolic distances and using a geographic addressing scheme that minimizes time delay.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If traditional routing protocols are used, then routing functionality is provided, but FIB sizes and protocol overhead grow linearly or superlinearly with network size
Solution Approach 1:
The patent transforms the routing problem by changing the parameter space from traditional flat routing tables to hyperbolic geometry coordinates. Each node is assigned coordinates (r, θ, φ) in 3D hyperbolic space, allowing routing decisions to be made based on geometric proximity rather than exhaustive table lookups. This parameter transformation enables sublinear scaling of routing information with network size.
Solution Approach 2:
The patent introduces a new dimensional framework by embedding the network in 3-dimensional hyperbolic space. Instead of using traditional 2D or flat routing tables, nodes are positioned with three coordinates (radial distance r, polar angle θ, azimuthal angle φ), creating a higher-dimensional addressing scheme that captures network topology more efficiently and reduces routing overhead.
2Quantity of substance
If network size increases to accommodate IoT devices, then addressing space requirements increase, but existing routing protocols cannot scale sublinearly
Solution Approach 1:
The patent changes the addressing parameters from traditional flat identifiers to hyperbolic coordinates (r, θ, φ). This transformation allows the addressing space to expand efficiently with network size while keeping routing protocol complexity sublinear, as routing decisions are based on geometric relationships in hyperbolic space rather than complex protocol state management.
3Loss of time
If geographic addressing is implemented, then routing efficiency is improved, but coordinate mapping and address assignment complexity increases
Solution Approach 1:
The patent applies preliminary action by pre-assigning hyperbolic coordinates (r, θ, φ) to each node based on its geographic position and network centrality before routing occurs. This pre-positioning in hyperbolic space enables efficient greedy geometric routing where packets are forwarded to neighbors closer to the destination in hyperbolic distance, minimizing routing time delay without requiring complex real-time calculations.
Data Source
AI summary
Network architectures and methods including addressing and dynamic network topology construction schemes that guarantee maximally efficient and scalable routing are disclosed herein. The network architectures and methods introduce a new approach to network design. The network architectures and methods include an addressing scheme based on geographic position of network nodes, and a network topology construction scheme based on the addressing scheme and that can reproduce properties of the existing Internet topology. A routing algorithm for the network architecture is shown to be maximally scalable and efficient. According to an example embodiment, a network includes a plurality of nodes, where each node has a network address based on a latitude of a location of the node, a longitude of the location of the node, and a centrality of the location of the node.