Temporarly Order Routing Algorism Essay

1573 Words7 Pages
Zagazig University Faculty of Engineering Computer & System Dept. Fourth Year By Sara Mohammed Mohammed Mohammed Ouf BN. 7 Under supervision of Dr. Nesreen Zeidan Create PDF files without this message by purchasing novaPDF printer (http://www.novapdf.com) Temporally ordered routing algorithm TORA In Wireless Mesh Networks or Mobile ad-hoc networks the devices (representing nodes ) is movable so its routing table changes constantly Due to nodes instability this needs a special routing algorithm • Algorithms should be simple and distributed • Self-stabilizing (or self-healing) in the face of failures TORA have these features so it is efficient for these applications. This algorithm is of the family of link reversal routing algorithms Create PDF files without this message by purchasing novaPDF printer (http://www.novapdf.com) These algorithms deals with directed acyclic graph (DAG) ie: any two nodes are related with directed links but the graph shouldn't terminate with the same node it began with. If the link is directed towards the node so it is an upstream (inbound) link. Each node in the graph has a height . This idea is similar to fluid flow All the fluid is to flow from the source to the destination. The source is at the highest level, the destination is at the lowest level and the fluid flows from the highest level to the lowest level. Thus, if an intermediate node has all inbound links, it is a local minimum and it is possible that all the the fluid flows to this node rather than the destination. Now, the node has to increase its level If the link is directed out of the node so it is an downstream (outbound) link. There are two types of link reversal routing algorithms. ◦Full Reversal if any anode (except the destination) only have inbound links it reverses all its links ◦Partial Reversal if a link between two nodes i , j has reversed

    More about Temporarly Order Routing Algorism Essay

      Open Document