Multi-hop D2D Path Selection for Low Latency Industrial Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless communication technologies in mobile networks, especially for industrial applications, face challenges in providing low latency and deterministic communications, particularly in scenarios where direct device-to-device (D2D) connections are not feasible due to range limitations or other requirements.
Innovation Solution
The implementation of a method and apparatus for selecting a connection path in multi-hop D2D communications, where controllers or path computation entities compute and select optimal paths based on link-state relationships and link quality data, using algorithms like SPF to ensure low latency and deterministic data transmission through a D2D mesh network, potentially involving candidate relay nodes to bridge coverage gaps.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If direct D2D connection is used, then communication latency is reduced, but connection reliability deteriorates when devices are out of range
Solution Approach 1:
The patent introduces intermediary relay nodes (other UEs) to establish multi-hop D2D communication paths when direct connections are not feasible. These relay nodes act as mediators to forward data packets between source and destination UEs, maintaining connection reliability while preserving low latency through direct wireless links between hops.
Solution Approach 2:
The patent segments the communication path into multiple hops through relay nodes when a single direct connection cannot satisfy both latency and reliability requirements. Each hop maintains direct wireless connectivity, and the overall path reliability is achieved through the combination of multiple reliable segments rather than a single unreliable direct link.
2Reliability
If multi-hop D2D communication is implemented, then connection reliability is improved for out-of-range devices, but communication latency increases
Solution Approach 1:
The patent uses intermediary relay nodes to enable multi-hop communication, but carefully selects relays that minimize additional latency. The path computation entity evaluates multiple candidate paths and selects those that achieve reliable communication while keeping the number of hops and total transmission time within acceptable thresholds for industrial applications.
Solution Approach 2:
The patent dynamically adjusts communication parameters such as transmission power, modulation schemes, and resource allocation for each hop in the multi-hop path. By optimizing these parameters, the system maintains low latency despite the increased number of transmissions required for multi-hop communication.
3Loss of time
If path computation is performed centrally, then optimal paths are selected for low latency, but system complexity increases
Solution Approach 1:
The patent introduces a dedicated path computation entity (PCE) as an intermediary that centralizes the complex path selection and optimization functions. This PCE computes optimal multi-hop D2D paths considering latency requirements, link quality, and network topology, while individual UEs simply follow the computed paths, reducing the complexity burden on end devices.
Solution Approach 2:
The patent extracts the complex path computation and optimization functions from individual UEs and concentrates them in a dedicated path computation entity. This separation allows the PCE to handle the computational complexity of finding optimal paths while UEs focus on executing the predetermined communication paths, reducing overall system complexity.
Data Source
AI summary
In one illustrative example, one or more controllers may be configured to perform a path selection procedure for selecting a connection path for multi-hop device-to-device (D2D) communications. Identifiers of candidate D2D device pairings from D2D peer discovery performed by a plurality of UEs served in a plurality of base stations and link quality data associated with each candidate D2D device pairings are obtained. D2D network topology map data including a plurality of link-state relationships are generated based on the identifiers of candidate D2D device pairings. A plurality of connection paths of UEs are computed based on the generated link-state relationships and the link quality data, where each computed connection path includes UEs indicated as required nodes and at least one UE indicated as a candidate relay node. An optimal connection path that satisfies a latency parameter is selected from the plurality of computed connection paths (e.g. based on a shortest path first or SPF algorithm). The selected connection path may be part of an operational control loop for low latency, deterministic D2D communications.