Open Access Open Access  Restricted Access Subscription or Fee Access

Reducing Overhead in Ad-Hoc Network via Temporarily Ordered Routing Algorithm

D. Helen, D. Arivazhagan

Abstract


The Temporally Ordered Routing Algorithm (TORA) is a distributedrouting protocol for ad-hoc networks. The protocol constructs for dynamic, distributed, multipath routing in the network.The TORA performs the reactive technique, forthe routeformation and maintenance of the nodes in the network The TORA can concurrently support together source-initiated, ondemand routing at the destination. TORA is a complex protocol. TORA can able to work at the point of link flops .It can able to broadcast the control messages from the point of connection failure, this is the beauty of this protocol. During the reactive operation, origin initiates the route creation for the certain destination on demand basis. This mode of operation may be benefit forthe distributed and dynamic networks.Since it may not be compulsory to maintaina routebetween each source and destination at all the times. TORA is more effective for the large network but it has a high upstairs in the smaller network. In the proposed paper, TORA is designed to minimize the communication overhead in small network and linked with adapting to network topological changes. TORA use the link reversal protocols and Directed Acyclic Graph (DAG) to maintain the route at the destination.

Keywords


Distributed, Topology, Reactive, Topology, Broadcast.

Full Text:

PDF

References


Royer, E.; Toh C.-K.: A review of current routing protocols for ad hoc mobile wireless networks, April 1999.

J. Jaffe and F. Moss, A responsive distributed routing algorithm for computer networks, IEEETrans. Commun.July 1982.

E. Gafni and D. Bertsekas, Distributed algorithms for generating loop-free routes in networks with frequently changing topology, IEEE Trans. Commun. (January 1981).

S.Murthy and J.JGarciaLunaAceves,“AnEfficient Routing Protocol forWireless Networks,” ACMMobile Networks and Applications Journal, Special issue on Routing in Mobile Communication Networks, (1996)

Park, V.; Corson, M. S: A performance comparison of TORA and Ideal Link-State routing, USA, 1998.

C Perkins and P. Bhagwat, Highly dynamic destination sequenced distance vector routing (DSDV) for mobile computers, ACM SIGCOMM, (October 1994).

2. C. E. Perkins, E. M. Royer, and S. R. Das, “Ad Hoc On- Demand Distance Vector (AODV) Routing”, Internet Draft, draft-ietf- manet- aodv10.txt, work in progress, 2002.

Anuj K. Gupta, Dr. Harsh Sadawarti and Dr. Anil K. Verma, “Performance analysis of AODV, DSR & TORA Routing Protocols,” IACSIT International Journal of Engineering and Technology, Vol.2, No.2, April 2010 ISSN: 1793-8236.

17. Suresh Kumar and Jogendra Kumar, ”Comparative Analysis of Proactive and Reactive Routing Protocols in Mobile Ad-Hoc Networks (Manet)”, Journal of Information and Operations Management ISSN: 0976–7754 & E-ISSN: 0976–7762 , Volume 3, Issue 1, 2012.

. Bertsekas and R. Gallager, Data Networks(Prentice-Hall, 1987).

V. Park and M. S. Corson, “A Highly AdaptiveDistributed Routing Algorithm for Mobile Wireless Networks”, Proc. IEEE INFOCOM „97, Kobe, Japan(1997).

M.S. Corson and A. Ephremides, A distributed routingalgorithm for mobile wireless networks, Wireless Networks 1 (1995).

E. Gafni and D. Bertsekas, Distributed algorithms fogenerating loop-free routes in networks with frequentlychanging topology, IEEE Trans. Commun. (January 1981).

M. S. Corson and A. Ephremides, “A Distributed Routing Algorithm for Mobile Wireless Networks,”Wireless Networks 1 (1995).


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.