Well, but i read Dissemination and i don t understand all subtlety of
Dissemation : With this applcation, it says that the information is
disseminate on all network. How does it disseminate values to node wich are
out of range. Is it is dseminate by other nodes wich can forward to nodes
wich are not accessible ?
Indeed, in Dissemination application a root is decided ( id = 0), and then
it disseminates value periodically. but, in my case there is no node chosen
to disseminate value. At the begin a node don t know if it has got the most
litte id.
Does Disseminate work more than one hop ?
Thans for your help .
From: Philip Levis <[EMAIL PROTECTED]>
To: vazoumana fofana <[EMAIL PROTECTED]>
CC: [email protected]
Subject: Re: [Tinyos-help] [application : TREE]
Date: Wed, 11 Jul 2007 06:49:04 -0700
On Jul 11, 2007, at 3:17 AM, vazoumana fofana wrote:
Hello
i want to implement an application where in a network , the node with the
most little id is chosen like the root of a tree. At the begin, i init a
struct message with this field ( id , parent , hopcount) in flash for
each node. Then i send this struct in broadcast. After each node must
compare its field and field received by other nodes. Iif its necessary ,
it updates its fields. I ve got a question : when a node receive
serveral messages, what happens ? indeed, a node must at the begin
receive all neigbours' messages to treat them. How can i answer to this
problem, because there are somme messages wich are gonna be lost ?
I'd suggest using dissemination to perform the leader election, then once
dissemination settles down have the node which wins call
RootControl.setRoot() on CollectionC.
Phil
_________________________________________________________________
Avec Windows Live OneCare éliminez tous les virus de votre PC !
http://www.windowslive.fr/liveonecare/default.asp
_______________________________________________
Tinyos-help mailing list
[email protected]
https://mail.millennium.berkeley.edu/cgi-bin/mailman/listinfo/tinyos-help
