CN113676845B - Multi-hop relay communication method for near field service - Google Patents

Multi-hop relay communication method for near field service Download PDF

Info

Publication number
CN113676845B
CN113676845B CN202010402502.2A CN202010402502A CN113676845B CN 113676845 B CN113676845 B CN 113676845B CN 202010402502 A CN202010402502 A CN 202010402502A CN 113676845 B CN113676845 B CN 113676845B
Authority
CN
China
Prior art keywords
prose
terminal
hop
relay
communication
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010402502.2A
Other languages
Chinese (zh)
Other versions
CN113676845A (en
Inventor
朱玉梅
范晨
袁乃华
陈贵荣
苑雪
周志宏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chengdu TD Tech Ltd
Original Assignee
Chengdu TD Tech Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chengdu TD Tech Ltd filed Critical Chengdu TD Tech Ltd
Priority to CN202010402502.2A priority Critical patent/CN113676845B/en
Publication of CN113676845A publication Critical patent/CN113676845A/en
Application granted granted Critical
Publication of CN113676845B publication Critical patent/CN113676845B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/80—Services using short range communication, e.g. near-field communication [NFC], radio-frequency identification [RFID] or low energy communication
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/02—Terminal devices
    • H04W88/04—Terminal devices adapted for relaying to or from another terminal or user
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W92/00—Interfaces specially adapted for wireless communication networks
    • H04W92/04—Interfaces between hierarchically different network devices
    • H04W92/10—Interfaces between hierarchically different network devices between terminal device and access point, i.e. wireless air interface
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

The application discloses a short-distance service multi-hop relay communication method, which comprises the following steps: the first remote terminal and the second remote terminal realize the short-distance service (ProSe) communication through the relay of at least one relay terminal based on the ProSe technology; the first remote terminal and the second remote terminal are two terminals which cannot directly carry out ProSe communication; each relay terminal is logically divided into two parts: the system comprises ProSe UE and ProSe RUE, wherein the ProSe UE bears the function of a server of a PC5 interface of a previous hop, and the ProSe RUE bears the function of a client of a PC5 interface of a next hop; the ProSe UE in each relay terminal establishes ProSe communication with the upper node over a PC5 interface, and the ProSe RUE in each relay terminal establishes ProSe communication with the lower node over a PC5 interface. By applying the technical scheme disclosed by the application, the ProSe communication can be realized between two terminals which cannot directly perform the ProSe communication.

Description

Multi-hop relay communication method for near field service
Technical Field
The present application relates to the field of direct communication technologies, and in particular, to a short-range service multi-hop relay communication method.
Background
In a scenario without LTE network coverage, in order to solve near field communication between two terminals, 3GPP proposes a Proximity-based Services (ProSe) technology. ProSe is based on 3GPP LTE, defining a new logical interface PC5, as shown in fig. 1. The two ProSe UEs can communicate in close proximity via the PC5 interface.
The ProSe includes ProSe direct Discovery and ProSe direct Communication, and air interface resources used in the two procedures may be pre-configured.
The PC5 Discovery Plane protocol stack interface is PC5-D, and the existing PC5-D protocol stack is as shown in fig. 2, where UE a and UE B respectively represent two UEs in ProSe direct communication, and the PC5-D protocol stack sequentially includes from bottom to top: a physical layer (PHY), a medium access control layer (MAC), and a proximity services Protocol layer (ProSe Protocol).
As shown in fig. 3, the PC5 Direct Communication signaling plane protocol stack sequentially includes, from bottom to top: PHY, MAC, radio link control layer (RLC), packet data convergence Protocol layer (PDCP), PC5 Signaling Protocol layer (PC 5 Signaling Protocol).
As shown in fig. 4, the PC5 Direct Communication user plane protocol stack sequentially includes, from bottom to top: PHY, MAC, RLC, PDCP, IP, ARP layer, application layer (Application).
At present, 3GPP ProSe only defines short-range communication between two UEs, and if the two UEs are far away, direct communication cannot be performed, which is how to handle this situation, which is a technical problem to be solved urgently.
Disclosure of Invention
The application provides a short-distance service multi-hop relay communication method, which is used for realizing direct communication between two long-distance UE.
The application discloses a short-distance service multi-hop relay communication method, which comprises the following steps:
the first remote terminal and the second remote terminal realize the short-distance service ProSe communication through the relay of at least one relay terminal based on the short-distance service ProSe technology; the first remote terminal and the second remote terminal are two terminals which cannot directly carry out ProSe communication;
each relay terminal is logically divided into two parts: the system comprises ProSe UE and ProSe RUE, wherein the ProSe UE bears the function of a server of a PC5 interface of a previous hop, and the ProSe RUE bears the function of a client of a PC5 interface of a next hop;
the ProSe UE in each relay terminal establishes ProSe communication with the upper node through the PC5 interface, and the ProSe RUE in each relay terminal establishes ProSe communication with the lower node through the PC5 interface.
Preferably, the method further comprises:
adding hop information in a ProSe protocol of a PC5-D protocol stack, broadcasting the hop information of each relay terminal by discovery announcement messages, and acquiring the hop information of other surrounding terminals by receiving the discovery announcement messages broadcast by other surrounding terminals;
and each relay terminal determines the upper and lower nodes according to the hop information of the relay terminal and the hop information of other surrounding terminals.
Preferably, the method for determining the upper and lower nodes includes:
the method comprises the steps that a terminal interconnected with a wired network enters a transmitting state after being started, and sends synchronous data, edge connection-master information block SL-MIB information and a physical edge connection discovery channel PSDCH to surrounding terminals, wherein hop information is set to be 0;
a terminal which is not interconnected with a wired network is started up to enter a receiving state, synchronous data, SL-MIB information and PSDCH are received, if a terminal with 0 hop information is found, the terminal with 0 hop information is selected as a superior relay terminal of the terminal, the hop information of the terminal is set to be 1, otherwise, the terminal with the minimum hop information is selected as the superior relay terminal of the terminal, and the hop information of the terminal is set to be +1 of the hop information of the superior relay terminal; then, transmission is started, and information including hop information of itself is broadcast to the peripheral terminals.
Preferably, the method further comprises:
if two terminals interconnected with the wired network exist in the network, one terminal is used as the terminal interconnected with the wired network for processing, and the other terminal is used as the terminal not interconnected with the wired network for processing.
Preferably, the method further comprises:
dividing a direct discovery resource pool by the multi-hop number of the multi-hop relay communication, and dividing the direct discovery resource pool by taking a subframe as granularity from the angle of a time domain;
dividing a direct communication resource pool by the multi-hop number of the multi-hop relay communication, and dividing the direct communication resource pool by taking a subframe as granularity from the angle of a time domain;
dividing a broadcast/synchronous resource pool by a multi-hop number, and dividing the broadcast/synchronous resource pool by taking a subframe as granularity from the angle of a time domain;
and adopting a time division multiplexing mode for the divided resources, and carrying out resource occupation in a staggered mode by set time offset according to a fixed period.
Preferably, the dividing by the number of multiple hops of the multi-hop relay communication includes: and equally dividing the corresponding resources according to the multi-hop number.
Preferably, the same resource allocation is used for all terminals with the same node sequence number modulo 4 according to the node sequence number of the terminal in the cycle of 40 ms.
Preferably, for a terminal not interconnected with a wired network, the direct communication resource pools used in the air interfaces of the ProSe UE and the ProSe RUE are the same, and the PSDCH and the broadcast/synchronization channel only send one copy on the air interfaces of the ProSe UE and the ProSe RUE.
As can be seen from the above technical solutions, the short-range service multi-hop relay communication method provided in the present application, by introducing the concept of relay communication, logically divides each relay terminal into a ProSe UE that handles the server function of a PC5 interface of a previous hop and a ProSe RUE that handles the client function of a PC5 interface of a next hop, establishes ProSe communication with a higher node through the PC5 interface by the ProSe UE of each relay terminal, and establishes ProSe communication with a lower node through the PC5 interface by the ProSe RUE of each relay terminal, thereby implementing ProSe communication between two terminals that cannot directly perform ProSe communication through the relay of at least one relay terminal.
For the problem of the selection of the superior-subordinate relationship of each relay terminal, the method adds hop information in a ProSe protocol, broadcasts own hop information of the terminals to the surrounding terminals after the terminals interconnected with a wired network are started up to be 0, other terminals not interconnected with the wired network receive the broadcast information of the surrounding terminals after the terminals interconnected with the wired network are started up, selects the terminal with the minimum hop information as the superior-subordinate relay terminal, sets the hop information of the terminal to be +1 of the superior-subordinate relay terminal, and broadcasts the hop information of the terminal to the surrounding terminals, so that the relay terminal can discover the surrounding UE through a direct discovery process after the terminals interconnected with the wired network are started up, detects the hop information of the surrounding UE, and sets the hop information of the relay terminal, thereby solving the problem of the selection of the superior-subordinate relationship of the multi-level relay terminals.
For the problem of air interface resource coordination of each relay terminal, the method fully considers that the PSBCH/SLSS/PSCCH/PSDCH has periodicity, and enables each relay terminal to stagger occupation of related resources at a certain time offset according to a fixed period by dividing a direct communication resource pool, a direct communication resource pool and a broadcast/synchronous resource pool by multi-hop number and dividing the direct communication resource pool, the direct communication resource pool and the broadcast/synchronous resource pool by taking a subframe as granularity from the aspect of a time domain, so that the problem of resource coordination returned by a multi-stage relay terminal is solved.
Drawings
Fig. 1 is a schematic diagram of communication between existing ProSe UEs over a PC5 interface;
FIG. 2 is a diagram of a conventional PC5-D protocol stack;
FIG. 3 is a diagram of a conventional PC5 signaling plane protocol stack;
FIG. 4 is a diagram of a conventional PC5 user plane protocol stack;
fig. 5 is a schematic diagram of a ProSe multi-hop communication method of the present application;
fig. 6 is a schematic diagram of a relay process of the ProSe multi-hop communication method of the present application;
fig. 7 is a schematic flow diagram of ProSe multihop relay communication according to the present application;
FIG. 8 is a diagram illustrating a preferred method for allocating resources to multiple nodes according to the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is further described in detail below by referring to the accompanying drawings and examples.
In order to solve the technical problems existing in the prior art, the application proposes an idea that: when two UEs are far away from each other, whether a Relay (Relay) method can be adopted to support the two UEs to implement communication based on the ProSe technology, however, the existing 3GPP ProSe technology does not support multi-hop communication between the UEs.
To this end, the present application proposes a ProSe multi-hop communication method as shown in fig. 5, see fig. 5:
in the figure, remote UE1 and Remote UE2 respectively represent two UEs with a long distance;
relay UE1, relay UE2 and Relay UE3 in the figure represent several Relay UEs between the Remote UE1 and the Remote UE 2.
In the method shown in fig. 5, the ProSe multi-hop communication process includes:
remote UE1 communicates with Relay UE1 in close range through PC5 interface;
the Relay UE1 carries out near field communication with the Relay UE2 through a PC5 interface;
the Relay UE2 carries out near field communication with the Relay UE3 through a PC5 interface;
the Relay UE3 carries out near field communication with the Remote UE2 through a PC5 interface;
finally, multi-hop communication between Remote UE1 and Remote UE2 is realized through the Relay of Remote UE1, remote UE2 and Remote UE 3.
Referring now to fig. 6, the multi-hop communication illustrated in fig. 5 will be described in further detail. Fig. 6 is a schematic diagram of a relay process of the ProSe multi-hop communication method of the present application, see fig. 6:
in the figure, remote UE1 and Remote UE2 respectively represent two UEs with a long distance;
relay UE1 and Relay UE2 in the figure represent Relay UEs between Remote UE1 and Remote UE 2.
As shown in the figure, each Relay UE can be regarded as two ProSe UEs spliced together, and assumes the server role of the PC5 interface of the previous hop (shown as ProSe UE in the figure) and the client role of the PC5 interface of the next hop (shown as ProSe RUE in the figure), while resource coordination is required between two PC5 interfaces in the same Relay UE.
In fig. 6, remote UE1 establishes near field communication with ProSe UE1 in Relay UE1 through PC5 interface, which is called N-1 hop; here, remote UE1 may also be a Relay UE, and there may be other hops before this, and the principle is the same, and is not described herein again;
then, the ProSe RUE1 in the Relay UE1 establishes near field communication with the ProSe UE2 in the Relay UE2 through the PC5 interface, which is called N-hop;
finally, the ProSe RUE2 in the Relay UE2 establishes near field communication with the Remote UE2 through the PC5 interface, which is called N +1 hop;
thus, after the relay process, 3GPP ProSe multi-hop relay communication between Remote UE1 and Remote UE2 is realized. Of course, the Remote UE2 may also be a Relay UE, and after N +1 hops, N +2 hops may also exist, and the principle of continuing to perform Relay communication is the same, and is not described herein again.
In the multi-hop communication scenario, the following technical problems need to be solved:
1. selecting the superior-subordinate relation of each Relay UE: how to determine an upper node of a current Relay UE, and how to determine a lower node of the current Relay UE?
2. Air interface resource coordination of each Relay UE: during multi-hop communication, subframes of a previous hop PC5 interface and a next hop PC5 interface of the same Relay UE cannot collide.
For the above technical problem, the present application proposes the following solutions:
1. for the upper and lower level relation selection problem of multi-level Relay UE:
the present application adds hop (hop) information to the ProSe Protocol of the PC5-D Protocol stack shown in fig. 2: and each Relay UE broadcasts the ProSe HOP ID of the Relay UE by sending a Discovery Announcement (Discovery Announcement) message and acquires the ProSe HOP IDs of other surrounding UEs by receiving Discovery Announcement messages broadcast by other surrounding UEs. The first level Relay UE may preset ProSe HOP ID =0.
The hop information defined above is used to determine the context of each Relay UE in the subsequent processing, and for details, see the following detailed description.
2. For the PC5 interface resource coordination problem:
since the same terminal cannot transmit a plurality of channels at the same time in the uplink, all uplink channels of the same terminal and channels of different relay terminals need to be time-division multiplexed.
Since the PSBCH/SLSS/PSCCH/PSDCH has periodicity, each node terminal needs to be staggered with a certain time offset according to a fixed period. For this reason, the present application deals with the following three aspects:
1) Usage of Direct Discovery resource pool:
dividing a Direct Discovery resource pool by a multi-hop number, and dividing the Direct Discovery resource pool by taking a subframe as granularity from the angle of a time domain; a particular resource pool is associated with a multi-hop index. For example: the distribution can be carried out equally or proportionally according to the hop count.
2) Use of Direct Communication resource pool:
dividing a Direct Communication resource pool by a multi-hop number, and dividing the Direct Communication resource pool by taking a subframe as granularity from the angle of a time domain; a particular resource pool may be associated with a multi-hop index. For example: the distribution can be carried out equally or proportionally according to the hop count.
3) Use of synchronization resources:
dividing a broadcast/synchronous resource pool by a multi-hop number, and dividing the broadcast/synchronous resource pool by taking a subframe as granularity from the angle of a time domain; a particular resource pool may be associated with a multi-hop index. For example: the distribution can be carried out evenly or in proportion according to the hop count.
3. PC5 related Process
Fig. 7 is a schematic flow chart of ProSe multihop relay communication according to the present application, where the flow chart includes the following steps:
step 1: a terminal interconnected with a wired network (i.e. one side of the terminal is connected with a fixed network and is equivalent to the 0 th hop) enters a transmitting state after being started up, and transmits PSBCH/SLSS/PSDCH according to preconfigured resources, which specifically comprises the following steps: transmitting synchronization data and SL-MIB (side-master information block) information to surrounding terminals, and transmitting PSDCH (Physical side Discovery Channel) to surrounding terminals, wherein ProSe HOP ID =0 is set, and "iam who (who I is)" is broadcasted.
If there are two terminals interconnected with the wired network in the network, one of the terminals is defined as the "terminal interconnected with the wired network" and processed according to the step 1, and the other terminal is defined as the "terminal not interconnected with the wired network" and processed according to the step 2.
Step 2: the terminal which is not interconnected with the wired network is powered on to enter a receiving state, and PSBCH/SLSS/PSDCH is received, namely: and receiving the synchronous signal, the SL-MIB and the PSDCH and confirming surrounding terminals. If the ProSe HOP ID of the surrounding terminal is 0, the ProSe HOP ID of the terminal is set to be 1, the resource of the node is confirmed according to the global pre-configuration table, the sending is started, and the self information is broadcasted to other terminals. The global configuration table is used for configuring the resources of each node. The operation of the following nodes is analogized.
For a terminal not interconnected with a wired network, the PSCCH and PSSCH resource pools used in the air interfaces of the front and rear nodes (namely, proSe UE and ProSe RUE in the terminal) are the same, but only one PSDCH and PSBCH/SLSS are transmitted on the air interfaces of the front and rear nodes.
Based on the mechanism, the Relay UE discovers peripheral UE through a Direct Discovery (Direct Discovery) process when starting up, and monitors the ProSe HOP ID in the Discovery notification message of the peripheral UE;
then, selecting the Relay UE with the minimum ProSe HOP ID value as the upper Relay UE of the Relay UE;
finally, the Relay UE sets its own ProSe HOP ID as the HOP count +1 of the superior Relay UE (i.e. the HOP information +1 of the superior Relay UE), and broadcasts its own ProSe HOP ID through a Discovery notification message.
Therefore, the problem of the selection of the upper and lower level relations of the multi-level Relay UE is solved.
In addition, the Discovery resources and the Communication resources of the previous hop PC5 interface and the next hop PC5 interface of the multi-hop Communication and other resources are coordinated and distributed in a time division manner, so that the problem of the coordination of the multi-level Relay UE return resources is solved. The Discovery resource is used by PSDCH, and the Communication resource is used by PSCCH/PSSCH.
The technical solution of the present application is illustrated by a specific example.
Considering that the PSBCH period is 40ms, in order to avoid waste in resource allocation configuration, the present embodiment sets 40ms as a period, and each node terminal specifies according to the protocol:
1. the PSCCH is fixedly transmitted for 2 times and occupies 2 subframes;
2. the PSSCH is fixedly transmitted for 2 times, and occupies 4 subframes at minimum;
3. the PSDCH repeated sending times can be configured (the value range is 0-3), and the PSDCH repeated sending times are configured according to 3 subframes occupied;
4. the PSBCH is transmitted 1 time, occupying 1 subframe.
As can be seen from the above, a node terminal needs to occupy 10 subframes at minimum, and 40ms may include 4 nodes, and if the number of the nodes exceeds 4, the time domain resources may be recycled, and all nodes with the same result according to the node sequence number being the node sequence number MOD 4 use the same resource configuration, as shown in fig. 8:
the 10M bandwidth is taken as an example in the figure for explanation, and the frequency domain is 0 to 49 RBs;
in the time domain, one period is 40ms, and 0 to 39 subframes in one period are shown in the figure.
The channel transmission condition of the node 1 is as follows:
the PDSCH of node 1 may be repeatedly transmitted three times in 3 subframes as indicated by the box occupied by D-0-Tx in the figure;
the PSCCH of node 1 may be sent repeatedly twice in 2 subframes, as shown by the box occupied by PSCCH-0-Tx in the figure;
the PSSCH of node 1 can be repeatedly transmitted four times in 4 subframes, as indicated by the box occupied by PSSCH-0-Tx in the figure;
the PSBCH of node 1 is transmitted in only 1 subframe, as indicated by the box occupied by PSBCH0/SLSS0 in the figure.
The channel transmission condition of the node 4 is as follows:
the PDSCH of node 4 may be repeatedly transmitted three times in 3 subframes as indicated by the box occupied by D-3-Tx in the figure;
the PSCCH of node 4 may be repeatedly transmitted twice in 2 subframes, as shown by the box occupied by PSCCH-3-Tx in the figure;
the PSSCH of node 4 can be sent repeatedly four times in 4 subframes, as shown by the box occupied by PSSCH-3-Tx;
the PSBCH of node 4 is transmitted in only 1 subframe, as indicated by the box occupied by PSBCH3/SLSS3 in the figure.
For the other nodes, processing is performed in a similar manner as described above.
The above description is only exemplary of the present application and should not be taken as limiting the present application, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present application should be included in the scope of protection of the present application.

Claims (6)

1. A short-distance service multi-hop relay communication method is characterized by comprising the following steps:
the first remote terminal and the second remote terminal realize the ProSe communication of the short-distance service through the relay of at least one relay terminal based on the ProSe technology of the short-distance service; the first remote terminal and the second remote terminal are two terminals which cannot directly carry out ProSe communication;
each relay terminal is logically divided into two parts: the system comprises ProSe UE and ProSe RUE, wherein the ProSe UE bears the function of a server of a PC5 interface of a previous hop, and the ProSe RUE bears the function of a client of a PC5 interface of a next hop;
the ProSe UE in each relay terminal establishes the ProSe communication with the superior node through the PC5 interface, and the ProSe RUE in each relay terminal establishes the ProSe communication with the subordinate node through the PC5 interface;
the method further comprises the following steps:
adding hop information in a ProSe protocol of a PC5-D protocol stack, broadcasting the hop information of each relay terminal by discovery announcement messages, and acquiring the hop information of other surrounding terminals by receiving the discovery announcement messages broadcast by other surrounding terminals;
each relay terminal determines an upper node and a lower node according to the hop information of the relay terminal and the hop information of other surrounding terminals;
the method for determining the upper and lower nodes comprises the following steps:
the method comprises the steps that a terminal interconnected with a wired network enters a transmitting state after being started, and sends synchronous data, edge connection-master information block SL-MIB information and a physical edge connection discovery channel PSDCH to surrounding terminals, wherein hop information is set to be 0;
a terminal which is not interconnected with a wired network is started up to enter a receiving state, synchronous data, SL-MIB information and PSDCH are received, if a terminal with 0 hop information is found, the terminal with 0 hop information is selected as a superior relay terminal of the terminal, the hop information of the terminal is set to be 1, otherwise, the terminal with the minimum hop information is selected as the superior relay terminal of the terminal, and the hop information of the terminal is set to be +1 of the hop information of the superior relay terminal; then, transmission is started, and information including hop information of itself is broadcast to the peripheral terminals.
2. The method of claim 1, further comprising:
if two terminals interconnected with the wired network exist in the network, one terminal is used as the terminal interconnected with the wired network for processing, and the other terminal is used as the terminal not interconnected with the wired network for processing.
3. The method of claim 1, further comprising:
dividing a direct discovery resource pool by the multi-hop number of the multi-hop relay communication, and dividing the direct discovery resource pool by taking a subframe as granularity from the angle of a time domain;
dividing a direct communication resource pool by the multi-hop number of the multi-hop relay communication, and dividing the direct communication resource pool by taking a subframe as granularity from the angle of a time domain;
dividing a broadcast/synchronous resource pool by a multi-hop number, and dividing the broadcast/synchronous resource pool by taking a subframe as granularity from the angle of a time domain;
and for the divided resources, a time division multiplexing mode is adopted, and the resources are occupied in a staggered mode by setting time offset according to a fixed period.
4. The method of claim 3, wherein:
the dividing by the number of hops of the multi-hop relay communication includes: and averaging the corresponding resources according to the multi-hop number.
5. The method of claim 4, wherein:
and taking 40 milliseconds as a period, and using the same resource configuration for all terminals with the same node serial number modulo 4 according to the node serial numbers of the terminals.
6. The method according to any one of claims 3 to 5, wherein:
for terminals which are not interconnected with a wired network, the direct communication resource pools used in the air interfaces of the ProSe UE and the ProSe RUE are the same, and the PSDCH and the broadcast/synchronization channel only send one part on the air interfaces of the ProSe UE and the ProSe RUE.
CN202010402502.2A 2020-05-13 2020-05-13 Multi-hop relay communication method for near field service Active CN113676845B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010402502.2A CN113676845B (en) 2020-05-13 2020-05-13 Multi-hop relay communication method for near field service

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010402502.2A CN113676845B (en) 2020-05-13 2020-05-13 Multi-hop relay communication method for near field service

Publications (2)

Publication Number Publication Date
CN113676845A CN113676845A (en) 2021-11-19
CN113676845B true CN113676845B (en) 2023-04-04

Family

ID=78536902

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010402502.2A Active CN113676845B (en) 2020-05-13 2020-05-13 Multi-hop relay communication method for near field service

Country Status (1)

Country Link
CN (1) CN113676845B (en)

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11284337B2 (en) * 2015-03-27 2022-03-22 Qualcomm Incorporated Selection of proximity services relay
EP3627723A1 (en) * 2015-07-24 2020-03-25 Panasonic Intellectual Property Corporation of America Improved prose relay ue activation
WO2017099833A1 (en) * 2015-12-11 2017-06-15 Intel IP Corporation Control plane enhancements over sidelink for low power devices
GB2548374A (en) * 2016-03-16 2017-09-20 Nec Corp Communication system
CN108024295B (en) * 2016-11-03 2022-04-19 中兴通讯股份有限公司 Relay transfer method and device, terminal and base station

Also Published As

Publication number Publication date
CN113676845A (en) 2021-11-19

Similar Documents

Publication Publication Date Title
CN110572838B (en) Communication method, terminal equipment and network side equipment
TWI735216B (en) Methods and user equipment for coverage extension
US11737133B2 (en) QoS guarantee for high priority low latency service
US8144604B2 (en) Method and system for allocating multiple channels in a mesh network
JP2020109984A (en) Resource selection method for v2x operation of terminal in wireless communication system and terminal using the method
JP6568574B2 (en) Communication device and method
WO2016138822A1 (en) Method and device for processing resources
KR102087656B1 (en) Method and apparatus for distributed scheduling of resources in a device to divice communication system
JP5427232B2 (en) MAC protocol for multi-channel wireless networks
JP2019216436A (en) User equipment, base station, method, and program
CN100444679C (en) Channel distributing method in mixed network
MXPA06012761A (en) Adaptive beacon period in a distributed network.
WO2016202227A1 (en) Selection and notification method and device for layer 2 link identifier
US10932228B2 (en) Communication method and terminal
JP2016506176A (en) Multi-enterprise device multicasting or broadcasting communication
CN105165106A (en) Systems and methods for peer-to-peer and AP traffic multiplexing
JP2017507528A (en) Communication device and method
TW201531134A (en) Base station and device to device user equipment for a wireless communication system
EP3836578A1 (en) Direct link communication method, terminal, and network device
CN106162734B (en) Resource configuration method and device
CN108337297A (en) Operating method in point to point wireless communication network and its communication equipment
WO2015188571A1 (en) Wireless network communication method, access device and user equipment
WO2013173505A1 (en) Distributed interference management algorithm
CN110557831A (en) Transmission method and equipment for control plane information in simulcast SC-PTM system
JP2017524304A (en) Capability information reporting, processing method and apparatus for supporting proximity services

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant