THOR Route Chains for Low-Latency Mobile Ad Hoc Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Mobile ad hoc networks face challenges with efficient routing, managing network topology, and reliability, particularly in scenarios where nodes move randomly and generate/receive data, leading to inefficiencies in existing proactive and reactive routing protocols.
Innovation Solution
A Target Homing Optimized Routing (THOR) protocol that designates nodes as target homeport, comms-relay, or sensor nodes, maintains multiple route chains, and transmits sensor information along a primary route chain, enabling alternative paths and reducing network overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If proactive routing protocols continuously maintain routing tables at each node, then routing latency decreases and route availability improves, but network overhead increases
Solution Approach 1:
The patent segments the network into mobile nodes and stationary infrastructure nodes (access points, routers). Only mobile nodes maintain full routing tables, while stationary nodes use simplified routing information, reducing overall network overhead while maintaining low latency for mobile nodes that need it most.
Solution Approach 2:
Different node types receive different routing table maintenance strategies. Mobile nodes continuously maintain routing tables for low latency, while stationary infrastructure nodes use event-driven updates. This local differentiation optimizes the balance between latency and overhead for each node type based on its mobility characteristics.
2Quantity of substance
If reactive routing protocols establish routes on-demand, then network overhead decreases, but routing latency increases and route reliability deteriorates
Solution Approach 1:
Mobile nodes pre-compute and maintain routing tables to potential destinations before routes are actually needed. This preliminary action ensures that when data transmission is required, routes are already established, eliminating the latency penalty of on-demand route discovery while reducing overhead compared to continuous maintenance at all nodes.
3Adaptability or versatility
If nodes move randomly in mobile ad-hoc networks, then network flexibility and adaptability improve, but route stability and reliability deteriorate
Solution Approach 1:
The routing protocol dynamically adapts to node mobility by having mobile nodes continuously update their routing tables as they move. The system accepts and responds to topological changes rather than resisting them, maintaining reliability through dynamic adaptation to the changing network environment.
Solution Approach 2:
Mobile nodes continuously monitor network topology changes and update routing tables accordingly. This feedback mechanism ensures that routing information remains current despite random node movement, maintaining route stability through continuous adaptation to the dynamic environment.
4Reliability
If routing tables are periodically maintained at all nodes, then route availability improves, but energy consumption and computational overhead increase
Solution Approach 1:
The patent applies different routing table maintenance strategies to different node types. Mobile nodes that require high route availability continuously maintain routing tables, while stationary infrastructure nodes use event-driven updates. This local differentiation reduces overall energy consumption while maintaining adequate route availability for nodes that need it most.
Solution Approach 2:
Instead of all nodes performing full routing table maintenance, only mobile nodes perform continuous updates. Stationary nodes perform partial maintenance only when topology changes occur. This partial action approach maintains sufficient route availability while significantly reducing total energy consumption in the network.
Data Source
AI summary
A target homing optimized routing protocol over an aerial service gateway relay domain. A method of proactive routing comprising the steps of designating each node of a plurality of nodes within a mobile ad-hoc network as either one of a plurality of target homeport nodes, one of a plurality of comms-relay nodes, or one of a plurality of sensor nodes, initializing a target homing optimized protocol by propagating a plurality of route chains to each of the plurality of comms-relay nodes and each of the plurality of sensor nodes, maintaining the plurality of route chains at each of the plurality of nodes, wherein a plurality of routing tables, each associated with one of the plurality of nodes, comprises the plurality of route chains, generating sensor information at the plurality of sensor nodes, and selectively transmitting the sensor information to the plurality target homeport nodes along a primary route chain.


