hello a,
my final year mtech thesis will be on secured clustered wireless sensor
network ...
and i am going to implement it on ns2. any one of you can u have cluster
formation code.. please reply me if u have either code or any kind of
suggestion..
eagerly waiting
Hi everyone
I am very new to NS2 and ns2 manual is not user friendly at all.
I need to be able to broadcast a single UDP packet at unpredictable
moments(determined through the program logic). This broadcast is initiated
by one of the 400 nodes present in the MANET Network and every other
Hi all ns users and Qiming,
I tried ff the instructn they gave in the tutorial on how to go about that and
this is what I got;
input Number of Groups:
1
input Number of Node per group:
5
input the Speed Deviation:
0
input the Angle Deviation (in degree):
0
input the Filename of the original
Dear all,
I'm trying to access the physical layer from the aodv agent. So I need
to include the wireless-phy.h in the aodv.h. However, it gives me the following
compilation errors when i #include wireless-phy.h:
In file included from ./aodv/aodv.h:48,
from aodv/aodv_logs.cc:31:
Hi Mubashir,
Thanks again but its not working when i use index as the argument to any
function,
such as coutindex or get_node_by_address(index). I get an error which
says:
1366: error: no matching function for call to
‘Node::get_node_by_address(unresolved overloaded function type)’
ive
Hi
Do somebody know how can I print the printf commands' contents in .cc
source codes which are for debugging? I want to print them in a text file!
Thanks,
Elham
i have made .cc files which are calculating the routing path based on my
algorithm.First they are calculating the path and store in orig.txt then by
the concept of dominanace, some path gets deleted.and finally pareto optimal
paths are stored in dominance.txt.
Now to show the simulation i have
i have made .cc files which are calculating the routing path based on my
algorithm.First they are calculating the path and store in orig.txt then by
the concept of dominanace, some path gets deleted.and finally pareto optimal
paths are stored in dominance.txt.
Now to show the simulation i have