Connection ID Allocation in Device-to-Device Pairing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In device-to-device communication, the existing methods for allocating connection IDs lead to overhead in searching for available IDs and result in repeated IDs when multiple devices attempt communication, causing data transmission failures.
Innovation Solution
A method and apparatus for efficiently determining connection IDs by classifying link identifications into tiers, selecting available candidate seeds, and exchanging seed information through pairing request and response messages to avoid ID repetition.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If connection IDs are allocated by searching all available IDs to ensure uniqueness, then ID repetition is avoided, but communication overhead and time consumption increase significantly
Solution Approach 1:
The system pre-generates and stores a pool of candidate connection IDs before the pairing process begins. This preliminary preparation eliminates the need for exhaustive searching during actual ID allocation, reducing time consumption while maintaining uniqueness through the pre-filtered candidate pool
Solution Approach 2:
The connection ID allocation process is segmented into two phases: a preliminary phase where candidate IDs are generated and stored in a pool, and an execution phase where IDs are selected from the pre-prepared pool. This segmentation separates the computationally intensive search operation from the actual pairing process
2Ease of operation
If connection IDs are selected randomly to simplify the allocation process, then overhead is reduced, but ID repetition occurs when multiple devices attempt communication simultaneously
Solution Approach 1:
A candidate connection ID pool acts as an intermediary between random selection and guaranteed uniqueness. The pool pre-organizes available IDs, allowing devices to select from pre-validation candidates rather than performing random selection, thus maintaining simplicity while ensuring uniqueness through the structured pool management
3Reliability
If exhaustive search for available connection IDs is performed, then ID collision is prevented, but system complexity and computational overhead increase
Solution Approach 1:
The system performs the complex exhaustive search operation in advance during system initialization or idle periods, populating a candidate ID pool. This preliminary computation eliminates the need for repeated exhaustive searches during active pairing operations, reducing real-time complexity while maintaining reliability
Solution Approach 2:
Instead of performing exhaustive searches on the complete ID space during each pairing operation, the system creates and maintains a copied subset of valid candidate IDs in a pool. This copy contains only currently available IDs, reducing the search space and computational complexity for subsequent allocations
Data Source
AI summary
A method of performing pairing by a transmission terminal in device to device communication is provided. The method includes classifying a plurality of link identifications for identifying a data transmission and reception channel a seed of at least one link identification; selecting an available candidate link identification seed among the seed of the at least one link identification, transmitting a pairing request message including seed information associated with the selected available candidate link identification seed, and receiving a pairing response message corresponding to the pairing request message. When allocating a connection ID in a device to device communication environment, even if a small number of devices exist, an overhead for searching for the connection ID is not great. Further, when many devices exist within a specific range, a probability of devices having the same connection ID is reduced. Accordingly, the device to device communication can be easily performed.