Dear Zhichao Cao,
Thank you very much for answer.
What you say makes perfect sense to me.
I'm really thankful for your help.
I couldn't figure it out by myself.
I somehow always missed the fact, that data_total is only reset if
data_success 0.
Thanks again
Christian
On Tue, 20 Sep 2011
Thank you very much for your kind reply,
I think, I'm on the wrong train with my assumptions.
However, I can not spot my mistake on my own.
Please help me understand.
If more than MAX_PKT_GAP beacons are lost, the code will reinitialize
the link information. The code is in the same file.
If I
On Fri, Sep 9, 2011 at 11:57 AM, Christian christ...@wwad.de wrote:
Dear TinyOS community,
I have a problem understanding, how CTP's updateRouteTask() works, if
the 4-Bit Link Estimator is used.
Consider the following example:
Node 2 with costs 70 is currently using node 1 (costs 20) as
On Tue, Sep 6, 2011 at 5:12 AM, Francisco J. kit...@gmail.com wrote:
Hello, im working with CTP and have a question about it.
In the task 'updateRouteTask' implemented in the file
'ctpRoutingEngineP.nc', the first part the node scan each row in the
neighbor table:
/* Find best path
Dear TinyOS community,
I have a problem understanding, how CTP's updateRouteTask() works, if
the 4-Bit Link Estimator is used.
Consider the following example:
Node 2 with costs 70 is currently using node 1 (costs 20) as parent.
He could also choose node 3, that has costs 60 over a link of costs
Hello, im working with CTP and have a question about it.
In the task 'updateRouteTask' implemented in the file
'ctpRoutingEngineP.nc', the first part the node scan each row in the
neighbor table:
/* Find best path in table, other than our current */
for (i = 0; i
