V.Park and S.Corson. "Temporally-Ordered Routing Algorithm (TORA) Version 1", IETF Internet Draft, July 2001, ( Work in progress).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Random Waypoint Based Performance Comparisons Much of the initial research was based on using Random Waypoint as the underlying mobility model and CBR traffic consisting of randomly chosen source destination pairs as the traffic pattern. Routing protocols like DSR [5] DSDV [6] AODV [7] and TORA [12] were mainly evaluated based on the following metrics: packet delivery ratio (ratio of the number of packets received to the number of packets sent) and routing overhead (number of routing control packets sent) 9] concluded that on demand protocols such as DSR and AODV performed better than ....

V. D. Park and M. S. Corson, "Temporally-ordered routing algorithm (TORA) version 1: Functional specification, internet-draft, draft-ietfmanet -tora-spec-01.txt," August 1998.

....Random Waypoint Based Performance Comparisons Much of the initial research was based on using Random Waypoint as the underlying mobility model and CBR traffic consisting of randomly chosen source destination pairs as the traffic pattern. Routing protocols like DSR [2] DSDV [3] AODV [4] and TORA [9] were mainly evaluated based on the following metrics: packet delivery ratio (ratio of the number of packets received to the number of packets sent) and routing overhead (number of routing control packets sent) 6] concluded that on demand protocols such as DSR and AODV performed better than ....

V. D. Park and M. S. Corson, "Temporally-ordered routing algorithm (TORA) version 1: Functional specification, internet-draft, draft-ietfmanet -tora-spec-01.txt," August 1998.

....future research directions in section VI. II. REACTIVE ROUTING MECHANISM Reactive routing protocols in MANETs consist of the following dominant candidates Dynamic Source Routing (DSR) 12] Adhoc On demand Distance Vector Routing (AODV) 13] and Temporally Ordered Routing Algorithm (TORA) [14]. They all have two main phases in common: Route Discovery and Route Maintenance. A. Route Discovery In this phase, the source node S broadcasts a route request packet (RRQ) to locate the destination node D in the network. The first node receiving the RRQ that has a valid route for node D ....

V. D. Park and M. Scott Corson, "Temporally-ordered routing algorithm (tora) version 1: Functional specification.," Internet-Draft draft-ietfmanet -tora-spec-00.txt, November 1997.

....routing path is stored in the header and the header grows as the route grows, a network could waste a lot of energy in overhead. In addition, this type of scheme has traditionally been proven to scale poorly as the number of mobiles increases. TORA Temporally Ordered Routing Algorithm (TORA) [15,16] was designed to discover routes on demand, provide multiple routes to a destination, establish routes quickly, and minimize communication overhead. Route optimality (shortest path routing) is considered to be of secondary importance. Sometimes longer routes may be chosen to avoid the overhead of ....

....metric is dependent on logical time of a link failure[12] A logically separate copy of TORA is run for each destination. This means that each destination must maintain a structure describing the node s height as well as the status of all connected links per connection supported by the network[16,17]. Finally TORA can still suffer from oscillations which arise from unfortunate internodal coordination [12] Other Reactive Protocols These are not all the reactive protocols that exist, but these are definitely the more popular ones. The Internet Engineering Task Force homepage for mobile ....

V. Park and S. Corson, "Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification", Internet Draft, draft-ietf-manet-tora-spec-01.txt, August 7, 1998. Work in Progress

....view, these routing protocols fall into the class of interior gateway protocols, i.e. protocols used to route within a (mobile wireless) network or a set of interconnected (mobile wireless) networks under the same administration authority. Several of these protocols [59] 7] 32] 24] 9] [54], 55] 12] have been implemented in prototypes [45] and, while they are not yet available commercially, some of them are under commercial consideration [22] In [16] a list of desirable qualitative properties of mobile ad hoc networks routing protocols for the Internet is given: 1) Distributed ....

V. Park and M.S. Corson, "Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification," IETF Internet-Draft draft-ietf-manet-tora-spec02. txt, October 1999.

....simulation. Produce a classification of the protocols with respect to applicability in combinations of small large networks, and mobile semi mobile nodes. Recommend protocols for specific network scenarios. 1. 3 Related work Many routing protocols have been proposed [2] 4] 6] 8] 10] 11] 12][16][19] 22] 26] but few comparisons between the different protocols have been made. Of the work that has been done in this field, only the work done by the Monarch project at Carnegie Mellon University (CMU) has compared some of the different proposed routing protocols and evaluated them based on ....

....and forum, so people can discuss issues concerning ad hoc networks. Currently they have seven routing protocol drafts: AODV Ad hoc On Demand Distance Vector [19] ZRP Zone Routing Protocol [8] TORA IMEP Temporally Ordered Routing Algorithm Internet MANET Encapsulation Protocol [6][16][17] DSR Dynamic Source Routing [12] 13] CBRP Cluster Based Routing Protocol [11] CEDAR Core Extraction Distributed Ad hoc Routing [26] AMRoute Ad hoc Multicast Routing Protocol [2] OLSR Optimized Link State Routing Protocol [10] Of these proposed protocols we have ....

[Article contains additional citation context not shown here]

Vincent D. Park and M. Scott Corson, "Temporally-Ordered Routing Algorithm (TORA) Version 1: Functional specification". Internet draft, draft-ietf-manet-tora-spec-01.txt, August 1998. Work in progress.

....On demand routing is the most recent entry in the class of wireless routing schemes. It is based on a query reply approach. Examples include the Lightweight Mobile Routing (LMR) protocol [15] Ad hoc On Demand Distance Vector Routing (AODV) 18] Temporally Ordered Routing Algorithms (TORA) 16] [17], Dynamic Source Routing Protocol (DSR) 19] and ABR ( 42] Typically, on demand routing aims at providing solutions for networks with fast changing topologies. IETF s MANET working group is also focusing on the on demand routing solution for an Ad Hoc Network Standard [18] 17] 19] There are ....

....(TORA) 16] 17] Dynamic Source Routing Protocol (DSR) 19] and ABR ( 42] Typically, on demand routing aims at providing solutions for networks with fast changing topologies. IETF s MANET working group is also focusing on the on demand routing solution for an Ad Hoc Network Standard [18] [17] [19] There are many different schemes for discovering routes in On Demand algorithms. Most algorithms, however, employ a scheme derived from LAN bridge routing , ie, route discovery and backward learning. The source in search for a path floods a query into the network. The transit nodes upon ....

[Article contains additional citation context not shown here]

V. Park and S. Corson. "Temporally-Ordered Routing Algorithms (TORA) Version 1 Functional Specification" IETF, Internet Draft, draft-ietf-manet-tora-spec-00.txt, Nov. 1997 30

.... [9] Regional tunnel management Fast handoffs [8] Distributed mobile agents Fast scalable handoffs (Layer2) 10] Cellular IP [11] HAWAII [12] Dense Mode Sparse mode Multicast protocols Daedalus [15] Multicast mobility [16] MMP [14] Fast handoff multicast [17] MER TORA [18] TORA [19] AODV, DSR, etc MANET protocols Figure 2: Classification of IP mobility proposals Requirements for Mobile Hosts: An important decision is to what extent MHs are required to participate in the establishment and updating of the routing structure that enables mobility. A reference example can be ....

V. Park and S. Corson, "Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification", Internet Draft (work in progress) , draft-ietf-manet-toraspec -02.txt, October `99.

....agent (router) to reduce overhead. Cellular IP [CIP] CIP) Handoff Aware Wireless Access Internet Infrastructure [HAW] HAWAII) Dynamic Source Routing (DSR) Ad hoc On demand Distance Vector [AODV] AODV) Temporary Ordered Routing Algorithm with Edge Mobility support [EMA] TORA] MER TORA) 2.A. Classification of Micro Mobility protocols Our analysis is based on two fundamental protocol properties related to micro mobility. These two properties are consequences of independent design options. In what follows, we describe the selected properties, followed by a ....

....(router) to reduce overhead. Cellular IP [CIP] CIP) Handoff Aware Wireless Access Internet Infrastructure [HAW] HAWAII) Dynamic Source Routing (DSR) Ad hoc On demand Distance Vector [AODV] AODV) Temporary Ordered Routing Algorithm with Edge Mobility support [EMA] TORA] MER TORA) 2.A. Classification of Micro Mobility protocols Our analysis is based on two fundamental protocol properties related to micro mobility. These two properties are consequences of independent design options. In what follows, we describe the selected properties, followed by a classification of ....

[Article contains additional citation context not shown here]

Park, V., Corson, S., "Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification", Internet Draft (work in progress) , draft-ietf-manet-tora-spec-02.txt, October `99.

....connected. On the basis of a mapping between COA and local addresses, the FA can finally deliver the packet to its destination. D. EMA EMA [6] 7] aims to define a generic framework for the mobility management within a wireless domain. The authors discuss the possibility of using the TORA [17], 18] ad hoc network routing protocol with EMA. This choice seems to ensure a good scalability to the system while the EMA architecture allows to adapt TORA to the management of standard wireless access network which have specific properties with respect to ad hoc networks. Without any assumption ....

....the so called crossover base station for a given handoff value. In general, we can assume that ) # . We call TORA the average number of updates required in a TORA network for routing to converge after a modification (this number depends on the network topology [17]) We assume that this convergence is done in TORA . 10 is the average time needed to reach the HA in classical Mobile IP registration mechanism. is the mean throughput for a MN. Global Internet Gateway New Base Station Mobile s movement Crossover Base Station t prev ....

V. Parks and S. Corson, "Temporally-Ordered Routing Algorithm (TORA) version 1 - functionnal specification," internet draft, draft-ietf-manet-toraspec -02.txt, October 1999, work in progress.

....of ongoing sessions. A number of efficient routing protocols have been proposed in the IETF MANET Working Group over the past several years, including Ad Hoc On Demand Distance Vector (AODV) routing [1] Dynamic Source Routing (DSR) 2] and the Temporally Ordered Routing Algorithm (TORA) [3], among others [4] Common features of these protocols are that they are lightweight, and provide loopfree operations and responsive routing information. The working group has focused on standardizing routing protocols suitable for supporting best effort packet delivery in IP based networks. A ....

V. Park and S. Corson, "Temporally Ordered Routing Algorithm (TORA) Version 1 Functional Specification," draft-ietf-manet-tora-spec-00.txt, Nov. 1997, work in progress.

....nodes continuously search for routing information within the network, so that when a route is needed, the route is already known. In reactive approach, a need for route triggers a route search. Here, nodes evaluate the network on as needed basis. The existing routing schemes ( 1] 3] 10] 14] [16], 17] and [18] have both advantages and disadvantages. We summarise hereafter some of the drawbacks of the existing proposals: In [1] AODV) and [3,8] DSR) nodes make use of their routing caches to reply to route queries. This mechanism, however, results to a storm of replies and repetitive ....

....a significant overhead to the protocol. DSR, on the other hand, requires hosts to operate in promiscuous mode, which could present an even higher routing and processing overhead as it will have to process every packet heard. Finally, both protocols do not guarantee shortest path routes. In TORA [16], nodes maintain multiple routes to destinations, thus additional cost of maintenance is implied, albeit no protocol reaction may be required in the face of topological changes. In addition, TORA makes use of the so called advantaged nodes. These are nodes that may provide a route that is ....

Vincent D. Park and M. Scott Corson. "Temporally-Ordered Routing Algorithm (TORA) version 1: Functional Specification", Internet-Draft, draft-ietf-manet-tora-spec01. txt, August 1998. Work in progress

....links between adjacent nodes get frequently broken due to node movements, causing the network topology to change unpredictably. Hence, the hosts need to determine routes to other nodes frequently. Many protocols have been proposed to efficiently perform this task under various mobility models [15, 2, 8, 17, 14, 7, 9, 18]. Of special interest is the class of on demand protocols, that set and maintain routes from a source to a destination only when needed [2, 17, 15, 8] These protocols have a lower routing overhead (measured in terms of the number of routing packets transmitted) than the traditional shortest ....

....average time for route discovery, which may lead to higher buffer length requirements and delays in packet delivery. But the savings in routing overhead may be considered to be more valuable than these demerits of the proposed schemes. 2 ROUTE DISCOVERY IN ON DEMAND PROTOCOLS On demand protocols [2, 4, 8, 15, 14, 16] create routes on an on needed basis. If the sender of a data packet does not have a route to the destination, or if the old route has expired, then it initiates a search for a new route. This reduces the routing overhead in comparison to shortest path based protocols such as those using ....

V. Park and S. Corson. "Temporally ordered routing algorithm (TORA) version 1, functional specification ", http://www.ietf.org/internet-drafts/draft-ietfmanet -tora-spec-01.txt, August 1998. IETF Internet Draft (work in progress).

....population size N is 5 mobiles. 3 Related Work Scheduling algorithms for broadcasting and gossiping have been studied extensive [8, 9] To the best of our knowledge, these studies do not consider the mobility aspect. In the area of ad hoc mobile networks the focus has been on routing protocols [10, 11, 12, 4, 13, 14]. As we mentioned in the Section 1, a di#erence of the traditional ad hoc networks from the mobile network we consider is that in our network the mobile hosts do not forward packets on behalf of other hosts. There are some papers presenting mobility modeling for wireless mobile networks [15, 16] ....

S. Corson and V. Park, "Temporally-ordered routing algorithm (TORA) version 1 functional specification," Internet Draft, Internet Engineering Task Force, Dec. 1997. Work in progress.

....[12] were also discussed in [13] While these groups focused more on mobile IP implementations, J. Inouye et al. [13] were dealing more with dynamic reconfiguration policies. There is a large amount of work focused on routing protocols to support mobility and some on ad hoc mobile networks [14] [15], 16] 17] and [18] S. Lee and A. Campbell [19] presented a signaling system for supporting quality of service in mobile ad hoc networks. It has been designed to support the delivery of adaptive real time services and includes fast session reservation, restoration and adaptation algorithms ....

S. Corson and V. Park, "Temporally-ordered routing algorithm (TORA) version 1 functional specification, " Internet Draft, Internet Engineering Task Force, Dec. 1997. Work in progress. 16

....sensor. This makes anycast mechanisms best suited to resource location applications. During the past 4 years, a number of multi hop wireless ad hoc network routing protocols have been proposed, including DSDV (Destination Sequenced Distance Vector) 4] TORA (Temporally Ordered Routing Algorithm) [5], DSR (Dynamic Source Routing) 2] and AODV (Adhoc On Demand Distance Vector) 3] to name only several. All of above are unicast routing protocols, and none of them focuses on anycast routing issues. However, since they are designed to be deployed in hostile environments as ours, some of their ....

Vincent D. Park and M. Scott Corson. "TemporallyOrdered Routing Algorithm (TORA) version 1: Functional Specification," Internet-Draft, draft-ietf-manet-tora-spec00. txt, November 1997. Work in progress.

....routing is the most recent entry in the class of scalable wireless routing schemes. It is based on a query reply approach. Examples include Lightweight Mobile Routing (LMR) protocol [5] Ad hoc On Demand Distance Vector Routing (AODV) 20] Temporally Ordered Routing Algorithms (TORA) 16] [17], Dynamic Source Routing Protocol (DSR) 2] and ABR [21] Most of the routing proposals currently evaluated by the IETF s MANET working group for an Ad Hoc Network Standard [20] 17] 2] fall in on demand routing category. There are different approaches for discovering routes in on demand ....

.... [5] Ad hoc On Demand Distance Vector Routing (AODV) 20] Temporally Ordered Routing Algorithms (TORA) 16] 17] Dynamic Source Routing Protocol (DSR) 2] and ABR [21] Most of the routing proposals currently evaluated by the IETF s MANET working group for an Ad Hoc Network Standard [20] [17] [2] fall in on demand routing category. There are different approaches for discovering routes in on demand algorithms. Most algorithms employ a scheme derived from LAN bridge routing, i.e. route discovery via backward learning. The source in search of a path floods a query into the network. The ....

V. Park and S. Corson. "Temporally-Ordered Routing Algorithms (TORA) Version 1 Functional Specification", IETF, Internet Draft, draft-ietf-manet-tora-spec-00.txt, November 1997

....of hops through other hosts in the network [7] Host mobility can cause frequent unpredictable topology changes. Therefore, the task of finding and maintaining routes in MANET is nontrivial. Many protocols have been proposed for mobile ad hoc networks, with the goal of achieving efficient routing [6, 9, 11, 12, 14, 16, 17, 18, 21, 23, 24, 28]. These algorithms differ in the approach used for searching a new route and or modifying a known route, when hosts move. In this paper, we suggest an approach to decrease overhead of route discovery by utilizing location information for mobile hosts. Such location information may be obtained ....

....in part by Texas Advanced Technology Program grants 010115 248and 009741 052 C. 1 We will use the terms host and node interchangeably. 2 Related Work Design of routing protocols is a crucial problem in mobile ad hoc networks [7, 25] and several routing algorithms have been developed (e.g. [6, 9, 11, 12, 14, 16, 17, 18, 21, 23, 24, 28]) One desirable qualitative property of a routing protocol is that it should adapt to the traffic patterns [8] Johnson and Maltz [15, 16] point out that conventional routing protocols are insufficient for ad hoc networks, since the amount of routing related traffic may waste a large portion of ....

[Article contains additional citation context not shown here]

V. D. Park and M. S. Corson, "Temporally-ordered routing algorithm (TORA) version 1 functional specification (InternetDraft) ," Aug. 1998.

....fLife pot (A; j)g It is easy to see that using this recursive formulation allows all nodes in the ad hoc network to iteratively build their optimal route towards a specific destination D. The distance vector formulation presented here can easily be incorporated in protocols, such as TORA [7], AODV [8] that are specifically designed for ad hoc mobile environments. Indeed, the intent of this paper is not to indicate the choice of a specific routing protocol, but to define a set of power aware metrics for use by a protocol during route selection. B. Applying MRPC to Energy Aware Cost ....

V. Park and S. Corson, "Temporally-Ordered Routing Algorithm (TORA) Version 1: Functional Specification", draft-ietf-manet-tora-spec-04.txt, IETF, Work in Progress, July 2001.

....be included) This progress in the mobile network simulation area is a very encouraging and important result for the group. Implementations of various manet protocol proposals now exist and status was briefly updated relating to the various Internet Drafts (IDs) at the beginning of the meeting [1, 2, 3, 4, 5]. Subsequently, new proposals and protocol enhancements were presented by various parties. A more proactive optimized link state technique with efficient multipoint relaying for flooding control traffic within a manet was presented [6] Various multicast enhancements were also discussed and a ....

.... flooding control traffic within a manet was presented [6] Various multicast enhancements were also discussed and a new multicast approach which is independent of any particular manet unicast approach was presented [7] In addition, several multicast extensions to existing protocols (i.e. TORA [3] and AODV [4] were outlined by developers. The group is beginning to discuss security issues in the context of manet, and a candidate manet security approach [8] was presented outlining authentication techniques for inclusion in the IMEP protocol. A number of manet protocols now intend to use the ....

[Article contains additional citation context not shown here]

V. Park and M. S. Corson. "Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification". Internet Draft (work in progress), 9/98.

....protocol proposals now exist in various stages of maturity and here is an overview of some known status. A networked, spread spectrum radio system is commercially available from Nova Engineering, Cincinnati, OH which contains an implementation of the Temporally Ordered Routing Algorithm (TORA) [2] running atop the Internet MANET Encapsulation Protocol (IMEP) 3] see http: www.novaengr.com stards57kvm.html) Enhanced Linux 2.1.95 based versions of IMEP and TORA are running at the University of Maryland and will be made available shortly. The Carnegie Mellon University (CMU) Monarch ....

V. Park and M. S. Corson. "Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification". Internet Draft (work in progress), September 1998.

No context found.

V.Park and S.Corson. "Temporally-Ordered Routing Algorithm (TORA) Version 1", IETF Internet Draft, July 2001, ( Work in progress).

No context found.

V.Park and S.Corson. "Temporally-Ordered Routing Algorithm (TORA) Version 1", IETF Internet Draft, July 2001, (Work in progress).

No context found.

V.D.Park and S. Corson, "Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification," IETF Internet draft, draft-ietf-manet-tora-spec-01.txt, Aug.1998, Work in progress.

No context found.

V. Park and S. Corson, "Temporally-ordered routing algorithm (tora) version 1: Functional specification, draft-ietf-manet-tora-spec-04.txt," .

No context found.

S. Corson and V. Park, "Temporally-orderedrouting algorithm (TORA) version 1 functional specification," Internet Draft, Internet Engineering Task Force, Dec. 1997. Work in progress.

No context found.

V. Park, S. Corson, "Temporally-Ordered Routing Algorithm (TORA) version 1: functional specification," Internet-draft-ietf-manet-tora-spec00. txt, November 1997.

No context found.

V. Park, and S. Corson, "Temporally-ordered routing algorithm (TORA) Version 1," Internet draft, IETF, Aug. 1998.

No context found.

V. Park, S. Corson, "Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification", http://www.ietf.org/internet-drafts/draft-ietf-manet-tora-spec-02.txt, October 1999, IETF Internet Draft,

No context found.

V. Park, S. Corson, "Temporally-Ordered Routing Algorithm (TORA) Version 1," Internet draft, IETF, Aug. 1998.

No context found.

V. Park and S. Corson, "Temporally ordered routing algorithm (TORA) version 1, functional specification ", http://www.ietf.org/ internetdrafts / draft-ietf-manet -tora-spec-01. txt, 1998. IETF Internet Draft.

No context found.

V. Park and S. Corson, "Temporally-Ordered Routing Algorithm (TORA) Version I Functional Specification", Internet Drafft draft-ietf-manet-tora-spec-01.txt, Aug 1998.

No context found.

Park, V., Corson, S., "Temporally-Ordered Routing Algorithm (TORA) version 1: Functional specification," Internet-Draft, draft-ietf-manet-tora-spec-00.txt, November

No context found.

V. D. Park and M. S. Corson, "Temporally-ordered routing algorithm (TORA) version 1 functional specification (Internet-Draft)," Mobile Ad-hoc Network (MANET) Working Group, IETF, Aug. 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC