# Sastry NEST meeting notes
# Date: 3/19/2004
# Present: Phoebus, Cory, Bruno, Massimo, Shawn, Bonnie, Mike, Songhwai, Tanya
# Scribe: Mike Manzo

Cory:  We should talk to Eric Fraser in Soda about the testbed they're
building in Soda since it's very similiar to ours.

Bruno: I'd like to find a way to absorb rf to avoid multipath.
We offer ideas.

Massimo said he might be able to arrange for Aetherwire, which does
localization, about talking to us.  Cory said we should bring Avantaca if we
invite Aetherwire so that everyone has a fair shot at the contract.

Bruno gave presentation based on "A Game of Cops and Robbers" by M. Aigner
and M. Fromme:

Generally, the ratio of the velocities of the pursuers and evaders
determines which games can be won.  This paper assumes that that ratio is 1.

The paper uses a discrete model.  It attempts to divide all graphs into
those in which there exists a strategy for the evader to escape and those in
which there does not.  For example, the pursuers win in a tree.  Various
theorems are presented presented in the paper about dividing graphs into the
two sets.  The most interesting result is that for any planar graph, the
minimal number of pursuers for the pursuers to always win is 3.  Shawn
suggests doing some experiments on a discrete model to test that theorem.