Docsity
Log inSign up
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search Store documents

The best documents sold by students who completed their studies

Search through all study resources
Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

University Rankings

Discover the best universities in your country according to Docsity users

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

From our blog

Exams and Study
Go to the blog

Mobile Computing - TORA, Study notes of Mobile Computing

Moradabad Institute of TechnologyMobile Computing

Summary about Temporally-Ordered Routing Algorithm (TORA), TORA – Conceptual Description, TORA – Link Reversal , TORA Advantages, TORA Disadvantages, algorithm.

Typology: Study notes

2010/2011

Uploaded on 09/04/2011

amit-mohta
amit-mohta 🇮🇳

4.2

(152)

89 documents

1 / 5

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
Temporally-Ordered Routing Algorithm
(TORA)
•Highly adaptive, loop-free, distributed
routing algorithm based on the concept
of link reversal
•Proposed to operate in a highly dynamic
mobile networking environment
•It is source initiated and provides
multiple routes for any desired source/
destination pair
•This algorithm requires the need for
synchronized clocks
pf3
pf4
pf5

Partial preview of the text

Download Mobile Computing - TORA and more Study notes Mobile Computing in PDF only on Docsity!

Temporally-Ordered Routing Algorithm

(TORA)

  • (^) Highly adaptive, loop-free, distributed

routing algorithm based on the concept

of link reversal

  • (^) Proposed to operate in a highly dynamic

mobile networking environment

  • (^) It is source initiated and provides

multiple routes for any desired source/

destination pair

  • (^) This algorithm requires the need for

synchronized clocks

Temporally-Ordered Routing Algorithm

(TORA)

  • (^) TORA has three basic functions: Route creation, Route maintenance and Route erasure. The route creation algorithm generates a directed acyclic graph from source to destination based on a propagation parameter, called “height”. A node with higher height is considered upstream and one with lesser downstream. The algorithm starts by stetting the height of the destination to 0 (base) and all other node’s height undefined (NULL). Now the source broadcasts a “route query packet” containing the destinations’ ID. Each node with non-NULL height responds with an update packet, witch including its height in it. If a node receiving an update packet compares its height with the packet height. If it is more than 2, a short path to the source exists. Now it updates its own height to the packet height plus 1 and propagates the update packet with its own height in it.

TORA – Link Reversal

 (^) When a node has no downstream links, it reverses the direction of one or more links A C E D F G B A C E D F G B A C E D F A G C E D F G B B

TORA

TORA Advantages :
  • (^) It supports multiple routes to any source/destination pair.
  • (^) Failure or removal of one node is quickly resolved without
source intervention by switching to an alternate route.
  • (^) Loop Free Path
  • (^) Establish routes quickly , before topology changes
  • (^) Able to detect partitions very quickly
  • (^) TORA Disadvantages :
  • (^) It relies on synchronized clocks among nodes in the
network.
  • (^) It also relies on intermediate lower layers for certain
functionality.
  • (^) TORA is not energy efficient and does not scale to large
networks.
  • (^) exhibits instability behavior similar to "count-to-infinity"
problem in distance vector routing protocols