CN103428642B - Based on relaying bunch in D2D multicasting method - Google Patents

Based on relaying bunch in D2D multicasting method Download PDF

Info

Publication number
CN103428642B
CN103428642B CN201310297127.XA CN201310297127A CN103428642B CN 103428642 B CN103428642 B CN 103428642B CN 201310297127 A CN201310297127 A CN 201310297127A CN 103428642 B CN103428642 B CN 103428642B
Authority
CN
China
Prior art keywords
user
data
bunch
packet
multicast
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.)
Expired - Fee Related
Application number
CN201310297127.XA
Other languages
Chinese (zh)
Other versions
CN103428642A (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.)
Shenzhen Tinno Wireless Technology Co Ltd
Original Assignee
WUXI BUPT PERCEPTIVE TECHNOLOGY INDUSTRY INSTITUTE Co 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 WUXI BUPT PERCEPTIVE TECHNOLOGY INDUSTRY INSTITUTE Co Ltd filed Critical WUXI BUPT PERCEPTIVE TECHNOLOGY INDUSTRY INSTITUTE Co Ltd
Priority to CN201310297127.XA priority Critical patent/CN103428642B/en
Publication of CN103428642A publication Critical patent/CN103428642A/en
Priority to PCT/CN2013/089877 priority patent/WO2015007058A1/en
Application granted granted Critical
Publication of CN103428642B publication Critical patent/CN103428642B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/16Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/18Negotiating wireless communication parameters
    • H04W28/22Negotiating communication rate

Landscapes

  • Engineering & Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The present invention relates to a kind of based on relaying bunch in D2D multicasting method, comprising: S1: base station will have data sharing demand and the user that link loss is little is each other divided in one bunch; S2: base station by multicast will bunch in Data distribution8 inform each user, and control end-probing link information in each bunch; S3: in bunch, terminal node selects information multicast order based on the demand of each packet, and the packet occupation rate based on each user selects corresponding transmitting terminal, exchanges shared data by the mode of distributed multicast; S4: to be retransmitted by relaying with the user of transmitting terminal link-quality difference and obtain shared data.The invention provides the mode that a kind of relaying assists bunch internal information of multi-casting communication to share, overcome the large decline link of minority in multicast process to the impact of transmission rate, realize the optimization of network performance.

Description

Based on relaying bunch in D2D multicasting method
Technical field
The present invention relates to wireless communication technology field, particularly relate to a kind of based on relaying bunch in D2D multicasting method.
Background technology
Along with the development of 3GPP technology and multimedia service, emerge in large numbers a large amount of low energy consumption in network, possess the mobile terminal of calculating, memory function, data service presents the features such as variation, multimedization, mobility and position relevantization day by day.The development of business is had higher requirement to aspects such as the network optimization and managerial ability, network running quality, partner management ability, customer-oriented QOE and QOS.
Long Term Evolution (LTE, LongTermEvolution) system is a communication system based on scheduling.Under cellular communication modes, user to be obtained the authorization resource carry out transfer of data by control channel access base station (RNC/eNB).Because the information interchange between user needs by base station transfer, when great amount of terminals needs access network, request of data can be caused crowded, make base station face larger business challenge and pressure.Especially when data sharing and interaction demand, adopt and repeat a little to the communication mode of base station between a large number of users among a small circle, understand the serious waste network bandwidth.Multicast can improve efficiency of transmission and network performance.Under this pattern, base station utilizes to cluster the user in network with similar communication demand to gather in same bunch and serves.Such as when a large amount of sharing users terminal needs information exchanging data with one another time, base station is that each user distributes independently up channel (UL, UpLink) carry out data summarization, and then each user is given in multicast.But use traditional base station multicasting mode, can not alleviate the conflict of ascending resource under data sharing scene between user, serviced number of users can be restricted because of base station processing speed, ability.
D2D(Device-to-Device) information transmission communicated is without base station, and user can carry out direct communication by multiplexing up-downgoing authorization resources.The introducing of D2D technology can increase the availability of frequency spectrum, reduces load of base station, increases network throughput and coverage.But only utilize man-to-man D2D to communicate under data sharing service, not only can bring the redundant transmission of data, also can introduce D2D between interference.
For saving Internet resources, improving throughput, improving Consumer's Experience, when user has a data sharing demand among a small circle, the solution that main employing is following at present:
Buffer memory merges (cacheintergration): based on the visit capacity of terminal log certificate, cache node (cachepeer) stores the larger packet of interest-degree.If the packet that user needs is in memory range, user terminal is directly downloaded from buffer memory Nodes, otherwise still asks for base station.
D2D(Device-to-Device) multicast: base station assisting building bunch, each user serves as a bunch head in turn, realizes the information sharing between user by the mode of D2D multicast.Bunch head selects transmission rate according to the link-quality of multicast users.
The communication that above scheme takes full advantage of between terminal node improves network performance.Do not need base station (BS) to get involved due to the transmission between multi-user or assist signaling information only by BS transmission, the program can discharge downstream spectrum, reduce load of base station, makes more user access network.But above-mentioned data-sharing scheme exists user fairness sex chromosome mosaicism on the one hand: individual user's reception server function, pressure is large, and fairness is poor; On the other hand, multicast rate limits by the poorest link-quality, and the link of individual mass difference can affect overall efficiency of transmission.Based on this, relay transmission is incorporated in D2D multicast process, and method is as follows:
Mobile ad-hoc network (MANET): the mobile terminal in network has route and packet forwarding, the network information exchanges the packet switching mechanism that have employed in computer network, both can work alone as independent network, also can with the form of end subnet access existing network.
Traversal queries: according to node state, poll each node in base station, as the effect of relaying, under ensureing that user correctly receives the prerequisite of multicast information, selects suitable relaying to minimize total transmitting power.
Analyze such scheme, the introducing of route relaying increases efficiency of transmission, but brings extra route maintenance cost, adds consumption and the complexity of transmission.When service range is large, expense can be found for cost with above-mentioned relaying, solve the problems such as Transmission, and to increase within the scope of D2D bunch that efficiency of transmission is target, the relay selection algorithm that complexity is low is first-selection.
Summary of the invention
(1) technical problem that will solve
The technical problem to be solved in the present invention is: provide a kind of relaying to assist the information sharing mode of multi-casting communication, in making bunch, each user having an independent information is mutual by data multicast, obtain bunch in exist whole resources, and overcome the large decline link of minority in multicast process to the impact of transmission rate, realize the optimization of network performance.
(2) technical scheme
The invention provides a kind of based on relaying bunch in D2D multicasting method, comprising: S1: base station will have data sharing demand and the user that link loss is little is each other divided in one bunch; S2: base station by multicast will bunch in Data distribution8 inform each user, and control end-probing link information in each bunch; S3: in bunch, terminal node selects information multicast order based on the demand of each packet, and the packet occupation rate based on each user selects corresponding transmitting terminal, exchanges shared data by the mode of distributed multicast; S4: to be retransmitted by relaying with the user of transmitting terminal link-quality difference and obtain shared data.
Preferably, by the situation signals base of bag that holds data while user sends data sharing request, and carry out link detection under base station controls, during the user that can carry out D2D communication joins bunch.
Preferably, user, under the auxiliary control in base station, obtains information of neighbor nodes and network packet distribution, builds small-world network model accordingly.
Preferably, described user is under the auxiliary control in base station, obtain information of neighbor nodes and network packet distribution, build small-world network model accordingly and comprise step: base station controls a bunch member and sends detectable signal, and new user monitors sounding channel, when received signal to noise ratio exceedes setting threshold thresholding, assert that sending user is self neighbour, data transmit-receive is realized by the directly transmission of point-to-point, otherwise, think that link-quality is poor, the relay forwarding that is conveyed through of information realizes.
Preferably, after each user access bunch, send detectable signal, in making bunch, user knows the renewal of neighbor information.
Preferably, base station completes after bunch user collects, will bunch in packet distribution inform each terminal, user can realize distributed transmission terminal and relaying is found accordingly.
Preferably, by the analysis of the distribution to data in network, the multicast order of the packet of distributed selection the best and transmission user.
Preferably, described by the analysis to Data distribution8 in network, the multicast order of the packet that distributed selection is best and transmission user comprise step: each user obtains consistent data sending order according to the distribution of packet and sends user: by packet according to demand descending, demand is larger, transmits priority higher; The selection of transmitting terminal based on the analysis data of holding bag user being enjoyed to rate, hold bag user to occupy data fewer, send priority higher.
Preferably, in bunch, the control of multicast is distributed, depends on the computing capability of each user.
Preferably, when not ensureing the link-quality of sending node and all users, the user of link-quality difference is retransmitted by relaying and obtains information, and the successively forwarding being conveyed through neighbor node of multi-hop realizes.
Preferably, it is described when the link-quality of sending node and all users can not be ensured, the user of link-quality difference is retransmitted by relaying and obtains information, the successively forwarding being conveyed through neighbor node of multi-hop realizes comprising step: the user not receiving information sends request of data to neighbor node, the neighbor node holding this packet adds up the number of requests self received, and feeds back to each request of data user; The terminal not receiving information accordingly selects the neighbor node can serving maximum user as relaying, namely again request of data is sent to the neighbor user receiving maximum request of data, each neighbor node is according to secondary request of data retransmission information: receive a request of data, just realizes D2D communication with mode of unicast; If receive multiple request of data, just provide packet with D2D multicast; If still have user to fail to obtain data, then repeat above-mentioned steps, served through multi-hop, the user being obtained by relaying serving is fed back to the multicast transmitting terminal of current data packet and successfully receives signaling.
Preferably, when multiple relay forwarding is simultaneous time, the transfer resource of multiplexed quadrature.
(3) beneficial effect
The invention provides the mode that a kind of relaying assists multi-casting communication bunch internal information to share, in making bunch, each user having an independent information is mutual by data multicast, obtain bunch in exist whole resources, and overcome the large decline link of minority in multicast process to the impact of transmission rate, realize the optimization of network performance.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, to introduce simply apparently the accompanying drawing that uses required in embodiment or description of the prior art below, accompanying drawing in the following describes is some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.
Fig. 1 is the schematic diagram of the user bunch embodying small-world property.Wherein, bunch each user in contains independently information;
Fig. 2 is the scene schematic diagram that multiple relaying retransmits simultaneously;
Fig. 3 is the signalling schematic diagram that user accesses to base station requests;
Fig. 4 is the method flow diagram of the embodiment of the present invention.
Embodiment
In order to make the object of the embodiment of the present invention, technical scheme and advantage clearly, below in conjunction with the accompanying drawing in the embodiment of the present invention, clear, complete description is carried out to the technical scheme in the embodiment of the present invention, obviously, described embodiment is a part of embodiment of the present invention, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
As shown in Figure 1 to 4, the invention provides a kind of user's sub-clustering, and bunch in relaying assist the mode of multicast.Introduce small-world network model in this programme, in small-world network, user enjoys high polymerization degree and low linkage length, and each node has neighbor information and destination node information.When running into direct-connected unreachable link, the neighbor node be conveyed through successively of information forwards and realizes.This programme comprises the following steps:
S1: base station will have data sharing demand and the user that link loss is little is each other divided in one bunch, makes user in same cluster can realize stable D2D communication;
S2: base station by multicast will bunch in Data distribution8 inform each user, and control end-probing link information in each bunch, assist to build small-world network model;
S3: in bunch, terminal node selects information multicast order based on the demand of each packet, and the packet occupation rate based on each user selects corresponding transmitting terminal, exchanges shared data by the mode of distributed multicast;
S4: to be retransmitted by relaying with the user of transmitting terminal link-quality difference and obtain shared data.The selection of relaying is with under ensureing signal to noise ratio prerequisite, and maximization number of service subscribers is target.
Wherein, by the situation signals base of bag that holds data while user sends data sharing request, under base station controls, carry out link detection, during the user that can carry out D2D communication joins bunch.
Wherein, user, under the auxiliary control in base station, obtains information of neighbor nodes and network packet distribution, builds small-world network model accordingly.
Wherein, each user obtains the Data distribution8 in network by the broadcast of base station, and then learns the destination node of asking for data.
Wherein, by the analysis of the distribution to data in network, the multicast order of the packet of distributed selection the best and transmission user.Multicast process is controlled by Signalling exchange.
Wherein, in bunch, the control of multicast is distributed, depends on the computing capability of each user.
Wherein, when not ensureing the link-quality of sending node and all users, the user of link-quality difference is retransmitted by relaying and obtains information.The successively forwarding being conveyed through neighbor node of multi-hop realizes.
Wherein, when multiple relay forwarding is simultaneous time, the transfer resource of multiplexed quadrature.
The implementation of the embodiment of the present invention: the user with data sharing demand to build bunch according to network link status, by bunch in cooperate multicast transmission based on the D2D of relaying, ensureing the covering realizing multi-user's combined data under user fairness prerequisite.Comprise the steps:
S1: base station will have data sharing demand and the user that link loss is little is each other divided in one bunch, makes user in same cluster can realize stable D2D communication.
Data sharing user sends access request to base station, and self holds bag situation pack with signaling method informing base station i, controlling terminal in lower bunch in base station and send detectable signal, after new user receives detection information, being uploaded to base station by accepting signal to noise ratio, accordingly, base station judges whether it can add current cluster:
If there be n user in current cluster, if the signal to noise ratio of n user that new user receives all is greater than setting threshold H l, namely meet SNR i, new>H l, then it can add current cluster; The signal to noise ratio received is greater than the user of H, SNR i, new>H, i ∈ 1,2 ..., n} belongs to its neighbor user.
S2: base station by multicast will bunch in Data distribution8 inform each user, and control end-probing link information in each bunch, assist to build small-world network model.
After user's access bunch, under base station controls, send detection information, notify the existence of neighbor user self accordingly, make neighbor user upgrade local information.Neigh irepresent the neighbor information of user i,
After the user of fixed time period collects, the combined data bag that network contains is learnt in base station, and the distribution S of bag, there are N number of user and the individual different packet of M in suppose bunch:
S = b 11 b 12 · · · · · · b 1 N b 21 b 22 · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · · b M 1 · · · · · · · · · b MN
B ij=1 represents that a jth user has i-th bag, b ij=0 represents not this packet.Base station this information to be handed down to bunch in user.
The above information structure local information of small-world network interior joint.Small-world network model may be used for the searching of relaying: when direct connected link is unreachable time, progressively forwarded by neighbor node, realize information transmission.
S3: in bunch, terminal node selects information multicast order based on the demand of each packet, and the packet occupation rate based on each user selects corresponding transmitting terminal, exchanges shared data by the mode of distributed multicast.
In bunch, all users grasp the distributed intelligence of bag, and each terminal node calculates the transmission sequence of identical bag and corresponding transmitting terminal accordingly.As follows:
The occupancy volume of each packet is obtained: K={k by analyzing S 1, k 2... k m, wherein represent the user's number containing i-th packet, the arrangement of it ascending order is obtained K', contrast K and K' information obtains the transmission sequence Q wrapped: make r get r the element arriving r the corresponding Q in the position of element in K in M, K' all over 1.
For q in Q iindividual packet, looks for the principle of corresponding transmission user: hold in the user of this packet and hold bag and measure data that minimum node needs obtain from network at most, to even things up, we make it carry out multicast service.Q in traversal S ioK, the user obtaining this packet gathers W={i 1, i 2..., i c, i 1, i 2..., i c≤ n, for element in W, calculates find and make s jnamely a minimum jth user is the transmitting terminal of this packet.Packet delivery order and corresponding transmission user form basic packet delivery information.
Each user is by calculating identical packet delivery information, and thus multicast process can by the interactive controlling process of signaling.In the broadcasting process of a packet, the user of data is not needed to keep mourning in silence.Send user and first send information access request, recipient detects received signal to noise ratio, and the user's (i.e. neighbor user) being greater than threshold value H selects directly to receive, and feedback link situation.Remaining user (i.e. non-neighbor user) does not feed back.Transmit leg according to the link information of user feedback adjustment multicast transmission speed, and is given tacit consent to each neighbor user and accurately can be received information.The non-neighbor user of transmitting terminal asks for packet at next time slot to self neighbor node, is retransmitted and is served, be the correct reception of guarantee information simultaneously, feed back to transmit leg ACK signaling information after making it receive packet by relaying.After transmit leg collects the ACK feedback of all non-neighbor users, notify that next transmission user starts next multicast process in the mode of signaling.With this, by the Signalling exchange between user and local information, realize the distributed AC servo system of multicast process.
For ensureing the correct reception of all users in multicast process, transmission rate is based on the poorest link path loss situation, and note U needs the user of packet i to gather, and k is the transmitting terminal selected, and considers channel gain g, D2D user and phone user transmitting power P d, P c, the interference Inf that D2D user receives, noise N and channel width B, utilize Shannon's theorems transmission rate can be expressed as:
C i = B * log 2 ( 1 + min ( g kl P d ) N + P c Inf arg ( min ( g kl P d ) ) ) , l ∈ U
After introducing relaying, the multicast rate of network improves:
C i = B * log 2 ( 1 + min ( g kl P d ) N + P c Inf arg ( min ( g kl P d ) ) ) , l ∈ neigh i UU
S4: to be retransmitted by relaying with the user of transmitting terminal link-quality difference and obtain shared data.The selection of relaying is with under ensureing signal to noise ratio prerequisite, and maximization number of service subscribers is target.
When user directly can not obtain information from multicast process, packet can be asked for self neighbor node, and the re-transmission of neighbor user by the bag that holds data, obtain information.Retransmission processes is as follows: the terminal not receiving information sends request of data to neighbor user; After all neighbor users holding this packet receive solicited message, calculate the number of users self can served, and quantity information is fed back to each terminal sending request of data to self.The information that the terminal contrast neighbor user not receiving data feeds back, can serve the neighbor request information of maximum user simultaneously, and submit link condition to one; Neighbor node is according to the link condition fed back, and adjustment retransmits clean culture or multicast rate, carries out relaying re-transmission: if via node receives a data request information, then provide D2D unicast services; If receive multiple data request information, then send multicast service.
Receive the user feedback of packet to transmitting terminal ACK information.If still have user not receive packet, then get back to and send request of data step to neighbor user, find forward relay further at next time slot; After 2 relay request, still can not get the user of current data information to transmitting terminal request increasing power transmitting data bag.
Introduce after relaying, use DF(decodeandforward) mode transmits, and considers the SINR(signalandinterferencenoiseratio that relaying and terminal receive) SINR r, SINR d, receiving velocity is
C = B * log ( 1 + S s - r 1 + N + S r _ d I + N )
As shown in Figure 2, when multiple relaying retransmits simultaneous time, for it distributes orthogonal multiplexed resource, to avoid the interference between D2D user.
The invention provides a kind of mode of carrying out user's sub-clustering and bunch internal information transmission according to interest-degree and distance feature.The optimization of network performance is realized eventually through multiple-user communication.
One of ordinary skill in the art will appreciate that: all or part of step realizing above-described embodiment can have been come by the hardware that program command is relevant, aforesaid program can be stored in a computer read/write memory medium, this program, when performing, performs the step comprising above-described embodiment; And aforesaid storage medium comprises: ROM, RAM, magnetic disc or CD etc. various can be program code stored medium.
Use most it is noted that above embodiment is only for illustration of technical scheme of the present invention, be not intended to limit; Although with reference to previous embodiment to invention has been detailed description, those of ordinary skill in the art are to be understood that: it still can be modified to the technical scheme described in foregoing embodiments, or equivalent replacement is carried out to portion of techniques feature wherein; And these amendments or replacement, the essence of appropriate technical solution departs from the spirit and scope of various embodiments of the present invention technical scheme frequently.

Claims (10)

1. based on relaying bunch in a D2D multicasting method, it is characterized in that, comprising:
S1: base station will have data sharing demand and the user that link loss is little is each other divided in one bunch;
S2: base station by multicast will bunch in Data distribution8 inform each user, and control end-probing link information in each bunch;
S3: in bunch, terminal node selects information multicast order based on the demand of each packet, and the packet occupation rate based on each user selects corresponding transmitting terminal, exchanges shared data by the mode of distributed multicast;
S4: to be retransmitted by relaying with the user of transmitting terminal link-quality difference and obtain shared data;
User, under the auxiliary control in base station, obtains information of neighbor nodes and network packet distribution, builds small-world network model accordingly;
Described user, under the auxiliary control in base station, obtains information of neighbor nodes and network packet distribution, builds small-world network model accordingly and comprises step:
Base station controls a bunch member and sends detectable signal, new user monitors sounding channel, when received signal to noise ratio exceedes setting threshold thresholding, assert that sending user is self neighbour, data transmit-receive is realized by the directly transmission of point-to-point, otherwise think that link-quality is poor, the relay forwarding that is conveyed through of information realizes.
2. the method for claim 1, is characterized in that, by the situation signals base of bag that holds data while user sends data sharing request, and carries out link detection under base station controls, during the user that can carry out D2D communication joins bunch.
3. the method for claim 1, is characterized in that, after each user access bunch, sends detectable signal, and in making bunch, user knows the renewal of neighbor information.
4. the method as described in claim 1 or 3, is characterized in that, base station completes after bunch user collects, will bunch in packet distribution inform each terminal, user can realize distributed transmission terminal and relaying is found accordingly.
5. the method for claim 1, is characterized in that, by the analysis of the distribution to data in network, and the multicast order of the packet of distributed selection the best and transmission user.
6. method as claimed in claim 5, is characterized in that, described by the analysis to the distribution of data in network, and the multicast order of the packet of distributed selection the best and transmission user comprise step:
Each user obtains consistent data sending order according to the distribution of packet and sends user: by packet according to demand descending, demand is larger, transmits priority higher; The selection of transmitting terminal based on the analysis data of holding bag user being enjoyed to rate, hold bag user to occupy data fewer, send priority higher.
7. the method as described in claim 5 or 6, is characterized in that, in bunch, the control of multicast is distributed, depends on the computing capability of each user.
8. the method for claim 1, is characterized in that, when not ensureing the link-quality of sending node and all users, the user of link-quality difference is retransmitted by relaying and obtains information, and the successively forwarding being conveyed through neighbor node of multi-hop realizes.
9. method as claimed in claim 8, it is characterized in that, described when not ensureing the link-quality of sending node and all users, the user of link-quality difference is retransmitted by relaying and obtains information, and the successively forwarding being conveyed through neighbor node of multi-hop realizes comprising step:
The user not receiving information sends request of data to neighbor node, and the neighbor node holding this packet adds up the number of requests self received, and feeds back to each request of data user; The terminal not receiving information accordingly selects the neighbor node can serving maximum user as relaying, namely again request of data is sent to the neighbor user receiving maximum request of data, each neighbor node is according to secondary request of data retransmission information: receive a request of data, just realizes D2D communication with mode of unicast; If receive multiple request of data, just provide packet with D2D multicast; If still have user to fail to obtain data, then repeat above-mentioned steps, served through multi-hop, the user being obtained by relaying serving is fed back to the multicast transmitting terminal of current data packet and successfully receives signaling.
10. method as claimed in claim 8 or 9, is characterized in that, when multiple relay forwarding is simultaneous time, and the transfer resource of multiplexed quadrature.
CN201310297127.XA 2013-07-16 2013-07-16 Based on relaying bunch in D2D multicasting method Expired - Fee Related CN103428642B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201310297127.XA CN103428642B (en) 2013-07-16 2013-07-16 Based on relaying bunch in D2D multicasting method
PCT/CN2013/089877 WO2015007058A1 (en) 2013-07-16 2013-12-18 Method for allocating spectrum resources between cellular subscriber and d2d subscriber in same cell

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310297127.XA CN103428642B (en) 2013-07-16 2013-07-16 Based on relaying bunch in D2D multicasting method

Publications (2)

Publication Number Publication Date
CN103428642A CN103428642A (en) 2013-12-04
CN103428642B true CN103428642B (en) 2016-01-13

Family

ID=49652674

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310297127.XA Expired - Fee Related CN103428642B (en) 2013-07-16 2013-07-16 Based on relaying bunch in D2D multicasting method

Country Status (2)

Country Link
CN (1) CN103428642B (en)
WO (1) WO2015007058A1 (en)

Families Citing this family (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110380980A (en) * 2013-02-22 2019-10-25 英特尔Ip公司 System and method for accessing network selection and flow routing
CN112491734A (en) * 2014-05-30 2021-03-12 索尼公司 Electronic device and data transmission method
CN104320772B (en) * 2014-10-13 2018-02-06 北京邮电大学 D2D communication nodes clustering method and device based on degree of belief and physical distance
CN104581837B (en) * 2015-01-15 2018-01-09 浙江工业大学 The data distributing method with energy-saving effect of D2D collaboration communications is utilized under the transmission of data blocks time such as a kind of
WO2016112678A1 (en) * 2015-01-16 2016-07-21 中兴通讯股份有限公司 Data processing method and device
CN105992143A (en) * 2015-02-06 2016-10-05 北京信威通信技术股份有限公司 D2D relay multicast method assisted by network
CN105992157A (en) * 2015-02-06 2016-10-05 北京信威通信技术股份有限公司 D2D relay multicast method assisted by network
CN106034081B (en) * 2015-03-10 2019-04-05 北京信威通信技术股份有限公司 A kind of transmission control method in D2D cast communication
CN106034289A (en) * 2015-03-10 2016-10-19 北京信威通信技术股份有限公司 Forwarding control method in D2D multicast communication
JP6985152B2 (en) * 2015-04-08 2021-12-22 インターデイジタル パテント ホールディングス インコーポレイテッド Realization of mobile repeaters for device-to-device (D2D) communication
CN112887003B (en) * 2015-05-15 2022-12-06 索尼公司 Mobile communication system, communication terminal and method
CN106341892A (en) * 2015-07-10 2017-01-18 中兴通讯股份有限公司 Content distribution implementing method and device
CN106341774B (en) * 2015-07-10 2020-03-20 华为技术有限公司 Data transmission method, network equipment and user equipment
AU2017376109A1 (en) 2016-12-16 2019-07-11 Pipeline Therapeutics, Inc. Methods of treating cochlear synaptopathy
CN106507489B (en) * 2016-12-30 2019-12-10 宇龙计算机通信科技(深圳)有限公司 resource allocation method and access device
CN107911824B (en) * 2017-11-07 2021-12-14 曙光信息产业(北京)有限公司 Dynamic spectrum allocation method and device
CN107820256B (en) * 2017-11-14 2021-05-07 上海电机学院 Data transmission method based on D2D regional distribution technology
EP3767988B1 (en) * 2018-04-02 2022-06-01 Guangdong Oppo Mobile Telecommunications Corp., Ltd. Information reporting method, terminal device, network device, and computer storage medium

Citations (1)

* 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

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110047384A1 (en) * 2009-08-21 2011-02-24 Qualcomm Incorporated Establishing an ad hoc network using face recognition
CN102083138B (en) * 2011-01-14 2017-04-05 北京邮电大学 A kind of D2D user to can the multiple phone user's resources of concurrent multiplexing method
WO2013075340A1 (en) * 2011-11-25 2013-05-30 Renesas Mobile Corporation Radio resource sharing and contention scheme for device-to-device communication in white space spectrum bands
CN103619024B (en) * 2013-11-27 2016-07-06 无锡北邮感知技术产业研究院有限公司 With the method that in community, between phone user and D2D user, frequency spectrum resource distributes

Patent Citations (1)

* 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

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
D2D技术在LTE-A系统中的应用;崔鹏 等;《现代电信科技》;20110225;全文 *

Also Published As

Publication number Publication date
WO2015007058A1 (en) 2015-01-22
CN103428642A (en) 2013-12-04

Similar Documents

Publication Publication Date Title
CN103428642B (en) Based on relaying bunch in D2D multicasting method
Zhou et al. Intracluster device-to-device relay algorithm with optimal resource utilization
Liu et al. CoopMAC: A cooperative MAC for wireless LANs
Zhang et al. VC-MAC: A cooperative MAC protocol in vehicular networks
CN102340829B (en) Data sharing method in D2D bunch under cellular environment
Bhatia et al. ICAM: Integrated cellular and ad hoc multicast
US8515437B2 (en) Wireless resource allocation method, wireless mobile station and wireless base station in wireless communication system
WO2015078068A1 (en) Relay-based in-cluster d2d multicast method
WO2010124647A1 (en) Device and method for base stations dynamic clustering in mobile communication
US20100046396A1 (en) Adaptive management method for wireless transfer network containing base station and wireless relay stations
CN101291169B (en) Selection method of wireless relay station
US8098609B2 (en) Integrated scheduling of unicast and multicast traffic in relay-enabled wireless networks
Militano et al. When D2D communication improves group oriented services in beyond 4G networks
KR20120010936A (en) Apparatus and method to control session connection in a communication system
CN101919295B (en) Method of wireless data transmission
KR20080081958A (en) System and method for utilizing multiple radios to increase the capacity of a wireless communication network
CN102932866A (en) Opportunistic routing mechanism applicable to multi-radio-frequency multi-channel Ad hoc network
Amodu et al. A primer on design aspects, recent advances, and challenges in cellular device-to-device communication
US11070467B1 (en) Expedited route recovery and load balancing in a multi-radio mesh network
Zhang et al. An OFDMA-based joint reservation and cooperation MAC protocol for the next generation WLAN
Cheng et al. Md2do: A channel selection method for device to device communication using the mobile edge computing (mec) paradigm
Zhu et al. An efficient multicast clustering scheme for D2D assisted offloading in cellular networks
Atat et al. Delay-sensitive content distribution via peer-to-peer collaboration in public safety vehicular ad-hoc networks
CN116709592A (en) Data transmission method and system based on MESH ad hoc network content sharing
Zhou et al. An on-demand routing protocol for improving channel use efficiency in multichannel ad hoc networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
ASS Succession or assignment of patent right

Owner name: WUXI BUPT SENSING TECHNOLOGY INDUSTRY INSTITUTE CO

Effective date: 20140428

C41 Transfer of patent application or patent right or utility model
TA01 Transfer of patent application right

Effective date of registration: 20140428

Address after: 100876 Beijing city Haidian District Xitucheng Road No. 10

Applicant after: Beijing University of Posts and Telecommunications

Applicant after: Wuxi BUPT Perceptive Technology Industry Institute Co., Ltd.

Address before: 100876 Beijing city Haidian District Xitucheng Road No. 10

Applicant before: Beijing University of Posts and Telecommunications

ASS Succession or assignment of patent right

Free format text: FORMER OWNER: WUXI BUPT SENSING TECHNOLOGY INDUSTRY INSTITUTE CO., LTD.

Effective date: 20140618

Owner name: WUXI BUPT SENSING TECHNOLOGY INDUSTRY INSTITUTE CO

Free format text: FORMER OWNER: BEIJING POSTAL AND TELECOMMUNICATIONS UNIV.

Effective date: 20140618

C41 Transfer of patent application or patent right or utility model
COR Change of bibliographic data

Free format text: CORRECT: ADDRESS; FROM: 100876 HAIDIAN, BEIJING TO: 214135 WUXI, JIANGSU PROVINCE

TA01 Transfer of patent application right

Effective date of registration: 20140618

Address after: 214135 Jiangsu Wuxi District Road No. 97 Linghu University Science Park E

Applicant after: Wuxi BUPT Perceptive Technology Industry Institute Co., Ltd.

Address before: 100876 Beijing city Haidian District Xitucheng Road No. 10

Applicant before: Beijing University of Posts and Telecommunications

Applicant before: Wuxi BUPT Perceptive Technology Industry Institute Co., Ltd.

C14 Grant of patent or utility model
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20180329

Address after: 518000 Guangdong, Shenzhen, Guangdong, East China Industrial Zone, Nanshan District

Patentee after: Shenzhen Tinno Wireless Technology Co., Ltd.

Address before: 214135 Jiangsu Wuxi District Road No. 97 Linghu University Science Park E

Patentee before: Wuxi BUPT Perceptive Technology Industry Institute Co., Ltd.

TR01 Transfer of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20160113

Termination date: 20190716

CF01 Termination of patent right due to non-payment of annual fee