文件名称:findoptt
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:1.25kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
function optt = findoptt(L,C,pmax,rP,a,w,maxw)
Arguments:
L =input( links in the network )
C =input( coordinates of nodes )
pmax =input( max. transmission power )
rP - see rndtopo2d
a - fading coefficient (a<-2)
Output:
optt(i) - optimal blocking distance around destination of L(i),
i.e. radius of the circle in which there should be no active nodes
when L(i) is active.
Descr iption:
We try to estimate the optimal blocking distance for the source of each link.
For every node we start with a candidate distance t. We then estimate a number of slots N needed
for the network as a number of link sources in that circle. We also est-
function optt = findoptt(L,C,pmax,rP,a,w,maxw)
Arguments:
L =input( links in the network )
C =input( coordinates of nodes )
pmax =input( max. transmission power )
rP - see rndtopo2d
a - fading coefficient (a<-2)
Output:
optt(i) - optimal blocking distance around destination of L(i),
i.e. radius of the circle in which there should be no active nodes
when L(i) is active.
Descr iption:
We try to estimate the optimal blocking distance for the source of each link.
For every node we start with a candidate distance t. We then estimate a number of slots N needed
for the network as a number of link sources in that circle. We also est
(系统自动生成,下载前可以参看下载内容)
下载文件列表
findoptt.m
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.