CN104956751A - Fast device discovery for device to device communication - Google Patents

Fast device discovery for device to device communication Download PDF

Info

Publication number
CN104956751A
CN104956751A CN201480005855.1A CN201480005855A CN104956751A CN 104956751 A CN104956751 A CN 104956751A CN 201480005855 A CN201480005855 A CN 201480005855A CN 104956751 A CN104956751 A CN 104956751A
Authority
CN
China
Prior art keywords
discovery
beacon
distributed resources
resources
resource
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.)
Granted
Application number
CN201480005855.1A
Other languages
Chinese (zh)
Other versions
CN104956751B (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.)
Zhou Junting
MediaTek Singapore Pte Ltd
Original Assignee
MediaTek Singapore Pte 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 MediaTek Singapore Pte Ltd filed Critical MediaTek Singapore Pte Ltd
Publication of CN104956751A publication Critical patent/CN104956751A/en
Application granted granted Critical
Publication of CN104956751B publication Critical patent/CN104956751B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/005—Discovery of network devices, e.g. terminals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0032—Distributed allocation, i.e. involving a plurality of allocating devices, each making partial allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0058—Allocation criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/08—Access restriction or access information delivery, e.g. discovery data delivery
    • H04W48/12—Access restriction or access information delivery, e.g. discovery data delivery using downlink control channel
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02—Power saving arrangements
    • H04W52/0209—Power saving arrangements in terminal devices
    • H04W52/0212—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave
    • H04W52/0216—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave using a pre-established activity schedule, e.g. traffic indication frame
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/02—Power saving arrangements
    • H04W52/0209—Power saving arrangements in terminal devices
    • H04W52/0212—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave
    • H04W52/0219—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave where the power saving management affects multiple terminals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/16—Discovering, processing access restriction or access information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/21—Control channels or signalling for resource management in the uplink direction of a wireless link, i.e. towards the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W92/00—Interfaces specially adapted for wireless communication networks
    • H04W92/16—Interfaces between hierarchically similar devices
    • H04W92/18—Interfaces between hierarchically similar devices between terminal devices
    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Databases & Information Systems (AREA)
  • Computer Security & Cryptography (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

A fast device discovery protocol with a high success rate for device-to-device (D2D) communication in LTE-A networks is proposed. With the proposed protocol, device discovery is done by monitoring a randomly transmitted beacon from other devices within a pre-defined period. In one embodiment, an eNB receives scheduling requests from D2D UEs and in response allocates a distributed uplink resource for random access of beacon transmission by the D2D UEs. The distributed resource is dynamically allocated based on the number of requesting D2D UEs, a discovery period, and a target discovery probability to minimize the required resource.

Description

Fast device discovery for D2D communication
Cross Reference to Related Applications
The present application is entitled "Fast Device Discovery for Device to Device communication for D2D communication" application No. 61/756,046, filed 2013, month 1, 24, § 119, in accordance with 35u.s.c. § 119; the subject matter of this application is hereby incorporated by reference.
Technical Field
Embodiments of the present invention relate generally to device-to-device (D2D) wireless communication systems and, more particularly, to fast device discovery (discovery) for D2D communications.
Background
With the prevalence of wireless devices, 3G and 3.5G technologies no longer support continuous full-sheet of wireless applications and services. Therefore, 3GPP proposes Long Term Evolution (LTE) as a new network standard to solve the above-mentioned problems. After LTE Release 10(Release 10, R10), LTE is further improved to LTE-enhanced (LTE-a), which is considered a 4G standard. In LTE-a, new technologies including enhancements for diverse data applications (eDDA), multiple-Input multiple-Output (MIMO), Carrier Aggregation (CA), small cell (small cell), and D2D communication are proposed to improve network capacity and efficiency.
Of these new technologies, D2D is considered to be a key enabling technology for facilitating machine-to-machine (M2M) communication in LTE-a. In future M2M communications, a large number of (sheet number) machines need to communicate with each other for diverse applications, such as home, or office automation, intelligent vehicle (intelligent vehicle) or transportation (transportation) systems, or intelligent power monitoring (power monitoring). The control and data traffic brought by the above-described machines, if injected directly into the LTE network, can overwhelm the network and reduce the effectiveness of human-to-human (H2H) communications in existence. With the help of LTE-A D2D communication, multiple machines (i.e., multiple users in LTE-a) in proximity (immediate) can communicate directly and locally, and the impact on the LTE architecture is reduced. Furthermore, the multiple machines themselves also benefit from D2D communications due to the shorter communication delays. Further, higher data rates may be supported while consuming less power due to better channel quality and shorter physical distances between nearby machines.
D2D communication has been widely discussed in 3GPP conferences. A research project "proximity-based Service (ProSe)" is created in 3GPP Technical Specification Group Service and System accessories 1 (TSG-SA 1) conference #55, and several usage scenarios are defined. Although different scenarios have their own needs, a common set of functions is always required. For example, nearby UEs must be able to discover (discover) each other (i.e., peer discovery). In existing LTE networks, nearby enbs are found to be through synchronization signals (PSS/SSS), and multiple UEs can only connect to them through random access procedures on PRACH. Therefore, a new mechanism-possibly with the assistance of an eNB-is needed for peer discovery. The peer discovery may be classified into two types according to whether the D2D UE has an existing online (session). If multiple UEs do not have sessions, then multiple UEs may need to broadcast signals to identify themselves, which is treated as a beacon (beacon) to let other UEs know of their presence. Since a plurality of UEs perform peer discovery by themselves, the impact on the core network is small. This type of discovery is more suitable for M2M. However, sending beacons is a power saving, which is a critical issue for M2M, especially when multiple UEs blindly send beacons.
FlashLinQ is a reservation-based peer discovery method, which is not designed based on LTE-a. Devices using this approach require global (globalley) synchronization. The bandwidth used based on reservation is 5MHz and one discovery repetition (repetition) period is 8 seconds. Further, the resource is further divided into 3584 Peer Discovery Resource IDs (PDRIDs) in one iteration. When a device enters the network, the device senses (sense) to the channel and selects a PDRID with low signal power for sending beacons to avoid collisions (collision). The device then listens for beacons for the remainder of the repetition. The time that the UE uses to send a beacon in each repetition may be shifted (shift) differently based on the selected PDRID. The objective is to avoid that half-duplex UEs always transmit at the same time and cannot find each other.
Although FlashLinQ states that about 1000 devices can be found by one device in 10 seconds, there are still some implications (salient). First, since each device must reserve a dedicated (freed) PDRID for itself, the free PDRIDs are different from place to place. If two distant (faraway) devices choose the same PDRID, there is a collision once they are close. Although multiple devices may detect collisions and reselect to other PDRIDs, the likelihood that they will select the same PDRID again remains high. Because they perceive the same region, then the optimized idle PDRID that they perceive is the same. Therefore, the collision in the case where a plurality of devices have mobility appears too much for the above-described plurality of devices to handle. The efficiency found is therefore low. Second, when a device enters the network, the time wasted sensing the channel is long. This may also lead to collisions. The probability that at least two nearby devices are turned on for discovery in one repetition is not low. After perception, they can select the same optimized idle PDRID with a high probability and cause a collision.
A solution for peer discovery for D2D communication in LTE-a networks is needed.
Disclosure of Invention
The invention provides a device discovery method for D2D communication in an LTE-A network. A new distributed random access protocol is proposed for multiple UEs to broadcast their presence. A data model is developed so that the eNB can dynamically adjust its resource allocation for device discovery based on the number of requesting D2D UEs. Therefore, multiple enbs may minimize the required resources while obtaining the target discovery probability. The proposed protocol may enable various M2M applications in LTE-a networks because of its scalability (scalability) and mobility support.
In one novel aspect, multiple UEs randomly select one resource block for beacon transmission during a particular beacon period, and repeat (again and again) in subsequent repetitions (repetition). Therefore, upon collision, a large number of UEs can reselect in all RBs of one beacon period. The probability of a UE collision over and over is low compared to FlashLinQ. Multiple UEs also do not need to detect collisions because there is a new start for each repetition. Further, the waiting time of a plurality of UEs after joining (join) to the network is short. The eNB allocates resources immediately after each UE request and multiple UEs need not waste operation on the cognitive channel. To further increase successful beacon transmissions, the settings for beacon transmissions may be adjusted by the network on a case-by-case basis to increase the success rate probability as high as possible.
In one embodiment, the eNB receives scheduling requests from a plurality of D2D UEs and, in response, allocates distributed UL resources for beacon transmission of the plurality of D2D UEs. The distributed resource contains k RD's per t slots, and one beacon period contains N times t slots. One UE randomly selects one RD for beacon transmission in one beacon period. If discovery fails, the UE randomly selects another RD for beacon transmission in the next beacon period, and so on until the UE is discovered by another UE. The eNB dynamically allocates distributed resources (e.g., selects k, t, and N) to minimize the required resources based on the number of requesting D2D UEs, the discovery period, and the target discovery probability. In one example, a very high 0.99% probability may be achieved in one second for 50 UEs using only 1% of UL resource D2D.
Other embodiments and advantages of the present invention are described in detail below. The summary is not intended to limit the scope of the invention.
Drawings
Like numerals in the drawings denote like elements for illustrating embodiments of the present invention.
Figure 1 is a schematic diagram of an LTE-a network with D2D communication, in accordance with one novel aspect.
Figure 2 is a block diagram of an eNB and UE for D2D peer discovery, in accordance with one novel aspect.
Figure 3 is a diagram illustrating a D2D communication process in an LTE-a network, in accordance with one novel aspect.
Figure 4 is a diagram of distributed UL resource allocation for D2D peer discovery, in accordance with one novel aspect.
Fig. 5 is a data model of D2D peer discovery probability for a client-server service.
Fig. 6 is a schematic diagram of optimized resource allocation for D2D peer discovery for master-slave service.
Fig. 7 is a data model of D2D peer discovery probability for peer-to-peer (peer-to-peer) services.
Fig. 8 is a schematic diagram of D2D peer discovery optimized resource allocation for end-to-end service.
Fig. 9 is a diagram illustrating simulation results of the proposed discovery performance using different SINR decoding methods.
Fig. 10 is a diagram of simulation results of the discovery performance of the proposed method compared to the FlashLinQ method.
Figure 11 is a flow diagram of a method for D2D peer discovery from an eNB perspective, in accordance with one novel aspect.
Figure 12 is a flow diagram of a method for D2D peer discovery from a UE perspective, in accordance with one novel aspect.
Detailed Description
The present invention will be described with reference to the following detailed embodiments, which are illustrated in the accompanying drawings.
Figure 1 is a schematic diagram of an LTE-a communication network 100 with D2D communication, in accordance with one novel aspect. The wireless communication network 100 includes a base station eNB101, a first D2D user equipment UE1, and a second D2D user equipment UE 2. The UE1 and UE1 may communicate by transmitting UL data to the eNB101 or receiving DL data from the eNB 101. D2D communication is proposed for improving network capacity and performance in LTE-a networks because multiple D2D UEs in close proximity can communicate directly and locally with each other. For example, UE1 and UE2 may communicate directly after initial discovery and session setup (setup). However, in order to support D2D communication in LTE-a, all relevant mechanisms, protocols and signal formats have to be studied under the framework of the existing LTE-a architecture. For example, the eNB101 may control all radio resources and not allow any messages to be sent by the allowed UEs 1 and UEs 2 of the eNB 101. Therefore, in order to initiate device discovery for D2D communication, each D2D UE must send a D2D Scheduling Request (SR) and in response receive a UL grant (grant) from the network allocated UL resources.
In one novel aspect, a fast discovery protocol with high success rate in LTE-a networks is provided. Using the provided protocol, device discovery is performed by monitoring beacons transmitted by other devices during a predefined beacon period. In one embodiment, the UE1/UE2 first sends a D2D scheduling request to the eNB 101. After receiving the scheduling request, the eNB101 decides distributed resources to allocate for beacon transmission by the UE1/UE 2. UE1/UE2 then randomly selects one RB from the distributed resources for beacon transmission within a predefined beacon period. The distributed resources are dynamically decided based on D2D parameters, such as the number of devices, discovery period (discovery period), target discovery probability (target discovery probability), etc., to substantially (substentially) minimize the required resources.
Figure 2 is a block diagram of an eNB201 and a UE202 for D2D peer discovery, in accordance with one novel aspect. The base station eNB201 has an RF transceiver module 212 coupled to the antenna 211, receiving RF signals from the antenna 211, converting them to baseband signals and sending them to a processor 214. The RF transceiver 212 will also receive the baseband signal from the processor 214, convert it to an RF signal, and then transmit it to the antenna 211. The processor 214 processes the received baseband signal and activates the different functional modules of the eNB to perform the functions. The memory 215 stores program instructions and data to control the operation of the eNB. Similarly, the UE202 has an RF transceiver module 222 coupled to the antenna 221, which receives RF signals from the antenna 221, converts them to baseband signals, and sends them to the processor 224. The RF transceiver 222 also converts the baseband signal received by the processor 224 into an RF signal and transmits the RF signal to the antenna 221. The processor 224 processes the received baseband signals and activates the different functional modules to implement the functions of the UE. The memory 225 stores program instructions and data to control the operation of the UE.
Functional blocks may be implemented in hardware, firmware, software, or a combination thereof. The functional modules, when executed by the processors 214 and 224 (e.g., by execution of program code in memories 215 and 225, respectively), allow the eNB201 to allocate UL resources for the UE202 to initiate peer discovery for D2D communication purposes. In the example of fig. 2, the discovery module 223 in the UE202 initiates the device discovery process by sending a D2D Scheduling Request (SR) to the eNB201, and the resource allocation module 214 in the eNB201 allocates distributed resources to the UE202 for beacon transmission. The distributed resources, as depicted in block 230 of fig. 2, comprise k Resource Blocks (RBs) per t slots, and N slots in each RB in a beacon period. For each beacon transmission, UE202 randomly selects one RB from k times N RBs in one beacon period. The UE202 may repeat such random access for beacon transmission until the UE202 is successfully discovered by its peer D2D device.
Figure 3 is a diagram illustrating a D2D communication process in an LTE-a network, in accordance with one novel aspect. In step 311, the eNB301 receives multiple D2D Scheduling Requests (SRs) for beacon transmission from multiple D2D UEs, UE1, UE2 … … UEm to initiate D2D discovery. The D2D SR may follow a similar procedure as specified in the LTE specifications, transmitted on the Random Access Channel (RACH), with some additional information to indicate D2D beacon transmission. For example, D2D SR may also include D2D discovery parameters, such as discovery period and target discovery probability. Based on the SR, eNB301 decides UL resource allocation for D2D discovery. For example, UL resources may be decided based on the total number of D2D UEs requiring beacon transmission, the discovery period, and the target discovery probability. The allocated UL resources are distributed in such a way that minimal resources are required to meet the same D2D discovery performance. After the eNB301 allocates UL resources for beacon transmission, a plurality of UEs initiate D2D peer discovery by sending and receiving beacons (steps 321-322). In one predefined beacon period, a beacon is sent by one D2D UE and no feedback is required from the receiving UE. Each D2D UE may repeat beacon transmission for multiple beacon periods until successfully discovered by other D2D UEs, or by an upper layer (higher layer), or a maximum number of transmissions is reached. For example, when the UE1 receives a beacon from another UE2, the UE1 detects that the UE2 is in the vicinity of the UE1 and can reply to the UE2 and establish a session with the UE2 with the help of the eNB 301. Finally, in step 331-332, the multiple UEs start D2D communication directly with each other.
Figure 4 is a diagram of a distributed UL resource allocation method for D2D peer discovery, in accordance with one novel aspect. In LTE-a, Time Division Duplex (TDD) and Frequency Division Duplex (FDD) are supported. In TDD or FDD, transmission is further divided into DL, i.e. from eNB to UE, and UL, i.e. from UE to eNB. The DL and UL time is divided into 10 ms frames. As shown in fig. 4, one frame includes 10 subframes for DL and 10 subframes for UL. Each subframe is further divided into two slots. Each slot contains 7 OFDM symbols in the time domain and several RBs divided into the frequency domain. One RB contains 12 subframes of 15kHz, and the RB is a basic resource allocation unit for data transmission of LTE-a. The number of RBs in each cell depends on the bandwidth size. Take a 5MHz cell as an example. There are 25 RBs in one slot. The size of the load per slot depends on the MCS, which is specified for the eNB. If QPSK and 1/2 code rates are used, the size of each RB transmission is 84 bits if MIMO and carrier aggregation techniques are not considered. In the following discussion, FDD is an example for peer discovery, while TDD is also available. In addition, the discovery signal is transmitted on a data Channel of the UL subframe, a Physical UL Shared Channel (PUSCH). Alternatively, the discovery signal may also be transmitted on a Physical Random Access Channel (PRACH).
In LTE-a, Semi-Persistent Scheduling (SPS) and per Transmission Time Interval (per-TTI) Scheduling are supported. When per-TTI scheduling is used, the eNB dynamically schedules each transmission for each UE. In most cases, per-TTI scheduling is used because multiple enbs can allocate resources based on the reporting of a Channel Quality Indicator (CQI) for each subframe. While per-TTI scheduling is used for bursty (burst) data transmissions, it is less used for real-time applications such as voice calls (voice calls). The data rate for these applications is low and at regular intervals the overhead of scheduling messages is high. On the other hand, when SPS is used, the semi-persistent transmission pattern (pattern) is scheduling for a stream (stream), not for a single transmission. When the eNB decides to configure the UE with UL semi-persistent resources, the eNB schedules the UL grant using the semi-persistent scheduling C-RNTI of the UE. This significantly reduces the scheduling overhead.
According to one novel aspect, after receiving the D2D SR, the eNB allocates semi-persistent resources for all requesting UEs to reduce signaling overhead in per-TTI scheduling. As shown in fig. 4, the eNB allocates k RBs in every t slots. Each beacon period TBIn (1), there are N allocated time slots, where TBN × t. That is, at a TBIn (b), there are (k × N) RBs for all requesting UEs that need to transmit beacons. To increase the frequency diversity of beacon transmissions, the scheduled RBs need to hop in the frequency domain. First, the eNB sets a Frequency Hopping (FH) flag (flag) to 1 and a resource allocation header (header) to 0(UL resource allocation type 0) in a Downlink Control Information (DCI) format 0. Second, the eNB sets a PUSCH hopping type to type 2 (pseudo-random hopping between sub-bands). Finally, the eNB informs the plurality of UEs of the scheduled RBs.
After receiving the UL grant from the beacon transmission in each beacon period TB, each UE randomly selects one of (k × N) scheduled RBs for transmitting its beacon. Thus, each UE transmits only one beacon per beacon period. Since no carrier sensing, or collision detection mechanism is used, collisions may occur in the beacon transmissions. The success rate of beacon transmission is thus dependent on the number of UEs in a cell (m) calculated for the beacon resources, the total number of resources of a beacon period being (k × N), and the length T of a beacon periodB(N × t). Thus, with sufficient resources, the success rate can be improved. However, an increase in required resources (k × N) is not allowed, especially in one cell, with hundreds of machines (machines) connected to one eNB. Except that the required resource ratio R can be as low as possible. Resource(s)The ratio can be expressed by the following formula:
wherein,is the total number of UL RBs in each slot in the cell. Therefore, there is a balance (tradeoff) between the successful discovery rate for D2D peer discovery and the required resource ratio.
Generally, the goal is to ensure that two UEs can discover each other as soon as possible while keeping the required resources as low as possible. Therefore, a performance metric (metric) that takes into account the successful discovery rate and the required resource ratio is required. The purpose of the evaluation (evaluation) is to find the best settings in different usage scenarios and different numbers of D2D UEs. It may be noted that the targets differ for different usage scenarios. In one example, M2M is Based on Location-Based Service (LBS), machines, such as a smart parking (parking) timer (meter), broadcast their presence. Since only the parking meter sends messages to the devices in the vehicle, this service is classified as a client-server based service. The amount of parking space in a parking lot is typically large, so the allocated resources must be sufficient to support the beacon transmission of the parking meter. In another example, in a vehicular ad-hoc network (VANET), a sensor (sensor) in a vehicle detects a sensor in a nearby vehicle. All sensors can send and receive messages from other sensors, so these services are classified as peer-to-peer (peer-to-peer) services. The success rate of beacon transmission must be high and the discovery time must be short so that the driver can take action to avoid an accident.
Fig. 5 is a mathematical model of D2D peer discovery probability for a master-slave service. In a master-slave service, there are m server (server) UEs (e.g., bookstore or Cafe (Cafe)) sending messages to other UEs (e.g.,UE 3). When only one UE transmits a beacon in a particular RB, then the beacon transmission is considered successful. For each server UEi (i ═ 1,2 … m), TBProbability p of successful beacon transmission within one beacon period in a time slotiComprises the following steps:
thus, if the period is found to be TDOne slot, then at TDIn each time slot, for UEi, the success rate PDI.e. the probability of at least one successful beacon transmission can be expressed as:
in order to obtain a target discovery probability PD-TAGETTo minimize the optimal (optimal) setting of the resource ratio R, t can be derived as follows:
based on t, R can be rewritten as:
using m, T of a given setD,And PD-TAGETInstead of x ═ k × N, the optimization setting (k, N, t) can be derived from the following equation:
fig. 6 is a schematic diagram of D2D peer discovery optimized resource allocation for master-slave service. In the example of fig. 6, the D2D service device has a transmission range with a radius of 10m, and the D2D client (client) device has a movement rate of 5km per hour (e.g., walking). Therefore, the discovery period TDCan be calculated as TD14.4 seconds. It is also assumed that there are 5MHz cellsAnd UL resources. In the table 600 of fig. 6, different target discovery probabilities and different numbers of servers UE m may be considered for calculating the optimal setting (k, N, t) of the minimum resource ratio R. For example, listing two target discovery probabilities PD-TAGET0.8 and 0.95, and listing different numbers of server UEs, m 50,100,200,300,400 and 500.
Fig. 7 is a diagram of a mathematical model of D2D peer discovery probability for end-to-end service. In end-to-end service, each UE (e.g., UE1-UE4) discovers and is discovered by other UEs. Therefore, a plurality of UEs transmit beacons and also receive beacons. Note that there is a half-duplex problem. If two UEs transmit beacons at the same time, then they cannot find each other if they transmit beacons on different RBs. That is, if UE j receives the beacon of UE i, this means that all other (m-2) UEs cannot select the same RB as UE i, considering the beacon resources allocated in FIG. 4. In addition, UE j must select an RB in a different slot. The number of choices that UE j can choose is k N-k. Therefore, the probability p that UE j (j 1, 2...., m) finds UE i (i 1, 2...., m, j ≠ i) in one beacon period in one sloti,jComprises the following steps:
thus, if the period is found to be TDA time slot, then at TDIn a timeslot, UE j (j 1, 2.. times, m) finds UE i (i 1, 2.. times, m, j ≠ m)i) The probability of (c) is:
the optimal settings for the master-slave service can be obtained in the same way.
Fig. 8 is a schematic diagram of D2D peer discovery optimized resource allocation for peer-to-peer. In the example of fig. 8, consider the discovery period TD1 second case, and in a 5MHz cellAnd (4) resources. In the table 800 of fig. 8, different target discovery probabilities and different numbers of servers UEm are considered for calculating the optimized settings (k, N, t) in the minimized resource ratio R. By way of example, two target discovery probabilities P are listedD-TAGET0.97 and 0.99, and also lists four different numbers of UEs m 50,100,150 and 200. It can be noted that there is a half-duplex problem. Therefore, an increase in k may not significantly increase the success rate. Therefore, the parameter t is increased to increase the success rate. In the example of fig. 8, it can be seen that a very high discovery probability of 0.99% can be obtained for 50D 2D UEs that are only applicable with 1% UL resources within 1 second.
Fig. 9 is a diagram illustrating simulation results of the proposed discovery performance using different SINR decoding methods. In the example of fig. 9, consider an end-to-end service. One hundred UEs (m 100) are randomly distributed at 100x100m2In the region. The maximum UE speed is 0.8m/s and the transmission power is 23 dBm. The path loss model is 135.5+40.0log (d) dB, where d is the distance in kilometers. It is assumed that all UEs start discovery at the same time. Figure 9 depicts several efficacy curves for discovery versus comparative discovery time (discovery ratio vs. discovery time) in such an environment. For the analysis results, SINR decoding is not used, meaning that the UE listening to the RB cannot decode any collision beacon. On the other hand, a UE listening to an RB can detect a beacon from a set of colliding beacons with SINR decoding if the received SINR is above a specified threshold. Threshold valueThe lower the efficiency, the better.
Fig. 10 is a schematic diagram of the results of a simulation of the discovery performance of the proposed method compared to the FlashLinQ method. Figure 10 gives three discovered efficacy curves. Curve 1001 depicts the performance of the Reactivation Reselection (RR) of the FlashLinQ method, curve 1002 depicts the performance of the Unconditional Reselection (UR) of the FlashLinQ method, and curve 1003 depicts the performance of the proposed method. It can be seen that the proposed method is better than the FlashLinQ sensing method. This is because the proposed D2D discovery protocol allows each UE to randomly select a different RB without requiring a perceptual overhead. Furthermore, local collisions are reduced and less power consumption with respect to perception is obtained.
Figure 11 is a flow diagram of a method for D2D discovery from an eNB perspective, in accordance with one novel aspect. In step 1101, a base station receives one or more D2D Scheduling Requests (SRs) in a wireless communication network. In step 1102, the base station obtains D2D discovery parameters and accordingly decides UL resource allocation accordingly. The D2D discovery information contains the total number of D2D devices that need beacon transmission, the discovery period, and the target discovery probability. In step 1103, the base station sends an UL grant to multiple D2D devices for beacon transmission. The UL grant allocates distributed resources for random access for D2D device beacon transmissions. The distributed resource includes a plurality of RBs distributed in a frequency domain of the subcarriers and a time domain of the slot. In one embodiment, the distributed resources contain k RBs in every t slots. In the beacon period of one (N × t) slot, (k × N) RBs are allocated, and one D2D device randomly selects one RB from the allocated (k × N) RBs for beacon transmission. The values of k, t, N are dynamically determined by the base station to minimize the required resources substantially under the same D2D discovery parameters.
Figure 12 is a flow diagram of a method for peer discovery from a UE perspective D2D, in accordance with one novel aspect. In step 1201, the D2D UE sends an SR to a base station in the wireless communication network. In step 1202, the UE receives a UL grant from a base station. The UL grant allocates distributed resources for random access for beacon transmissions. In step 1203, the UE sends a first beacon to the other UEs on a first RB, where the first RB is randomly selected from distributed resources in a first beacon period. In step 1204, the UE continues to transmit multiple beacons to the other multiple D2D UEs on multiple RBs in the subsequent multiple beacon periods. Each beacon is transmitted on a randomly selected RB from the distributed resources in each beacon period. The UE continues beacon transmission for D2D discovery until the UE is stopped by upper layers, receives responses from other multiple D2D UEs, or reaches a maximum number of transmissions. In one embodiment, the distributed resources in each t slot contain k RBs. In one beacon period of one (N × t) slot, (k × N) RBs are allocated, and one D2D UE randomly selects one RB from the allocated (k × N) RBs for one beacon transmission. The values of k, t, N are dynamically determined by the base station to substantially minimize the required resources under the same D2D discovery parameters.
Although the present invention has been described in connection with certain specific embodiments, the scope of the invention is not limited in this respect. Accordingly, various modifications, adaptations, and combinations of features of the described embodiments can be practiced by those skilled in the art without departing from the spirit of the invention, which is limited only by the claims.

Claims (23)

1. A method, comprising:
receiving, by a base station in a wireless communication network, one or more D2D scheduling requests;
determining uplink resource allocation based on a plurality of D2D discovery parameters, wherein the plurality of D2D discovery parameters include a total number of D2D devices requiring beacon transmission, a discovery period, and a target discovery probability; and
transmitting an uplink grant to a plurality of D2D devices for beacon transmission, wherein the uplink charging preamble allocates distributed resources for random access for beacon transmission of the plurality of D2D devices, and wherein the distributed resources comprise a plurality of resource blocks distributed in a frequency domain in which a plurality of subcarriers are located and a time domain of a time slot.
2. The method of claim 1, wherein the distributed resources comprise k resource blocks per t slots, and wherein k and t are positive integers.
3. The method of claim 2, wherein the k resource blocks are allocated using a predefined frequency hopping scheme to obtain frequency diversity.
4. The method of claim 2, wherein k and t for distributed resources are dynamically determined to substantially minimize required resources under the same D2D discovery parameters.
5. The method of claim 1, wherein a beacon period comprises N times t slots for use by a device for one beacon transmission, and wherein N is a positive integer.
6. The method of claim 1, wherein the distributed resource is semi-persistently allocated on a physical uplink shared channel or a physical random access channel.
7. The method of claim 1, wherein the base station obtains at least a portion of the D2D discovery parameters from the one or more scheduling requests.
8. A method, comprising:
D2D user equipment in a wireless communication network transmits a D2D scheduling request;
receiving an uplink grant from a base station, wherein the uplink grant allocates distributed resources for random access for beacon transmission;
sending a first beacon to the other plurality of D2D user devices on a first resource block, wherein the first resource block is randomly selected from the distributed resources in a first beacon period; and
a plurality of beacons are transmitted to a plurality of other user devices in a subsequent plurality of beacon periods, wherein each beacon is transmitted on a randomly selected resource of the distributed resources of each beacon period.
9. The method of claim 8, wherein the distributed resources in each t slots comprise k resource blocks, and wherein k and t are positive integers.
10. The method of claim 9, wherein the k resource blocks are allocated using a predefined frequency hopping scheme to achieve frequency diversity.
11. The method of claim 8, wherein the distributed resources are semi-persistently allocated on a physical uplink shared channel or a physical random access channel.
12. The method of claim 8, wherein one beacon period comprises N times t slots, and wherein N is a positive integer.
13. The method of claim 8, wherein the UE provides D2D discovery parameters via the scheduling request, and wherein the D2D discovery parameters include a discovery period and a target discovery probability.
14. The method of claim 8, wherein the UE performs periodic beacon transmission on the allocated distributed resources without performing sensing.
15. The method of claim 8, wherein the UE continues to send beacons until the UE is stopped by an upper layer, or receives a response, or reaches a maximum number of transmissions.
16. A user equipment, comprising:
a transmitter for transmitting a D2D scheduling request to a base station in a wireless communication network;
a receiver that receives an uplink grant from the base station, wherein the uplink grant allocates distributed resources for random access for beacon transmission; and
a discovery module that transmits a plurality of beacons to another plurality of D2D user devices over a plurality of resource blocks, wherein each resource block is randomly selected from the distributed resources during each beacon period.
17. The UE of claim 16, wherein the distributed resources include k resource blocks in no k slots, and wherein k and t are positive integers.
18. The UE of claim 17, wherein the k resource blocks are allocated using a predefined frequency hopping scheme to obtain frequency diversity.
19. The UE of claim 16, wherein the distributed resources are semi-persistently allocated on a physical uplink shared channel or a physical random access channel.
20. The UE of claim 16, wherein a beacon period comprises N times t slots, and wherein N is a positive integer.
21. The UE of claim 16, wherein the UE provides D2D discovery parameters via the scheduling request, and wherein the D2D discovery parameters include a discovery period and a target discovery probability.
22. The UE of claim 16, wherein the UE does not perform sensing and performs periodic beacon transmission on the allocated distributed resources.
23. The UE of claim 16, wherein the UE continues to send beacons until the UE is stopped by an upper layer, or receives a response, or reaches a maximum number of transmissions.
CN201480005855.1A 2013-01-24 2014-01-24 Fast equipment discovery method, UE and resource allocation methods for D2D communication Active CN104956751B (en)

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
US201361756046P 2013-01-24 2013-01-24
US61/756,046 2013-01-24
US14/161,924 US9326121B2 (en) 2013-01-24 2014-01-23 Device discovery using distributed random access for device to device communication
US14/161,924 2014-01-23
PCT/CN2014/071400 WO2014114263A1 (en) 2013-01-24 2014-01-24 Fast device discovery for device to device communication

Publications (2)

Publication Number Publication Date
CN104956751A true CN104956751A (en) 2015-09-30
CN104956751B CN104956751B (en) 2019-05-17

Family

ID=51207630

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201480005855.1A Active CN104956751B (en) 2013-01-24 2014-01-24 Fast equipment discovery method, UE and resource allocation methods for D2D communication

Country Status (4)

Country Link
US (1) US9326121B2 (en)
EP (1) EP2949172B1 (en)
CN (1) CN104956751B (en)
WO (1) WO2014114263A1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107257542A (en) * 2017-04-26 2017-10-17 南京邮电大学 The modeling method with ofdm system is distributed based on PPP in a kind of asynchronous D2D networks
WO2023098431A1 (en) * 2021-12-02 2023-06-08 华为技术有限公司 Beacon sending and receiving methods and apparatuses

Families Citing this family (34)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104937995B (en) 2013-02-22 2019-08-06 英特尔Ip公司 System and method for accessing network selection and flow routing
US9706481B2 (en) * 2013-03-15 2017-07-11 Futurewei Technologies, Inc. System and method for time-power frequency hopping for D2D discovery
WO2014151436A1 (en) * 2013-03-15 2014-09-25 Interdigital Patent Holdings, Inc. Enhanced common logical-a protocol for reconfigurable systems
AU2014251413B2 (en) * 2013-04-12 2017-02-02 Telefonaktiebolaget L M Ericsson (Publ) A method and wireless device for providing device-to-device communication
US9369258B2 (en) * 2013-05-03 2016-06-14 Qualcomm Incorporated Systems and methods for peer-to-peer and AP traffic multiplexing
US9392433B2 (en) * 2013-05-10 2016-07-12 Htc Corporation Method of device discovery in wireless communication systems
US9544754B1 (en) * 2013-05-28 2017-01-10 Marvell International Ltd. Systems and methods for scheduling discovery-related communication in a wireless network
US9143979B1 (en) 2013-06-18 2015-09-22 Marvell International Ltd. Method and apparatus for limiting a number of mobile devices that can contend for a time slot in a wireless network
CN105453668B (en) 2013-08-09 2019-03-22 瑞典爱立信有限公司 Method and apparatus for timing offset signaling
EP3031222B1 (en) 2013-08-09 2017-10-11 Telefonaktiebolaget LM Ericsson (publ) Direct control signaling in a wireless communication system
WO2015021256A1 (en) * 2013-08-09 2015-02-12 Huawei Technologies, Co., Ltd. System and method for resource allocation device-to-device for open discovery
TWI531273B (en) * 2013-08-09 2016-04-21 財團法人資訊工業策進會 Wireless communication system and resource allocation method thereof
US20150056982A1 (en) * 2013-08-22 2015-02-26 Telefonaktiebolaget L M Ericsson (Publ) Methods and Network Nodes for Management of Resources
JP6523268B2 (en) * 2013-10-10 2019-05-29 エルジー エレクトロニクス インコーポレイティド Method and apparatus for managing uplink transmission resources in wireless communication system
EP2911425B1 (en) 2014-01-13 2016-08-31 Industrial Technology Research Institute Device to device discovery method for user equipment and network entity and user equipment and network entity using the same
US9609581B2 (en) * 2014-01-21 2017-03-28 Qualcomm Incorporated Parameters for device to device discovery
CN106063310B (en) * 2014-01-30 2020-10-02 诺基亚技术有限公司 Device-to-device discovery resource allocation
WO2015115951A1 (en) * 2014-01-31 2015-08-06 Telefonaktiebolaget L M Ericsson (Publ) Radio node, communication devices and methods therein
CN106465151B (en) * 2014-03-24 2020-04-24 三星电子株式会社 Apparatus and method for monitoring device-to-device transmissions in a connected state
WO2016019512A1 (en) * 2014-08-05 2016-02-11 华为技术有限公司 D2d terminal, system, and d2d discovery method
WO2016021010A1 (en) * 2014-08-06 2016-02-11 富士通株式会社 Communication system, communication method, communication device, and mobile terminal
KR101861494B1 (en) * 2014-08-07 2018-05-25 인텔 아이피 코포레이션 Resource allocation techniques for device-to-device (d2d) discovery
CN110740028B (en) * 2014-08-07 2021-12-28 Lg电子株式会社 Method for determining transmission resource block pool of terminal in D2D communication and device thereof
US10342056B2 (en) 2014-09-23 2019-07-02 Lg Electronics Inc. Method and device whereby device-to-device terminal transmits discovery signal in wireless communication system
CN105451211B (en) * 2014-09-25 2019-12-27 中兴通讯股份有限公司 Method and apparatus for device-to-device communication
EP3190844B1 (en) * 2014-09-26 2019-07-24 Huawei Technologies Co., Ltd. D2d signal frequency hopping method and base station
JP6276415B2 (en) * 2014-11-07 2018-02-07 京セラ株式会社 Base station, user terminal and processor
CN107182221B (en) * 2015-01-21 2021-10-01 三星电子株式会社 System and method for device-to-device discovery message transmission
CN105992322B (en) * 2015-01-30 2019-04-19 大唐电信科技产业控股有限公司 A kind of Poewr control method and device
CN106303915B (en) * 2015-06-08 2021-05-28 索尼公司 Wireless communication apparatus and wireless communication method
US9955460B2 (en) * 2015-07-01 2018-04-24 Qualcomm Incorporated Scheduling assignment optimization for device-to-device communications
CN107182023A (en) * 2016-03-09 2017-09-19 索尼公司 User equipment and base station and wireless communications method in wireless communication system
EP3404944B1 (en) * 2016-03-22 2022-04-27 Huawei Technologies Co., Ltd. D2d communication method and device
US10231239B2 (en) 2016-07-20 2019-03-12 Qualcomm Incorporated Method and apparatus for resolving time domain conflict in device-to-device communication

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101772199A (en) * 2008-11-24 2010-07-07 华为终端有限公司 Method and device for establishing D2D network
CN102640553A (en) * 2009-10-30 2012-08-15 诺基亚公司 Scheduling of direct to direct communication
WO2012128505A2 (en) * 2011-03-18 2012-09-27 엘지전자 주식회사 Method and device for communicating device-to-device
CN102792759A (en) * 2010-03-11 2012-11-21 诺基亚公司 Method and apparatus for device-to-device communication setup

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8493887B2 (en) * 2008-12-30 2013-07-23 Qualcomm Incorporated Centralized control of peer discovery pilot transmission
CN101873704A (en) 2009-04-24 2010-10-27 大唐移动通信设备有限公司 Method, system and equipment for resource scheduling in long-term evolution system
ES2809241T3 (en) * 2009-11-27 2021-03-03 Nokia Solutions & Networks Oy Device-to-device communication
EP2510733A4 (en) 2009-12-11 2017-05-17 Nokia Technologies Oy Method, apparatus and computer program product for allocating resources in wireless communication network
US9485069B2 (en) * 2010-04-15 2016-11-01 Qualcomm Incorporated Transmission and reception of proximity detection signal for peer discovery
US8509105B2 (en) * 2010-06-23 2013-08-13 Nokia Corporation Method and apparatus for device-to-device network coordination
DK2617258T3 (en) 2010-09-14 2019-05-27 Nokia Technologies Oy D2D COMMUNICATION PROCEDURES: USE OF RADIO FIRE; RADIO TRANSMISSION; CONFLICT RESOLUTION
US9055389B2 (en) * 2011-12-30 2015-06-09 Telefonaktiebolaget L M Ericsson (Publ) Method and network node for handling beacon signal transmission
CN102547871B (en) 2012-02-07 2015-07-29 华为技术有限公司 Resource negotiation method and apparatus in a kind of D2D communication

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101772199A (en) * 2008-11-24 2010-07-07 华为终端有限公司 Method and device for establishing D2D network
CN102640553A (en) * 2009-10-30 2012-08-15 诺基亚公司 Scheduling of direct to direct communication
CN102792759A (en) * 2010-03-11 2012-11-21 诺基亚公司 Method and apparatus for device-to-device communication setup
WO2012128505A2 (en) * 2011-03-18 2012-09-27 엘지전자 주식회사 Method and device for communicating device-to-device

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107257542A (en) * 2017-04-26 2017-10-17 南京邮电大学 The modeling method with ofdm system is distributed based on PPP in a kind of asynchronous D2D networks
CN107257542B (en) * 2017-04-26 2021-01-01 南京邮电大学 Modeling method based on PPP distribution and OFDM system in asynchronous D2D network
WO2023098431A1 (en) * 2021-12-02 2023-06-08 华为技术有限公司 Beacon sending and receiving methods and apparatuses

Also Published As

Publication number Publication date
WO2014114263A1 (en) 2014-07-31
EP2949172B1 (en) 2019-11-06
EP2949172A1 (en) 2015-12-02
US20140204898A1 (en) 2014-07-24
EP2949172A4 (en) 2016-08-24
US9326121B2 (en) 2016-04-26
CN104956751B (en) 2019-05-17

Similar Documents

Publication Publication Date Title
CN104956751B (en) Fast equipment discovery method, UE and resource allocation methods for D2D communication
US11667253B2 (en) System and method of reducing interruptions for vehicle to vehicle communication
US11546802B2 (en) Method and apparatus for supporting flexible UE bandwidth in next generation communication system
EP3847865B1 (en) Method and apparatus for random access procedure
TWI723552B (en) Method for determining listen before talk and channel access priority class and user equipments thereof
US11570819B2 (en) Telecommunications apparatus and methods
Yang et al. Peer discovery for device-to-device (D2D) communication in LTE-A networks
CN115606263A (en) Demand and response for sidelink synchronization signal block (S-SSB) transmission
US11576191B2 (en) Method and apparatus for handling configured grant type 1 for vehicle-to-everything (V2X) communication
US11606812B2 (en) Method of prioritizing random access for multimedia priority and mission critical services and apparatus thereof
US11528743B2 (en) Method and apparatus for interruption handling for vehicle to everything communication
EP3915330B1 (en) Method and apparatus for random access preamble group selection in wireless communication system
CN110830172A (en) Indication and sending method and device for HARQ feedback of unlicensed frequency band, storage medium, base station and terminal
CN114830739A (en) Method and apparatus for processing system information request in wireless communication system
CN110839228A (en) NB-IoT D2D communication method, terminal and system based on signaling monitoring
CN116709268A (en) Side-link management method, device and system
CN114128390A (en) Method and apparatus for random access
CN115039500A (en) Method and apparatus for random access

Legal Events

Date Code Title Description
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C41 Transfer of patent application or patent right or utility model
TA01 Transfer of patent application right

Effective date of registration: 20160322

Address after: Singapore, Singapore, one of the first floor of the city hall on the 3rd floor, Soras

Applicant after: Mediatek (Singapore) Pte. Ltd.

Applicant after: Zhou Junting

Address before: Singapore, Singapore, one of the first floor of the city hall on the 3rd floor, Soras

Applicant before: Mediatek (Singapore) Pte. Ltd.

GR01 Patent grant
GR01 Patent grant