Multi-lane Path Discovery in Bluetooth Mesh Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Bluetooth mesh networking faces challenges with single-path approaches, which are insufficient for maintaining guaranteed successful reception rates due to lossy medium access techniques and low duty cycle of Bluetooth LE radios, leading to increased interference and energy consumption.
Innovation Solution
The implementation of novel techniques for establishing multiple independent paths between source and destination nodes in Bluetooth mesh networks, using a new path metric that combines hop-count and node-count information, to enhance redundancy and reliability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If single-path approaches are used for message forwarding in Bluetooth mesh networks, then device complexity and energy consumption are reduced, but network reliability and successful reception rates deteriorate due to lossy medium access and low duty cycle
Solution Approach 1:
The patent segments the network path into multiple independent lanes between source and destination nodes. Each lane represents a distinct routing path that can operate independently. This segmentation allows messages to be distributed across multiple paths, improving reliability without requiring complex end-to-end path management at each node
Solution Approach 2:
The patent implements partial redundancy by creating multiple lanes only where needed based on traffic patterns and network conditions. Rather than establishing full redundancy for all communications, the system dynamically creates additional lanes when reliability requirements demand, balancing reliability improvements with device complexity constraints
2Reliability
If multiple independent paths are established between source and destination nodes, then message delivery reliability improves, but interference and energy consumption increase
Solution Approach 1:
The patent implements dynamic lane management where multiple paths are created and activated based on real-time network conditions, traffic demands, and reliability requirements. The system can dynamically add or remove lanes rather than maintaining static multiple paths, allowing energy consumption to adapt to actual needs while preserving reliability when required
Solution Approach 2:
The system changes operational parameters by adjusting the number of active lanes based on message priority, destination importance, and network conditions. Low-priority traffic may use fewer lanes conserving energy, while high-priority traffic automatically receives more lanes for enhanced reliability, optimizing the trade-off between energy consumption and message delivery success
3Ease of operation
If flooding is used for path discovery in Bluetooth mesh networks, then path establishment is simplified, but interference and energy consumption increase due to extensive message broadcasting
Solution Approach 1:
The patent extracts the path discovery function from the general message flooding mechanism by implementing targeted lane discovery protocols. Instead of flooding all messages throughout the network, the system uses controlled discovery messages only when new lanes need to be established, separating path discovery from regular data transmission and reducing unnecessary interference from discovery traffic
Data Source
AI summary
A method for multilane path discovery between a first node and a second node in a wireless mesh network, the method being performed by an intermediate node and comprising: receiving, by the intermediate node, a path request for establishing a path between the first and second nodes, wherein the path request comprises node count information related to the path between the first and second nodes; determining, by the intermediate node, that the received node count information is less than or equal to node count information, corresponding to a path between the first and second nodes, that is stored in a discovery table of the intermediate node; and updating, by the intermediate node, the stored node count information with the received node count information.