WO2015078068A1 - Relay-based in-cluster d2d multicast method - Google Patents

Relay-based in-cluster d2d multicast method Download PDF

Info

Publication number
WO2015078068A1
WO2015078068A1 PCT/CN2013/089859 CN2013089859W WO2015078068A1 WO 2015078068 A1 WO2015078068 A1 WO 2015078068A1 CN 2013089859 W CN2013089859 W CN 2013089859W WO 2015078068 A1 WO2015078068 A1 WO 2015078068A1
Authority
WO
Grant status
Application
Patent type
Prior art keywords
user
data
cluster
multicast
information
Prior art date
Application number
PCT/CN2013/089859
Other languages
French (fr)
Chinese (zh)
Inventor
田辉
张平
陈楠楠
王智博
Original Assignee
无锡北邮感知技术产业研究院有限公司
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

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/02Details
    • H04L12/16Arrangements for providing special services to substations contains provisionally no documents
    • H04L12/18Arrangements for providing special services to substations contains provisionally no documents for broadcast or conference, e.g. multicast
    • H04L12/189Arrangements for providing special services to substations contains provisionally no documents for broadcast or conference, e.g. multicast in combination with wireless systems
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/02Details
    • H04L12/16Arrangements for providing special services to substations contains provisionally no documents
    • H04L12/18Arrangements for providing special services to substations contains provisionally no documents for broadcast or conference, e.g. multicast
    • H04L12/1863Arrangements for providing special services to substations contains provisionally no documents for broadcast or conference, e.g. multicast comprising mechanisms for improved reliability, e.g. status reports
    • H04L12/1877Measures taken prior to transmission

Abstract

The present invention relates to a relay-based in-cluster D2D multicast method, the method comprising: S1: partitioning, by a base station, users which have a data sharing demand and a small link loss between each other to one cluster; S2: notifying, by the base station, data distribution in a cluster by means of multicast to each user, and controlling terminal detection link information in each cluster; S3: choosing, by a terminal node in the cluster, an information multicast order based on the demand amount of each data packet, choosing a corresponding sending end based on the occupancy rate of each data packet of each user, and exchanging sharing data in a distributed multicast manner; and S4: acquiring, by a user which has a poor sending end link quality, the sharing data by means of relay retransmission. Provided is an in-cluster information sharing approach of relay assisted multicast communications, which overcomes the effect of a minority of large fading links on transmission rate in a multicast process, and realizes optimization of network performance.

Description

Based on the cluster relay D2D multicast method

Technical Field The present invention relates to wireless communication technologies, and in particular relates to an internal relay cluster D2D multicast method. Background technique

With the development of technology and 3GPP multimedia services, the emergence of a large number of low-energy network, comprising ^ operator, the mobile terminal stores function data services become increasingly diversified, multimedia, mobility and location-related and other characteristics. Business development for network optimization and management capabilities, network operating quality, partner management, customer-facing QOE and gos and other aspects of higher demand.

Long Term Evolution (LTE, Long Term Evolution) system is a communication system based on scheduling. In the cellular communication mode, ^ authorized users access the base station through a control channel resource (RC / eNB) and data transmission. Since the information exchange between the user needs to transit through the base station, when a large number of terminals required to access the network, congestion cause data request, so that the base station face greater challenges and business pressures. In particular, in the face of a large amount of user data in a small area between sharing and interaction requirements, repeated use of the point to the communication base station, the network bandwidth will be a serious waste. Multicast can improve transmission efficiency and network performance. In this mode, the base station uses the aggregated user cluster networks having similar communication requirements to the same service for a cluster. Uplink channel (UL, Up Link) data collection and then multicast to each user, for example when a large number of user terminals share one another when the need to exchange data, the base station is independently assigned to each user. However, the use of traditional base station multicast mode, and can not alleviate the conflict between the uplink user data resource sharing scenario, the number of users being serviced due to a base station processing speed, capacity is limited.

Information transmission D2D (Device-to-Device) communication without the base station, ffl user - may be multiplexed spend T authorization direct communication resources. D2D introduction techniques may increase spectrum efficiency, to reduce the load of the base station, increasing the network throughput and coverage. However, only the use of one of the D2D communication in a data sharing environment will not only bring redundant transmission of data, will introduce interference between D2D right.

To conserve network resources, increase throughput, improve the user experience when the user has a small range of data sharing needs, mainly in the following solution - Cache Fusion (cache intergration): access to data based on the amount of the terminal, caching node ( cache peer) stores a relatively large degree of interest packet. If the user needs to store data packets in the range of the circle, the user terminal downloads directly from the cache nodes, the base station whether the agent is still obtainable.

D2D (Device-to-Device) Multicast: helper constructs base station cluster, each cluster head users take turns, sharing information between users by way D2D multicast. The transmission rate selected cluster head multicast user link quality.

Above makes use of the communication network performance between the terminal nodes. Since the transmission between the base station does not need multi-user (BS) BS transmissions only by intervention or assistance signaling information, the program can be released downstream spectrum, reducing the load of the base station, so that more users access the network. However, these data-sharing program on the one hand there is a user fairness: individual households bear the server function, stress, poor fairness; on the other hand, multicast rate limit by the worst link quality, poor quality link individual will affect the overall transmission efficiency. Based on this, the introduction of relay transmission process to the multicast D2D, methods such as a mobile ad-hoc network (MANET): a mobile terminal in the network with routing and packet forwarding, network information exchange mechanism using the packet switched computer network † , either independently as a separate network, the network may be in the form of an access terminal prior subnet.

Traversal query: The node status, the base station polls each node as a relay effect, under the premise of ensure correct reception user multicast information to select a suitable relay to minimize the total transmit power.

Analysis of the above-described embodiment, the introduction of relay routes increases transmission efficiency, but introduces additional maintenance cost routing, increased consumption and complexity of the transmission. When a large range of services, can look to the relay Jian sales at the expense of other issues to address transmission is interrupted, and in order to increase the transmission efficiency of the D2D cluster target range, low complexity relay selection algorithm is preferred. SUMMARY

(.) Technical problem to be solved

The present invention is to solve the technical 1¾] The problem is: RA Shao provides a relay information sharing multicast communication, so that each user has a separate information ^ cluster through interaction multicast data, obtaining all the resources present in the cluster and to overcome the effects of fading during the few large link multicast transmission rate to achieve optimal network performance.

(B) Technical Solution

The present invention provides a D2D multicast method based on a relay in the cluster, comprising: S1: a base station having a demand for sharing data with each other and the small loss of link users into one cluster; S2; base station through a cluster multicasting the data distribution ^ inform each user, and the control terminal detects the link information in each cluster; S3: terminal node in the cluster based on the demand for packet selection information of each multicast sequence, select the user data packet based on the respective occupancy the transmitting end, the data exchange via the distributed shared multicast mode; S4: the transmitting end of the link quality poor user data be shared through the relay retransmission.

While preferably the case, the user sends data sharing request packet will hold informs the base station, and detecting the link at the base station controller thorn, the user can be added to the D2D communications cluster.

Preferably, the user at the base station controller assisted puncture, to obtain information about neighbor nodes, and the network packet distribution, whereby constructing small-world network model.

Preferably, the user under the control of the auxiliary base station, obtaining information of neighbor nodes and network packet distribution, whereby small-world network model constructing step comprises: a base station transmits a probe signal control cluster members, the new user listens sounding channel, when receiving the signal to noise ratio exceeds the threshold value threshold, determined as the sending user's own neighbors, send and receive data through the direct transfer point, otherwise, that the difference link quality, transmission of information is achieved by forwarding relay.

Preferably, each access cluster of the user, transmitting the probe signal, so that the user knows the cluster update neighbor information. Preferably, after completion of the base station collecting user cluster, the cluster distribution of the packet to inform each of the terminals, whereby the user can achieve distributed ^ the transmission terminal and the relay to find.

Preferably, by analyzing the distribution of data on the network, and distributed sequentially selects a multicast best transmitting user packets.

Preferably, the analysis of the data distribution network, distributed choose the best order of multicast packets and transmits the user comprising the steps of: for each user gets the same data transmission order based on the distribution data packet and transmits the user: the demand for packet descending order, the greater the demand for higher transfer priority; selecting the transmitting end based on the analysis of data packets of users who enjoy rates, packet holding] ¾ data occupies fewer households, the transmission priority high.

Preferably, the cluster multicast control is distributed, depending on the computing power of each user.

Preferably, when the link quality can not be guaranteed to all users of the sending node, the user of the difference link quality information obtained through the relay retransmission sequential multi-hop transmission of a neighboring node through forwarding achieved.

Preferably, when the link quality can not be guaranteed to all users of the sending node, link quality difference between the user information obtained through the relay retransmission, transmitted through the multi-hop neighboring node forwarding at successive ho comprising steps of: receiving not the user information request to send data to a neighbor node, holding the packet count the number of neighbor nodes received the request itself, and feeds the data to each requesting user: accordingly not received neighbor terminal selection information can serve up to the user as a relay node, namely to a maximum data request received neighbor user data retransmission request, retransmission information of each neighbor node a second request for the data by: receiving a data request, the D2D communication is realized in a unicast manner; Upon receiving the plurality of data request, in order to provide D2D multicast packets; if the user fails to obtain the data remains, repeat above step ho, to give a multi-hop service, obtained through a relay service to the current user data packet multicast transmission of the feedback signaling is successfully received.

Preferably, when the plurality of relaying exist when the multiplex transmission orthogonal resources.

(Iii) the beneficial effects

The present invention provides a relay assistance multicast communications within the cluster information sharing manner, so that each user has a separate multicast information in the cluster through interaction data, obtaining all the resources present in the cluster, and the process of overcoming the multicast few large Effect of fading on the link transmission rate, network performance optimization "BRIEF DESCRIPTION oF dRAWINGS in order to more clearly illustrate the technical solutions in the embodiments or the prior art embodiment of the present invention, the following embodiments or the prior art will be described in the embodiment required BRIEF introduced Apparently, the following description of some embodiments of FIG. ^ the present invention, those of ordinary skill in the art is concerned, without any creative effort, can also be obtained from these other attachment pay FIG. Fig.

Figure 1 a schematic view of a user cluster small world network embodying features: wherein, in each user memo containing independent information;

FIG 2 is a schematic view of a plurality of relay retransmission scenarios simultaneously;

Figure 3 is a user requests access to a base station signaling schematic;

FIG 4 is a flowchart of a method embodiment of the present invention. DETAILED DESCRIPTION In order to implement the purpose of the inverted of the present invention, the technical solution and merits thereof more apparent in conjunction with the present invention in the drawings embodiments below, the technical solutions in the embodiments of the present invention will be clearly and completely described, obviously, the described Example touches a part of the embodiment of the present invention, rather than feeding all of the embodiments. Based on the embodiments of the present invention, those of ordinary skill in the art to make all other embodiments without creative efforts T obtained by, it falls within the scope of the present invention.

FIG i~ FIG. 4, the present invention provides a user clustering, and the relay to assist in the cluster multicast manner. This scheme introduces small-world network model, small-world network users to enjoy high degree of polymerization and low link length, each node has a node neighbor information, and object information. When confronted unreachable direct link, transmission of information forwarded achieved through successive stages of its neighbors. The program includes steps of T:

S1: The base station having data sharing among each other and the user needs a small link loss is divided into a memo, so that the same user can realize stable cluster: the D2D communication:

S2; base station within the cluster via a multicast data distribution to inform each user terminal detects and controls the link information in each cluster, help build small-world network model;

S3: terminal node in the cluster based on the demand for packet selection information of each multicast sequence, based on each user's share packets select the transmission side, exchange data via the shared multicast distributed manner;

S4: the transmitting end of the link quality is poor indoor shared data obtained through the relay retransmission. Relay options to ensure that noise ratio under the premise, to maximize the number of service users as the goal.

The case wherein the user data is transmitted while holding sharing request packet informs the base station, the base station performs the link detection under control, the user can be added to the D2D communications cluster.

Wherein the user at the base station assist control, and obtain information about neighbor nodes network packet distribution, whereby constructing small-world network model.

Wherein each of the user data to obtain the distribution network by the broadcast station, and thus obtain the data that the destination node.

Wherein, by analyzing the distribution of data on the network, and distributed sequentially selects a multicast best transmitting user packets. Beng multicast signaling interaction process into line by the control.

Wherein the cluster multicast control is distributed, depending on the computing power of each user.

Wherein, when the link quality can not be guaranteed to all users of the sending node, link quality difference between the user information obtained through the relay retransmission. Forward multihop transmission is achieved by successive neighbors.

Wherein, when a plurality of simultaneously present when relaying, multiplexing orthogonal transmission resource.

Implementation of this embodiment of the present invention: a user needs to share data according to a network constructed cluster link state, covered by a cooperative cluster backbone D2D relay multicast transmission, multi-user data summarized in ensuring fairness user premise. Comprising the steps of:

S i: a base station having data sharing among each other and the user needs a small link loss divided into a cluster, so that the same user can realize stable cluster ffi D2D communication.

Shared user data to the base station an access request, and notify the base station itself in the signaling packet holding case a detection signal issued at a terminal cluster control station, the new user receives the probe information, the receiving voice channel to the base station than the upload, according to here, the base station determines whether it can be added to the current cluster:

If there is "user, if the user receives a new" user SNR is greater than the set threshold value H L, i.e. to meet the current cluster ^;,> ¾, ¥ ^ { 1,2, -, »}? , which agent may be added to the current cluster: the received SNR is greater than the user's, s> Η, / ^ ί.2, · .. "} users belonging to its neighbor.

S2: the base station via a multicast data distribution within the cluster inform each user, and the control terminal to detect the link information within each cluster to help build small-world network model.

After the user access cluster, the base station transmits probe information under control of the user's own inform the neighbors exist, updating local information that neighbor households."6, the user indicates neighbor information ί, neigh ^ {1, 2,3, .. .Ν

After a fixed period of time to collect household, that the base station network with the aggregate data packet,

Distribution S ^ S pack,, and the package, assuming a cluster of W ¾ M different users and packet: i 2

2122

MMN

= 1 for the first / second user has packages, ¾ = 0 Table 'the data packet. This indoor base station information.

The above information constitutes a local small-world information network nodes. Small-world network model can be used to relay finding: when the direct link is unreachable when forwarded by neighbors gradually to achieve information transmission.

S3: Select the terminal node in the cluster based on the demand of each multicast packet GU order, based on each user's share packets select the transmission side, exchange data via the shared multicast distributed manner.

Cluster distribution information of all users to grasp the package, whereby each end node is calculated to obtain the same transmission sequence and the corresponding packet transmitting side. as follows:

S obtained by analyzing the occupancy rate of each packet: κ = "7, ο wherein =

Indicates the i-th user having a number of data packets, the ascending order to obtain the contrast information obtained ^ i and packet transmission sequence Q: Let r runs over 1 to M, the first element position in the K r corresponding to Q r-th element.

For the first β packets, sends the user to find the appropriate principles: the user holds the most data packets in the packet hold a minimum amount of required nodes obtained from the network, to be fair, we make multicast services. S traversing the first row, the user data packet has been set =., U, ¾, ... ≤ «, elements for calculating ^ =, found that a minimum of ffl ./ th user that is transmitting the data packet end. Packet distribution order and the «ί transmitting user packets constituting the basic distribution information.

Each user calculated through the same packet distribution information, thereby multicasting process may be controlled by exchanging signaling process. Process a broadcast data packet, the user does not need to remain silent data. Transmitting user first sends an access request message, the recipient receives the detection signal to noise ratio, the threshold value w of a big user (i.e., neighboring user) receives directly selected, and a feedback link conditions. The rest of the user (ie, non-neighbor user) is not feedback. Adjusting the sender link information according to the user feedback multicast transmission rate, and each neighbor default user can receive accurate information. Transmitting end user Τ a non-neighbor slot to the neighbor node to request the data packet itself, obtained by the relay retransmission services, to ensure correct reception of information, make an ACK feedback signaling information to the transmission side after receiving the data packet. The sender collect all the non-neighbor users ACK feedback, signaling notification under way to send a user starts a multicast process. In this, the signaling interaction between the user and the local information, implement distributed control multicast process.

In the multicast process to ensure the correct reception of all] ¾ households, the transmission rate based on the worst case link path loss, referred to as the user needs to set the data packet, the sending end & chosen, consider user channel gain and cellular user D2D transmit power, p c, D2D user receives stem channel bandwidth S, using Shannon transmission rate may be expressed as:

C = i * log 2 (l +,), 1 & U after the introduction of the relay, the multicast network is improved rate? -

Figure imgf000009_0001

S4: the transmitting end of the link is of poor quality ffl user data obtained by the shared relay retransmission. Relay selection signal to noise ratio to ensure that the premise of T, to maximize the number of users for the service ^ goal.

When ffl households can not get the information directly from the multicast process will request packets to their neighbors, and neighbors through retransmission of user data packets holds, get the information. Retransmission process is as follows: the terminal information is not received transmits a user data request to the neighbor: holds all the user data packet after receiving the neighbor request message, the service itself may calculate the number of users, and the amount of feedback to each a terminal sends a data request itself [Comparative not received neighbor information terminal of the user data fed back to a user can simultaneously serve up to the neighbor solicitation message, and submitting link conditions; neighbor nodes according to the link conditions fed back to adjust re-broadcast or multicast rate leaflets, relay retransmission: if the relay node receives a data request message, the D2D providing unicast services; a plurality of data if the received request information, sends a multicast service.

Receiving a packet of user feedback information to the transmitter an ACK. If the user still does not receive the packet, it sends back the subscriber data request step neighbor, and look forward relay in a time slot T; 2 times after the relay request, the current data is still not transmitted to the user end power increase request packet is transmitted.

After the introduction of the relay, the use DF (decode and forward) mode transmission, considering SINR (signal and interference noise ratio) SlNR r received by the terminal and the relay. SINR d, meal ¾ [¾ rate ¾ /

C = B * logii

Ν · Ϊ + Ν

As shown in FIG 2, when a plurality of relay retransmission occur simultaneously for orthogonal resource allocation multiplexing to avoid interference between the D2D one thousand users.

The present invention provides a way for a user cluster clustering information transmission and in accordance with the degree of interest and the distance characteristic. Ultimately optimize network performance multiuser coordinating communications.

Those of ordinary skill in the art will be appreciated that: all or part of a hardware implemented steps of the above embodiments may be associated by program instructions complete, the program may be stored in a computer readable storage medium, the program Jue row, performed comprising the steps of the above-described embodiments; the storage medium includes: any medium may store program code, or a magnetic disk, an optical disk ROM RAM :, etc. "

Should be noted that the most used: above embodiments are merely to illustrate the technical solutions of the present invention, but not intended to limit spines; While the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art will appreciate; it still may be made to the technical solutions described in the embodiments are modified or partial technical features which will be equivalents; as such modifications or replacements do not when the respective nature of the technical solutions to depart from the spirit and scope of the feed technical solutions of the embodiments of the present invention .

Claims

Claims
A D2D multicast method based on the relay cluster, wherein, comprising:
S1: the base station and the user needs to share the data with a small loss of the link between them is divided into a cluster; S2: a base station within the cluster via a multicast data distribution to inform each user terminal detects and controls the link information of each cluster ;
S3: terminal node in the cluster based on the demand for packet selection information of each multicast sequence, based on each user's share packets select the transmission side, exchange data via the shared multicast distributed manner;
S4: the transmitting end of the link quality to give a difference of ¾ shared user data retransmitted by the relay.
2. The method as claimed in claim 1, characterized in that, while the user is transmitting data sharing request packet will hold the case informs the base station, and detecting the link under control of the base station, the user can be added to the D2D communications cluster.
3. The method of claim i, wherein the auxiliary base station under control of the user, obtaining information of neighbor nodes and network packet distribution, whereby the hook to build small-world network model.
4. The method as claimed in claim 3, wherein, said auxiliary user at the base station control spines, to obtain information about neighbor nodes, and the network packet distribution, whereby constructing small-world network model comprises the step of - sending base station control cluster member detection signal, the new user to monitor the channel to detect, when the received SNR exceeds the set threshold value gate mm, identified user transmits its own neighbors, send and receive data through the direct transfer point, otherwise, that the difference link quality, transmission of information by relaying achieved.
5. The method as claimed in claim 4, wherein each user access to the cluster, sending a probe signal, so that the user knows the cluster update neighbor information.
6. The method as claimed in claim 4 or 5, characterized in that the base station is completed cluster] ¾ households collected after the cluster distribution packet to inform each terminal, whereby a user can implement a distributed transmission terminal and the relay Look for.
7. The method as claimed in claim 1, characterized in that, by analyzing the distribution of data on the network, a distributed multicast select the best sequence of packets and transmits the user.
8. A method as claimed in claim 7, characterized in that, by analyzing the distribution of the data on the network, selects a multicast distributed optimal sequence and transmits the user data packet comprises the steps of:
Each user profile obtained according to the same data packet transmission order and transmits the user: in accordance with the demand for packet data in descending order, the greater the demand for higher transfer priority; selected based on the transmitting end user data rates supported packet Related analysis, holding packet data occupies fewer users, higher transmission priority.
9. The method of claim 7 or claim 8, wherein the cluster multicast control is distributed, depending on the computing power of each user.
10. The method as claimed in claim i, wherein, when the transmission link quality can not be guaranteed to all nodes ^ households, poor link quality information obtained through the user relay retransmission, transmitted through the multi-hop neighbors successive forwarding node implementation.
11 The method as claimed in claim), wherein, when the link quality can not be guaranteed to all users of the sending node, link quality difference between the user information obtained through the relay retransmission, transmitted through the multi-hop successive forwarding realize neighbor node comprises the steps of:
The user information is not received the data request is sent to the neighbor node holding the packet count the number of neighbor nodes received the request itself, and feeds the data to each requesting user; accordingly not received terminal information service selection may be up to the user neighbor as a relay node, namely to a maximum data request received neighbor user data retransmission request, retransmission information of each neighbor node a second request for the data by: receiving a data request, a unicast manner D2D communication; if the received plurality of data request, in order to provide D2D multicast packets; if the user fails to obtain the data remains, the above steps are repeated to obtain a multi-hop service, the service obtained by the user of the current packet relaying the multicast transmission of the feedback signaling is successfully received.
12, 10 or the method as claimed in claim 1, wherein, when a plurality of simultaneously present when relaying, multiplexing] ¾ orthogonal transmission resource.
PCT/CN2013/089859 2013-11-27 2013-12-18 Relay-based in-cluster d2d multicast method WO2015078068A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN 201310616922 CN103619024B (en) 2013-11-27 2013-11-27 The method of inter-cell cellular user with users of the spectrum resource allocation d2d
CN201310616922.0 2013-11-27

Publications (1)

Publication Number Publication Date
WO2015078068A1 true true WO2015078068A1 (en) 2015-06-04

Family

ID=50169728

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/089859 WO2015078068A1 (en) 2013-11-27 2013-12-18 Relay-based in-cluster d2d multicast method

Country Status (2)

Country Link
CN (1) CN103619024B (en)
WO (1) WO2015078068A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107465479A (en) * 2017-04-14 2017-12-12 重庆信科设计有限公司 Multi-cell D2D communication interference management method based on relay assistance

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103428642B (en) * 2013-07-16 2016-01-13 无锡北邮感知技术产业研究院有限公司 Based on the cluster relay d2d multicast method
CN104254130B (en) * 2014-09-09 2017-10-27 北京邮电大学 The method of allocating the user with the cellular D2d user link shared resource, apparatus and system for
CN104185263B (en) * 2014-09-12 2017-09-15 东南大学 A multi-target power based on heterogeneous network optimization

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102340829A (en) * 2010-07-15 2012-02-01 上海无线通信研究中心 Device-to-device (D2D) cluster data sharing method under cellular environment
CN103179575A (en) * 2011-12-23 2013-06-26 中兴通讯股份有限公司 Neighboring device communication method and system, network side device and user equipment
US20130288608A1 (en) * 2012-04-30 2013-10-31 Jong-Kae Fwu Apparatus and method to enable device-to-device (d2d) communication in cellular networks

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8588803B2 (en) * 2010-06-18 2013-11-19 Nokia Corporation Method and apparatus for resource scheduling for network controlled D2D communications
CN102083138B (en) * 2011-01-14 2017-04-05 北京邮电大学 A method d2d user can simultaneously multiplex a plurality of user resources cellular
CN102970758B (en) * 2012-12-11 2015-03-04 东南大学 Straight-through self-adaptive resource distribution method for cellular communication system terminal
CN103079262B (en) * 2012-12-28 2015-06-17 浙江大学 Mode selection and resource allocation method of device-to-device (D2D) users in cellular system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102340829A (en) * 2010-07-15 2012-02-01 上海无线通信研究中心 Device-to-device (D2D) cluster data sharing method under cellular environment
CN103179575A (en) * 2011-12-23 2013-06-26 中兴通讯股份有限公司 Neighboring device communication method and system, network side device and user equipment
US20130288608A1 (en) * 2012-04-30 2013-10-31 Jong-Kae Fwu Apparatus and method to enable device-to-device (d2d) communication in cellular networks

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107465479A (en) * 2017-04-14 2017-12-12 重庆信科设计有限公司 Multi-cell D2D communication interference management method based on relay assistance

Also Published As

Publication number Publication date Type
CN103619024B (en) 2016-07-06 grant
CN103619024A (en) 2014-03-05 application

Similar Documents

Publication Publication Date Title
Katti et al. XORs in the air: practical wireless network coding
Vuran et al. XLP: A cross-layer protocol for efficient communication in wireless sensor networks
US20050111428A1 (en) Power and delay sensitive ad-hoc communication networks
US20080205385A1 (en) Data frame formats to improve groupcast efficiency in multi-hop wireless networks
US20090023460A1 (en) System and method for setting up P2P communication group in cellular system, and P2P communication system and method using P2P communication group
US20110225312A1 (en) Unified cache and peer-to-peer method and apparatus for streaming media in wireless mesh networks
US20140098685A1 (en) Content Delivery in Wireless Wide Area Networks
Liu et al. CoopMAC: A cooperative MAC for wireless LANs
US20110225311A1 (en) Unified cache and peer-to-peer method and apparatus for streaming media in wireless mesh networks
Zhou et al. Intracluster device-to-device relay algorithm with optimal resource utilization
US20070133483A1 (en) Transmission power control over a wireless ad-hoc network
Yuan et al. An optimized ad-hoc on-demand multipath distance vector (AOMDV) routing protocol
US20070072604A1 (en) Method and system for a wireless multi-hop relay network
US20070153789A1 (en) Apparatus and method for multicasting data in a communication network
Zhang et al. VC-MAC: A cooperative MAC protocol in vehicular networks
Bhatia et al. ICAM: Integrated cellular and ad hoc multicast
US20130016629A1 (en) Network-assisted peer discovery with network coding
Siam et al. Energy-efficient clustering/routing for cooperative MIMO operation in sensor networks
Gossain et al. Supporting MAC layer multicast in IEEE 802.11 based MANETs: Issues and solutions
Bharati et al. CAH-MAC: cooperative ADHOC MAC for vehicular networks
WO2003105353A2 (en) System and method for multicast media access using broadcast transmissions with multiple acknowledgments in an ad-hoc communications network
CN101969396A (en) Time delay and bandwidth resource-based relay selection method
US20090109891A1 (en) Method and system for distributed admission control in mobile ad hoc networks (manets)
Sivaraj et al. QoS-enabled group communication in integrated VANET-LTE heterogeneous wireless networks
CN101877918A (en) Equipment and method for dynamic clustering of base station in mobile communication

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 13898157

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase in:

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 13898157

Country of ref document: EP

Kind code of ref document: A1