Ad Hoc Network Packet Transport via Transit Key Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Ad hoc wireless networks face significant latency issues due to the need for multiple wireless hops and the lack of a centralized controller, leading to inefficient channel access protocols and increased processing and queueing delays, which limit their performance and quality of service.
Innovation Solution
The implementation of a packet transport system that uses a transit key processor to determine forwarding actions for data packets based on a transit control table, allowing for reduced latency by collapsing the data plane and eliminating unnecessary processing and queueing steps, with each node only re-energizing packets if it is on the path from the source to the destination.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If conventional layering protocol is used in ad hoc networks, then routing functionality is provided, but latency increases due to multiple processing and queueing steps at each relay node
Solution Approach 1:
The patent segments the routing functionality by extracting only the essential forwarding decision logic from the complex layered protocol stack. Each node maintains a transit control table that pre-computes forwarding actions based on transit keys, separating the decision-making function from the detailed protocol processing, thereby reducing latency while maintaining routing capability.
Solution Approach 2:
The patent applies preliminary action by pre-computing and storing forwarding actions in transit control tables before packets arrive. Nodes pre-determine which packets to forward, drop, or keep based on transit keys, eliminating the need for real-time complex protocol processing and queueing decisions, thus significantly reducing latency.
2Reliability
If channel access protocol with RTS/CTS is used, then medium access control is achieved, but delay increases due to guard times and multiple interactions
Solution Approach 1:
The patent extracts the essential channel access control function from the complex RTS/CTS protocol. By using transit keys to pre-determine forwarding actions, the system removes the need for multiple RTS/CTS interactions and guard times, keeping only the critical medium access control capability while eliminating the time-consuming protocol overhead.
3Ease of operation
If packets are forwarded hop-by-hop through multiple wireless hops, then routing is achieved, but end-to-end latency becomes unacceptably high
Solution Approach 1:
The patent applies the skipping principle by enabling packets to be forwarded more directly through the network using pre-computed transit keys. Instead of following traditional hop-by-hop routing with extensive processing at each node, packets skip unnecessary processing steps and queueing delays, rushing through the network with minimal intervention, thus reducing end-to-end latency while maintaining routing functionality.
Data Source
AI summary
The systems and methods described herein include, among other things, processes for providing low latency packet transport in ad hoc networks. To this end, the systems, in certain embodiments, employ an architecture for communication nodes in MANETs, in which the delay introduced in “routing” or “relaying” the packet is reduced. In these systems invention, the data plane of the OSI stack at relay nodes is collapsed so that bits entering the node are re-energized “on-the-fly”, with only a brief pause. A transit key in each packet, inserted by the originator of the packet, is used to index into a transit table to determine one of three actions to perform—drop, keep, or retransmit the packet. A control plane determines, for each packet, whether it should be re-energized or not. The control algorithm ensures that only nodes along the path from the source to the destination re-energize (relay) the packet.