Academic Journals Database
Disseminating quality controlled scientific knowledge

An Efficient and Secure Routing Protocol for Mobile Ad-Hoc Networks

ADD TO MY LIST
 
Author(s): N. Ch. Sriman Narayana Iyengar | Syed Mohammad Ansar Sachin kumar | Piyush Nagar | Siddharth Sharma | Akshay Atrey

Journal: International journal of Computer Networks & Communications
ISSN 0975-2293

Volume: 2;
Issue: 3;
Start page: 28;
Date: 2010;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: Random Algorithms | MANETS

ABSTRACT
Efficiency and simplicity of random algorithms have made them a lucrative alternative for solving complexproblems in the domain of communication networks. This paper presents a random algorithm for handling therouting problem in Mobile Ad hoc Networks [MANETS].The performance of most existing routing protocols forMANETS degrades in terms of packet delay and congestion caused as the number of mobile nodes increases beyonda certain level or their speed passes a certain level. As the network becomes more and more dynamic, congestion innetwork increases due to control packets generated by the routing protocols in the process of route discovery androute maintenance. Most of this congestion is due to flooding mechanism used in protocols like AODV and DSDVfor the purpose of route discovery and route maintenance or for route discovery as in the case of DSR protocol. Thispaper introduces the concept of random routing algorithm that neither maintains a routing table nor floods theentire network as done by various known protocols thereby reducing the load on network in terms of number ofcontrol packets in a highly dynamic scenario. This paper calculates the expected run time of the designed randomalgorithm.
Save time & money - Smart Internet Solutions      Why do you need a reservation system?