Layer 2 Mesh Packet Routing With Hybrid Path ID Relay Logic
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing wireless mesh networks face challenges in efficiently routing packets due to dynamic topology changes and the risk of delivery failures and loops, especially in multi-hop scenarios where traditional path ID-based routing is inefficient or impractical.
Innovation Solution
A hybrid approach combining path IDs with dynamic route generation, utilizing a sidelink relay adaptation protocol (SRAP) for packet routing, which includes determining next-hop nodes based on routing tables and intermediate destinations, and implementing acknowledgement mechanisms to ensure reliable delivery.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If path ID-based routing is used in traditional wireless mesh networks, then packet routing can be simplified, but delivery efficiency deteriorates due to dynamic topology changes and loop risks
Solution Approach 1:
The routing process is segmented into two distinct phases: path discovery (using path ID) and packet forwarding (using dynamic routing tables). This segmentation allows the system to benefit from both simplified path identification and adaptive routing optimization, resolving the contradiction between routing simplicity and delivery efficiency.
Solution Approach 2:
The system performs preliminary path discovery using path ID before actual packet forwarding. This preliminary action establishes a valid route in advance, ensuring that subsequent packet forwarding can proceed efficiently through pre-validated next-hop nodes without encountering topology changes or loops during transmission.
2Productivity
If dynamic route generation is implemented, then delivery efficiency improves, but routing complexity increases
Solution Approach 1:
The routing table is made dynamic, allowing next-hop nodes to be updated in real-time based on current network topology. This dynamic adjustment enables the system to adapt to topology changes and avoid loops while maintaining efficient packet forwarding, balancing delivery efficiency with manageable routing complexity.
Solution Approach 2:
The system implements feedback mechanisms where routing decisions are continuously refined based on packet transmission outcomes and network state changes. This feedback loop allows the routing table to self-optimize, improving delivery efficiency while the feedback control maintains routing complexity within acceptable bounds.
3Adaptability or versatility
If multi-hop relaying is supported, then network coverage and flexibility improve, but the risk of delivery failures and loops increases
Solution Approach 1:
The system performs preliminary path validation using path ID before enabling multi-hop relaying. This preliminary action ensures that each hop in the relay chain follows a pre-validated route, preventing loops and delivery failures while maintaining the flexibility of multi-hop topology support.
Solution Approach 2:
The routing table acts as an intermediary between the flexible multi-hop topology and reliable packet delivery. By mediating packet forwarding decisions through the routing table, the system enables adaptable network paths while ensuring each hop is controlled and validated, thus maintaining delivery reliability.
Data Source
AI summary
This disclosure provides an apparatus operated as a relay node in a wireless mesh network for packet routing. The apparatus comprises processing circuitry that receives a packet including indications of a source node and a destination node. When the relay node is not the destination node, the processing circuitry determines whether the packet includes a path ID identifying a delivery route for the packet. When the packet includes the path ID and a routing table of the relay node includes a first next-hop node associated with the path ID, the processing circuitry transmits the packet to the first next-hop node. When the packet does not include the path ID or the routing table does not include the first next-hop node, the processing circuitry transmits the packet to one of a second next-hop node associated with the destination node and a third next-hop node associated with an intermediate destination node.