[net2-wg] BVR/S4

[Rodrigo Fonseca]

The situation is the following:

There is a public implementation of BVR for T1.x in contrib.
It was ported to T2, and features as one of the examples of how to
port code to T2.

S4 has an implementation that was used by the paper, for T1, and it
was in part based on the BVR code. Of course the core algorithm is
different.
Jorge Ortiz, Daekyong Moon and Chris Baker did an implementation of a
location service for BVR, using the 1.x code, and wrote an IPSN paper
about it (BLS).
The code for that wasn't released.

I don't know what the current state of the code is, but I am cc'ing
Jorge here, maybe he can answer.

Phil, do you know how much the code was tested for BVR T2?

Rodrigo

On Fri, Feb 6, 2009 at 12:42 PM, Omprakash Gnawali <gnawali at usc.edu> wrote:
> On Fri, Feb 6, 2009 at 12:35 PM, Philip Levis <pal at cs.stanford.edu> wrote:
>>
>> On Feb 6, 2009, at 12:21 PM, Kaisen Lin wrote:
>>
>>> During the telecon, Phil said there was a BVR and S4 implementation in
>>> contrib. There was also discussion of needing a lookup service for BVR
>>> and S4 to work, and it seemed to cause some concern. Is there no
>>> lookup
>>> service implementation?
>>
>> As far as I know, there aren't lookup service implementations out
>> there. I think Jorge Ortiz from Berkeley wrote one a few years ago,
>> but I've never heard of the code being public. So the papers just
>> evaluate routing under the assumption that there's been a lookup.
>>
>
> The lookup service can be complex and a protocol by itself. Where
> should one implement this lookup service? What are the ways in which
> one is allowed to add or delete a node? Another issue is if some part
> of it is not implemented on the motes, it might be hard for us to
> "standardize" it.
>
> - om_p
> _______________________________________________
> net2-wg mailing list
> net2-wg at millennium.berkeley.edu
> https://www.millennium.berkeley.edu/cgi-bin/mailman/listinfo/net2-wg
>