[ns] Maintaining and Updating vector table
Hello ns-users, I have a problem and hope somebody will help. Problem- I want to maintain a table (path table) where each Node - keeps info for every other node i.e. next hop to reach that node and the least cost. Now the problem is how should I create table for each node and update these tables with other node table. i.e how can I create vector table and exchange vector information Thank you Send instant messages to your online friends http://in.messenger.yahoo.com
[ns] NS 2.29 in X86_64 (Suse 10.0)
Hello,
I installed Suse Linux 10.0 (uname -a gives Linux linux
2.6.13-15.7-default #1 x86_64 x86_64 x86_64 GNU/Linux) in a Turion 64
processor.
Googling the mailing list I found some usefull tips I translated in the
patch bellow, including my own contribution.
After ./validate, I got the following:
validate overall report: some tests failed:
./test-all-tcpHighspeed ./test-all-srm ./test-all-smac-multihop
./test-all-hier-routing ./test-all-algo-routing ./test-all-mcast
./test-all-vc ./test-all-session ./test-all-mixmode ./test-all-red
./test-all-cbq ./test-all-webcache ./test-all-mcache ./test-all-plm
./test-all-wireless-tdma ./test-all-xcp
Maybe, the errors listed above come from my modifications. I don't know,
but the patch could help someone as a starting point.
Thanks,
Marcos
---
*diff -Naur ns-allinone-2.29-orig/install ns-allinone-2.29/install*
*--- ns-allinone-2.29-orig/install 2005-10-22 15:34:47.0 -0200*
*+++ ns-allinone-2.29/install 2006-01-20 15:56:37.0 -0200*
@@ -468,7 +468,7 @@
blame='Please check http://www.isi.edu/nsnam/ns/ns-problems.html
for common problems and bug fixes.'
if [ "${test_cygwin}" = "true" ]; then
-./configure --x-libraries=/usr/X11R6/lib
--x-includes=/usr/X11R6/include || die "otcl-$OTCLVER configuration failed!
Exiting ...";
+./configure --x-libraries=/usr/X11R6/lib64
--x-includes=/usr/X11R6/include || die "otcl-$OTCLVER configuration failed!
Exiting ...";
else
./configure || die "otcl-$OTCLVER configuration failed! Exiting ...";
fi
@@ -493,7 +493,7 @@
cd ./tclcl-$TCLCLVER
if [ "${test_cygwin}" = "true" ]; then
-./configure --x-libraries=/usr/X11R6/lib
--x-includes=/usr/X11R6/include || die "tclcl-$TCLCLVER configuration failed!
Exiting ...";
+./configure --x-libraries=/usr/X11R6/lib64
--x-includes=/usr/X11R6/include || die "tclcl-$TCLCLVER configuration failed!
Exiting ...";
else
./configure || die "tclcl-$TCLCLVER configuration failed! Exiting ..."
fi
@@ -522,7 +522,7 @@
fi
if [ "${test_cygwin}" = "true" ]; then
-./configure --x-libraries=/usr/X11R6/lib
--x-includes=/usr/X11R6/include || die "Ns configuration failed! Exiting ...";
+./configure --x-libraries=/usr/X11R6/lib64
--x-includes=/usr/X11R6/include || die "Ns configuration failed! Exiting ...";
else
./configure || die "Ns configuration failed! Exiting ...";
fi
@@ -547,7 +547,7 @@
cd ./nam-$NAMVER
if [ "${test_cygwin}" = "true" ]; then
-./configure --x-libraries=/usr/X11R6/lib
--x-includes=/usr/X11R6/include --with-tclcl=$CUR_PATH/tclcl-$TCLCLVER || die
"Nam configuration failed! Exiting ...";
+./configure --x-libraries=/usr/X11R6/lib64
--x-includes=/usr/X11R6/include --with-tclcl=$CUR_PATH/tclcl-$TCLCLVER || die
"Nam configuration failed! Exiting ...";
else
./configure --with-tclcl=$CUR_PATH/tclcl-$TCLCLVER || die "Nam
configuration failed! Exiting ...";
fi
*diff -Naur ns-allinone-2.29-orig/nam-1.11/conf/configure.in.x11
ns-allinone-2.29/nam-1.11/conf/configure.in.x11*
*--- ns-allinone-2.29-orig/nam-1.11/conf/configure.in.x11 2004-12-17
13:14:20.0 -0200*
*+++ ns-allinone-2.29/nam-1.11/conf/configure.in.x112006-01-20
15:56:37.0 -0200*
@@ -3,6 +3,7 @@
xlibdirs="\
/usr/openwin/lib \
+ /usr/X11R6/lib64 \
/usr/X11R6/lib \
/usr/lib/X11R6 \
/usr/X11R5/lib \
*diff -Naur ns-allinone-2.29-orig/nam-1.11/config.status
ns-allinone-2.29/nam-1.11/config.status*
*--- ns-allinone-2.29-orig/nam-1.11/config.status 2005-01-24
17:48:25.0
-0200*
*+++ ns-allinone-2.29/nam-1.11/config.status2006-01-20 15:56:37.0
-0200*
@@ -77,7 +77,7 @@
[EMAIL PROTECTED]@%gcc%g
[EMAIL PROTECTED]@%c++%g
[EMAIL PROTECTED]@%%g
[EMAIL PROTECTED]@%-L/usr/X11R6/lib -lXext -lX11%g
[EMAIL PROTECTED]@%-L/usr/X11R6/lib64 -lXext -lX11%g
[EMAIL PROTECTED]@%$(TCL_84_LIBRARY_FILES)%g
[EMAIL PROTECTED]@%/users/haldar/tcl8.4.5/bin/tclsh8.4%g
[EMAIL PROTECTED]@%/users/haldar/tcl8.4.5/lib/tcl8.4%g
*diff -Naur ns-allinone-2.29-orig/nam-1.11/config.sub
ns-allinone-2.29/nam-1.11/config.sub*
*--- ns-allinone-2.29-orig/nam-1.11/config.sub 2005-01-25 21:22:43.0
-0200*
*+++ ns-allinone-2.29/nam-1.11/config.sub 2006-01-20 15:56:37.0
-0200*
@@ -267,7 +267,7 @@
| tahoe | thumb | tic4x | tic80 | tron \
| v850 | v850e \
| we32k \
- | x86 | xscale | xstormy16 | xtensa \
+ | x86 | x86_64 | xscale | xstormy16 | xtensa \
| z8k)
basic_machine=$basic_machine-unknown
;;
@@ -1172,7 +1172,7 @@
;;
-qnx*)
case $basic_machine in
- x86-* | i*86-*)
+ x86-* | x86_64-* | i*86-*)
;;
*)
os=-nto$os
*diff -Naur ns-allinon
[ns] kindly help me with these simulations
dear all , Please go through this scenario that I am supposed to simulate (it is an excerpt from a paper) . I have already underlined the part I am unable to have under simulate .Please go through the whole mail and kindly send in your inputs .I have already mailed about this topic even earlier but could not get through ,due to lack of any sort of input . The DSR implementation built in to NS-2 version 2.1b9 was used as a base, and some slight modifications were made to simulate the sinkhole attacker node. The simulation environment was composed of 20 wireless nodes, each with a transmission radius of 250m. At the start of each simulation, the nodes were given random placements in a 1000m x 1000m area, and a random movement pattern was generated, which the nodes adhered to, using CMUs setdest program, which is included with NS-2. The program generates node movement files using the random waypoint algorithm, in which nodes choose a random point within the area boundaries, and proceed towards it at a randomly chosen constant velocity. When the node arrives at its destination, it pauses for some interval, and then repeats the process. Constant bit rate traffic patterns were also generated at the start of each simulation, using the cbrgen.tcl program that is included with NS-2. A total of 23,710 simulations were run. Of these, 19,797 of them were normal, cooperative DSR networks with no sinkhole attacker, and 3,913 of them were with a single sinkhole attacker identified as node 20. In the simulation, the sinkhole attacker ran the same DSR code as the other nodes. However, in addition to the normal behavior, a new behavior was triggered by a timer that normally goes off every 0.03 seconds to check the DSR send buffer the normal purpose of this is to flush packets that have been queued for asynchronous transmission. In the case of the attacker, this timer would cause 18 bogus route request messages to be sent, in rapid succession, with the purpose of redirecting all routes leading to a particular target node, starting with node 1. The target node would then be incremented. After the timer had fired 18 times, the attacker would have made an effort to redirect all routes in the network to itself, and the target node would be reset to 1. For these messages, the attacker node used sequence numbers starting at , incrementing the sequence number each time a message was sent. I am supposed to simulate the Sinkhole attack (made on Ad-Hoc Networks) . As i am quite new to ns-2 programming I am unable to do so .The main problem is that how do we create routing tables for the different nodes in the ad-hoc network (or Mobile Network) and then how can we represent the sending of information from a compromised node that it has the shortest route for a number of nodes . Kindly helpme out as I am stuck badly here .Any sort of inputs are welcome .I am also including a definition of the sinkhole attacks at the bottom . Expecting a quick relief . Sinkhole attacks By carrying out a sinkhole attack, a compromised node tries to attract the data to itself from all neighboring nodes. Since this would give access to all data to this node, the sinkhole attack is the basis for many other attacks likes eavesdropping or data alteration. Sinkhole attacks make use of the loopholes in routing algorithms of ad hoc networks and present themselves to adjacent nodes as the most attractive partner in a multihop route. Even though by definition nodes on the network layer of an ad hoc network are equal, sinkhole attacks might be very effective on application level, where nodes may have different roles. This means, that as stated the effect of sinkhole attacks on networks with centralized entities can be especially grave, because by impersonating the centralized node or its neighbors, the adversary can get access to the biggest part of the data flowing through the network. Send instant messages to your online friends http://in.messenger.yahoo.com
[ns] Installation issues - Qiang's 802.11 EDCF simulator
Hi, During the installation of Qiang's 802.11 EDCF simulator(ftp://ftp-sop.inria.fr/rodeo/qni/ns-edcf.tar.gz), I have following problem (I use Red Hat 7.3) : after "make install" command I get the following error: tclAppInit.o: In function `Tcl_AppInit': tclAppInit.o(.text+0x122): undefined reference to `et_ns_lib' misc.o: In function `VersionCommand::command(int, char const *const *)': misc.o(.VersionCommand::gnu.linkonce.t.command(int, char const *const*)+0x8): undefined reference to `version_string' collect2: ld returned 1 exit status make: *** [ns] Error 1 I would be very grateful for any suggestions how to cope with this problem and make the installation succesful. Regards, Marek Swierk
[ns] kindly help me with the simulation of Sinkholes Attacks (ad-hoc network) on ns-2
Ashutosh Srivastava <[EMAIL PROTECTED]> wrote:dear all , I am supposed to simulate the Sinkhole attack (made on Ad-Hoc Networks) . As i am quite new to ns-2 programming I am unable to do so .The main problem is that how do we create routing tables for the different nodes in the ad-hoc network (or Mobile Network) and then how can we represent the sending of information from a compromised node that it has the shortest route for a number of nodes . Kindly helpme out as I am stuck badly here .Any sort of inputs are welcome .I am also including a definition of the sinkhole attacks at the bottom . Expecting a quick relief . Sinkhole attacks By carrying out a sinkhole attack, a compromised node tries to attract the data to itself from all neighboring nodes. Since this would give access to all data to this node, the sinkhole attack is the basis for many other attacks likes eavesdropping or data alteration. Sinkhole attacks make use of the loopholes in routing algorithms of ad hoc networks and present themselves to adjacent nodes as the most attractive partner in a multihop route. Even though by definition nodes on the network layer of an ad hoc network are equal, sinkhole attacks might be very effective on application level, where nodes may have different roles. This means, that as stated the effect of sinkhole attacks on networks with centralized entities can be especially grave, because by impersonating the centralized node or its neighbors, the adversary can get access to the biggest part of the data flowing through the network. Send instant messages to your online friends http://in.messenger.yahoo.com
[ns] mobile node ?
Hi, Can a single mobile node in ns 2.28 support generating several flows at the same time ? For example : I want to establish 2 TCP flows and 2 TFRC flows between 'node 0' and 'node 3' at the same time in a multi hop wireless network ( no mobility). Is there any restriction in ns ? From my results I observe only one flow exists most of the time. Thanks. PBA
[ns] Regarding Queuing delay
Hello, I am simulating wireless networks-single hop.I use "tracegraph" for getting the "end to end delays".My question is,when u set the source trace as AGT and destination trace as MAC,does the "end to end delay" include the queuing delay at the source? Another question is regarding an anomaly.. I am simulating a wireless environment where the nodes are arranged in a random fashion(ie topology is random and the arrangement is made in such a way that it satisfies the single hop condition.)The experiment is repeated several times to get the distribution of the delay Traffic-CBR No.of flows-5,10,14 problem is when the rate is 400kbps the delay u get is concentrated on a smaller value than that obtained for 200kbps.and for 100kbps u get a still greater value than 200kbps..but the difference di Is it because the nodes are going to saturation? The channel bit rate is 1Mbps.. So will the nodes be in the saturation state? And will that affect the delay if so why? If neone can explain these that will be really very helpful for me.. Thanks in advance.. Teena.
[ns] static routing in 802.15.4
Dear all, I am a newbie in NS2, and I am working on wireless sensors network simulation using the 802.15.4 module developed by Zheng. The scripts that come with the module use AODV as the routing protocol. However, I would like to configure static routing tables for each node, so as to be able to control the exact path followed by my packets. Can anybody give suggestions on how to do this? Thanks in advance! Regards, Sara Della Luna
[ns] R: 802.11 simulating
The number of transmissions is not sufficient to determine the cause of such a high number of collisions. Several other parameters are necessary: simulation time, transmission range of nodes, use of RTS/CTS, 802.11 CWND min and max sizes, etc. Regards, Marco Fiore Messaggio originale Da: [EMAIL PROTECTED] Data: 19-gen-2006 4.25 PM A: Ogg: [ns] 802.11 simulating Hi all! I´m simulating a sensor network, with 100 nodes in a 1000x1000 scenario, but I´ve a terrible number of collisions: 47935 in 19905 messages sent... The packet is 52 byte long. I use the 802.11 with ns2.28 Someone have some tricks? Or someone can help me to understand the reason? Maybe I have to configure better some parameters? Many thanks!!
[ns] Layer Three Handoff Detection Algorithms
Hi all Users. I am new to ns and using ns2.28 in Linux RedHat 8.0 environment. can anyone help me to implement the layer three detection Algorithms for mobile IP (like lazy cell switching, eager cell switching etc) in ns 2.28. thanks - Yahoo! Photos Showcase holiday pictures in hardcover Photo Books. You design it and well bind it!
