It s not really the distance but the minimal number of hops until the sink.
the mote just keep its minimal cots of hops until the sink. I don t use
TOSSIM. i experiment under real conditions. This is the sink who collect all
motes' positions and can deduce a graph of id mote.
Thanks
From: "Bernardo Avila Pires" <[EMAIL PROTECTED]>
To: "vazoumana fofana" <[EMAIL PROTECTED]>
Subject: Re: [Tinyos-help] [Broadcast and tree graph]
Date: Wed, 13 Jun 2007 07:38:00 -0300
It happens that I actually programmed somthing like this in tinyos-2.x
and 1.x. I didn't use the distance thing, though. But I suppose you
need each mote to know its position for this to work. They may be able
to calculate their distance from the sink, by analyzing signal power
and so. Do you want the mote to know it's exact position as well? Will
you test with TOSSIM?
2007/6/13, vazoumana fofana <[EMAIL PROTECTED]>:
hello,
i want to implement an appliaction where a basestation broadcast a message
wich contains its id and distance ( 0 for the sink). When a mote receive
its
message, it acks by sending its id end distance by incrementing distance.
It
does recursively until all motes have acked messages.
It looks like to CPT. At the end, the base station can have a tree of all
motes. Have you ever programmed it ? Can you help me ?
_________________________________________________________________
Windows Live Spaces : créez votre blog à votre image !
http://www.windowslive.fr/spaces
_______________________________________________
Tinyos-help mailing list
[email protected]
https://mail.millennium.berkeley.edu/cgi-bin/mailman/listinfo/tinyos-help
--
"The truth shall set you free"
_________________________________________________________________
Windows Live Messenger sur i-mode : dialoguez avec vos amis depuis votre
mobile comme sur PC ! http://mobile.live.fr/messenger/bouygues/
_______________________________________________
Tinyos-help mailing list
[email protected]
https://mail.millennium.berkeley.edu/cgi-bin/mailman/listinfo/tinyos-help
