[ns] Finding the neighbour nodes of a mobile node

2011-09-20 Thread Divya G

Hello Sir..!!

Can you please help in writing a code for finding all the neighbor nodes of
a mobile node in a wireless scenario.

Thanks  Regards,
Divya.


[ns] Display a message in NAM file

2011-09-20 Thread Divya G

Hello Sir..!!

Can u please help me to know the code or syntax used in displaying a message
while running a simulation in a NAM file in ns2.


[ns] [NS-ANS] Re: Finding the neighbour nodes of a mobile node

2011-09-20 Thread Mubashir Rehmani

Hi,

You can use the following methods to discover neighbors:
1. Use Hello Packets for *neighbor* discovery.
2. Use Communication range for neighbour discovery.
3. Use Nodes Positions for *neighbor* discovery.

So, it totally depends upon you, how you discover your neighbours. But i
would suggest you to use Hello Packets to discover neighbors.

What you have to do is simple: Just start sending hello messages by using
hello packets (if you dont know this, please ask) or just search ns2 mailing
list by my name and hello packets, InshaAllah you will find the way to
enable hello packets. Once each and every node is able to send hello packets
then each node that receive the hello packet of other node is supposed to be
the neighbor of other node. In this way, you would find the number of
neighbors of each node. In simple, a node that receives the hello packet of
other node is the neighbor of that node. So, there is a function of
recvHello() in aodv.cc and you have to write a line of code in recvhello()
that each node when receive this packet should make a entry in node.cc
(inneighbor table) that i am neighbor node of this node.

Node.cc


Add this code
void Node::addNeighbor(Node * neighbor) {

int flag=0;
neighbor_list_node* my_neighbor_list;
my_neighbor_list=neighbor_list_;
//cout Mmy_neighbor_list-
nodeidendl;
//return;

   while(my_neighbor_list)
{
if(my_neighbor_list-nodeid == neighbor-nodeid())
{
flag = 1;
break;
}
else
{
my_neighbor_list=my_neighbor_list-next;
}
}


//coutMMM my_neighbor_list-nodeidendl;
if(flag == 1)
{
   //neighbour already exist do nothing
}
else
{
   neighbor_list_node* nlistItem = (neighbor_list_node
*)malloc(sizeof(neighbor_list_node));
nlistItem-nodeid = neighbor-nodeid();
nlistItem-next = neighbor_list_;
neighbor_list_=nlistItem;
}



}

AODV.cc
==
Add these lines in AODV::recvHello(Packet *p) {} function

Node* sender_node = Node::get_node_by_address(rp-rp_dst);
Node* receiver_node = Node::get_node_by_address(index);
sender_node-addNeighbor(receiver_node);
receiver_node-addNeighbor(sender_node);

==

Now let me expalin you what i have done. In recvHello funciton whenever a
node receives a Hello packet it create two objects of node, sending node and
receiving node and then add them in the neighborl list. Secondly in void
Node::addNeighbor(Node * neighbor) {}, first a doulbe entry is checked and
if found, it won't add the neighbor, else it add the neighbor.

After that you can easily get access to any node's neighbor list by creating
its object and calling its neighbor list.

Node* m_node = Node::get_node_by_address(
this-addr());
neighbor_list_node* my_mobile_neighbor_list;
my_mobile_neighbor_list = m_node-neighbor_list_;

while(my_mobile_neighbor_list)
{
cout## Mubashir Neighbor ID
:my_mobile_neighbor_list-nodeidendl;
my_mobile_neighbor_list=my_mobile_neighbor_list-next;
}

coutnode id :  put here node id Mubashir Neighbor list contains ID
:my_mobile_neighbor_list- nodeidendl;

Regards
Mubashir Husain Rehmani
Lip6/UPMC - Sorbonnes Universités,
Paris, France


On 20 September 2011 11:42, Divya G divyaga...@gmail.com wrote:


 Hello Sir..!!

 Can you please help in writing a code for finding all the neighbor nodes of
 a mobile node in a wireless scenario.

 Thanks  Regards,
 Divya.




-- 
Mubashir Husain Rehmani


[ns] [NS-ANS] Re: Finding the neighbour nodes of a mobile node

2011-09-20 Thread Mubashir Rehmani

Hi,

You can use the following methods to discover neighbors:
1. Use Hello Packets for *neighbor* discovery.
2. Use Communication range for neighbour discovery.
3. Use Nodes Positions for *neighbor* discovery.

So, it totally depends upon you, how you discover your neighbours. But i
would suggest you to use Hello Packets to discover neighbors.

What you have to do is simple: Just start sending hello messages by using
hello packets (if you dont know this, please ask) or just search ns2 mailing
list by my name and hello packets, InshaAllah you will find the way to
enable hello packets. Once each and every node is able to send hello packets
then each node that receive the hello packet of other node is supposed to be
the neighbor of other node. In this way, you would find the number of
neighbors of each node. In simple, a node that receives the hello packet of
other node is the neighbor of that node. So, there is a function of
recvHello() in aodv.cc and you have to write a line of code in recvhello()
that each node when receive this packet should make a entry in node.cc
(inneighbor table) that i am neighbor node of this node.

Node.cc


Add this code
void Node::addNeighbor(Node * neighbor) {

int flag=0;
neighbor_list_node* my_neighbor_list;
my_neighbor_list=neighbor_
list_;
//cout Mmy_neighbor_list-
nodeidendl;
//return;

   while(my_neighbor_list)
{
if(my_neighbor_list-nodeid == neighbor-nodeid())
{
flag = 1;
break;
}
else
{
my_neighbor_list=my_neighbor_list-next;
}
}


//coutMMM my_neighbor_list-nodeidendl;
if(flag == 1)
{
   //neighbour already exist do nothing
}
else
{
   neighbor_list_node* nlistItem = (neighbor_list_node
*)malloc(sizeof(neighbor_list_node));
nlistItem-nodeid = neighbor-nodeid();
nlistItem-next = neighbor_list_;
neighbor_list_=nlistItem;
}



}

AODV.cc
==
Add these lines in AODV::recvHello(Packet *p) {} function

Node* sender_node = Node::get_node_by_address(rp-rp_dst);
Node* receiver_node = Node::get_node_by_address(index);
sender_node-addNeighbor(receiver_node);
receiver_node-addNeighbor(sender_node);

==

Now let me expalin you what i have done. In recvHello funciton whenever a
node receives a Hello packet it create two objects of node, sending node and
receiving node and then add them in the neighborl list. Secondly in void
Node::addNeighbor(Node * neighbor) {}, first a doulbe entry is checked and
if found, it won't add the neighbor, else it add the neighbor.

After that you can easily get access to any node's neighbor list by creating
its object and calling its neighbor list.

Node* m_node = Node::get_node_by_address(
this-addr());
neighbor_list_node* my_mobile_neighbor_list;
my_mobile_neighbor_list = m_node-neighbor_list_;

while(my_mobile_neighbor_list)
{
cout## Mubashir Neighbor ID
:my_mobile_neighbor_list-nodeidendl;
my_mobile_neighbor_list=my_mobile_neighbor_list-next;
}

coutnode id :  put here node id Mubashir Neighbor list contains ID
:my_mobile_neighbor_list- nodeidendl;

Regards
Mubashir Husain Rehmani
Lip6/UPMC - Sorbonnes Universités,
Paris, France


On 20 September 2011 11:42, Divya G divyaga...@gmail.com wrote:


 Hello Sir..!!

 Can you please help in writing a code for finding all the neighbor nodes of
 a mobile node in a wireless scenario.

 Thanks  Regards,
 Divya.




-- 
Mubashir Husain Rehmani


[ns] please experts help me , with this dilemma ....

2011-09-20 Thread Sandy Haff

hi all 


ns exports , can you help me with my project  , i want to create 2 BSs  , and 
100 MNs , and make the 100 MNs crossover from BS1 to BS2 , 

i want to calculate the handover of the MNs when they crossover , i already 
made a tcl script , 

in order to make it run i need to generate a wireless scenario movement  
pattern  for the 100 MNs movement and position ,using ./setdest 


but the problem is when i generate the movement scenario file , the tcl script 
cant seem to read it , 

some friends told me the problem is with MNs identification in my tcl script , 
but i don't know what is the issue exactly  
can you please take a look at the tcl script and the movement scenario file 
that i have generated using ./setdest 

zmezm@zmezm-laptop:~/ns2/test$ ns 100nzwimax.tcl
num_nodes is set 102
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
INITIALIZE THE LIST xListHead
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. 

[ns] please experts help me , with this dilemma .....

2011-09-20 Thread Sandy Haff





hi all 


ns exports , can you help me with my project  , i want to create 2 BSs  , and 
100 MNs , and make the 100 MNs crossover from BS1 to BS2 , 

i want to calculate the handover of the MNs when they crossover , i already 
made a tcl script , 

in order to make it run i need to generate a wireless scenario movement  
pattern  for the 100 MNs movement and position ,using ./setdest 


but the problem is when i generate the movement scenario file , the tcl script 
cant seem to read it , 

some friends told me the problem is with MNs identification in my tcl script , 
but i don't know what is the issue exactly  
can you please take a look at the tcl script and the movement scenario file 
that i have generated using ./setdest 

zmezm@zmezm-laptop:~/ns2/test$ ns 100nzwimax.tcl
num_nodes is set 102
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
INITIALIZE THE LIST xListHead
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. Bw=500.00, n=1.152000, new value is 5.76e+06
Fs updated. 

[ns] 2nd CfP: MMEDIA 2012 || April 29 - May 4, 2012 - Chamonix / Mont Blanc, France

2011-09-20 Thread Cristina Pascual



INVITATION:

=
Please, consider to contribute to and/or forward to the appropriate groups the 
following opportunity to submit and publish original scientific results to 
MMEDIA 2012.
The submission deadline is set to December 5, 2011.
In addition, authors of selected papers will be invited to submit extended 
article versions to one of the IARIA Journals: http://www.iariajournals.org
=


== MMEDIA 2012 | Call for Papers ===

CALL FOR PAPERS, TUTORIALS, PANELS

MMEDIA 2012: The Fourth International Conferences on Advances in Multimedia
April 29 - May 4, 2012 - Chamonix / Mont Blanc, France

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

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

- regular papers
- short papers (work in progress)
- posters

- ideas

Submission page: hhttp://www.iaria.org/conferences2012/SubmitMMEDIA12.html

Submission deadline: December 5, 2011

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

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

Fundamentals in multimedia
Multimedia systems, architecture, and applications; New multimedia platforms; 
Multimedia architectural specification languages; Theoretical aspects and 
algorithms for multimedia; Multimedia content delivery networks; Network 
support for multimedia data; Multimedia data storage; Multimedia meta-modeling 
techniques and operating systems; Multimedia signal coding and processing 
(audio, video, image); Multimedia applications (telepresence, triple-play, 
quadruple-play, …); Multimedia tools (authoring, analyzing, editing, browsing, …
); Computational multimedia intelligence (fuzzy logic, neural networks, genetic 
algorithms, …); Intelligent agents for multimedia content creation, 
distribution, and analysis; Multimedia networking; Wired and wireless 
multimedia systems; Distributed multimedia systems; Multisensor data 
integration and fusion; Multimedia and P2P; Multimedia standards

Multimedia content and modeling
Interfaces for multimedia creation; Multimedia streaming and services; Image 
modeling and editing; Audio modeling and transformation; Video modeling and 
transformation; Image recognition; Multimedia databases; Multimedia coding and 
encryption; Multimedia modeling for learning content; Multimedia description 
languages; Image clustering; Media fusion for communication and presentation

Self-organizing multimedia architectures
Self-organization in multimedia systems; Self-organization in multimedia 
communities; Self-organized multimedia networks; Multimedia content 
distribution and consumption; Adaptive multimedia interfaces; Multimedia 
retrieval

Multimedia content-based retrieval and analysis
Multimodal data analysis; Multimedia databases; Semi-automatic and automatic 
methods for multimedia annotation; Image/video/audio databases; Content-based 
image retrieval; Semantics-based search and integration of multimedia and 
digital content; Multimedia data modeling, indexing, and mining; Statistical 
modeling of multimedia data; Multimedia extraction and annotation; Content 
search/browsing/retrieval; Internet imaging and multimedia; Multimodal content 
analysis; Multimedia abstraction and summarization; Semantic analysis of 
multimedia data; Media assimilation and fusion

Perception and cognition for multimedia users
Quality of experience; Relevance feedback; Human-computer interaction; 
Multimodal interaction; Multimodal user interfaces; Mobile user-centered 
interfaces; Peer-to-peer multimedia systems and streaming; Pervasive and 
interactive multimedia systems (digital TV, mobile systems, gaming,…); 
Multimedia in personal, sensor and ad-hoc networks; Visualization and virtual 
reality; Intelligent browsing and visualization; Perception and cognition; 
Perception and modeling of the environment; Multimedia collaboration; Social 
networking

Multimedia ontology
Multimedia semantics; Emergent semantics; Media ontology learning; Ontology for 
media web mining; Multimedia ontologies; Multimedia information management; 
Approaches using metadata standards; Conceptual 

[ns] wimax mesh

2011-09-20 Thread charanpreet singh

Hey everyone
Anyone having the patch for wimax in mesh architecture. If anyone has it can
he/she please give it to me i am not able to download it from
http://cng1.iet.unipi.it/wiki/index.php/Ns2mesh80216
there server seems to be down.
I will be really grateful.

Thanks and regards
Charanpreet