Thread Border Router Routing for Shortest-Path Downlink Packets
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In IoT environments, thread networks experience performance degradation due to non-optimal routing of downlink data traffic when multiple border routers are used, leading to significant delays in packet delivery.
Innovation Solution
A wireless network device controls border routers to determine the shortest route path to thread nodes, assigns preferred border routers based on this path, and uses on-mesh prefixes and sub-prefixes to ensure efficient routing, with backup routes for redundancy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple border routers are used in a thread network, then network redundancy and reliability are improved, but routing efficiency deteriorates due to non-optimal path selection
Solution Approach 1:
The patent implements dynamic route path determination by having border routers calculate and update route path counts to thread nodes in real-time. The system dynamically selects the preferred border router based on current network conditions and shortest path metrics, rather than using static routing tables. This dynamic approach allows the network to maintain multiple border routers for redundancy while always selecting the optimal path for packet delivery, thereby resolving the contradiction between reliability and delivery delay.
Solution Approach 2:
The patent employs feedback mechanisms where border routers continuously exchange routing information and update route path counts with other border routers and thread nodes. Thread nodes provide feedback about their preferred border router selections based on received route information. This feedback loop enables the system to maintain network redundancy through multiple border routers while ensuring that packets are always routed through the currently optimal path, thus preventing performance degradation.
2Reliability
If multiple border routers are used in a thread network, then network reliability is improved, but routing complexity increases leading to performance degradation
Solution Approach 1:
The patent implements self-service routing where each border router autonomously calculates route path counts to thread nodes and determines its own status as a preferred border router based on shortest path metrics. Thread nodes independently select their preferred border router based on received routing information without requiring complex centralized control. This self-service approach simplifies the overall system architecture while maintaining multiple border routers for reliability, as each component makes autonomous routing decisions based on local calculations rather than requiring complex inter-component coordination.
3Ease of operation
If non-optimal routing paths are used, then network simplicity is maintained, but packet delivery efficiency deteriorates
Solution Approach 1:
The patent applies preliminary action by having border routers pre-calculate and advertise route path counts to thread nodes before actual packet transmission occurs. Thread nodes receive and store this routing information in advance, enabling them to immediately select the optimal border router when packets need to be sent. This preliminary routing information exchange simplifies the actual packet forwarding process while ensuring optimal path selection, as the complex calculations are performed beforehand rather than in real-time during packet transmission.
Data Source
AI summary
A wireless network device includes at least one processor; and memory storing instructions, wherein the instructions, when executed by the at least one processor, individually or collectively, cause the wireless network device to control at least one border router to determine a shortest route path from the at least one border router to a thread node in a thread network; control the at least one border router to assign a preferred border router to the thread node based on the shortest route path; control the at least one border router to send context information in an advertisement packet to a network node, wherein the context information indicates the assigned preferred border router for the thread node; and send at least one downlink packet to the thread node through the assigned preferred border router.