Tuesday, January 31, 2012

The averaged results of neural network analyses are presented in Fig - Technology

The Stuttgart Neural Network Simulator (SNNS - free-available software simulator) has been used in our studies to build and train networks used in the experiments. We have implemented the "Quickprop" training algorithm with continuous sigmoid activation of neurons, because of the character of data. A classic four divided cross-validation method, multiple random initialisations and network trainings [3] have been used in order to check the correctness and repeatability of the results. The test's results of ten networks were averaged to get partial results.

These partial results, after ultimate averaging for four divisions, provided us with the percentage of correct detected persons (Fig. 2). In our neural network experiments we have used 19 parameters (Table 1, Set I) because some of 26 mentioned features were expressed both in minutes and in percents of total sleep time. There are also parameters, which can be calculated on the basis of the others from that set, for example "stage3 plus stage4". Therefore, we can simplify the analysed set to only 13 parameters (Table 1, Set II).

To evaluate an influence of particular parameters on result of alcoholic addiction detection, we checked how reducing of each parameter from training set (Table 1; Set II) changes the outcome. Fig. 2 shows the results of these experiments. We have also calculated percentage of effective networks' initialisations as a tentative method of estimation the parameter's significance.

The statistical analysis (Fig. 1) shows that some sleep parameters have small differences (100%) standard deviation in both groups. This means that detection of alcoholic addiction based on statistical methods would have too small correctness to be reliable.

The averaged results of neural network analyses are presented in Fig. 2. We have obtained the percentage of correct detections from 69,9% to 76,6% with the standard deviation of 0,83,8% for all experiments. Effective initialisations were from 64% to 97,5%. Based on the results shown in Fig. 2 we can notice, that lack of some parameters in the Set II leads to better results (e.g. "latency to stage 3 and 4"). Simultaneously, a deficiency of the other ones causes noticeable deterioration of the detections' outcomes (e.g. "stage 4 NREM" and "stage 3 NREM"). The significance weight of parameters: "stage 3 NREM" and "stage 4 NREM" was confirmed by the values of the received numbers of the effective initializations and by substantial differences in the averages for the groups. Moreover, the big difference in the averages of "latency to stage 3 and 4" seems to be not correlated with alcohol addiction.

The noticeable differences of the results for the specified sets of parameters (Set I and Set II) indicate that the redundant information decrease reliability of the detections and optimization of the set's composition is required. We have proposed the Set III (Table 1) to check if we can reduce a number of features from the Set II without worsening the correctness of diagnosing. We obtained 76,25% correctness of diagnoses with 51,6% effective initializations for the neuronal network with 5 hidden units.

Simultaneously, we achieved the 76,83% correctness of diagnoses with 96,4% effective initializations for the neuronal network with 7 hidden units. These results show that "weak features" are necessary to optimise the learning process' quality.


0

The averaged results of neural network analyses are presented in Fig - Technology

The Stuttgart Neural Network Simulator (SNNS - free-available software simulator) has been used in our studies to build and train networks used in the experiments. We have implemented the "Quickprop" training algorithm with continuous sigmoid activation of neurons, because of the character of data. A classic four divided cross-validation method, multiple random initialisations and network trainings [3] have been used in order to check the correctness and repeatability of the results. The test's results of ten networks were averaged to get partial results.

These partial results, after ultimate averaging for four divisions, provided us with the percentage of correct detected persons (Fig. 2). In our neural network experiments we have used 19 parameters (Table 1, Set I) because some of 26 mentioned features were expressed both in minutes and in percents of total sleep time. There are also parameters, which can be calculated on the basis of the others from that set, for example "stage3 plus stage4". Therefore, we can simplify the analysed set to only 13 parameters (Table 1, Set II).

To evaluate an influence of particular parameters on result of alcoholic addiction detection, we checked how reducing of each parameter from training set (Table 1; Set II) changes the outcome. Fig. 2 shows the results of these experiments. We have also calculated percentage of effective networks' initialisations as a tentative method of estimation the parameter's significance.

The statistical analysis (Fig. 1) shows that some sleep parameters have small differences (100%) standard deviation in both groups. This means that detection of alcoholic addiction based on statistical methods would have too small correctness to be reliable.

The averaged results of neural network analyses are presented in Fig. 2. We have obtained the percentage of correct detections from 69,9% to 76,6% with the standard deviation of 0,83,8% for all experiments. Effective initialisations were from 64% to 97,5%. Based on the results shown in Fig. 2 we can notice, that lack of some parameters in the Set II leads to better results (e.g. "latency to stage 3 and 4"). Simultaneously, a deficiency of the other ones causes noticeable deterioration of the detections' outcomes (e.g. "stage 4 NREM" and "stage 3 NREM"). The significance weight of parameters: "stage 3 NREM" and "stage 4 NREM" was confirmed by the values of the received numbers of the effective initializations and by substantial differences in the averages for the groups. Moreover, the big difference in the averages of "latency to stage 3 and 4" seems to be not correlated with alcohol addiction.

The noticeable differences of the results for the specified sets of parameters (Set I and Set II) indicate that the redundant information decrease reliability of the detections and optimization of the set's composition is required. We have proposed the Set III (Table 1) to check if we can reduce a number of features from the Set II without worsening the correctness of diagnosing. We obtained 76,25% correctness of diagnoses with 51,6% effective initializations for the neuronal network with 5 hidden units.

Simultaneously, we achieved the 76,83% correctness of diagnoses with 96,4% effective initializations for the neuronal network with 7 hidden units. These results show that "weak features" are necessary to optimise the learning process' quality.


0

[ns] CONFIDANT mechanism for DSR

I want to implement Trust MANET protocol namely CONFIDANT mechanism.
However, I didn't know how to compile (makefile) it under NS-2.
Anyone...please teach me how to compile it..
This is the link of thesis contains the codes.

http://www2.imm.dtu.dk/pubdb/views/publication_details.php?id=3961
--
View this message in context: http://old.nabble.com/CONFIDANT-mechanism-for-DSR-tp33236000p33236000.html
Sent from the ns-users mailing list archive at Nabble.com.

[ns] CBQ as ifq for wireless node

All ns-users
How can i use class based queuing (CBQ) as
interface queue for wireless node.

Regards
Moazzam

[ns] [IEEE AOC 2012] Call for Papers

--------------------------------------------------------------------------------
CALL FOR PAPERS
Sixth IEEE WoWMoM Workshop on
Autonomic and Opportunistic Communications (AOC 2012)
June 25, 2012 - San Francisco, California, USA
http://cnd.iit.cnr.it/aoc2012/

jointly supported by the

SCAMPI project
funded by the FP7-ICT Programme under the
Future Internet Research and Experimentation (FIRE) initiative
http://www.ict-scampi.eu/

and

RECOGNITION project
funded by the FP7-ICT Programme under the
Future and Emerging Technologies (FET) initiative
http://www.recognition-project.eu/


Fast Track on Computer Communication Journal
http://www.elsevier.com/locate/comcom


**** Submission Deadline --- February 17, 2012 ****
--------------------------------------------------------------------------------


The diffusion of lightweight, powerful portable devices, also enriched with a
variety of sensing capabilities, is enabling new ways for users' communication,
and laying the foundation for realizing the ubiquitous networking idea. Acting
either as the main communication mode or as complement to existing mobile
network infrastructures, opportunistic networking can leverage the mobility of
end users and enhance their communication capabilities. The opportunistic
exploitation of extemporary contacts among the users of the network paves the
way to a number of applications but also poses new and challenging problems to
the networking research community. The AOC 2012 workshop aims at serving as a
meeting point for people working in the area and a forum for exchanging ideas,
discussing solutions, and sharing experiences among researchers, professionals,
and application developers, both from industry and academia. As with the
previous five editions of the AOC workshop series, the scope of this year's
workshop will remain on general issues related to opportunistic networking and
computing. Yet, AOC 2012 will have a primary interest in new directions of
opportunistic communications, such as service composition techniques, scenarios
of co-existence with infrastructure networks, and insights to their operation
coming from other disciplines such as game theory and cognitive psychology. The
workshop will solicit original papers addressing theoretical and practical
aspects of autonomic and opportunistic communications but also papers describing
prototype implementations and deployments.


Topics of interest for AOC 2012 include, but are not limited to:

* Routing, transport, and reliability issues
* Techniques for data dissemination and replication
* Applications and middleware support, mobile social networking applications
* Mobility models and statistical analysis of mobility traces
* Context and social awareness mechanisms and algorithms
* Co-existence of opportunistic networks with infrastructure mobile wireless
networks
* Service composition in autonomic and opportunistic networks
* Cognition-driven information processing and decision making
* Performance modelling, scaling laws, and fundamental limits for autonomic
and opportunistic communications
* Game-theoretic insights to the operation of autonomic and opportunistic
networks
* Participatory and urban sensing in autonomic and opportunistic networks
* Trust, security, and reputation
* Autonomic and opportunistic communication testbeds and prototypes,
measurement data from real experiments
* Socio-economic models for autonomic and opportunistic communications

PAPER SUBMISSION AND PUBLICATION
--------------------------------

Papers should neither have been published elsewhere nor being currently under
review by another conference or journal. Manuscripts are limited to 6 pages,
single spacing, double column, and must strictly adhere to the template
format. Guidelines on paper submission and formatting are available at
http://cnd.iit.cnr.it/aoc2012/.

Accepted papers will appear in the symposium proceedings published by IEEE. At
least one author of each accepted paper is required to register and present
his/her work at the workshop. There will be no separate registration for
workshop, but one single registration will cover both conference and workshops
participation.

Extended versions of workshop selected papers will be considered for possible
fast track publication on the Computer Communications Journal (Elsevier).


IMPORTANT DATES
---------------
Full papers due: February 17, 2012
Notification: April 4, 2012
Workshop: June 25, 2012


ORGANIZING COMMITTEE
--------------------

WORKSHOP Chairs
Merkouris Karaliopoulos, University of Athens, Greece
Chiara Boldrini, IIT-CNR, Italy

STEERING Committee
Marco Conti, IIT-CNR, Italy
Silvia Giordano, SUPSI, Switzerland
Ioannis Stavrakakis, University of Athens, Greece

PUBLICITY Chairs
Fabio Pezzoni, IIT-CNR, Italy
Pushpendra Singh, IIIT Delhi, India


PROGRAM COMMITTEE
------------------------------------

Gergely Acs, BUTE, Hungary
Eleonora Borgia, IIT-CNR, Italy
Jian-Nong Cao, Hong Kong Polytechnic University, HK
Vania Conan, Thales, France
Serge Fdida, UPMC, Paris VI, France
Laura Galluccio, University of Catania, Italy
Nidhi Hegde, Technicolor, France
Tristan Henderson, University of St. Andrews, UK
Gunnar Karlsson, KTH, Sweden
Mohan Kumar, University of Texas at Arlington, USA
Kyunghan Lee, North Carolina State University, USA
Franck Legendre, ETH Zurich, Switzerland
Daniele Miorandi, Create-net, Italy
Refik Molva, Eurecom, France
Valtteri Niemi, Nokia, Switzerland
Katia Obraczka, University of California, Santa Cruz, USA
Konstantinos Oikonomou, Ionian University, Greece
Joerg Ott, HUT, Finland
Elena Pagani, Universita' degli Studi di Milano, Italy
Andrea Passarella, IIT-CNR, Italy
Daniele Puccinelli, SUPSI, Switzerland
Christian Rohner, Uppsala University, Sweden
Fabrizio Sestini, EU Commission
Abdullatif Shikfa, Alcatel Lucent Bell Labs, France
Thrasyvoulos Spyropoulos, EURECOM, France
Roger Whitaker, Cardiff University, UK
Hongyi Wu, University of Louisiana at Lafayette, USA
Eiko Yoneki, University of Cambridge, UK
Franco Zambonelli, University of Modena-Reggio, Italy
Xiaolan Zhang, Fordham University, USA

Re: [ns] re quest for code for adding malicious nodes in aodv

Hi, kindly follow this link. it will be very useful. let me know what you
think after you have tried it out. http://elmurod.net/?p=196

On Tue, Jan 31, 2012 at 8:54 AM, BINDU PRASAD <cbinduprasad@gmail.com>wrote:

>
>
> Hai
> I want to implement malicious nodes functionality in aodv
> using ns2.pls help me.also if anyone know about wormhole attack
> implementation too pls help me
> --
> View this message in context:
> http://old.nabble.com/request-for-code-for-adding-malicious-nodes-in-aodv-tp33234109p33234109.html
> Sent from the ns-users mailing list archive at Nabble.com.
>
>


--
Regards,

Munuulo Joseph Wanuume
Management Information Systems Unit
Makerere University Business School
P.O. Box 1337,
Kampala
Mob
+256 712 730826
+256 701 730826
+256 771 899893

Re: [ns] to run a .cc file

Hi
you need to make a tcl script in order to run a simulation, the cc
and h files only define the structure of your code.

Regards
--
Luca Bedogni
PhD Candidate in Computer Science
University of Bologna
http://lbedogni.web.cs.unibo.it

On Tue, Jan 31, 2012 at 10:00 AM, Revathi Elangovan
<revathicse.tce@gmail.com> wrote:
>
> I am having a .cc file and a .h file.. Can anyone pls help me to run it in
> ns2...
>
> Thanks in advance...
>

[ns] to run a .cc file

I am having a .cc file and a .h file.. Can anyone pls help me to run it in
ns2...

Thanks in advance...

Monday, January 30, 2012

[ns] Congestion Control

Hello Friends!

I want to simulate congestion control algorithm in wireless sensor network using ns2. I want your help on sample script or any similar information with script example. I am counting on you to meet my deadline next week.

Tnx in advance

[ns] re quest for code for adding malicious nodes in aodv

Hai
I want to implement malicious nodes functionality in aodv
using ns2.pls help me.also if anyone know about wormhole attack
implementation too pls help me
--
View this message in context: http://old.nabble.com/request-for-code-for-adding-malicious-nodes-in-aodv-tp33234109p33234109.html
Sent from the ns-users mailing list archive at Nabble.com.

[ns] Cognitive Radio Sensor Networks

Good Morning!
Hope you will be doing good. I need the algorithm and code for *Dynamic
Spectrum Sensing (DSS)* and *Dynamic Spectrum Allocation(DSA) *for
cognitive radio sensor networks.
Your help in this regard will be appreciated please.

Regards
Fazlullah Khan
Department of Electrical Electronics and Information Engineering,
Nagaoka University of Technology, Nagaoka-shi, Niigata-ken, Japan
Cell # +8180 3474 4286

[ns] CfP - WiNMee 2012 - DEADLINE EXTENDED to 15 February 2012

Sunday, January 29, 2012

[ns] Fwd: [WSN-ADT'2012] CFP update: 4 days remaining - deadline February 2

** Deadline: February 2, 2012 **

(Our apologies for duplicate copies of this call)

Wireless Sensor Networks: Architectures, Deployments and Trends (WSN-ADT)
http://www.ntms-conf.org/ntms2012/wsn2012/index.htm

May 8-10, 2012, Istanbul, Turkey.

To be held in conjunction with the International Conference on New
Technologies, Mobility and Security (NTMS 2012).

All accepted papers will be published in IEEE Xplore. The best papers
of the conference will be considered for publication in COMNET and ADHOC
NETWORKS journals.

SCOPE:
------
Wireless Sensor Networks (WSNs) continue to attract a lot of attention
among researchers who are promoting their large-scale deployments in
many applications, such as environmental monitoring, military
surveillance, and scientific exploration. While continuous improvements
are addressing specific WSN issues spanning hardware, network protocols,
architecture, operating systems, and applications, several research
areas are emerging from new needs and challenges. To address these
issues, the NTMS'2012 Wireless Sensor Network workshop invites
unpublished, high-quality contributions that focus on the architectures,
deployments and recent advances of Wireless Sensor Networks. The
workshop is an opportunity for researchers and practitioners to share
their ideas, experiences, and expectations on the future of WSNs. The
workshop seeks original contributions that address the following topics,
but not limited to:

- Sensor architectures
- Protocol architectures
- Hardware architectures
- WSN architectures for routing
- WSN architectures for security management
- WSN architectures for power consumption optimization
- WSN user applications and demonstrations
- Applications for WSN resource management
- Platforms and developments tools for WSN
- Programming models for sensors
- Artificial Intelligence tools and techniques for WSN applications
- Languages and operating systems of Sensors
- Multi-services WSN
- WSN trends on data gathering, processing, and communication
- WSN trends on applications
- WSN trends on sensor and network architectures
- Multidisciplinary WSNs

Papers should be in English, strictly not exceeding 5 double-column
pages (3,000 words), in Adobe PDF format (which is the only accepted
format for the Workshop). Authors should use the relevant IEEE template,
ensuring an IEEE Xplore compatible PDF-format.

Paper submission:
-----------------
The Workshop is using the EDAS Conference Management System to manage
paper submissions process: http://www.edas.info/newPaper.php?c=10495

IMPORTANT DATES:
----------------
February 2, 2012: Submission of full papers
February 25, 2012: Notification of acceptance
March 7, 2012: Camera-Ready Papers Due for publication in the Final
Edition of the proceedings.

NTMS'2012 will be held in Istanbul, Turkey on the 7th-10th May 2012.
This Conference is technically sponsored by IEEE ComSoc, IFIP TC6 WG. To
access the full list of topics, submission guidelines, as well as venue
and travel information please visit: www.ntms-conf.org

[ns] DSR error in wired-cum-wireless scenarios

Dear everybody,

I used the following scripts to run the wired-cum-wireless simulation. (You can see below).
For DSDV, it's ok, I can see the data transmission in nam. But for DSR, after change ifq to CMUPriQueue and change adhocRouting to DSR.
It generates the following errors
"
num_nodes is set
4
INITIALIZE THE LIST xListHead
can't read "ragent_": no such variable
can't read "BS(0)": no such variable
can't read "BS(0)": no such variable
can't read "BS(0)": no such variable
can't read "BS(0)": no such variable
can't read "BS(0)": no such variable
can't read "BS(0)": no such variable
can't read "BS(0)": no such variable
can't read "node_(2)": no such element in array
*** NOTE: no connection pattern specified.
Loading scenario file...
Starting Simulation...
couldn't read file "../mobility/scene/scen-3-test": no such file or
directory
can't read "node_(1)": no such element in array
can't read "node_(1)": no such element in array
can't read "BS(0)": no such variable

"

Do you know why? Can you suggest any solutions?
Thanks


******************************************************************

Script to run DSDV in wired-cum-wirless scenario

# wireless2.tcl
# simulation of a wired-cum-wireless scenario consisting of 2 wired nodes
# connected to a wireless domain through a base-station node.
# ======================================================================
# Define options
# ======================================================================
set opt(chan)           Channel/WirelessChannel    ;# channel type
set opt(prop)           Propagation/TwoRayGround   ;# radio-propagation model
set
opt(netif)          Phy/WirelessPhy            ;# network interface type
set opt(mac)            Mac/802_11                 ;# MAC type
set opt(ifq)            Queue/DropTail/PriQueue    ;# interface queue type
set opt(ll)             LL                         ;# link layer type
set opt(ant)            Antenna/OmniAntenna        ;# antenna model
set
opt(ifqlen)         50                         ;# max packet in ifq
set opt(nn)             3                          ;# number of mobilenodes
set opt(adhocRouting)   DSDV                       ;# routing protocol


set opt(cp)             ""                         ;# connection pattern file
set
opt(sc)     "../mobility/scene/scen-3-test"    ;# node movement file.

set opt(x)      670                            ;# x coordinate of topology
set opt(y)      670                            ;# y coordinate of topology
set opt(seed)   0.0                            ;# seed for random number gen.
set opt(stop)  
250                            ;# time to stop simulation

set opt(ftp1-start)      160.0
set opt(ftp2-start)      170.0

set num_wired_nodes      2
set num_bs_nodes         1

# ============================================================================
# check for boundary parameters and random seed
if { $opt(x) == 0 || $opt(y) == 0 } {
    puts "No X-Y boundary values given for wireless topology\n"
}
if {$opt(seed) > 0} {
    puts "Seeding Random number generator with $opt(seed)\n"
    ns-random $opt(seed)
}

# create simulator instance
set ns_   [new Simulator]

# set up for
hierarchical routing
$ns_ node-config -addressType hierarchical
AddrParams set domain_num_ 2           ;# number of domains
lappend cluster_num 2 1                ;# number of clusters in each domain
AddrParams set cluster_num_ $cluster_num
lappend eilastlevel 1 1 4              ;# number of nodes in each cluster
AddrParams set nodes_num_ $eilastlevel ;# of each domain

set tracefd  [open wireless2-out.tr w]
set namtrace [open wireless2-out.nam w]
$ns_ trace-all $tracefd
$ns_ namtrace-all-wireless $namtrace $opt(x) $opt(y)

# Create topography object
set topo   [new Topography]

# define topology
$topo load_flatgrid $opt(x) $opt(y)

# create God
create-god [expr $opt(nn) +
$num_bs_nodes]

#create wired nodes
set temp {0.0.0 0.1.0}        ;# hierarchical addresses for wired domain
for {set i 0} {$i < $num_wired_nodes} {incr i} {
    set W($i) [$ns_ node [lindex $temp $i]]
}

# configure for base-station node
$ns_ node-config -adhocRouting $opt(adhocRouting) \
                 -llType $opt(ll) \
                 -macType $opt(mac) \
                 -ifqType $opt(ifq) \
                 -ifqLen $opt(ifqlen) \
                 -antType
$opt(ant) \
                 -propType $opt(prop) \
                 -phyType $opt(netif) \
                 -channelType $opt(chan) \
         -topoInstance $topo \
                 -wiredRouting ON \
         -agentTrace ON \
                 -routerTrace OFF \
                 -macTrace OFF

#create base-station node
set temp {1.0.0 1.0.1 1.0.2 1.0.3}   ;# hier
address to be used for wireless
                                     ;# domain
set BS(0) [$ns_ node [lindex $temp 0]]
$BS(0) random-motion 0               ;# disable random motion

#provide some co-ord (fixed) to base station node
$BS(0) set X_ 1.0
$BS(0) set Y_ 2.0
$BS(0) set Z_ 0.0

# create mobilenodes in the same domain as BS(0) 
# note the position and movement of mobilenodes is as defined
# in $opt(sc)

#configure for mobilenodes
$ns_ node-config -wiredRouting OFF

  for {set j 0} {$j < $opt(nn)} {incr j} {
    set node_($j) [ $ns_ node [lindex $temp \
        [expr $j+1]]
]
    $node_($j) base-station [AddrParams addr2id \
        [$BS(0) node-addr]]
}

#create links between wired and BS nodes

$ns_ duplex-link $W(0) $W(1) 5Mb 2ms DropTail
$ns_ duplex-link $W(1) $BS(0) 5Mb 2ms DropTail

$ns_ duplex-link-op $W(0) $W(1) orient down
$ns_ duplex-link-op $W(1) $BS(0) orient left-down

# setup TCP connections
set tcp1 [new Agent/TCP]
$tcp1 set class_ 2
set sink1 [new Agent/TCPSink]
$ns_ attach-agent $node_(0) $tcp1
$ns_ attach-agent $W(0) $sink1
$ns_ connect $tcp1 $sink1
set ftp1 [new Application/FTP]
$ftp1 attach-agent $tcp1
$ns_ at $opt(ftp1-start) "$ftp1 start"

set tcp2 [new Agent/TCP]
$tcp2 set class_ 2
set sink2 [new Agent/TCPSink]
$ns_ attach-agent $W(1) $tcp2
$ns_ attach-agent $node_(2) $sink2
$ns_ connect $tcp2 $sink2
set ftp2 [new Application/FTP]
$ftp2 attach-agent $tcp2
$ns_
at $opt(ftp2-start) "$ftp2 start"


# source connection-pattern and node-movement scripts
if { $opt(cp) == "" } {
    puts "*** NOTE: no connection pattern specified."
        set opt(cp) "none"
} else {
    puts "Loading connection pattern..."
    source $opt(cp)
}
if { $opt(sc) == "" } {
    puts "*** NOTE: no scenario file specified."
        set opt(sc) "none"
} else {
    puts "Loading scenario file..."
    source $opt(sc)
    puts "Load complete..."
}

# Define initial node position in nam

for {set i 0} {$i < $opt(nn)} {incr i} {

    # 20 defines the node size in nam, must adjust it according to your
    # scenario
    # The function must be called
after mobility model is defined

    $ns_ initial_node_pos $node_($i) 20
}    

# Tell all nodes when the simulation ends
for {set i } {$i < $opt(nn) } {incr i} {
    $ns_ at $opt(stop).0 "$node_($i) reset";
}
$ns_ at $opt(stop).0 "$BS(0) reset";

$ns_ at $opt(stop).0002 "puts \"NS EXITING...\" ; $ns_ halt"
$ns_ at $opt(stop).0001 "stop"
proc stop {} {
    global ns_ tracefd namtrace
    $ns_ flush-trace
    close $tracefd
    close $namtrace
    exec nam wireless2-out.nam &
    exit 0
}

# informative headers for CMUTracefile
puts $tracefd "M 0.0 nn $opt(nn) x $opt(x) y $opt(y) rp \
    $opt(adhocRouting)"
puts $tracefd "M 0.0 sc $opt(sc) cp $opt(cp) seed $opt(seed)"
puts $tracefd "M 0.0 prop $opt(prop) ant
$opt(ant)"

puts "Starting Simulation..."
$ns_ run

[ns] error while executing ns

hi,
the execution runs normally, NAM displays as it must but I'm getting the
following message on my terminal while executing app.tcl

xxx@xxxx:~$ ns app.tcl
num_nodes is set 8
INITIALIZE THE LIST xListHead
xxx@xxxx:~$ Missing required flag -x in: W -t 3.0

Missing required flag -y in: W -t 3.0

Parsing error in event.

and it doesn't stop until I type ctrl + c as if it waits for something

any ideas?

best regards
Leila

[ns] attach agent to mobile node

hi,
I'm simulating an ad hoc net, I got the following error message when
executing my tcl file:

num_nodes is set 8
INITIALIZE THE LIST xListHead
wrong # args: should be "_o3 self class proc node agent"
(Simulator attach-agent line 1)
invoked from within
"$ns attach-agent $n(1) $tcp
(file "xxx.tcl" line 144)


here is some of the code:

set tcp [new Agent/TCP/Newreno]
$tcp set class_ 2
$tcp set window_ 2000

$ns attach-agent $n(1) $tcp #line 144

can anyone help me to fix this error or at least to understand the cause of
it
thanks

[ns] attach agents to nodes

hi,

is it possible to attach more than one agent to the same node (ad hoc
network)

thanks

Friday, January 27, 2012

[ns] vector in NS

[ns] Dynamically change data rate

Hi,
In Tcl if we want to change the CBR value and data rate dynamically then
how it can be achieved?
i have tried following code but it takes only initialisation value that is
1000

set cbr_rate 1000
proc record {} {

global cb_rate cbr

set ns [Simulator instance]

set $cb_rate [expr $cb_rate + 50000]
set time 0.5
set now [$ns now]
$cbr set rate_ $cb_rate
puts "$cb_rate"
$ns at [expr $now+$time] "record"

}

Thanks in advance
--
Regards

[ns] merging two packet and assign single label in mpls multicast

hello everyone
i want to combine two data packets and send it in mpls multicast network.
Can anyone please guide me how to do this in ns2?

Thanking in advance.

With Regards
Prabin
--
View this message in context: http://old.nabble.com/merging-two-packet-and-assign-single-label-in-mpls-multicast-tp33213160p33213160.html
Sent from the ns-users mailing list archive at Nabble.com.

Thursday, January 26, 2012

[ns] Can't get $node_ from $self instvar

Hi
I've setup a simulation in which I want to color the node in nam
according to some events. Everything is working perfectly, except for
the node colors. Following Marc Greis tutorial, I wrote a function in
my modified mac/mac-802_11.cc like this:
can't read "node_": no such variable

void Mac802_11::setColor(int channel) {
char out[100];
sprintf(out, "%s setColor %d", name(), variable);
Tcl& tcl = Tcl::instance();
tcl.eval(out);
}

and in my tcl file:
Mac/802_11 instproc setColor {variable} {
$self instvar node_
$node_ color red
}

The problem is that the tcl function gets called, but I get this error:
ns: _o1854 setColor 8: can't read "node_": no such variable
while executing
"$node_ color red"
(procedure "_o1854" line 3)
(Mac/802_11 setColor line 3)
invoked from within
"_o1854 setColor 8"

Am I missing something? Does my function need to be placed somewhere
else or could I leave it here? Any hint?

Thanks
--
Luca Bedogni
PhD Candidate in Computer Science
University of Bologna
http://lbedogni.web.cs.unibo.it

[ns] doubt in printing a list

hi all ,

how to print the list maintained by me in to a file

i used tis
http://elmurod.net/?p=436
but it is showing error

Awaiting ur reply
Shanmugha Priya

Re: [ns] vector in NS

a help please

ziralda wrote:
>
> hello all
>
> please i want to know why when i use vector in NS, i get error in god.h
> and god.cc
>
> what i must do to resolve the issue, please it's urgent
>

--
View this message in context: http://old.nabble.com/vector-in-NS-tp33204186p33207259.html
Sent from the ns-users mailing list archive at Nabble.com.

Wednesday, January 25, 2012

[ns] VANET PROTOCOLS

hello
 
Does anyone has the source codes of VANET protocols integrateable in ns-2. GSR, SAR, GPCR, CAR, ASTAR, STBR, CBF, DIR, ROMSGP, BROADCOM, UMB, or any else.
 
 
Thanks in Advance.

[ns] vector in NS

hello all

please i want to know why when i use vector in NS, i get error in god.h and
god.cc

what i must do to resolve the issue, please it's urgent
--
View this message in context: http://old.nabble.com/vector-in-NS-tp33204186p33204186.html
Sent from the ns-users mailing list archive at Nabble.com.

[ns] simulation stops...

Hi people,

How can i find out why my simulation stops (260 secs)
before the time I specify (set opt(_stop) 900).
the trace file is empty :(

Thanks!

[ns] Confusion in AODV

following is the scenario,
http://dgr8swativekariya.wordpress.com/?p=13&preview=true
Scenario Image <http://dgr8swativekariya.wordpress.com/?p=13&preview=true>
I am using for the study of the protocols. At presently, I am studying the
AODV protocol.
In this scenario
node n0 is sending data to n11
after sometime, Node n8 is moving far from the other nodes, so node n8 is
doing local repair by initiating the RREQ for N11, but node N5, sends the
RRER to node N0. But after sometime node N11 send error message to the N0
and also initiates the route discovery for node NO.

I cant understand why the node N11 initiates the route discovery, while all
the links are bidirectional.

Please help me to understand this,
Thanks in advance

--
*Swati Vekariya,
Pursuing M.E.(C.S.E)
Parul Institute Of Engineering and Technology.
*

[ns] DDoS attack in NS2

Hi,

I need help to simulate DDoS attack in MANET using NS2 but I don't know how
to start?

any ideas about doing so

Thanks in advance

Tuesday, January 24, 2012

[ns] Which function does call the antenna module? THX.

Dear all,

I do not understand where the antenna module is called. I mean which function calls the omni-antenna module? I notice that in wireless-phy.cc file, it has sendUp() and sendDown() function to send out the packet, but it does not include the antenna, then how does NS2 know which antenna is used to transmit?

Can anyone give me a help?

Many thanks,

Lukas

[ns] doubt in AODV

sir
Is ter any way to send message with an information such as an id of
an node to all nodes in the network in ns2.
i am using AODV protocol


thanx in advance

Awaiting ur reply
Shanmugha Priya

[ns] Problem when calculating throughput

Hello everyone!

I have a strange problem during the throughput calculation. I have a FTP connection using TCP and TCPSink agents. I'm using a record trick to schedule logging to file every 0.1 seconds and the TCPSink bytes_ variable to retrieve the number of bytes retrieved (it gets zeroed out after every log). This trick seems to be extensively used by other people, like presented here:

http://mailman.isi.edu/pipermail/ns-users/2005-October/052150.html

Anyways, In cases where I have packet drops and traffic jams I'm observing some strange behavior. Immediately after the throughput drops to zero because of the traffic jam and packet drops, it spikes well above the total link bandwidth. This should simply not be possible. For instance, In a 0.1 second period after the traffic drops on the 1Mbits/s link (with 25 ms delay set) I get 22880 bytes. When put inside the formula I get the throughput of 1.83Mbits/s (22880 / 0.1 * 8 / 1000000 = 1.8304Mbits/s), which is much more than set bandwidth of 1Mbits/s.

I'd appreciate any information regarding this behaviour, why this happens in the simulation and how to properly calculate and draw this graph (I've read somewhere that the data might first be smoothed by using a smoothing algorithm. Is it true and will it be correct?). Thank you in advance.

Andrej

[ns] Coloring nodes in nam

Hi
I'm using ns2 to simulate a network of nodes, which I want to color
differently according to some events that occur during the simulation. I've
searched through the manual, but I found only how to color the nodes
statically, inside the tcl files. I'd like to color them in my .cc file. Is
that possible?

Thanks
--
Luca Bedogni

Re: [ns] problem with NS during execution

help please

ziralda wrote:
>
> hello all
> i have a really problem with my NS
> it doesn't take into account any change, even after execute make clean
> and make
> but when i execute the third instruction sudo make clean, it take change
> into account
> i use NS with ecplise in linux, at first i have any problem, but now
> without ( sudo make install) , it doesn't take into acount any change
> i have re-installed NS2 and it is the same problem
> please what must i do now, thanks and i am very interested by your answers
>

--
View this message in context: http://old.nabble.com/problem-with-NS-during-execution-tp33191310p33194764.html
Sent from the ns-users mailing list archive at Nabble.com.

Monday, January 23, 2012

[ns] metrics in the network that can infer or determine load in the node or in the network

Hello frd,


I am working on gathering those metrics in the network that can infer or determine load in the node or in the network.
Also to know capacity of a link?

I know it seems very fundamental..but I think you can help me in that.
Pls respond me ASAP, I have my assignment due on tomorrow.
I know its on short notice ...still I am counting on you all.


Pls help... i m in grt need.

Warm regards,
Ranjana

[ns] routing protocol for wired scenario

hi all,
i was wondering if anybody has access to a tutorial on how to implement a
protocol for wired scenarios. i find that a lot of the literature available
is for wireless scenarios with adhoc routing.
i particularly am interested in figuring out how to adjust the function in
NS2 that is responsible for forwarding packets.
The problem i am dealing with is packet marking and i want to find a way to
adjust a variable in a packet header for every packet that passes through a
node. so all i need to do is access a field of the packet, and change it
and every router should be able to do this.

does anyone have any ideas on what i should do? if so, your feedback would
be highly appreciated.
thank you very much.

anky

[ns] problem with NS during execution

hello all
i have a really problem with my NS
it doesn't take into account any change, even after execute make clean and
make
but when i execute the third instruction sudo make clean, it take change
into account
i use NS with ecplise in linux, at first i have any problem, but now
without ( sudo make install) , it doesn't take into acount any change
i have re-installed NS2 and it is the same problem
please what must i do now, thanks and i am very interested by your answers
--
View this message in context: http://old.nabble.com/problem-with-NS-during-execution-tp33191310p33191310.html
Sent from the ns-users mailing list archive at Nabble.com.

[ns] Deadline extension | CfP: ICWMC 2012 || June 24-29, 2012 - Venice, Italy

INVITATION:

=================

Please, consider contributing to and/or forwarding to the appropriate groups the following opportunity to submit and
publish original scientific results to ICWMC 2012.

The submission deadline is set to February 16, 2012.

In addition, authors of selected papers will be invited to submit extended article versions to one of the IARIA Journals:
http://www.iariajournals.org

=================


============== ICWMC 2012 | Call for Papers ===============

CALL FOR PAPERS, TUTORIALS, PANELS

ICWMC 2012, The Eighth International Conference on Wireless and Mobile Communications

June 24-29, 2012 - Venice, Italy


General page: http://www.iaria.org/conferences2012/ICWMC12.html

Call for Papers: http://www.iaria.org/conferences2012/CfPICWMC12.html

- regular papers

- short papers (work in progress)

- posters

Submission page: http://www.iaria.org/conferences2012/SubmitICWMC12.html


Submission deadline: February 16, 2012

Sponsored by IARIA, www.iaria.org


Extended versions of selected papers will be published in IARIA Journals: http://www.iariajournals.org


Please, note the Poster and Work in Progress options.

The topics suggested by the conference can be discussed in term of concepts, state of the art, research, standards,
implementations, running experiments, applications, and industrial case studies. Authors are invited to submit complete
unpublished papers, which are not under review in any other conference or journal in the following, but not limited to,
topic areas.

All tracks are open to both research and industry contributions, in terms of Regular papers, Posters, Work in progress,
Technical/marketing/business presentations, Demos, Tutorials, and Panels.

Before submission, please check and conform with the Editorial rules: http://www.iaria.org/editorialrules.html

ICWMC 2012 Topics (topics and submission details: see CfP on the site)


Wireless Communications Basics

Coding & modulation & equalization; Channel modeling and characterization; Equalization/Synchronization;
Transform-domain communication; Multiple access algorithms and schemes; Antenna and RF subsystems; Smart antennas,
adaptive antennas, MIMO and beam forming; MIMO and OFDM Based PHY Layer technologies; CDMA Systems

Radio Interfaces and Systems

Radio communications systems; Radio resource management; Radio transmission technologies; Power and interference
control; Interference Cancellation for Wireless Mobile Systems; Power management for small terminals; Energy map; Channel
Measurement and Characterization

Spectrum Allocation and Management

Spectrum efficiency analyses; Dynamic spectrum access networks; Spectrum management; Interference mitigation and
management techniques

Circuits for Wireless Communications

Wireless ASICs; Wireless technologies; RF Design issues

Wireless and Mobility

Mobility management; Location-based services and positioning; Micro and macro-mobility; Mobility, location and handoff
management; Mobile and wireless IP; Wireless broadband mobile access; Routing in multihop, ad hoc and sensor networks;
Wireless multicasting; Wireless mesh networks; Topology control in wireless

Protocols for wireless and mobility

Wireless protocols, architectural and design concepts; Protocols for air interfaces and networks; Wireless MAC
protocols: Design and analysis; Transport layer issues in mobile and wireless networks; Middleware for handhelds and
mobile services nodes; Proxies and middleware for wireless networks

Traffic and congestion control, QoS, Resource Management

Traffic Modeling and Analysis; 3G/4G Bandwidth on Demand; QoS and mobility; End-to-end QoS; QoS profiling and pricing;
Traffic Engineering; Congestion and admission control

Wireless and mobile technologies

Micro-mobility and macro-mobility; Wireless LANs; Home and Personal Area Networks: Bluetooth, ZigBeee, etc; Wireless
MANs:802.16, 802.20; Wireless WANs: 2G/3G/4G; Mobile ad hoc networks and multi-hop wireless; Sensor networks and
applications; Ultra-wideband and short-range networks; High altitude platforms and satellites; Emergency wireless
communications; Wireless real-time communications; RFID systems (including readers and transponders in LF, HF and UHF
bands)

Performance Evaluation, Simulation and Modeling of wireless networks and systems

Performance and QoS in wireless networks; Radio channel modeling (wave propagation and measurements); Mobile/wireless
networks modeling and simulation; Performance of end-to-end protocols over wireless networks

Management of wireless and mobile networks

Mobility and QoS management; Billing technologies and tools; Policy Based Management in wireless LANS and MANs;
Wireless and Mobile Network Planning; Mobile Database Access and Design

Security in wireless and mobile environment

Security and robustness in wireless networks; Privacy, Authentication Authorization and Accounting (AAA); Encryption
and Cryptography; Key Management Protocols; Digital Rights Management and Multimedia Protection

Networks convergence and integration

2G/3G/4G integration; Convergence of 3G wireless and Internet cross-layer design in wireless networks; WLAN/3G/4G
integration; Wireless-wireline convergence; Heterogeneous Networks (WAN, Wireless MAN, WLAN); IP Multimedia subsystems
(IMS); Next Generation Network Architecture- mobility issues; Coexistence of mobile radio networks; End to End QoS in
Heterogeneous environment; Signaling for integrated wireline/wireless networks

Applications and services based on wireless infrastructures

Mobile & Wireless applications & services; Service discovery: protocols and frameworks; Personalized services and
applications; Audio-visual and mobile multimedia applications; Media and content distribution over wireless networks

Standardization and regulations

Position on standards & fora on wireless and mobile networks; Wireless Networks Standards and Protocols;
Communications regulations; 802.11 WLAN Standards; 802.16 WMAN Standards; 3GPP and 3GPP2 standards; HSDPA Technology and
Standards; Next Generation Network standards

Design and implementation

Emerging wireless technologies; Cross-layer optimizations in wireless networks; Design and implementation of mobile
information systems; Software defined radio and re-configurability; Joint PHY/MAC design

Wireless and mobile network deployment

Business models on wireless networks; Market trends and regional developments; M-commerce; Lessons learnt for wireless
deployment in schools Lessons learnt for wireless deployment in special regions; Specialized wireless networks;
Heterogeneous wireless network deployment (e.g., combining 802.11, 802.16 and 3G networks)

Cooperative and Cognitive Vehicular Networks

Architectures and platforms of cognitive vehicular network; Distributed artificial intelligence techniques for
cognitive networks; Cognitive vehicular routing metrics and supporting protocols; Reduced complexity cognitive networks;
Physical and MAC layer issues; Protocols design for cognitive vehicular networks; Cross-layer optimization in cognitive
networks; Security issues for vehicular and cognitive networks; Testbed experiment, applications and new advances;
Cooperative vehicular networks; QoS provisioning in heterogeneous networks ; Managing vertical handover; Multihoming; IPv6
GeoNetworking; Vehicular network architectures and protocols ; Cross-layer design and optimization for vehicular networks
and cognitive networks; Mobility management and topology control; Standardization and Development of vehicular networks

Convergence and social mobility

Convergence of mobile networks with the Web 2.0; Convergence on architecture and services; Open service capabilities;
Open exposure of telco capabilities; Open Web APIs, SOA and SDP); Interworking strategies; Mobile terminals as sources for
User-generated content; Architecture and services for user-generated content; Auto-description and metadata synthesis for
telecom-generated for user-generated content; Social mobile networks; User behavior profiling; Social connections (social
graphs, contacts, etc); Services and architectures/solutions for social mobile services

-------------------
Committee: http://www.iaria.org/conferences2012/ComICWMC12.html
====================

[ns] Setting noise under ns2 simulations

Hi,

I would like to know if it's possible to set noise (like ambient noise,
background noise...) in my simulations. I'm using ns 2.35.

Thanks all!

--
======================
Javier Cancio del Busto
======================

Sunday, January 22, 2012

[ns] how to know load...a node is experincing

Hi All,

Cud anyone pls let me know, how to know load on a node in the the network?

Its urgent.


Pls help

[ns] how to measure load ...a node is experincing

Hi All,

Cud anyone pls let me know, how to know load on a node in the the network?

Its urgent.
.Pls help

[ns] CFP-IST-AWSN, Ontario, Canada, August 27-29, 2012

Call For Papers (Apologies for multiple copies)

Intelligent System Techniques for Ad hoc and Wireless Sensor Networks 2012 (IST-AWSN'12)

will be held in conjunction with
the 3rd International Conference on Ambient Systems, Networks and Technologies (ANT-2012)
in Niagara Falls, Ontario, Canada, August 27-29, 2012.
 
Recent developments of low-cost, low-power, multifunctional wireless sensors have enabled the fast growth of
Wireless Sensor Network (WSN) applications, which include security, military,
agriculture, automation, environmental
and habitat monitoring. WSNs consist of numerous small inexpensive battery powered sensors; each sensor has the
capability to
process and store the sensor data. A combination of the dense deployment of numerous smart sensors,
AI techniques, and intelligent agents can provide continuous real-time monitoring that is precise, accurate, reliable, and inexpensive.
This symposium aims to bring together researchers and practitioners working on different aspects of wireless sensor networks and
software agent technology in an effort to highlight the state-of-the-art and discuss the challenges and opportunities to explore
new research directions. We strongly welcome submissions that include results which advance the state of the art relating
to the theme of the symposium.

The main topics to be addressed include (but not limited to):
•    Adaptive agents in AWSN
•    Agent security and trust in AWSNs
•    Agent-based architectures for AWSNs
•    Agents design issues dealing with
reliability, efficiency, and fault tolerance
•    Context and situation awareness
•    Database management systems for AWSNs
•    Distributed management systems for AWSNs
•    Future Internet of Things
•    Intelligent data fusion and aggregation
•    Intelligent query and data dissemination
•    Intelligent systems for AWSNs
•    Learning agents in AWSN
•    M2M communication protocols for sensors networks
•    Middleware for sensors network
•    Mobile agents in AWSNs
•    Monitoring agents in AWSNs
•    Peer-to-Peer systems for AWSNs
•    Power management and energy-efficient protocols
•    QoS, performance evaluation and
simulation
•    Routing protocols for AWSNs
•    Safe transmissions of data in AWSNs
•    Self-organization of AWSNs
•    Sensors and actuators infrastructures for ubiquitous robotics applications
•    Sensors Knowledge Modeling and reasoning with Uncertainty
•    Smart energy-efficient routing protocols

Publication

Only original papers will be considered that have neither been published nor submitted for publication elsewhere,
including web publication. All submissions  will be handled electronically. The length of the paper is limited to 6 pages.
All papers will be reviewed by at least two independent reviewers.

Accepted papers will be printed in the conference proceedings published by Elsevier Science in the open-access
Procedia Computer Science series
(on-line and
CD). Procedia Computer Sciences is hosted on www.Elsevier.com
and on Elsevier content platform ScienceDirect (www.sciencedirect.com), and will be freely available worldwide.
All papers in Procedia will also be indexed by Scopus (www.scopus.com) and
Engineering Village (Ei) (www.engineeringvillage.com).

This includes EI Compendex (www.ei.org/compendex). The papers will contain linked references, XML versions and citable DOI numbers. You will be able to provide a hyperlink to all delegates and direct your conference website visitors to your proceedings.

Authors of high quality papers presented in the symposium will be invited to submit extended
version of
their papers for publication in international journal special issues.

Program Committee Chairs
Karim Djouani, French South African Institute of Techology, Pretoria, South Africa
Yskandar Hamam, ESIEE Paris, France

Program Committee Co-Chairs
Paolo Bellavista, DEIS - Università degli Studi di Bologna, Italy
Joel Rodrigues , Institute for Telecommunications, University of Beira Interior, Portugal

Publicity Chairs
Anish Mathieu Kurien, Tshwane University of Technology, Pretoria, South Africa
Chibani Abldeghani, University Paris Est, France
Nadeem Javaid, COMSATS Institute of IT, Pakistan


Steering Committee Chair
Elhadi Shakshuki, Acadia University, Canada

Program Committee Members
Barend Jacobus van Wyk, Tshwane University of Technology, South Africa
Kamel Barkaoui, CNAM-Paris, France
Marie Noel Lepareux, Thales communication, France
Guy Pujolles, LIP6, University Paris 6, France
Jaime Lloret Mauri, Polytechnic University of Valencia, Spain
Johnson
Agbinya, La
Trobe University, Victoria, Australia
Onur Oguz, Comsis, France
Nathalie Mutton, INRIA, France
Lynda Mokdad, LACL, France
Yacine Amirat, University Paris Est, France
Jalel Ben Othmane, University Paris 13, France
Boubaker Daachi, University Paris Est-Creteil (UPEC), France
Rahma ben Ayed, ENIT, Tunisia
Schahram Dustdar, Vienna University of Technology Wien, Austria
Ivan Stojmenovic, University of Ottawa, Canada
Abdelmajid Khelil, Umm Al-Qura University, Saudi Arabia
Lei Shu, Osaka University, Japan
Rafael Falcon, University of Ottawa, Canada
Sherali Zeadally, University of the District of Columbia Washington DC, USA
Eric Monacelli, LISV/UVSQ, France
Laurent Herault, Leti-CEA Grenoble, France
Kenji Leibnitz, NICT, Japan
Cheng Wang, University of Ottawa, Canada
Amir Nakib, University Paris Est, France
Laurent Georges, INRIA Rocquencourt, France

Important Dates

Submission Deadline February 10, 2012
Author Notification April 10, 2012
Final Manuscript Due May 10, 2012

[ns] CBQ/WRR for mobile nodes

Dear all ns-users

i run some codes of cbq/wrr for wired networks, it run fine, but when
i use it for wireless network and set IFQ as Queue/CBQ/WRR, simulation
at once terminate without any result.

how can i use cbq/wrr for wireless ad hoc networks

Regards
Moazzam

[ns] Implementation of CBQ/WRR in wireless network

Dear all ns-users

i run some codes of cbq/wrr for wired networks, it run fine, but when
i use it for wireless network and set IFQ as Queue/CBQ/WRR, simulation
at once terminate without any result.

how can i use cbq/wrr for wireless ad hoc networks

Regards
Moazzam

Re: [ns] getting values from trace file during execution of tcl script

Hello!

You don't need to pull the data from the trace file, you can get it from the sender / receiver objects (like bytes_ variable in TCPSink and LossMonitor for received bytes). You can also use ns "at" function to schedule the logging. Here is an example for bytes received:

[code]
proc record {} {
global sink0

set ns [Simulator instance]
#Set the time after which the procedure should be called again
set time 0.5
#How many bytes have been received by the traffic sink?
set bw0 [$sink0 set bytes_]
#Get the current time
set now [$ns now]
#Output the current time and received bytes
puts "$now $bw0"
#You can reset bytes count to get only the bytes received from the previous log ($now-$time)
#If you exclude the following line you will get all the bytes that were received from the simulation start up untill now
$sink0 set bytes_ 0
#Re-schedule the procedure
$ns at [expr $now+$time] "record"
}


#Start the record
$ns at 0.0 "record"
[/code]

(taken from some presentation and changed a bit, you can find these resources online, search for "recording throughput in ns")

So you basically have a function that recursively schedules its execution. Check the manual for the ways of getting the sent and received packets od the agent you are using, it should work. I'm currently using this method to log the used throughput of several TCP connections. I must admit, I have some unexpected results, like I have a time period when more packets are transmitted than a maximum throughput should allow. I must find the error.

Hope this helps.

Andrej


> Date: Sun, 22 Jan 2012 03:45:32 +0500
> From: zubiyaa@gmail.com
> To: ns-users@ISI.EDU
> Subject: [ns] getting values from trace file during execution of tcl script
>
>
> Hi,
> during execution of tcl script, is there some way to get values from trace
> file (e.g number of sent packets) after a specific time interval (e.g.3ms)?
> I need to write a function to count number of sent/received packets or
> bytes after every 2ms.
>
> I hope many researchers are present at this platform so plz consider it and
> do reply me.
>
> Thanks in advance
>
> --
> Regards

Re: [ns] how to print routing table

hi there ,

ok what i think you should do is to follow the codes i sent you earlier .
You can make necessary changes in it like i did to print the packet numbs
last time . Like now i print out the follwoing line .

BLACK LISTED NODE: 0t 13.0000t 1t 0t 255t 0t 0t 0.0000t 0
BLACK LISTED NODE: 0t 19.0000t 1t 0t 255t 0t 0t 0.0000t 0
BLACK LISTED NODE: 2t 28.0059t 0t 0t 1t 14t 1t 38.0059t 38
BLACK LISTED NODE: 0t 31.0000t 2t 2t 1t 6t 1t 34.0012t 0

I just printed BLACK LISTED NODE and nothing else .
No need for declaring a separate class for BLNs. It will make your work
more difficult . The clue is to make changes in the code i told you . Its
quite easy and obvious . you can do it . The clue is that you will print
only the BLNs only in the rtable.txt but for that you have to identify
them.


I hope you understand my point .

regards
On Sun, Jan 22, 2012 at 10:58 AM, shanmugha priya balasubramanian <
shanmughapriyab@gmail.com> wrote:

> sir,
>
> blacklist means t node in this list should not be allowed in network
> (i.e)
> as u say do not want them to be displayed later in your trace file.
>
> sir do i want to have a seperate blacklist class for maintaining
> malicious nodes
>
> Awaiting ur reply
> Shanmugha Priya
>
> On 1/22/12, shoaib saleem <shoaib.saleem@it-sudparis.eu> wrote:
> > hello ,
> >
> > By black list , what does that mean ? . You do not want them to be
> > displayed later in your trace file or you want to have a an output file
> > which show only the list of those nodes with anomalous activities ?
> >
> > regards
> >
> > On Sun, Jan 22, 2012 at 4:53 AM, shanmugha priya balasubramanian <
> > shanmughapriyab@gmail.com> wrote:
> >
> >> sir
> >> u r correct, to count t originator of RREQ we can analyse the
> >> trace file but
> >> i can analyse trace file only after the simulation ends na?
> >> i want to blacklist t nodes while simulation is running and
> >> not allowing them to send t packets during the single simulation
> >> process
> >>
> >> i hope u can understand my doubt littile bit clear
> >>
> >>
> >> Awaiting ur reply
> >> Shanmugha Priya
> >>
> >>
> >>
> >>
> >>
> >>
> >> On 1/22/12, shoaib saleem <shoaib.saleem@it-sudparis.eu> wrote:
> >> > hello ,
> >> >
> >> > your welcome. Well for all your questions i have one answer. Run a tcl
> >> > script file that generates a trace file . in that file, you will have
> >> > all
> >> > the information as far as my knowledge is soncerned about originator
> of
> >> the
> >> > RREQ packet. so there is no need for a counter. The node id descibes
> >> > whether ot not its the originator of the packet or not. for the
> >> > malicious
> >> > node , as i said earlier , set a frequency of sending packets bu
> >> defining a
> >> > max limit . Once all other nodes note that they are receving
> >> unnecessarily
> >> > no of packets either discard or drop these packets by identifying the
> >> node
> >> > id of such nodes .
> >> >
> >> > regards
> >> >
> >> > On Sat, Jan 21, 2012 at 6:12 PM, shanmugha priya balasubramanian <
> >> > shanmughapriyab@gmail.com> wrote:
> >> >
> >> >> sir,
> >> >>
> >> >> thank you for ur kind reply sir
> >> >> u r correctly saying wat i was doing in my project i used tis bool
> >> >> variable and timer to send packets
> >> >>
> >> >> i want each node to check the neighbour in its own neighbour list and
> >> >> keep count of the RREQ send by each one of them and periodically
> check
> >> >> these RREQ_count of each one of them and if they exceeds put them in
> >> >> blacklist
> >> >>
> >> >> 1.my doubt is where to make the counting of RREQ
> >> >>
> >> >> 2.is ter any function through which i can get the address
> >> >> of RREQ originator and not the forwarder ie who has want the
> >> >> route
> >> >>
> >> >> 3. shall i want to define a timer that periodically check
> >> >> these RREQ_count
> >> >>
> >> >> 4. is i want to create a blacklist class to note the
> malicious
> >> >> node
> >> >> so other nodes shall not forward the packets from
> >> >> these blacklisted node
> >> >>
> >> >>
> >> >> sorry for disturbing u sir
> >> >>
> >> >> Awaiting ur reply
> >> >> Shanmugha Priya
> >> >>
> >> >>
> >> >>
> >> >>
> >> >>
> >> >>
> >> >>
> >> >> On 1/21/12, shoaib saleem <shoaib.saleem@it-sudparis.eu> wrote:
> >> >> > Hello ,
> >> >> >
> >> >> > I guess in order to black list a node in a network, you first have
> to
> >> >> > declare malicious nodes in your network and ask them to perform a
> >> task
> >> >> > (
> >> >> > like dropping of packets or generating and broadcasting those
> packets
> >> >> with
> >> >> > a Frequency parameter set to a small interval of time ). So what
> you
> >> >> have
> >> >> > to do is to define a variable of type bool in the
> >> >> > aodv.h file where you are defining your routing agent and then in
> the
> >> >> > aodv.cc , in the constructor initialize that bool variable as
> false.
> >> >> >
> >> >> > Now i guess you have to insert an if statement in the int AODC ::
> >> comand
> >> >> ()
> >> >> > function for strcmp of an arg which you will pass from your tcl
> >> script .
> >> >> > Let say in your tcl script the malacious node you define passes an
> >> >> > arg
> >> >> > as
> >> >> > "bad node" etc .
> >> >> >
> >> >> > if the comparison turns true then in a AODV, use a timer for this
> >> node (
> >> >> > take an example from broadcast timer etc) which can call a
> function
> >> to
> >> >> > boradcast the packets more frequently .
> >> >> >
> >> >> > use if statements when receiving a packet from malicious node. or
> put
> >> a
> >> >> > limit of getting no of packets from this node. you can #define it
> >> after
> >> >> > header files in aodv.h.
> >> >> >
> >> >> > I hope this lil knowledge can help you a bit .
> >> >> >
> >> >> > regards
> >> >> >
> >> >> > On Sat, Jan 21, 2012 at 3:15 PM, shanmugha priya balasubramanian <
> >> >> > shanmughapriyab@gmail.com> wrote:
> >> >> >
> >> >> >> sir
> >> >> >>
> >> >> >> i am implementing "preventing flooding attack in MANET"
> >> >> >>
> >> >> >> sir i want to create a function that checks the whether t number
> of
> >> >> >> packets received from each of its neighbor has exceeded the
> >> particular
> >> >> >> threshold value and blacklist them
> >> >> >>
> >> >> >> please where can i declare the function structure of that blaclist
> >> in
> >> >> >> aodv.cc
> >> >> >>
> >> >> >> Awaiting ur reply
> >> >> >> Shanmugha Priya
> >> >> >>
> >> >> >> On 1/21/12, shoaib saleem <shoaib.saleem@it-sudparis.eu> wrote:
> >> >> >> >
> >> >> >> > Hello Kader ,
> >> >> >> >
> >> >> >> > i think you are asking about the routing table maintained by
> each
> >> >> >> > node
> >> >> >> > in
> >> >> >> > the network topology . In order to print that routing table for
> >> >> >> > any
> >> >> node
> >> >> >> > you have to declare a function in the class AODV (aodv.h file)
> as
> >> a
> >> >> >> > protected member function as follows .
> >> >> >> >
> >> >> >> > *************** void rt_print(nsaddr_t node_id);
> >> >> >> >
> >> >> >> >
> >> >> >> > then in the aodv.cc file define this function anywhere you want
> as
> >> >> >> follows
> >> >> >> >
> >> >> >> > void AODV::rt_print(nsaddr_t id) {
> >> >> >> > FILE *dumpFile;
> >> >> >> > char dumpFileName[50] = "rtable.txt";
> >> >> >> >
> >> >> >> > dumpFile = fopen("rtable.txt", "a");
> >> >> >> >
> >> >> >> > aodv_rt_entry *rt;
> >> >> >> >
> >> >> >> > fprintf (dumpFile,
> >> >> >> > "=======================================================");
> >> >> >> > for (rt=rtable.head();rt; rt = rt->rt_link.le_next) {
> >> >> >> >
> >> >> >> > fprintf (dumpFile, "NODE: %it %.4lft %it %it %it %it %it %.4lft
> >> >> >> > %d
> >> >> n",
> >> >> >> > id, CURRENT_TIME, rt->rt_dst, rt->rt_nexthop,
> >> >> rt->rt_hops,
> >> >> >> > rt->rt_seqno, rt->rt_expire, rt->rt_flags);
> >> >> >> >
> >> >> >> > }
> >> >> >> >
> >> >> >> > fclose(dumpFile);
> >> >> >> > }
> >> >> >> >
> >> >> >> >
> >> >> >> > ****************Calling the function *****************
> >> >> >> > you can call this function any where in aodv .cc to print the
> >> routing
> >> >> >> table
> >> >> >> > information as follows .
> >> >> >> >
> >> >> >> > rt_print(index); // where the index is the node id of
> >> which
> >> >> RT
> >> >> >> > table will be displayed
> >> >> >> >
> >> >> >> >
> >> >> >> >
> >> >> >> > **************************************************Recompile and
> >> >> >> > run
> >> >> >> > **************************
> >> >> >> > Recompile ns 2 using
> >> >> >> > make clean
> >> >> >> > make depend
> >> >> >> > make
> >> >> >> > sudo make install
> >> >> >> >
> >> >> >> > and run your script .
> >> >> >> >
> >> >> >> > The output file rtable.txt file gave the following output , i
> just
> >> >> >> > called
> >> >> >> > the function once.
> >> >> >> >
> >> >> >> > =======================================================NODE: 2t
> >> >> 28.0059t
> >> >> >> 0t
> >> >> >> > 0t 1t 14t 1t 38.0059t 13157952
> >> >> >> > n=======================================================NODE: 0t
> >> >> >> > 34.5030t
> >> >> >> > 2t 2t 1t 10t 1t 44.5030t 13157952 nNODE: 0t 34.5030t 1t 0t 255t
> 0t
> >> 0t
> >> >> >> > 0.0000t 13157952
> >> >> >> > n=======================================================NODE: 0t
> >> >> >> > 39.0149t
> >> >> >> > 2t 2t 1t 10t 1t 44.5030t 13157952 nNODE: 0t 39.0149t 1t 2t 2t 6t
> >> >> >> > 1t
> >> >> >> > 49.0149t 13157952
> >> >> >> > n=======================================================NODE: 0t
> >> >> >> > 45.0326t
> >> >> >> > 2t 2t 1t 12t 1t 55.0326t 13157952 nNODE: 0t 45.0326t 1t 2t 2t 6t
> >> >> >> > 1t
> >> >> >> > 55.0203t 13157952
> >> >> >> > n=======================================================NODE: 0t
> >> >> >> > 55.5618t
> >> >> >> > 2t 2t 1t 14t 1t 65.5618t 13157952 nNODE: 0t 55.5618t 1t 2t 2t 6t
> >> >> >> > 1t
> >> >> >> > 65.5365t 13157952
> >> >> >> > n=======================================================NODE: 0t
> >> >> >> > 66.0167t
> >> >> >> > 2t 2t 1t 16t 1t 76.0167t 13157952 nNODE: 0t 66.0167t 1t 2t 2t 6t
> >> >> >> > 1t
> >> >> >> > 76.0049t 13157952
> >> >> >> > n=======================================================NODE: 0t
> >> >> >> > 76.5285t
> >> >> >> > 2t 2t 1t 20t 1t 86.5285t 13157952 nNODE: 0t 76.5285t 1t 2t 2t 6t
> >> >> >> > 1t
> >> >> >> > 86.5166t 13157952
> >> >> >> > n=======================================================NODE: 2t
> >> >> >> > 76.5511t
> >> >> >> > 1t 1t 1t 6t 1t 86.5493t 13157952 nNODE: 2t 76.5511t 0t 0t 1t 30t
> >> >> >> > 1t
> >> >> >> > 86.5511t 13157952
> >> >> >> > n=======================================================NODE: 1t
> >> >> >> > 83.0483t
> >> >> >> > 2t 0t 2t 20t 1t 86.0483t 13157952 nNODE: 1t 83.0483t 0t 0t 1t
> 28t
> >> 1t
> >> >> >> > 93.0364t 13157952
> >> >> >> > n=======================================================NODE: 1t
> >> >> >> > 83.0719t
> >> >> >> > 2t 2t 1t 22t 1t 93.0719t 13157952 nNODE: 1t 83.0719t 0t 0t 1t
> 28t
> >> 1t
> >> >> >> > 93.0364t 13157952
> >> >> >> > n=======================================================NODE: 2t
> >> >> >> > 87.0160t
> >> >> >> > 1t 1t 1t 10t 1t 93.0819t 13157952 nNODE: 2t 87.0160t 0t 0t 1t
> 34t
> >> 1t
> >> >> >> > 97.0160t 13157952
> >> >> >> > n=======================================================NODE: 2t
> >> >> >> > 93.5197t
> >> >> >> > 1t 1t 1t 14t 1t 103.5197t 13157952 nNODE: 2t 93.5197t 0t 0t 1t
> 34t
> >> 1t
> >> >> >> > 97.0160t 13157952
> >> >> >> > n=======================================================NODE: 2t
> >> >> >> > 97.5183t
> >> >> >> > 1t 1t 1t 14t 1t 103.5197t 13157952 nNODE: 2t 97.5183t 0t 0t 1t
> 36t
> >> 1t
> >> >> >> > 107.5183t 13157952
> >> >> >> > n=======================================================NODE: 0t
> >> >> >> 104.0130t
> >> >> >> > 2t 2t 1t 32t 1t 114.0130t 13157952 nNODE: 0t 104.0130t 1t 1t 1t
> >> >> >> > 10t
> >> >> >> > 1t
> >> >> >> > 114.0098t 13157952
> >> >> >> > n=======================================================NODE: 2t
> >> >> >> 104.0280t
> >> >> >> > 1t 1t 1t 18t 1t 114.0280t 13157952 nNODE: 2t 104.0280t 0t 0t 1t
> >> >> >> > 38t
> >> >> >> > 1t
> >> >> >> > 110.0083t 13157952
> >> >> >> > n=======================================================NODE: 1t
> >> >> >> 104.0300t
> >> >> >> > 2t 0t 2t 32t 1t 113.0300t 13157952 nNODE: 1t 104.0300t 0t 0t 1t
> >> >> >> > 38t
> >> >> >> > 1t
> >> >> >> > 114.0229t 13157952
> >> >> >> > n=======================================================NODE: 1t
> >> >> >> 104.0385t
> >> >> >> > 2t 2t 1t 34t 1t 114.0385t 13157952 nNODE: 1t 104.0385t 0t 0t 1t
> >> >> >> > 38t
> >> >> >> > 1t
> >> >> >> > 114.0229t 13157952
> >> >> >> > n=======================================================NODE: 2t
> >> >> >> 110.5249t
> >> >> >> > 1t 1t 1t 18t 1t 114.0280t 13157952 nNODE: 2t 110.5249t 0t 0t 1t
> >> >> >> > 40t
> >> >> >> > 1t
> >> >> >> > 120.5249t 13157952
> >> >> >> > n=======================================================NODE: 2t
> >> >> >> 114.5243t
> >> >> >> > 1t 1t 1t 20t 1t 124.5243t 13157952 nNODE: 2t 114.5243t 0t 0t 1t
> >> >> >> > 40t
> >> >> >> > 1t
> >> >> >> > 120.5249t 13157952
> >> >> >> > n=======================================================NODE: 0t
> >> >> >> 121.0234t
> >> >> >> > 2t 2t 1t 42t 1t 131.0234t 13157952 nNODE: 0t 121.0234t 1t 1t 1t
> >> >> >> > 16t
> >> >> >> > 1t
> >> >> >> > 130.9986t 13157952
> >> >> >> > n=======================================================NODE: 2t
> >> >> >> 121.0272t
> >> >> >> > 1t 1t 1t 20t 1t 124.5243t 13157952 nNODE: 2t 121.0272t 0t 0t 1t
> >> >> >> > 44t
> >> >> >> > 1t
> >> >> >> > 131.0272t 13157952
> >> >> >> > n=======================================================NODE: 1t
> >> >> >> 121.0774t
> >> >> >> > 2t 2t 1t 44t 1t 131.0774t 13157952 nNODE: 1t 121.0774t 0t 0t 1t
> >> >> >> > 42t
> >> >> >> > 1t
> >> >> >> > 131.0736t 13157952
> >> >> >> > n=======================================================NODE: 2t
> >> >> >> 127.5210t
> >> >> >> > 1t 1t 1t 24t 1t 137.5210t 13157952 nNODE: 2t 127.5210t 0t 0t 1t
> >> >> >> > 44t
> >> >> >> > 1t
> >> >> >> > 131.0272t 13157952
> >> >> >> > n=======================================================NODE: 2t
> >> >> >> 131.5320t
> >> >> >> > 1t 1t 1t 24t 1t 137.5210t 13157952 nNODE: 2t 131.5320t 0t 0t 1t
> >> >> >> > 46t
> >> >> >> > 1t
> >> >> >> > 141.5320t 13157952
> >> >> >> > n=======================================================NODE: 1t
> >> >> >> 138.0045t
> >> >> >> > 2t 2t 1t 52t 1t 148.0045t 13157952 nNODE: 1t 138.0045t 0t 0t 1t
> >> >> >> > 42t
> >> >> >> > 1t
> >> >> >> > 147.9986t 13157952
> >> >> >> > n=======================================================NODE: 2t
> >> >> >> 138.0082t
> >> >> >> > 1t 1t 1t 28t 1t 148.0082t 13157952 nNODE: 2t 138.0082t 0t 0t 1t
> >> >> >> > 46t
> >> >> >> > 1t
> >> >> >> > 141.5320t 13157952
> >> >> >> > n=======================================================NODE: 0t
> >> >> >> 138.0283t
> >> >> >> > 2t 2t 1t 54t 1t 148.0283t 13157952 nNODE: 0t 138.0283t 1t 1t 1t
> >> >> >> > 26t
> >> >> >> > 1t
> >> >> >> > 148.0235t 13157952
> >> >> >> > n=======================================================NODE: 1t
> >> >> >> 143.0407t
> >> >> >> > 2t 0t 2t 54t 1t 148.0407t 13157952 nNODE: 1t 143.0407t 0t 0t 1t
> >> >> >> > 48t
> >> >> >> > 1t
> >> >> >> > 153.0378t 13157952
> >> >> >> > n=======================================================NODE: 2t
> >> >> >> 144.0934t
> >> >> >> > 1t 0t 2t 32t 1t 153.0934t 13157952 nNODE: 2t 144.0934t 0t 0t 1t
> >> >> >> > 48t
> >> >> >> > 1t
> >> >> >> > 144.0267t 13157952
> >> >> >> > n=======================================================NODE: 2t
> >> >> >> 144.5543t
> >> >> >> > 1t 0t 2t 32t 1t 153.0934t 13157952 nNODE: 2t 144.5543t 0t 0t 1t
> >> >> >> > 50t
> >> >> >> > 1t
> >> >> >> > 154.5543t 13157952
> >> >> >> > n=======================================================NODE: 1t
> >> >> >> 148.5243t
> >> >> >> > 2t 0t 2t 60t 1t 150.5243t 13157952 nNODE: 1t 148.5243t 0t 0t 1t
> >> >> >> > 48t
> >> >> >> > 1t
> >> >> >> > 158.5204t 13157952 n
> >> >> >> >
> >> >> >> > I hope this wil help you .
> >> >> >> >
> >> >> >> > regards
> >> >> >> >
> >> >> >> > On Sat, Jan 21, 2012 at 11:10 AM, Fatima Kader <
> >> kader.eliza@gmail.com
> >> >> >> >wrote:
> >> >> >> >
> >> >> >> >> hello sir
> >> >> >> >>
> >> >> >> >> please i want to ask you about AODV
> >> >> >> >>
> >> >> >> >> i want each node maintain an activity table, in this table
> there
> >> >> >> >> some
> >> >> >> >> fields like node id, number of data received from a node,...etc
> >> >> >> >>
> >> >> >> >> please where can i declare the structure table, in node.h or
> in
> >> >> >> >> aodv.cc
> >> >> >> >>
> >> >> >> >> many thanks in advance for your reply
> >> >> >> >>
> >> >> >> >> --
> >> >> >> >> [image:
> >> >> http://www.etudinfo.com/image/logo-ecole/telecom-sudparis.jpg]
> >> >> >> >> Muhammad Shoaib SALEEM
> >> >> >> >> PhD Student
> >> >> >> >> Wireless Networks & Multimedia Services Department
> >> >> >> >> Institut Télécom - Télécom SudParis
> >> >> >> >> 9 Rue Charles Fourier 91011 Evry, France.
> >> >> >> >> Office: +33 1 60 76 43 91
> >> >> >> >> https://sites.google.com/site/shoaibsal/
> >> >> >> >>
> >> >> >> >> <https://sites.google.com/site/shoaibsal/>
> >> >> >> >>
> >> >> >> >>
> >> >> >> >>
> >> >> >> >> <https://sites.google.com/site/shoaibsal/>
> >> >> >> >>
> >> >> >> >>
> >> >> >> >
> >> >> >>
> >> >> >
> >> >> >
> >> >> >
> >> >> > --
> >> >> > [image:
> http://www.etudinfo.com/image/logo-ecole/telecom-sudparis.jpg
> >> ]
> >> >> > Muhammad Shoaib SALEEM
> >> >> > PhD Student
> >> >> > Wireless Networks & Multimedia Services Department
> >> >> > Institut Télécom - Télécom SudParis
> >> >> > 9 Rue Charles Fourier 91011 Evry, France.
> >> >> > Office: +33 1 60 76 43 91
> >> >> > https://sites.google.com/site/shoaibsal/
> >> >> >
> >> >> > <https://sites.google.com/site/shoaibsal/>
> >> >> >
> >> >>
> >> >
> >> >
> >> >
> >> > --
> >> > [image: http://www.etudinfo.com/image/logo-ecole/telecom-sudparis.jpg
> ]
> >> > Muhammad Shoaib SALEEM
> >> > PhD Student
> >> > Wireless Networks & Multimedia Services Department
> >> > Institut Télécom - Télécom SudParis
> >> > 9 Rue Charles Fourier 91011 Evry, France.
> >> > Office: +33 1 60 76 43 91
> >> > https://sites.google.com/site/shoaibsal/
> >> >
> >> > <https://sites.google.com/site/shoaibsal/>
> >> >
> >>
> >
> >
> >
> > --
> > [image: http://www.etudinfo.com/image/logo-ecole/telecom-sudparis.jpg]
> > Muhammad Shoaib SALEEM
> > PhD Student
> > Wireless Networks & Multimedia Services Department
> > Institut Télécom - Télécom SudParis
> > 9 Rue Charles Fourier 91011 Evry, France.
> > Office: +33 1 60 76 43 91
> > https://sites.google.com/site/shoaibsal/
> >
> > <https://sites.google.com/site/shoaibsal/>
> >
>

--
[image: http://www.etudinfo.com/image/logo-ecole/telecom-sudparis.jpg]
Muhammad Shoaib SALEEM
PhD Student
Wireless Networks & Multimedia Services Department
Institut Télécom - Télécom SudParis
9 Rue Charles Fourier 91011 Evry, France.
Office: +33 1 60 76 43 91
https://sites.google.com/site/shoaibsal/

<https://sites.google.com/site/shoaibsal/>

[ns] help required

Hi all,

Can anybody tell how to obtain the coordinates of the node movements from
nam.

On Sun, Jan 22, 2012 at 4:28 AM, shoaib saleem <shoaib.saleem@it-sudparis.eu
> wrote:

>
> Hi again ,
>
> ok what you can do is that the code which i wrote earlier , you can modify
> it a bit as follow
>
> *1. include Packet *p in the following function in aodv.h*
>
> void rt_print(nsaddr_t node_id, Packet *p);
>
> *2. In aodv.cc , in **void AODV::rt_print(nsaddr_t id, Packet* p ) *
> include the following structure
>
> struct hdr_cmn *ch = HDR_CMN(p);
>
> *include ch ->ptype() in the following line *
>
> fprintf (dumpFile, " NODE: %it %.4lft %it %it %it %it %it %.4lft %d \n",
> id, CURRENT_TIME, rt->rt_dst, rt->rt_nexthop, rt->rt_hops,
> rt->rt_seqno, rt->rt_expire, rt->rt_flags,*ch->ptype()*);
>
> *3. Put rt_print(index,p); after the following lines in aodv.cc*
>
> if (ch->ptype() != PT_TCP && ch->ptype() != PT_ACK) {
> ch->size() += IP_HDR_LEN;
>
> }
> * rt_print(index,p);*
> *
> *
> *
> *
> *
> *
> *4. Now make clean , make , sudo make install *
> *
> *
> *run your tcl script. you will have a rtable.txt file with the following
> information. In ns-2.xx/common/packet.h file you have all types of packet
> defined in ns 2. Like for example, *
> *PT_TCP = 0 , PT_ AODV = 38 , PT_ACK = 5 . In rtable.txt , you have info
> about each node like in the first line , we have Node 0, sending 1st (1)
> PT_TCP packet = 0 at 13 sec . Similary there two other packets PT_AODV =
> 38 and PT_ACK = 5 . *
>
> NODE: 0 t 13.0000t 1t 0t 255t 0t 0t 0.0000t 0 n
>
> NODE: 0 t 19.0000t 1t 0t 255t 0t 0t 0.0000t 0 n
>
> NODE: 2 t 28.0059t 0t 0t 1t 14t 1t 38.0059t 38 n
>
> NODE: 0 t 31.0000t 2t 2t 1t 6t 1t 34.0012t 0 n
> NODE: 0 t 31.0000t 1t 0t 255t 0t 0t 0.0000t 0 n
>
> NODE: 0 t 34.5030t 2t 2t 1t 10t 1t 44.5030t 38 n
> NODE: 0 t 34.5030t 1t 0t 255t 0t 0t 0.0000t 38 n
>
> NODE: 0 t 39.0149t 2t 2t 1t 10t 1t 44.5030t 38 n
> NODE: 0 t 39.0149t 1t 2t 2t 6t 1t 49.0149t 38 n
>
> ..........................................................................
> ..........................................................................
> ..........................................................................
> ..........................................................................
> ..........................................................................
> ..........................................................................
> ..........................................................................
> NODE: 1t 149.9275t 0t 0t 1t 48t 1t 159.9153t 5
> NODE: 0t 149.9293t 2t 2t 1t 60t 1t 150.5402t 0
> NODE: 0t 149.9293t 1t 1t 1t 34t 1t 159.9172t 0
> NODE: 0t 149.9315t 2t 2t 1t 60t 1t 150.5402t 0
> NODE: 0t 149.9315t 1t 1t 1t 34t 1t 159.9293t 0
> NODE: 1t 149.9414t 2t 0t 2t 60t 1t 150.5243t 5
> NODE: 1t 149.9414t 0t 0t 1t 48t 1t 159.9275t 5
> NODE: 1t 149.9513t 2t 0t 2t 60t 1t 150.5243t 5
> NODE: 1t 149.9513t 0t 0t 1t 48t 1t 159.9414t 5
> NODE: 1t 149.9614t 2t 0t 2t 60t 1t 150.5243t 5
> NODE: 1t 149.9614t 0t 0t 1t 48t 1t 159.9513t 5
> NODE: 0t 149.9632t 2t 2t 1t 60t 1t 150.5402t 0
>
> I hope this will help you a little to understand your problem
>
> Regards
> ---------- Forwarded message ----------
> From: Fatima Kader <kader.eliza@gmail.com>
> Date: Sat, Jan 21, 2012 at 9:18 PM
> Subject:
> To: shoaib saleem <shoaib.saleem@it-sudparis.eu>
>
>
> ok sir, i have understand you, but i need all this information for another
> pupose, so i want each node calculate the number of data received from
> another node, and count another packet also, that's why i want to define an
> activity table independant and maintained by each node
> thanks in advance
>
>
>
> --
> [image: http://www.etudinfo.com/image/logo-ecole/telecom-sudparis.jpg]
> Muhammad Shoaib SALEEM
> PhD Student
> Wireless Networks & Multimedia Services Department
> Institut Télécom - Télécom SudParis
> 9 Rue Charles Fourier 91011 Evry, France.
> Office: +33 1 60 76 43 91
> https://sites.google.com/site/shoaibsal/
>
> <https://sites.google.com/site/shoaibsal/>
>

Counter

blogger analytics