Mesh Network Routing via Slotted Resource Segmentation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In wireless radio access networks, dense deployments require efficient backhaul solutions, but fiber installation is costly, and existing wireless self-backhaul methods face interference issues and suboptimal resource utilization due to complex routing algorithms.

Innovation Solution

A reduced-complexity routing algorithm for slotted resources in mesh networks that determines multi-slot routes through a sequence of nodes using standard algorithms like Bellman-Ford or Dijkstra, ensuring all routes to a destination go via the same nodes, reducing interference and optimizing link capacity.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Device complexity

If reduced-complexity routing algorithms are used, then processing overhead is reduced, but resource utilization becomes suboptimal

Engineering Contradiction:
Improverouting algorithm complexityVSAvoidresource utilization
Core Design Contradiction:
Device complexityVSProductivity

Solution Approach 1:

The routing problem is segmented into two independent phases: (1) determining the sequence of nodes using standard algorithms like Bellman-Ford or Dijkstra, and (2) assigning multiple slots to each link along the route. This segmentation allows using simple algorithms for node sequencing while optimizing resource utilization through multi-slot assignment, resolving the contradiction between algorithm complexity and resource utilization efficiency

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The invention adds the time dimension by introducing multiple slots per link. Instead of single-slot routing, the system assigns multiple time slots to each link in the route, effectively moving from a single-dimension routing problem to a multi-dimensional resource allocation problem. This enables better resource utilization without increasing the complexity of the underlying routing algorithm

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Device complexity

If single-slot routing is used, then routing complexity is reduced, but link capacity utilization is inefficient

Engineering Contradiction:
Improverouting complexityVSAvoidlink capacity utilization
Core Design Contradiction:
Device complexityVSQuantity of substance

Solution Approach 1:

By assigning multiple slots to each link, the system ensures continuous utilization of link capacity. Instead of a link being idle between single-slot transmissions, multiple slots keep the link continuously active, maximizing the useful action and capacity utilization while maintaining simple routing logic

Inventive Principle:
Principle #20Continuity of useful action

3Productivity

If multi-path routing is used, then resource utilization improves, but TCP traffic delivery becomes out-of-order

Engineering Contradiction:
Improveresource utilizationVSAvoidTCP traffic delivery order
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The invention merges all slot routes to a given destination into a single unified route through the same sequence of nodes. Instead of allowing traffic to split across multiple node sequences (multi-path routing), all slots are consolidated to traverse identical node sequences, ensuring in-order TCP delivery while maintaining high resource utilization through multiple slot assignments

Inventive Principle:
Principle #5Merging (Combining)

Data Source

PatentEP2929743B1Methods and apparatus for routing communications using slotted resources of radio access mesh networks
Publication Date: 2019.10.23 TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
  • EP2929743B1 patent drawingFigure 1~2
  • EP2929743B1 patent drawingFigure 3~4(d)
  • EP2929743B1 patent drawingFigure 5~6

AI summary

Methods and network nodes (700-720) route communications between pairs of source and destination nodes through network nodes (700-720) of a wireless communication system. One resource slot of a wireless communication link is selected (1200) between each of a sequence of the network nodes (700-720) along a communication route between one pair of the source and destination nodes. Another resource slot of the wireless communication link is selected (1202) between at least some of the sequence of the network nodes (700-720) along the communication route between the one pair of the source and destination nodes. Selection of the other resource slot between each of the sequence of the network nodes along the communication route can be constrained to selection among resource slots that are available from only the sequence of the network nodes along the communication route between the one pair of the source and destination nodes.