Hi, I was giving a look to the multihop routing algorithm implemented in tos/lib/MultiHopLQI. I have noticed that nodes select their parent evaluating the end-to-end link quality of the path to the base station.
In order to avoid cycles, shouldn't they select their parent evaluating also the distance from the base station? Without the check on the distance, there is no guarantee that the packet gets closer to the base station: isn't there the risk of cycles? (for example, I guess it may happen in scenarios with long paths and with link quality that frequently changes) The developers of this library, besides checking the address of the node that originates the packet, included also a check on the history of packets seen by the node, but this guarantees no cycles only for paths whose length is less or equal to the history size. Did anyone else notice this? Am I missing something? Regards, Paolo _______________________________________________ Tinyos-help mailing list [email protected] https://www.millennium.berkeley.edu/cgi-bin/mailman/listinfo/tinyos-help
