Description: This project helps us to identify the shortest distance in the wireless ad-hoc networks. here in this project EASE algorithm is implemented in order to identify the destination. and the code has been written by using MATLAB. Platform: |
Size: 4096 |
Author:RUPA KRISHNA |
Hits:
Description: 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- 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 Platform: |
Size: 1024 |
Author:Hemanth |
Hits:
Search - matlab code for aodv