資源簡(jiǎn)介
D2D通信的資源分配算法。一對(duì)一復(fù)用,吞吐量最大化。
代碼片段和文件信息
%?reliability
x=[0?.10?.20?.30?.40?.50];
d=[1?.92?.84?.76?.70?.68];
e=[1?.98?.92?.86?.80?.76];
plot(xd‘b‘xe‘r‘?‘LineWIdth‘2)
xlabel(‘Threshold‘);
ylabel(‘Sucess?Probability‘);
legend(?‘SOR?Method‘?‘Proposed?Method‘)
?屬性????????????大小?????日期????時(shí)間???名稱
-----------?---------??----------?-----??----
?????文件????????234??2018-03-07?16:57??New?folder\GRAPH.m
?????文件????1850530??2018-04-02?14:09??New?folder\master_Wahlstr?m_Pirkko_2015.pdf
?????文件????????654??2018-02-21?15:11??New?folder\msra_obj.m
?????文件???????3635??2018-03-30?20:55??New?folder\newpaper.m
?????文件???????4418??2018-03-30?19:22??New?folder\paper.m
?????目錄??????????0??2018-04-02?15:07??New?folder
-----------?---------??----------?-----??----
??????????????1859471????????????????????6
評(píng)論
共有 條評(píng)論