Start in: "On the Use of Multiple Hops in Next GenerationWireless Systems" - B.S. MANOJ, K.J. KUMAR - Wireless Networks 12, 199221, 2006
"The TinyOS-1.1 release and later include library components that provide ad-hoc multi-hop routing for sensor sensor network applications. The implementation uses a shortest-path-first algorithm with a single destination node (the root) and active two-way link estimation." http://www.tinyos.net/tinyos-1.x/doc/multihop/multihop_routing.html "Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959, is a graph search algorithm that solves the single-source shortest path problem for a graph with non negative edge path costs, outputting a shortest path tree. This algorithm is often used in routing." http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm Finaly, you have to read the code of MultHopRouter. ***************** João Giacomin Prof-DCC-UFLA ***************** ---------- Original Message ----------- From: manoj <[EMAIL PROTECTED]> To: [email protected] Sent: Wed, 12 Nov 2008 00:48:51 -0600 Subject: [Tinyos-help] Need help in multihop router > hi, > i'm currently studying a routing protocols in the tinyos 1.x. i've seen the > multihop router and found the following documents related to it. > 1. http://www.tinyos.net/tinyos-1.x/doc/multihop/multihop_routing.html > 2. http://www.tinyos.net/tinyos-1.x/doc/ad-hoc.pdf > > But i need to know > i) how the link costs are estimated > ii) how the parent are selected > iii) an algorithm to chose the parent > > Finally i want to know based on which research paper, this work has been > implemented. > So please point me where can i found detail information about the multihop > router. > > thanks a lot in advance. ------- End of Original Message -------
_______________________________________________ Tinyos-help mailing list [email protected] https://www.millennium.berkeley.edu/cgi-bin/mailman/listinfo/tinyos-help
