findoptt.zip -
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.
Description:
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,2010-04-05 19:31:43,下载23次
routing.zip - clc
clear
n=input( Total node= )
if n > 6
error( not <6 )
end
alphabets= char(65:1:65+n)
adj=zeros(n,n)
for p=1:n
for q=1:n
adj(p,q)=input([ Enter Weight between [ ,alphabets(p), ] , [ ,alphabets(q), ] = ])
end
end
for p=1:n
a(p).status=0 ,2010-04-05 19:30:07,下载14次
dijkstra.zip - clear all
clc
D=[0 6 inf inf 5 6 inf 5 inf
6 0 9 inf inf 9 inf 3 inf
inf 9 0 7 inf inf 4 inf inf
inf inf 7 0 6 4 6 inf 3
5 inf inf 6 0 5 inf inf 4
6 9 inf 4 5 0 5 inf inf
inf inf 4 6 inf 5 0 inf inf
5 3 inf inf inf inf inf 0 inf
inf inf inf 3 4 inf inf inf 0]
[m,n]=size(D)
E=zeros(m,n)
for s=1:m
d=inf.*ones(1,m)
d(1,s)=0
ok=zeros(1,m)
pre=zeros(1,m)
while length(find(ok==1))<m
minD=inf
for k=1:m
if ok(k)==0&&minD>d(k)
minD=d(k)
y=k
end
end
if minD==inf
break
,2010-04-05 19:28:54,下载7次
sureshaodv.zip - Code : AODV Routing.
x=1:20
s1=x(1)
d1=x(20)
clc
A=randint(20)
Making matrix all diagonals=0 and A(i,j)=A(j,i),i.e. A(1,4)=a(4,1),
A(6,7)=A(7,6)
for i=1:20
for j=1:20
if i==j
A(i,j)=0
else
A(j,i)=A(i,j)
end
end
end,2010-04-05 19:27:42,下载111次
routing99.zip - clc
clear all
close all
Field Dimensions - x and y maximum (in meters)
xm = 200
ym = 200
sink.x =0.25 * xm
sink.y =0.875 * ym
,2010-04-05 19:26:33,下载2次