Mesh Network Route Discovery via Neighbor Exchange
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In 4G and 5G communication networks, existing sidelink communication methods are limited to direct or single-hop relay, lacking a robust routing algorithm for efficient data packet delivery in multi-hop relay or mesh topologies, which hinders correct and efficient data transmission to destination nodes.
Innovation Solution
A method for route discovery in mesh networks, where nodes exchange discovery request and response messages to update routing tables, using PC5-S protocol messages, and determine optimal routes based on hop count, quality, and criteria such as maximum hop count and minimum route quality thresholds.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If sidelink communication is extended to support multi-hop relay or mesh topologies, then network coverage and connectivity are improved, but routing complexity increases and requires additional routing algorithms
Solution Approach 1:
Each node in the mesh network autonomously discovers routes to destination nodes by independently exchanging discovery request and response messages with its neighbors. The routing algorithm is distributed across all nodes rather than centralized, allowing the network to self-organize and adapt to topology changes without external control, thus improving coverage while managing complexity through decentralization
Solution Approach 2:
Nodes proactively discover and establish routes to destination nodes before actual data transmission occurs. By pre-discovering routes and maintaining routing tables with known paths, the network reduces the complexity of real-time routing decisions and ensures efficient data delivery when needed
2Reliability
If route discovery messages are exchanged between nodes, then accurate routing tables are established, but network overhead and message traffic increase
Solution Approach 1:
Route discovery is performed locally between neighboring nodes rather than globally across the entire network. Each node exchanges discovery messages only with its immediate neighbors and maintains routing information relevant to its local context. This localized approach ensures accurate routing tables are built through direct neighbor interactions while significantly reducing overall network message traffic compared to global discovery protocols
3Productivity
If maximum hop count limits are enforced, then routing efficiency is improved, but route selection flexibility is reduced
Solution Approach 1:
The maximum hop count is configured as a configurable parameter that can be adjusted based on specific network conditions and service requirements. Rather than enforcing a fixed rigid limit, the system allows dynamic parameter adjustment to balance routing efficiency (by preventing excessive multi-hop paths) with route selection flexibility (by adapting the limit to different scenarios), thus resolving the contradiction between productivity and adaptability
Data Source
AI summary
An apparatus operated as a relay node in a wireless mesh network for route discovery comprises processing circuitry that receives, from a first neighbor node, a discovery request including a request for a route to a destination node. When the routing table of the first node contains routes to the destination node, the first node sends, to the first neighbor node, a discovery response including information about these routes. When the routing table of the first node does not contain a route to the destination node, the first node sends, to a second neighbor node, a discovery request for a route to the destination node. When the first node receives, from the second neighbor node, a discovery message including information of routes to a destination node. The first node transmits, to the first neighbor node, a discovery response including information of these routes.