Geographic Packet Forwarding in Dynamic LEO Satellite Meshes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current routing methods in satellite mesh networks are computationally intensive and lack efficient packet forwarding mechanisms that consider satellite proximity to ground-based destinations, especially in low earth orbit (LEO) constellations where satellites move rapidly.
Innovation Solution
Implement geographic routing based on geographic location identifiers to determine the cost or utility of forwarding data packets to destination devices, using a comparator tree to select the optimal satellite for packet forwarding, and employing distance-based metrics like the Haversine function or inner product of vectors to calculate distances.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If current routing methods are used in satellite mesh networks, then packets can be routed through the network, but the computational complexity becomes excessively high due to the need to determine satellite locations and routing paths in real-time
Solution Approach 1:
The patent pre-calculates and stores routing paths in forwarding tables before packets arrive. When a packet needs to be forwarded, the router simply looks up the destination address in the forwarding table and forwards the packet along the pre-determined path, eliminating the need for real-time path computation and significantly reducing computational complexity
Solution Approach 2:
The patent creates simplified copies of routing information in the form of forwarding tables that contain pre-computed next-hop information. These forwarding tables are distributed to routers in advance, allowing them to make forwarding decisions based on simple table lookups rather than complex real-time calculations
2Reliability
If geographic routing based on real-time satellite locations is implemented, then packet forwarding can be optimized for proximity to destinations, but the system complexity increases due to the need for continuous location tracking and dynamic path computation
Solution Approach 1:
The patent pre-computes routing paths based on predicted satellite locations and stores them in forwarding tables before they are needed. This allows the system to maintain optimized geographic routing without requiring real-time location tracking and dynamic computation, thereby reducing system complexity while maintaining reliable connectivity
Solution Approach 2:
The patent uses dynamic routing tables that are updated periodically with new pre-computed paths as satellites move to new positions. This allows the system to adapt to changing satellite locations and maintain optimal routing without requiring complex real-time adjustments, balancing reliability with manageable system complexity
Data Source
Figure 1A
Figure 1B
Figure 1C
AI summary
The present invention is provides a method and apparatus for routing a data packet in a network. For each nearby device capable of routing the packet toward a further destination, an associated cost or utility is determined. The device with lowest cost or highest utility is selected and the packet is forwarded toward same. The selecting may use a comparator tree. The cost or utility may be associated with forwarding the data packet from the candidate device toward the further destination. The cost or utility may be based on a distance from candidate device to the further destination, and may be determined using a Haversine function or approximation thereof, or by computing an inner product of a first vector and a second vector originating at a center of Earth, the first vector directed toward the candidate device, the second vector directed toward the further destination.