CN104581867B - D2d cooperative communication using one kind of the other block with the transmission time of data distribution method and energy efficiency of fairness - Google Patents

D2d cooperative communication using one kind of the other block with the transmission time of data distribution method and energy efficiency of fairness Download PDF

Info

Publication number
CN104581867B
CN104581867B CN 201510020752 CN201510020752A CN104581867B CN 104581867 B CN104581867 B CN 104581867B CN 201510020752 CN201510020752 CN 201510020752 CN 201510020752 A CN201510020752 A CN 201510020752A CN 104581867 B CN104581867 B CN 104581867B
Authority
CN
Grant status
Grant
Patent type
Prior art keywords
user
data
data block
step
block
Prior art date
Application number
CN 201510020752
Other languages
Chinese (zh)
Other versions
CN104581867A (en )
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
Grant date

Links

Classifications

    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THIR OWN ENERGY USE
    • Y02D70/00Techniques for reducing energy consumption in wireless communication networks
    • Y02D70/20Techniques for reducing energy consumption in wireless communication networks independent of Radio Access Technologies
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THIR OWN ENERGY USE
    • Y02D70/00Techniques for reducing energy consumption in wireless communication networks
    • Y02D70/30Power-based selection of communication route or path
    • Y02D70/39Power-based selection of communication route or path using selective relaying for reaching a BTS [Base Transceiver Station] or an access point

Abstract

一种等数据块传输时间下利用D2D协作通信的带有公平性和节能效果的数据分发方法,包括以下步骤:(1)针对问题,在等数据块传输时间下完成对数据块的分发,同时相较于每个用户都各自从基站下载数据块的方式达到节能的效果,还兼顾到用户的公平性,即将数据块传输时间均分给每个满足中继条件的用户,设计方法得到数据块的传输时间及数据块的传输速率。 Using one kind of the other block with the transmission time of data distribution method and energy efficiency of fairness D2D cooperative communication, comprising the steps of: (1) for the issue, complete distribution of the data block in the data block transmission time, etc., while compared to reach each user from each download data block of a base station of the energy saving effect, but also take into account fairness of users, ie average block transfer time to each relay user satisfying the condition design method to give block transmission rate and transmission time of the data block. (2)确定在数据分发过程中需要考虑的限制条件,针对限制条件设计在给定数据块传输时间和传输速率下的数据分发方法,最终完成对数据块的发送。 (2) determining the data constraints need to be considered during the distribution, the data distribution method for a given block of data at a transmission time and transmission rate of the design constraints, the final completion of the transmission data block. 本发明兼顾公平性原则的同时通过数据块传输时间控制和对应的用户中继选择及中继时间控制的带有节能效果。 The present invention, while the principle of fairness when the relay by a user selecting the control data block and the corresponding transmission time and the relay time control with energy saving effect.

Description

一种等数据块传输时间下利用D2D协作通信的带有公平性和节能效果的数据分发方法 D2D cooperative communication using one kind of the other block with the transmission time of data distribution method and energy efficiency of fairness

技术领域 FIELD

[0001] 本发明涉及D2D通信领域中,尤其是一种等数据块传输时间下利用D2D协作通信的带有公平性和节能效果的数据分发方法。 [0001] The present invention relates to the field of D2D communication, in particular data distribution method with fairness and energy efficiency of the D2D cooperative communication using one kind of data block transfer time and the like.

背景技术 Background technique

[0002] 近年来,随着移动数据流量需求的爆发式增长,有限的网络资源分配也面临着巨大挑战,在此背景下,能够复用传统网络资源的D2D通信模式越来越受到人们的关注。 [0002] In recent years, with the explosive growth of mobile data traffic demand, limited network resource allocation also faces enormous challenges in this context, be able to reuse legacy network resources D2D communication mode more and more people's attention . 与此同时,随着网络的普及,社交网络已经成为人们不可缺少的一种交往方式,在社交网络中, 人们可以实现分享包括各种图片、影片等在内的数据块资源。 At the same time, with the popularity of social networking has become an indispensable way of communication, in social networks, people can achieve data sharing resource block includes a variety of pictures, videos, etc.,. 而处于同一场所(例如写字楼办公室、学校教室等)的人们对于社交网络内容的兴趣爱好上会有很大程度的重合,利用D2D通信方式实现对人们有共同需求爱好的数据块的协作式分发,是一种十分新颖的应用模式。 And at the same place (such as office buildings offices, classrooms, etc.) people for social network content hobbies have a large degree of overlap, using the D2D communication method to the needs of people with common hobbies and collaborative distribution of data blocks, It is a very innovative application mode. 这种模式更加贴合当下的社会需求,带有更强的目的性,以及更加高效的性能。 This mode is more fit the current needs of the community, with a stronger performance of purpose, as well as more efficient. 因此, 研究如何兼顾用户公平性原则的同时实现对用户共同需求的数据块的协作式分发,同时相较于用户各自从基站下载数据块的方式达到节能的效果是非常有意义的。 Therefore, the study of how to balance the principle of fairness user while achieving collaborative distribution of data blocks for common user needs, while compared to the respective users to achieve energy-saving effect is very significant way from the base station to download data blocks.

发明内容 SUMMARY

[0003] 为了克服传统D2D通信模式缺乏很好的应用体验、能耗较大以及缺乏一定程度公平性措施的不足,本发明提供一种具有良好应用体验、能耗较小、公平性良好的等数据块传输时间下利用D2D协作通信的带有公平性和节能效果的数据分发方法。 [0003] In order to overcome the lack of good D2D communication mode of application experience, to some extent, the lack of fairness and greater measures of energy shortage, the present invention is to provide a good application experience, less energy consumption, such as fairness good data distribution method with fairness and energy-saving effect using the D2D cooperative communication of data block transfer time.

[0004] 本发明解决其技术问题所采用的技术方案是: [0004] aspect of the present invention to solve the technical problem are:

[0005] —种等数据块传输时间下利用D2D协作通信的带有公平性和节能效果的数据分发方法,所述数据分发方法包括以下步骤: [0005] - the use of other types of cooperative communication D2D data distribution method with fairness and energy efficiency of the transmission time of a data block, said data distribution method comprising the steps of:

[0006] (1)在基于D2D的通信网络中,有. [0006] (1) based on the D2D communication network, there.

Figure CN104581867BD00051

个用户,N为总用户数, Users, N being the total number of users,

Figure CN104581867BD00052

个数据块,K为总数据块个数,其中,数据块k的需求用户群为Qk, Data blocks, K is the total number of data blocks, wherein the data block k needs of users as Qk,

Figure CN104581867BD00053

,数据块k的传输时间为xk,数据块k的大小为Lk,数据块k的单位传输时间为vk,数据块的均分份数为S,用户i所需要的数据块集合为山,基站需要在单个时间片T内完成对K个数据块的发送,在数据分发之前将数据块k的传输时间Xk均分为S份每份传输时间为Vk,满足有节能效果条件的中继用户按顺序判断是否满足传输Vk的时间,直至用户可用能量耗尽或者不满足发送条件,最终确定被选为中继的用户对数据块k的中继时间为;基站开始数 , The transmission time for the data block k xk, the unit transmission time for data block size of Lk k, k is the data block VK, average number of copies of the data block is S, i required for the user data blocks set the mountain, the base station needs to be done within a single time slice K T transmits data blocks, before distributing the data transmission time of the data block k Xk are each divided into parts S is Vk is the transmission time, the relay user satisfying the condition of energy-saving effect by sequence is judged whether the transmission time of the Vk, the available energy is depleted or until the user does not satisfy the transmission condition is determined to be finally selected as the relay to relay user data block k is the time; the number of base stations start

Figure CN104581867BD00054

据发送之后,被选为中继的用户在 After sending the data, the user is selected as the relay

Figure CN104581867BD00055

时间内接收来自基站数据块k的同时立即广播给与该中继用户处于同一用户群Qk的其他用户,最后,若数据块k的传输时间Xk在经过所有可选用户中继之后仍有剩余,即的传输时间由基站直接 Receiving from the base station while the time k block of data broadcast is immediately given to the relay user to other users in the same user group Qk, and finally, after the time when the transmission of data block k Xk After all the optional user relay still remaining, i.e., transmission time directly by the base station

Figure CN104581867BD00056

对用户广播发送数据完成;针对该问题,所述数据块传输时间0具体由以下步骤获得: Transmitting user data broadcasting is completed; To solve this problem, the data block obtained from a specific transmission time 0 following steps:

[0007] 步骤I. 1:基站在单个时间片T内对K个数据块的传输时间都相等,因此,对于数据块k的传输时间xk有, [0007] Step I. 1: base station transmission time K data blocks are equal within a single time slice list T,, the transmission time for the data block k have xk,

Figure CN104581867BD00061

,其中,xk表示数据块k的传输时间,k表示数据块集合 Wherein, XK represents a transmission time of data block k, k represents a set of data blocks

Figure CN104581867BD00062

中的第k个数据块,K表示数据块的总个数,T表示单个时间片长度; The k data blocks, K represents the total number of data blocks, T represents a single chip length;

[0008] 步骤1.2:对于数据块k,根据步骤I . 1所获得的传输时间Xk,其传输速率Rk有, [0008] Step 1.2: for a data block k, a transmission time according to step I obtained Xk 1, which has a transmission rate Rk,

Figure CN104581867BD00063

,其中,Rk表示数据块k的传输速率,Lk表示数据块k的大小; Wherein, Rk denotes a data transmission rate of the block k, k of Lk indicates the size of the data block;

[0009] (2)根据⑴所述的方法,针对所述被选为中继的用户在 [0009] (2) The method according ⑴, was chosen for the relayed user

Figure CN104581867BD00064

时间中接收来自基站数据块k的同时立即广播给与该中继用户处于同一用户群他用户的过程,考虑基于D2D 协作通信实现该过程的限制条件,所述限制条件包括以下内容: Receiving from the base station while the time k block of data broadcast immediately give the relay user in the same user group his user process, based on considerations D2D achieve collaborative communication restrictions of the process, the constraints include the following:

[0010] 用户i作为数据块k的中继用户时间 [0010] User i as a relay user data time block k

Figure CN104581867BD00065

不能超过数据块k的传输时间Xk,即: Xk not exceed the transmission time of the data block k, namely:

Figure CN104581867BD00066

[0012]用户i在完成对数据块k的中继转发和接收所需数据过程中的能量不能超过其可用能量 [0012] Upon completion of the user i relay data block k receives energy and data forwarding process required not exceed the available energy

Figure CN104581867BD00067

,其中用户i为其所需要的数据块k进行转发所需功率为 , Where i user forwards the data block to the required power it needs k

Figure CN104581867BD00068

,对应能耗为 The corresponding energy consumption

Figure CN104581867BD00069

;用户i为接收数据块k所需接收功率为; ; User k i is the received data block is the desired received power;

Figure CN104581867BD000610

,对应能耗为 The corresponding energy consumption

Figure CN104581867BD000611

,因此即: Therefore namely:

Figure CN104581867BD000612

[0014]用户i在作为数据块k的中继用户时发送功率不能超过其最大发送功率 [0014] When the user i as a relay user data block k in transmission power can not exceed the maximum transmission power

Figure CN104581867BD000613

,否则用户i不能被选作中继,BP: Otherwise, the user i can not be selected as a relay, BP:

Figure CN104581867BD000614

[0016] 其中,函数, [0016] where the function,

Figure CN104581867BD000615

[0017] 在上述限制条件中,各参数定义如下: [0017] In the above limitations, the parameters are defined as follows:

[0018] i:用户i; [0018] i: User I;

[0019] q1:用户i正在发送数据块时的电路功耗; [0019] q1: Sending User i circuit power consumption data block;

[0020] Rk:数据块k的传输速率; [0020] Rk: k is a transmission rate of data blocks;

[0021] Xk:数据块k的传输时间; [0021] Xk: k transmission time of a data block;

[0022] η:信道背景噪声; [0022] η: a channel background noise;

[0023] g小用户i与用户j之间的信道增益; [0023] g small channel gain between user i and user J;

[0024] [0024]

Figure CN104581867BD000616

:用户i接收数据块k过程中的接收功率; : Received power of the received user data block i k process;

[0025] [0025]

Figure CN104581867BD000617

:用户i被选为中继后对于数据块k的发送时间; : Time after transmission of user i is selected as the data block k of the relay;

[0026] [0026]

Figure CN104581867BD00071

i用户i最大可用能量; i maximum available power of user i;

[0027] [0027]

Figure CN104581867BD00072

::用户i最大发送功率; :: maximum transmission power of user i;

[0028] Ω k:对于数据块k有需求的用户集合; [0028] Ω k: k for a data block with a set of user requirements;

[0029] U1:用户i需求的数据块集合; [0029] U1: the data block needs a set of user i;

[0030] 根据所述限制条件,在⑴中所述方法给定数据块传输时间下,选择用户作为中继的同时还要兼顾到对数据块k需求的用户群中的每个用户的公平性,使得能耗尽可能的均分到满足中继条件的用户中去,即在达到节能效果的前提下,尽可能多的选择用户作为中继对属于集合Ω1^]其他用户进行数据块k的分发,步骤包括: While [0030] According to the restriction, in the method ⑴ given transmission time of the data block, the user selected as the relay to also take into account fairness of the data block k needs of users for each user group , so that the average power consumption as much as possible to meet the user to the relay condition, i.e., to save energy in the premise, as many users as a relay belonging to the selected set Ω1 ^] for other users of the data block k distribution, including the steps of:

[0031] 步骤2.1:令- [0031] Step 2.1: Let -

Figure CN104581867BD00073

,其中,tRk表示完成数据块k完成传输的剩余传输时间,ER1表示用户i的剩余可用能量,w表示0个 Wherein, TRK indicating completion of data block k completion of the remaining transmission time, the remaining available energy of the ER1 represents a user i, W represents 0

Figure CN104581867BD00074

中的i,k对应ERi = 0、tRk = 0或用户i不满足发送功率的 The i, k corresponding to ERi = 0, tRk = 0 is not satisfied, or transmission power of user i

Figure CN104581867BD00075

个数; The number;

[0032] 步骤2.2:在考虑数据块传输速率以及包括基站到用户、用户到用户在内信道环境因素下,定义变量: [0032] Step 2.2: considering the transmission rate of data blocks and comprising a base station to a user, user-to-user channel environment factors including, the defined variables:

Figure CN104581867BD00076

,计算对于所有数据块k对应属于集合所有用户下的 , K is calculated for all data blocks corresponding to all users belonging to the set

Figure CN104581867BD00077

[0033] 步骤2.3:将步骤2.2中计算的所有 [0033] Step 2.3: 2.2 in the step of calculating all

Figure CN104581867BD00078

从小到大进行排序,具体如下: From small to large sort, as follows:

[0034] [0034]

Figure CN104581867BD00079

[0035] 其中, [0035] wherein,

Figure CN104581867BD000710

.,表示 ., Expressed

Figure CN104581867BD000711

从小到大排列第 In ascending order of

Figure CN104581867BD000712

个,其中,Θ表示 , Of which, Θ ​​represents

Figure CN104581867BD000713

_个数; _ Number;

[0036] 步骤2.4:将数据块k传输时间0均分成S份,即令 [0036] Step 2.4: transmission time of the data block k S 0 are divided into parts, and even if

Figure CN104581867BD000714

其中,Vk表示数据块k的单位传输时间片,S表不数据块传输时间Xk的均分份数; Wherein, Vk denotes a unit of data block k transmission time slice, S table is not split parts of the data block transfer time Xk;

[0037] 步骤2.5:若θ = 〇,则 [0037] Step 2.5: If θ = square, then

Figure CN104581867BD000715

:跳至步骤2.8;否则令1 = 1,其中,1表示当前 : Skip to Step 2.8; otherwise let 1 = 1, where 1 represents the current

Figure CN104581867BD000716

序号; Serial number;

[0038] 步骤2 . 6 :对于步骤2 . 3得到的 . [0038] Step 26: Step 23 to give the

Figure CN104581867BD000717

根据 according to

Figure CN104581867BD000718

中的i,k得到对应的ERi和tRk,判断若ERi = O, tRk = 0, 则w = w + 1跳至步骤2 . 7 ;否则判断 Of i, k and obtain a corresponding ERi tRk, determines if ERi = O, tRk = 0, then w = w + 1 go to step 27; otherwise Analyzing

Figure CN104581867BD000719

同时 Simultaneously

Figure CN104581867BD00081

若是,则 If so,

Figure CN104581867BD00082

Figure CN104581867BD00083

I tRk = tRk-vk,若否,则w=w+l跳至步骤2 · 7; I tRk = tRk-vk, if not, then w = w + l 2 · skip to step 7;

[0039] 步骤2.7:若W= Θ,则跳至步骤2.8,否则令1 = 1+1,若1>θ,则令I = I,w = 〇并跳至步骤2.6,否则直接跳至步骤2.6; [0039] Step 2.7: If W = Θ, skip to step 2.8, otherwise letting 1 = 1 + 1 if 1> θ, then let I = I, w = square and skip to step 2.6, otherwise skip to step 2.6;

[0040] 步骤2.8:对于数据块k,若仍有 [0040] Step 2.8: for a data block k, if there is still

Figure CN104581867BD00084

的传输时间剩余,则剩余传输时间由基站直接进行广播; The remaining transmission time, the remaining time for the broadcast transmission by the base station directly;

[0041] 步骤2.9:输出:用户i对数据块k的传输时间 [0041] Step 2.9: Output: data transmission time to the user block k i

Figure CN104581867BD00085

[0042] 本发明的技术构思为:首先,结合D2D通信和社交网络各自的优势特性,在等数据块传输时间下完成对数据块的分发,同时相较于每个用户都各自从基站下载数据块的方式达到节能的效果,在此基础上还在一定程度上兼顾到用户的公平性,即将数据块传输时间尽可能地均分给每个满足中继条件的用户。 [0042] The technical idea of ​​the present invention are: First, in conjunction with their respective advantages and characteristics of the D2D communication social network, complete distribution of the data block in the data block transmission time, etc., while the user are compared to each respective data downloaded from the base station block way to save energy, both also on the basis of a certain degree of fairness of the user, ie average block transfer time to each relay satisfies the condition of the user as much as possible. 针对该问题,设计方法得到数据块的传输时间及数据块的传输速率。 To solve this problem, the design method to obtain a transmission rate and a transmission time of a data block of a data block. 其次,确定在数据分发过程中需要考虑的限制条件,针对限制条件设计在给定数据块传输时间和传输速率下的数据分发方法。 Next, it is determined in the data distribution process constraints to be considered, the design constraints for a given data distribution method in a data block transfer time and transfer rate. 即实现在D2D协作通信下兼顾公平性原则的通过数据块传输时间控制和对应的用户中继选择及中继时间控制实现的数据分发,同时相较于用户各自从基站下载数据块方式达到节能的效果。 That is achieved by taking into account the transmission time of the data block of the principle of fairness and control of the relay corresponding to the user selected time and the relay control implemented at the data distribution D2D cooperative communication, and to save energy compared to the respective users from the base station download data block of the embodiment effect.

[0043] 本发明的有益效果主要表现在:1、对于基站而言,通过利用D2D通信的优势,实现对传统网络资源的复用,能够很好地降低基站的通信负载;2、对于用户而言,通过以基于D2D的用户间协作的通信方式,在获得数据资源的同时也达到节省流量资费的效益,基于公平性的原则,对于中继用户来说,中继过程所付出的能耗代价也尽可能地被减小;3、对于整个系统而言,以合理的用户协作方式,有效达到控制整个数据块分发过程的能耗目的;4、紧密结合当今社会需求热点,巧妙利用社交网络特性,实现数据资源的高效利用。 [0043] Advantageous effects of the present invention are mainly: 1, in terms of the base station, by taking advantage of D2D communication, to realize multiplexing of legacy network resources, and could reduce the communication load of the base station; 2, for users words, by D2D communication between users based on collaboration, while also obtaining data resources to achieve savings benefits flow rates based on the principle of fairness, for relay users, relay process to pay for the cost of energy consumption also be reduced as much as possible; 3, for the entire system, a reasonable user collaborate effectively to achieve the purpose of controlling the energy consumption of the entire block distribution process; 4, in close connection with the needs of today's social hot spot, the clever use of social networking features , data efficient use of resources.

附图说明 BRIEF DESCRIPTION

[0044] 图1是基于D2D协作通信的数据块分发系统示意图。 [0044] FIG. 1 is a block-based cooperative communication system diagram D2D distribution.

具体实施方式 detailed description

[0045] 下面结合附图对本发明作进一步详细描述。 [0045] The following figures of the present invention will be further described in detail with.

[0046] 参照图1,一种等数据块传输时间下利用D2D协作通信的带有公平性和节能效果的数据分发方法,实行该方法能在满足各用户对数据块需求下兼顾中继用户间公平性原则的同时,基于D2D协作通信完成数据块的分发,同时相较于每个用户都各自从基站下载数据块的方式达到节能的效果。 [0046] Referring to FIG. 1 A cooperative communications such as the use D2D data distribution method with fairness and energy efficiency of the data block transfer time, implementation of this method can satisfy the balance of each user data block at the relay user demand between at the same time the principle of fairness, the D2D communication based on cooperative distribution data block is completed, while compared to each respective user to save energy from the download data blocks of a base station. 本发明基于D2D协作通信的数据分发系统(如图1所示)。 D2D data distribution system of the present invention is based on cooperative communication (as shown in Figure 1). 在基于D2D 协作通信的数据分发系统中,D2D用户以社交网络中共同兴趣需求为背景,通过D2D方式进行协作通信,设计了兼顾公平性原则并带有节能效果的数据分方法,有效提高了资源的利用率,降低了基站的负载。 In the data distribution system D2D communication based on the collaboration, D2D users with common interests demand a social network as the background, through collaboration D2D communication mode is designed taking into account the principle of equity and method of data points with energy saving effect, effectively improve the resource utilization, reduces the load on the base station. 针对基于D2D协作通信的数据分发系统,提出考虑公平性原则基础上以通过数据块传输时间控制和选择用户作为数据分发中继及其作为中继时间的方式, 完成数据块的对所需求用户的分发,并带有节能效果,所述数据分发方法包括以下步骤: D2D data distribution system for cooperative communication based on considerations proposed based on the principle of fairness by the user to control and select the data block as a data transfer time and the relay as the relay distribution time manner, the data block to the needs of the user distribution, and with energy-saving effect, the data distribution method comprising the steps of:

[0047] (1)在基于D2D的通信网络中,有. [0047] (1) based on the D2D communication network, there.

Figure CN104581867BD00091

个用户,N为总用户数, Users, N being the total number of users,

Figure CN104581867BD00092

•个数据块,K为总数据块个数,其中,数据块k的需求用户群为Qk, • data blocks, K is the total number of data blocks, wherein the data block k needs of users as Qk,

Figure CN104581867BD00093

,数据块k的传输时间为Λ数据块k的大小为Lk,数据块k的单位传输时间为Vk,数据块的均分份数为S,用户i所需要的数据块集合为仏,基站需要在单个时间片T内完成对K个数据块的发送,在数据分发之前将数据块k的传输时间Xk均分为S份每份传输时间为Vk,满足有节能效果条件的中继用户按顺序判断是否满足传输Vk的时间,直至用户可用能量耗尽或者不满足发送条件,最终确定被选为中继的用户对数据块k的中继时间为 , The transmission time for the data block k Λ k is the data block size of Lk, k data blocks is a unit transmission time Vk is, average number of copies of the data block is S, i required for the user data block set is Fo, the base station needs completed within a single time slice K T transmits data blocks, before distributing the data transmission time of the data block k Xk are each divided into parts S is Vk is the transmission time, the relay user satisfying the condition of energy savings in order Vk is judged whether the transmission time, the available energy is depleted or until the user does not satisfy the transmission condition, the time was chosen to finalize the relay relaying user data block is k

Figure CN104581867BD00094

;基站开始数据发送之后,被选为中继的用户在 ; After the base station starts transmitting data, the user is selected as the relay

Figure CN104581867BD00095

时间内接收来自基站数据块k的同时立即广播给与该中继用户处于同一用户群Ω k的其他用户,最后,若数据块k的传输时间Xk在经过所有可选用户中继之后仍有剩余,即 While within the time block k receives the base station data broadcast is immediately given to the relay user to other users in the same group of users k [Omega], and finally, if the transmission time of the data block k Xk still remaining after a user selectable relay all , which is

Figure CN104581867BD00096

的传输时间由基站直接对用户广播发送数据完成;针对该问题,所述数据块传输时间Xk具体由以下步骤获得: The transmission time of the broadcast transmission data done by the user directly to the base station; To solve this problem, the data block obtained from a specific transmission time Xk steps:

[0048] 步骤1.1:基站在单个时间片T内对K个数据块的传输时间都相等,因此,对于数据块k的传输时间Xk有, [0048] Step 1.1: base station transmission time K data blocks are equal within a single time slice list T,, the transmission time for the data block k Xk are,

Figure CN104581867BD00097

,其中,xk表示数据块k的传输时间,k表示数据块集合災中的第k个数据块,K表示数据块的总个数,T表示单个时间片长度; Wherein, XK represents a transmission time of data block k, k represents the k-th set of data blocks in the data block disaster, K represents the total number of data blocks, T represents a single chip length;

[0049] 步骤1.2:对于数据块k,根据步骤I . 1所获得的传输时间Xk,其传输速率Rk有, [0049] Step 1.2: for a data block k, a transmission time according to step I obtained Xk 1, which has a transmission rate Rk,

Figure CN104581867BD00098

,其中,Rk表示数据块k的传输速率,Lk表示数据块k的大小; Wherein, Rk denotes a data transmission rate of the block k, k of Lk indicates the size of the data block;

[0050] (2)根据⑴所述的方法,针对所述被选为中继的用户在 [0050] (2) The method according ⑴, was chosen for the relayed user

Figure CN104581867BD00099

时间中接收来自基站数据块k的同时立即广播给与该中继用户处于同一用户群他用户的过程,考虑基于D2D 协作通信实现该过程的限制条件,所述限制条件包括以下内容: Receiving from the base station while the time k block of data broadcast immediately give the relay user in the same user group his user process, based on considerations D2D achieve collaborative communication restrictions of the process, the constraints include the following:

[0051] 用户i作为数据块k的中继用户时间:不能超过数据块k的传输时间xk,即: [0051] User i as a relay user data block k of time: not exceed the transmission time of the data block k xk, namely:

Figure CN104581867BD000910

Figure CN104581867BD000911

[0053] 用户i在完成对数据块k的中继转发和接收所需数据过程中的能量不能超过其可用能量 [0053] Upon completion of the user i relay data block k receives energy and data forwarding process required not exceed the available energy

Figure CN104581867BD000912

,其中用户i为其所需要的数据块k进行转发所需功率为 , Where i user forwards the data block to the required power it needs k

Figure CN104581867BD000913

,对应能耗为 The corresponding energy consumption

Figure CN104581867BD000914

;用户i为接收数据块k所需接收功率为 ; User k i is the received data block is the desired received power

Figure CN104581867BD000915

,对应能耗为i , Energy consumption corresponding to i

Figure CN104581867BD000916

,因此即: Therefore namely:

Figure CN104581867BD000917

[0055]用户i在作为数据块k的中继用户时发送功率不能超过其最大发送功率 [0055] When the user i as a relay user data block k in transmission power can not exceed the maximum transmission power

Figure CN104581867BD000918

,否则用户i不能被选作中继,BP: Otherwise, the user i can not be selected as a relay, BP:

Figure CN104581867BD00101

[0057] 其中,函数, [0057] where the function,

Figure CN104581867BD00102

[0058] 在上述限制条件中,各参数定义如下: [0058] In the above limitations, the parameters are defined as follows:

[0059] 丨:用户1; [0059] Shu: User 1;

[0060] qi:用户i正在发送数据块时的电路功耗; [0060] qi: Sending User i circuit power consumption data block;

[0061] Rk:数据块k的传输速率; [0061] Rk: k is a transmission rate of data blocks;

[0062] xk:数据块k的传输时间; [0062] xk: k transmission time of a data block;

[0063] η:信道背景噪声; [0063] η: a channel background noise;

[0064] g小用户i与用户j之间的信道增益; [0064] g small channel gain between user i and user J;

[0065] [0065]

Figure CN104581867BD00103

:用户i接收数据块k过程中的接收功率; : Received power of the received user data block i k process;

[0066] [0066]

Figure CN104581867BD00104

:用户i被选为中继后对于数据块k的发送时间; : Time after transmission of user i is selected as the data block k of the relay;

[0067] [0067]

Figure CN104581867BD00105

:用户i最大可用能量; : The maximum available power of user i;

[0068] [0068]

Figure CN104581867BD00106

:用户i最大发送功率; : Maximum transmission power of user i;

[0069] Ω k:对于数据块k有需求的用户集合; [0069] Ω k: k for a data block with a set of user requirements;

[0070] U1:用户i需求的数据块集合; [0070] U1: the data block needs a set of user i;

[0071] 根据所述限制条件,在⑴中所述方法给定数据块传输时间下,选择用户作为中继的同时还要兼顾到对数据块k需求的用户群中的每个用户的公平性,使得能耗尽可能的均分到满足中继条件的用户中去,即在达到节能效果的前提下,尽可能多的选择用户作为中继对属于集合Ω1^]其他用户进行数据块k的分发,步骤包括: While [0071] According to the restriction, in the method ⑴ given transmission time of the data block, the user selected as the relay to also take into account fairness of the data block k needs of users for each user group , so that the average power consumption as much as possible to meet the user to the relay condition, i.e., to save energy in the premise, as many users as a relay belonging to the selected set Ω1 ^] for other users of the data block k distribution, including the steps of:

[0072] 步骤2.1:令tRk = xk,. [0072] Step 2.1: Let tRk = xk ,.

Figure CN104581867BD00107

其中,tRk表示完成数据块k完成传输的剩余传输时间,ER1表示用户i的剩余可用能量,w表示0个 Wherein, tRk indicating completion of data block k completion of the remaining transmission time, ER1 indicates the remaining available energy of user i, w denotes 0

Figure CN104581867BD00108

中的i,k对应ERi = 0、tRk = 0或用户i不满足发送功率的 The i, k corresponding to ERi = 0, tRk = 0 is not satisfied, or transmission power of user i

Figure CN104581867BD00109

个数; The number;

[0073] 步骤2.2:在考虑数据块传输速率以及包括基站到用户、用户到用户在内信道环境因素下,定义变量 [0073] Step 2.2: considering the transmission rate of data blocks and comprising a base station to a user, user-to-user channel environment factors including, the defined variables

Figure CN104581867BD001010

,计算对于所有数据块k对应属于集合所有用户下的 , K is calculated for all data blocks corresponding to all users belonging to the set

Figure CN104581867BD001011

[0074] 步骤2.3:将步骤2.2中计算的所有 [0074] Step 2.3: 2.2 in the step of calculating all

Figure CN104581867BD001012

从小到大进行排序,具体如下: From small to large sort, as follows:

[0075] [0075]

Figure CN104581867BD001013

[0076] 其中, [0076] wherein,

Figure CN104581867BD00111

,表示 Expressed

Figure CN104581867BD00112

从小到大排列第 In ascending order of

Figure CN104581867BD00113

个,其中,Θ表示 , Of which, Θ ​​represents

Figure CN104581867BD00114

的个数; Number;

[0077] 步骤2.4:将数据块k传输时间,均分成S份,即令 [0077] Step 2.4: k transmission time of the data block are divided into parts S, and even if

Figure CN104581867BD00115

,其中,Vk表示数据块k的单位传输时间片,S表;^数据块传输时间Xk的均分份数; Wherein, Vk is a data block represents a unit transmission time slice, S k of the table; ^ sharing copies of data block transfer time Xk;

[0078] 步骤2.5:若θ = 〇,则, [0078] Step 2.5: If θ = square, then,

Figure CN104581867BD00116

,跳至步骤2.8;否则令1 = 1,其中,1表示当前 , Go to step 2.8; otherwise let 1 = 1, where 1 represents the current

Figure CN104581867BD00117

序号; Serial number;

[0079] 步骤2 . 6 :对于步骤2 . 3得到的 . [0079] Step 26: Step 23 to give the

Figure CN104581867BD00118

,根据 ,according to

Figure CN104581867BD00119

中的i,k得到对应的ERi和tRk,判断若ERi = 0,tRk = 0,则w = w +1跳至步骤2.7 ;否则判断」 Of i, k and obtain a corresponding ERi tRk, determines if ERi = 0, tRk = 0, then w = w +1 jumps to step 2.7; otherwise Analyzing "

Figure CN104581867BD001110

同时 Simultaneously

Figure CN104581867BD001111

•若是,则 • If so, then

Figure CN104581867BD001112

Figure CN104581867BD001113

,若否,则w=w+l跳至步骤2 · 7; If not, then w = w + l 2 · skip to step 7;

[0080] 步骤2.7:若W= Θ,则跳至步骤2.8,否则令1 = 1+1,若1>θ,则令I = I,w = 〇并跳至步骤2.6,否则直接跳至步骤2.6; [0080] Step 2.7: If W = Θ, skip to step 2.8, otherwise letting 1 = 1 + 1 if 1> θ, then let I = I, w = square and skip to step 2.6, otherwise skip to step 2.6;

[0081 ] 步骤2.8:对于数据块k,若仍有 [0081] Step 2.8: for a data block k, if there is still

Figure CN104581867BD001114

的传输时间剩余,则剩余传输时间由基站直接进行广播; The remaining transmission time, the remaining time for the broadcast transmission by the base station directly;

[0082] 步骤2.9:输出:用户i对数据块k的传输时间 [0082] Step 2.9: Output: data transmission time to the user block k i

Figure CN104581867BD001115

[0083] 本实施例着眼于当今社会热点需求,巧妙结合社交网络的特性优势,基于D2D协作通信,兼顾中继用户间公平性原则的同时,通过数据块传输时间控制和对应的用户中继选择及中继时间控制的方式实现数据分发,最终相较于每个用户都各自从基站下载数据块的方式达到节能的效果。 [0083] The present embodiment focuses on the needs of today's society hot, the advantages of the unique combination of characteristics of a social network, the D2D communication based cooperative, while taking into account the principles of fairness among users relay, relay selection by a user data block and the corresponding transmission time control and a time-controlled manner the relay data delivery, eventually each user compared to a respective way to save energy from the base station to download data blocks. 我们的工作可以使网络运营商获得更多的利益,服务更多的用户,也使得用户达到获得数据资源的同时节省相应流量资费的目的,有效提高了数据资源的利用率,最终使得网络运营商和用户能够双赢。 Our work enables network operators to get more benefits, more service users, but also allows users to achieve the purpose of saving resources while obtaining data corresponding flow rates, effectively improve the utilization of data resources, and ultimately makes the network operators and users can win.

Claims (1)

  1. 1. 一种等数据块传输时间下利用D2D协作通信的带有公平性和节能效果的数据分发方法,其特征在于:所述数据分发方法包括以下步骤: (1) 在基于D 2D的通信网络中,有Λ「二{1.,2, "'AO个用户,N为总用户数, 咒={1,2, ·*·个数据块,K为总数据块个数,其中,数据块k的需求用户群为Ω、 fe e JT,数据块k的传输时间为Xk,数据块k的大小为Lk,数据块k的单位传输时间为Vk,数据块的均分份数为S,用户i所需要的数据块集合为仏,基站需要在单个时间片T内完成对K个数据块的发送,在数据分发之前将数据块k的传输时间Xk均分为S份每份传输时间为Vk,满足有节能效果条件的中继用户按顺序判断是否满足传输Vk的时间,直至用户可用能量耗尽或者不满足发送条件,最终确定被选为中继的用户对数据块k的中继时间为 The method using the data distribution fairness and energy efficiency with a D2D cooperative communication in a data block, etc. A transmission time, wherein: said data distribution method comprising the steps of: (1) a communication network based on the D 2D , there are Λ "two {1., 2," 'AO users, N being the total number of users, curse = {1,2, · · * data blocks, K is the total number of data blocks, wherein the data block k users to demand Ω, fe e JT, the transmission time of the data block k is Xk, k is the data block size Lk, k a unit transmission time for data blocks Vk, average number of copies of the data block is S, a user i required set of data blocks is Fo, the base station transmits K complete blocks of data within a single time slot T, before distributing the data transmission time of the data block k Xk S is divided into parts each transmission time Vk , the user has to meet the energy saving effect of the relay condition sequentially determines whether the transmission time satisfying Vk, the available energy is depleted or until the user does not satisfy the transmission condition, the time was chosen to finalize the relay relaying user data block is k
    Figure CN104581867BC00021
    基站开始数据发送之后,被选为中继的用户在zf时间内接收来自基站数据块k的同时立即广播给与该中继用户处于同一用户群Qk的其他用户,最后,若数据块k的传输时间Xk在经过所有可选用户中继之后仍有剩余,即 After the base station starts data transmission, is selected as the relay station from a user simultaneously receives the data block k in time immediately zf relay broadcast user is given the same user group Qk other users, and finally, if the transmission data block k Xk is still time remaining after all the optional user in the relay, i.e.,
    Figure CN104581867BC00022
    ,则, ,then,
    Figure CN104581867BC00023
    的传输时间由基站直接对用户广播发送数据完成;所述数据块传输时间Xk具体由以下步骤获得: 步骤1.1:基站在单个时间片T内对K个数据块的传输时间都相等,因此,对于数据块k的传输时间xk有, The transmission time of the broadcast transmission data done by the user directly to the base station; Xk transmission time of the particular data block is obtained from the following steps: Step 1.1: base stations within a single time slot of a transmission time T K data blocks are equal, thus, for k is the transmission time of the data block have xk,
    Figure CN104581867BC00024
    .其中,xk表示数据块k的传输时间,k表示数据块集合沉中的第k个数据块,K表示数据块的总个数,T表示单个时间片长度; 步骤1.2:对于数据块k,根据步骤1.1所获得的传输时间Xk,其传输速率Rk有, Where, xk denotes the transmission time of the data block k, k represents the k-th set of data blocks in the data block Shen, K represents the total number of data blocks, T represents a single chip length; Step 1.2: for a data block k, the transmission time Xk obtained in step 1.1, which has a transmission rate Rk,
    Figure CN104581867BC00025
    其中,Rk表示数据块k的传输速率,Lk表示数据块k的大小; (2) 根据(1)所述的方法,针对所述被选为中继的用户在时间中接收来自基站数据 Wherein, Rk denotes a data transmission rate of the block k, k of Lk indicates the size of the data block; (2) The method according to (1), for the user is selected as the relay station receives data from a time
    Figure CN104581867BC00026
    块k的同时立即广播给与该中继用户处于同一用户群他用户的过程,考虑基于D2D协作通信实现该过程的限制条件,所述限制条件包括以下内容: 用户i作为数据块k的中继用户时间,不能超过数据块k的传输时间xk,即: Block k immediately administered simultaneously broadcasting the relay user in the same user group his user process, based on considerations D2D achieve collaborative communication restrictions of the process, the constraints include the following: User i as relay data block k user time can not exceed the transmission time of the data block k xk, namely:
    Figure CN104581867BC00027
    Figure CN104581867BC00028
    用户i在完成对数据块k的中继转发和接收所需数据过程中的能量不能超过其可用能量 Upon completion of user i relay data block k data forwarding and receiving the energy required in the process can not exceed its available energy
    Figure CN104581867BC00029
    其中用户i为其所需要的数据块k进行转发所需功率为 Wherein i is the user data block k you need to forward the power required to
    Figure CN104581867BC000210
    ,对应能耗为 The corresponding energy consumption
    Figure CN104581867BC000211
    :用户i为接收数据块k所需接收功率为 : User k i is the received data block is the desired received power
    Figure CN104581867BC000212
    > 对应能耗为 > Corresponding to energy consumption
    Figure CN104581867BC000213
    ,因此即: Therefore namely:
    Figure CN104581867BC000214
    用户i在作为数据块k的中继用户时发送功率不能超过其最大发送功率 When a user i transmitting user data block k as a relay in which power can not exceed the maximum transmit power
    Figure CN104581867BC000215
    否则用户i不能被选作中继,BP: Otherwise, the user i can not be selected as a relay, BP:
    Figure CN104581867BC00031
    其中,函数 Where the function
    Figure CN104581867BC00032
    在上述限制条件中,各参数定义如下: i:用户i; Φ:用户i正在发送数据块时的电路功耗; Rk:数据块k的传输速率; xk:数据块k的传输时间; η:信道背景噪声; glJ:用户i与用户j之间的信道增益; In the above limitations, the parameters are defined as follows: i: user i; Φ: Sending User i circuit power consumption data block; Rk: k is a transmission rate of data blocks; xk: k transmission time of a data block; η: channel background noise; glJ: channel gain between user i and user J;
    Figure CN104581867BC00033
    :用户i接收数据块k过程中的接收功率; : Received power of the received user data block i k process;
    Figure CN104581867BC00034
    用户i被选为中继后对于数据块k的发送时间; User i is selected as the transmission time after the relay for the data block k;
    Figure CN104581867BC00035
    用户i最大可用能量; Maximum available power of user i;
    Figure CN104581867BC00036
    用户i最大发送功率; Ω15:对于数据块k有需求的用户集合; U1:用户i需求的数据块集合; 根据所述限制条件,在(1)中所述方法给定数据块传输时间下,选择用户作为中继的同时还要兼顾到对数据块k需求的用户群中的每个用户的公平性,使得能耗尽可能的均分到满足中继条件的用户中去,即在达到节能效果的前提下,尽可能多的选择用户作为中继对属于集合Ω1^]其他用户进行数据块k的分发,步骤包括: 步骤2.1:令tRk = xk The maximum transmission power of user i; Ω15: for the data block k with a set of user requirements; U1: data block needs a set of user i; according to the constraints in (1) the method given in the block transfer time, select the user as the relay but also take into account fairness of demographic data in block k needs of each user, such that the average power consumption as much as possible to meet the user to the relay condition, i.e., to save energy premise effect, as many users as the selected distribution relay belonging to the set ^] other users Ω1 k of data blocks, comprising the step of: step 2.1: Let tRk = xk
    Figure CN104581867BC00037
    ,w = 0,其中,tRk表示完成数据块k完成传输的剩余传输时间,ER1表示用户i的剩余可用能量,w表示0个 , W = 0, where, tRk indicating completion of data block k completion of the remaining transmission time, ER1 indicates the remaining available energy of user i, w denotes 0
    Figure CN104581867BC00038
    中的i,k对应ERi = 0、tRk = 0或用户i不满足发送功率的 The i, k corresponding to ERi = 0, tRk = 0 is not satisfied, or transmission power of user i
    Figure CN104581867BC00039
    个数; 步骤2.2:在考虑数据块传输速率以及包括基站到用户、用户到用户在内信道环境因素下,定义变量 Number; Step 2.2: considering the transmission rate of data blocks and comprising a base station to a user, user-to-user channel environment factors including, the defined variables
    Figure CN104581867BC000310
    ,计算对于所有数据块k对应属于集合所有用户下的 , K is calculated for all data blocks corresponding to all users belonging to the set
    Figure CN104581867BC000311
    步骤2.3:将步骤2.2中计算的所有 Step 2.3: 2.2 in the step of calculating all
    Figure CN104581867BC000312
    从小到大进行排序,具体如下: From small to large sort, as follows:
    Figure CN104581867BC000313
    其中: among them:
    Figure CN104581867BC000314
    ,表示 Expressed
    Figure CN104581867BC000315
    从小到大排列第 In ascending order of
    Figure CN104581867BC00041
    I个,其中,Θ表示 The I, wherein, [Theta] represents
    Figure CN104581867BC00042
    的个数; 步骤2.4:将数据块k传输时间0均分成S份,即令 Number; Step 2.4: transmission time of the data block k S 0 are divided into parts, and even if
    Figure CN104581867BC00043
    其中,Vk表示数据块k的单位传输时间片,S表不数据块传输时间xk的均分份数; 步骤2.5:若Θ = 〇,则 Wherein, Vk is the transmission time slot represents a unit of data block k, S sharing parts table not block transfer time of xk; Step 2.5: If Θ = square, then
    Figure CN104581867BC00044
    跳至步骤2.8;否则令1 = 1,其中,1表示当前 Skip to step 2.8; otherwise let 1 = 1, where 1 represents the current
    Figure CN104581867BC00045
    序号; 步骤2 . 6 :对于步骤2 . 3得到的 No.; Step 26: Step 23 to give the
    Figure CN104581867BC00046
    z,根据 z, in accordance with
    Figure CN104581867BC00047
    中的i,k得到对应的ERi和tRk,判断若ERi = 0,tRk = 0, 则w = w + 1跳至步骤2 . 7 ;否则判断 Of i, k and obtain a corresponding ERi tRk, determines if ERi = 0, tRk = 0, then w = w + 1 go to step 27; otherwise Analyzing
    Figure CN104581867BC00048
    同时 Simultaneously
    Figure CN104581867BC00049
    若是,则 If so,
    Figure CN104581867BC000410
    ERi = ERi - ERi = ERi -
    Figure CN104581867BC000411
    若否,则W=w+1跳至步骤2 · 7; 步骤2.7 :若W = Θ,则跳至步骤2.8,否则令1 = 1 + 1,若1>θ,则令I = I,w = 〇并跳至步骤2.6,否则直接跳至步骤2.6; 步骤2.8:对于数据块k,若仍有 If not, W = w + 1 2 · skip to step 7; Step 2.7: If W = Θ, skip to step 2.8, otherwise letting 1 = 1 + 1 if 1> θ, then let I = I, w and go to step 2.6 = square, otherwise skip to step 2.6; step 2.8: for a data block k, if there is still
    Figure CN104581867BC000412
    的传输时间剩余,则剩余传输时间由基站直接进行广播; 步骤2.9:输出:用户i对数据块k的传输时间 The remaining transmission time, the remaining time for the broadcast transmission by the base station directly; Step 2.9: Output: data transmission time to the user block k i
    Figure CN104581867BC000413
    3 3
CN 201510020752 2015-01-15 2015-01-15 D2d cooperative communication using one kind of the other block with the transmission time of data distribution method and energy efficiency of fairness CN104581867B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201510020752 CN104581867B (en) 2015-01-15 2015-01-15 D2d cooperative communication using one kind of the other block with the transmission time of data distribution method and energy efficiency of fairness

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201510020752 CN104581867B (en) 2015-01-15 2015-01-15 D2d cooperative communication using one kind of the other block with the transmission time of data distribution method and energy efficiency of fairness

Publications (2)

Publication Number Publication Date
CN104581867A true CN104581867A (en) 2015-04-29
CN104581867B true CN104581867B (en) 2018-04-27

Family

ID=53096830

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201510020752 CN104581867B (en) 2015-01-15 2015-01-15 D2d cooperative communication using one kind of the other block with the transmission time of data distribution method and energy efficiency of fairness

Country Status (1)

Country Link
CN (1) CN104581867B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106576077A (en) * 2015-07-24 2017-04-19 华为技术有限公司 Method, base station and network server determining relay UE and social relationship in a mobile social network

Citations (2)

* 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
CN103533615A (en) * 2013-10-22 2014-01-22 桂林电子科技大学 Energy-saving relay selection method for cooperative transmission of cognitive radio

Patent Citations (2)

* 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
CN103533615A (en) * 2013-10-22 2014-01-22 桂林电子科技大学 Energy-saving relay selection method for cooperative transmission of cognitive radio

Also Published As

Publication number Publication date Type
CN104581867A (en) 2015-04-29 application

Similar Documents

Publication Publication Date Title
Feng et al. Device-to-device communications underlaying cellular networks
Golrezaei et al. Base-station assisted device-to-device communications for high-throughput wireless video networks
Cheng et al. D2D for intelligent transportation systems: A feasibility study
Andreev et al. Cellular traffic offloading onto network-assisted device-to-device connections
US20100085916A1 (en) Systems and Methods for Hybrid Wired and Wireless Universal Access Networks
US20130007287A1 (en) Dynamic Multicast Session Setup in LTE Networks
CN103188742A (en) Communication switching-over method, user equipment and base station
CN102123496A (en) Method for multiplexing cellular user resources of device-to-device (D2D) user pairs based on base station positioning
Zhang et al. Power allocation for full-duplex relaying-based D2D communication underlaying cellular networks
CN1568034A (en) Mobile communication system apparatus and method for implementing cluster service
Al-Kanj et al. Energy-Aware Cooperative Content Distribution over Wireless Networks: Design Alternatives and Implementation Aspects.
CN102858012A (en) Subsequent evolution embedded D2D(device-to-device) implementing method on basis of IMT-A (intelligent multimode terminal-advanced) standards
CN1905694A (en) Transmitting method and receiving method for multimedia broadcasting/multicasting service
CN1570992A (en) Traffic signal remote control system
CN1585316A (en) Method for building public transmitting channel for MBMS service
CN102595314A (en) Position-information-based device-to-device (D2D) clustering multicast method
CN101610593A (en) Access point, access controller and method for access point to select access controller
Al-Kanj et al. Optimal cellular offloading via device-to-device communication networks with fairness constraints
Magurawalage et al. Energy-efficient and network-aware offloading algorithm for mobile cloud computing
US20110051651A1 (en) Method and apparatus for multicast tree management in multi-hop relay communication system
Kashef et al. Energy efficient resource allocation for mixed RF/VLC heterogeneous wireless networks
CN102970713A (en) Method and equipment for shunting services based on hierarchical network
Abrol et al. Power optimization in 5G networks: A step towards GrEEn communication
US20160037569A1 (en) Method and device for processing proximity-based service in wireless communication system
Cheung et al. DAWN: Delay-aware Wi-Fi offloading and network selection

Legal Events

Date Code Title Description
C06 Publication
C10 Entry into substantive examination
GR01