Skip to search formSkip to main contentSkip to account menu

Temporally ordered routing algorithm

Known as: Temporally-Ordered Routing Algorithm, Tora 
The Temporally Ordered Routing Algorithm (TORA) is an algorithm for routing data across Wireless Mesh Networks or Mobile ad hoc networks. It was… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Perubahan yang sering terjadi dan banyaknya node dapat menyebabkan terjadinya collision atau tabrakan data pada VANET yang dapat… 
2013
2013
Mobile Ad hoc networks (MANETs) are self organized by a collection of mobile nodes, which are interconnected by multi hop… 
Review
2012
Review
2012
TORA is a highly adaptive routing protocol that provides loop free routing of data packets in ad hoc network at every instant… 
2010
2010
A broad class of mobile ad hoc network (MANET) applications will require every mobile node in a connected subnet to establish… 
2009
2009
We first characterize the minimal link-sets L whose directions must be reversed for reestablishing one or more directed paths… 
2008
2008
Abstract A mobile ad hoc network consists of nodes that move arbitrarily and form dynamic topologies. The distributed nature of… 
2006
2006
M-TORA is a new multi-path routing protocol based on temporally ordered routing algorithm(TORA) proposed for mobile Ad hoc… 
Review
2005
Review
2005
This paper presents a performance analysis of the temporally ordered routing algorithm (TORA) protocol on top of IEEE 802.11a… 
Highly Cited
2004
Highly Cited
2004
Mobile Ad hoc-networking (MANET) is becoming increasingly important in today's world and a number of protocols have been… 
2002
2002
One of the major challenges faced by designers of ad hoc network systems is the deployment of end-to-end quality-of-service…