Journal of Engineering and Applied Sciences

Year: 2017
Volume: 12
Issue: 3 SI
Page No. 6606 - 6613

Network Constraints Reduction by TORA in MANET

Authors : G. Madhusudan and T.N.R. Kumar

Abstract: Mobile Ad hoc Networks (MANETs) are characterized by bandwidth constrained links, multiple hops and dynamic topologies. Routing should provide quality of service in the mobile adhoc networks is a highly challenging task. In this study, we discussed the unicast routing in MANETs with enhancements to the Temporally Ordered Routing Algorithm (TORA). Temporally Ordered Routing Algorithm (TORA) is a highly scalable routing protocol for MANETs. TORA is dependent on the services provided by the internet encapsulation protocol to effectively carry out with its three main functions; route creation, route maintenance and route erasing. Route discovery in TORA is done in a cooperative manner with intermediate nodes contributing to the route generation from one node to another. Precision in route build-up demands that all network nodes portray persistent benevolent behaviour. This is however, not always possible to achieve and so a number of malicious nodes participate in the route discovery process only to sabotage the network by violating the protocol. This study will give the novel mechanism for establishing trust in ad-hoc networks that execute the Temporally Ordered Routing Algorithm (TORA) protocol. The main objective is to limit control message propagation in the highly dynamic mobile computing environment. Each node has to explicitly initiate a query when it needs to send data to a particular destination.

How to cite this article:

G. Madhusudan and T.N.R. Kumar, 2017. Network Constraints Reduction by TORA in MANET. Journal of Engineering and Applied Sciences, 12: 6606-6613.

Design and power by Medwell Web Development Team. © Medwell Publishing 2024 All Rights Reserved