Questions for Trickle Discussion
Russell Sears
UC Berkeley, CS 294 - Sensor Networks: Oct 25, 2005

Trickle questions:

 - Listening overhead:
   - O(log n) is total # of transmissions per network (per-mote transmission
     cost decreases with scaling!)
   - But, we have O(log n) *receptions* to deal with.
   - Why not bound the number of receptions per mote in a given window?
     - Eg:  Go to sleep after receiving k+1 messages.
     - (After each of the first k packets, any motes with updated information
        will immediately send new metadata, right?)

 - If a mote hears new metadata, it simply advertises its old meta data.
   - Why doesn't it set an 'out of date' bit to propogate staleness information
     throughout the network?

 - How high can T_h be?  (Why not days?)
 - 5 foot spacing (slide 32) propagation looks ugly, but it's fast.  What happens at
  higher density?
 - How did they handle the hidden terminal problem?
   - Lower channel utilization => Lower density. Lower k.  Raise T_h(?)
   - Other traffic on network?
   - Are slides 19-20 logarithmic?