[Tinyos-help] [application : TREE]

[Philip Levis]

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