I just performed another test to demonstrate the relation of costs for each PREQ and the occurrence of multihop paths. More importantly, maybe, the test also confirms that even with hop count as metrics, the multhop paths will still form.<br>
<br><a href="http://wiki.laptop.org/go/Path_Discovery_Mechanism:Sanity#Hop_count_will_indeed_reduce_it.2C_but_not_eliminate">http://wiki.laptop.org/go/Path_Discovery_Mechanism:Sanity#Hop_count_will_indeed_reduce_it.2C_but_not_eliminate</a><br>
<br>More on this soon.<br><br>Looking forward to hear your comments!<br>Ricardo<br><br><div class="gmail_quote">On Mon, May 12, 2008 at 10:12 AM, Ricardo Carrano <<a href="mailto:carrano@laptop.org">carrano@laptop.org</a>> wrote:<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">Those interested in the path discovery mechanism would probably want to take a look at:<br><a href="http://wiki.laptop.org/go/Path_Discovery_Mechanism:Sanity" target="_blank">http://wiki.laptop.org/go/Path_Discovery_Mechanism:Sanity</a><br>
<br>It is an investigation into the forming of "longer than expected" paths in a dense mesh (like a classroom).<br><br>Please, let me know of the flaws and loose ends in the argument.<br><br>Cheers!<br><font color="#888888">Ricardo Carrano<br>
</font></blockquote></div><br>