\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={A Study on Enhancement of the Security of the Routing Protocols in Adhoc Networks},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2011-09 2011-08-22 (revised: 2011 September 22 August 2011)}
\def\TheID{\makeatother }
\def\TheDate{2011-09 2011-08-22}
\title{A Study on Enhancement of the Security of the Routing Protocols in Adhoc Networks}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{C.  Chandrasekar}

             \author[2]{Dr. S. Santhosh  Baboo}

             \affil[1]{  SREE NARAYANA GURU COLLEGE , COIMBATORE - 641 105}

\renewcommand\Authands{ and }

\date{\small \em Received: 21 July 2011 Accepted: 10 August 2011 Published: 22 August 2011}

\maketitle


\begin{abstract}
        


An ad hoc wireless network is a set of wireless mobile nodes that self-configure to build a network without the requirement for any reputable infrastructure or backbone. Mobile nodes are utilized by the Ad hoc networks to facilitate effective communication beyond the wireless transmission range. As ad hoc networks do not impose any fixed infrastructure, it becomes very tough to handle network services with the available routing approaches, and this creates a number of problems in ensuring the security of the communication. Majority of the existing ad hoc protocols that deal with security issues depends on implicit trust relationships to route packets among participating nodes. The general security objectives like authentication, confidentiality, integrity,availability and nonrepudiation should not be compromised in any circumstances. Thus, security in ad hoc networks becomes an active area of research in the field of networking. There are various techniques available in the literature for providing security to the ad hoc networks. This paper focuses on analyzing the various routing protocols available in the literature for ad hoc network environment and its applications in security mechanisms.

\end{abstract}


\keywords{networks, security, infrastructure}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{INTRODUCTION}]{INTRODUCTION}\par
N ad hoc network \hyperref[b0]{[1]} is an infrastructureless network in which the nodes themselves are accountable for routing the packets. In the conventional Internet, routers within the central parts of the network are owned by a few well known operators and are therefore assumed to be somewhat trustworthy. This statement cannot hold good in an ad hoc network as all nodes coming into the network are expected to involve in routing. As the links in general are wireless, the security that was obtained because of the difficulty of tapping into a network is lost. Moreover, as the topology in such a network can be extremely dynamic, conventional routing protocols can no be effective.\par
The routing protocol \hyperref[b1]{[2,}\hyperref[b2]{3]} provides an upper limit to security in any packet network. If routing can be misdirected, the whole network will be affected greatly. The issue is inflated by the fact that routing generally depends on the trustworthiness of all the nodes that are participating in the routing process. It is very tough to differentiate compromised nodes from nodes that are suffering from bad links.\par
Because of self organize and rapidly deploy capability, ad hoc can be used in various applications like battlefield communications, emergency relief scenarios, law enforcement, public meeting, virtual class room and other applications. Though security \hyperref[b3]{[4]}  \hyperref[b4]{[5]} has long been a vital and active area of research in wired networks, the unique features of Mobile Ad hoc Networks (MANETs) offer a new collection of nontrivial difficulties to security design. These difficulties comprise open network architecture, shared wireless medium, stringent resource constraints, and highly dynamic network topology. It is very tough to maintain security of MANETs in group communication as of multiple senders and multiple receivers.\par
Previous security research  {\ref [6] [7]} in routing protocol mainly focuses on the use of encryption technology to implement message authentication. These routing protocols rely entirely on a central authority. Moreover, the performance of on demand routing protocols is very less which leads to various attacks. Thus, none of these existing protocols specifies any effective security measures which leads to malicious routing operations.\par
The main objective of this paper is to discuss ad hoc routing security with respect to the area of security. Various routing protocols available in the literature are analyzed to provide better security to the routing in ad hoc networks. 
\section[{II. LITERATURE SURVEY}]{II. LITERATURE SURVEY}\par
There is no centralized administration or fixed network infrastructure for the ad hoc network and thus nodes execute routing discovery and routing maintenance in a self-organized way. But, this flexible network topology suffer from various security problems and the existing routing protocols such as AODV has no effective measures to avoid themselves from being attacked. There are various secure routing protocol techniques available in the literature to defend the ad hoc networks. However, majority of these secure routing protocols require certain centralized units or some trusted third parties to provide digital certificates or monitor network traffics, which demolish the selforganization nature of ad hoc networks. In this paper, Zhiyuan et al., \hyperref[b7]{[8]} propose a secure routing protocol based on the trust mechanism. Each node in this ad hoc network has its views about some other node's Then the node will determine whether to exchange routing data with another node based on its view about that node's reliability.\par
The growth and development of telecommunication has increased the need for mobility, wireless or mobile networks and this has given more attention to the wired networks. The upcoming networks has entirely different infrastructure and has various protocols and devices. The main aim of this approach is to assess the two secure routing protocols Ariadne and SAODV in the performance characteristics rather than security features under random way point and Manhattan grid mobility models. Naeem et al., \hyperref[b9]{[9]} used and implement the extension of AODV that is Secure Adhoc On-demand Distance Vector routing protocol (SAODV) and the extension of DSR that is Ariadne in the network simulator 2 (NS-2). In this paper, these protocols are compared with the quality of service parameters like delay, jitter, routing overhead, route acquisition time, throughput, hop count, packet delivery ratio using Manhattan grid and random waypoint mobility models. This paper mainly focuses on finding out the payload a node has to pay to assure the good quality of service.\par
Communications in MANETs are becoming more malicious in traffic analysis because of the broadcast nature of wireless transmissions. Even though, there are various secure routing protocols, traffic analysis attacks are still not well addressed with those existing techniques. Certainly, these protocols concentrate on security of route maintaining and protecting against modification of routing data, which cannot prevent traffic analysis attack. Anonymity is one of the most vital techniques to resistant against the malicious traffic analysis. In this paper, Sheklabadi et al., \hyperref[b10]{[10]} described an anonymous version of ARAN, which is one of the significant secure routing protocols, to offer anonymity and maintain security of nodes in MANETs. The proposed protocol is based on the integration of the anonymous communication along with security specifications of ARAN. The main contribution of this protocol is combining several anonymous functionalities such as identity privacy, location privacy and route anonymity together with security features of ARAN In order to secure the MANET in adversarial environments, it is necessary to possibly detect and defend possible attacks on routing protocols, especially internal attacks, such as a Byzantine attack. Ming Yu et al., \hyperref[b11]{[11]} proposed a novel technique that identifies internal attacks by using both message and route redundancy during route discovery. The route-discovery messages are secured by pairwise secret keys between a source and destination and some intermediate nodes along a route established by using public key cryptographic mechanisms. An optimal routing technique is also proposed with routing metric integrating both requirements on a node's reliability and performance. A node constructs the reliability on its neighboring node's depending on its observations on the behaviors of the neighbor nodes. These two techniques can be combine into existing routing protocols like Ad hoc On-demand Distance vector routing (AODV) and Dynamic Source Routing (DSR). The author presented an integrated protocol called Secure Routing against Collusion (SRAC), in which a node makes a routing decision depending on its trust of its neighboring nodes and the performance provided by them. The simulation results have shown the advantages of the proposed attack detection and routing algorithm over the existing technique.\par
MANETs has several kinds of security issues, caused by their nature of collaborative and open systems and by limited availability of resources. In this paper, Cerri et al., \hyperref[b12]{[12]} consider a Wi-Fi connectivity data link layer as a fundamental technique and concentrates on routing security. The author discusses the implementation of the secure AODV protocol extension, which comprises of alteration policies aimed at enhancing its performance. The author proposed an adaptive technique that adjusts SAODV behavior. Furthermore, the author examined the adaptive technique and another approach that delays the verification of digital signatures. This paper sums up the experimental results collected in the prototype design, implementation, and tuning.\par
MANETs are a set of wireless mobile devices with limited broadcast range and resources, and no fixed infrastructure. Communication is attained by communicating data along suitable routes that are vigorously identified and maintained through collaboration between the nodes. Determining such routes is a major job, both from efficiency and security points of view. Recently, a security model tailored to the particular needs of MANETs was introduced by Acs, Buttyan, and Vajda. The novel feature of this security system is that it assures security under concurrent executions. A novel route discovery technique called endairA was also proposed, along with a claimed security proof within the same system. In this paper, Burmester et al., \hyperref[b13]{[13]} described that the security proof for the route discovery algorithm endairA is faulty, and moreover, this approach is susceptible to a hidden channel attack. The author also examined the security framework that was used for route discovery and argued that composability is a vital feature for ever-present applications. Ultimately, some of the major security challenges for route discovery in MANETs are discussed.\par
Decentralized node admission is a vital and fundamental security service in MANETs. It is required to steadily cope with dynamic membership and topology in addition to bootstrap other considerable security primitives (such as key management) and services (such as secure routing) without the help of any centralized trusted authority. A perfect admission approach should have least interaction among MANET nodes, as connectivity can be unstable. Moreover, as MANETs are frequently consists of weak or resourcelimited devices, admission should be capable in terms of computation and communication. Majority of the existing admission protocols are prohibitively costly and need heavy interaction among MANET nodes. In this paper, Saxena et al., \hyperref[b14]{[14]} concentrates on a general type of MANET that is formed on a temporary basis, and present a secure, efficient, and a fully noninteractive admission technique geared for this type of a network. This admission protocol depends on secret sharing techniques using bivariate polynomials. The author also presents a novel approach that facilitates any pair of MANET nodes to proficiently create an on-the-fly secure communication channel.\par
Routing in ad hoc networks is different from infrastructure-based wireless networks. In ad hoc networks each node acts as a router and is accountable for organizing topological data and ensuring correct route learning. In spite of various secure routing algorithms, security in ad hoc networks is still a controversial area. In this paper, Afzal et al., \hyperref[b15]{[15]} first investigate the security issues and attacks in existing routing protocols and then the design and analysis of a new secure on-demand routing protocol, called RSRP is presented which appropriates the problems declared in the existing protocols. Furthermore, unlike Ariadne, RSRP uses a very proficient broadcast authentication technique which does not need any clock synchronization and assists instant authentication.\par
Routing in ad hoc network is one of the fundamental issues in networking. An opponent can easily hack the information in the network by attacking the routing protocol. There are several techniques available for the security enhancement of ad hoc network. In this paper, Imani et al., \hyperref[b18]{[16]} argued about the defects in an ad hoc routing protocol that called Ariadne. This paper demonstrates that the security evidence for the route discovery technique Ariadne is defective, and furthermore, this algorithm is susceptible to certain attacks. In order to solve the limitations of this protocol, a novel proposed approach is presented in the route discovery algorithm. The proposed approach in this paper adds the capability of the malevolent node detections to this protocol.\par
Multipath routing diminishes the penalty of security attacks obtaining from collaborating malevolent nodes in MANET, by increasing the number of nodes that an opponent must negotiate in order to take control of the communication. In this paper, various attacks that cause multipath routing protocols more susceptible to attacks than it is expected, to collaborating malevolent nodes are recognized. Kotzanikolaou et al., \hyperref[b19]{[17]} proposed a novel On-demand Multipath routing protocol called the Secure Multipath Routing protocol (SecMR) and the author examine its security properties. The SecMR protocol can be easily combined in an extensive variety of on-demand routing protocols, such as DSR and AODV.\par
Hu et al., \hyperref[b20]{[18]} propose a more forceful protocol, which is more powerful in terms of security associations. In this approach, it is assumed that security associations are present between all pairs of nodes (through authentic public or Tesla [19] keys, or by shared secret keys). This facilitates both the sender and the receiver to validate all the nodes on the selected routing path.\par
Papadimitratos et al., \hyperref[b21]{[20]} assumed that, for effective secure routing, it is enough, if effective security association is established between the sender and the receiver. It is demonstrated that the author's proposal avoids a wide range of attacks, but the proposed protocol is still susceptible to certain active attacks \hyperref[b22]{[21]}. The author proposed a protocol (SRP) that can be effectively applied to a wide variety of existing routing protocols. This protocol focuses on the security association between source and destination nodes. Intermediate nodes need not require cryptographic validation of the control traffic. It adds an SRP header to the base routing protocol (DSR or AODV) request packet. SRP header has three vital fields namely QSEQ, QID and SRP MAC. QSEQ facilitates to avoid replay of old outdated requests. QID and random number help to prevent fabrication of requests, and SRP MAC guarantees reliability of the packets in communication. In SRP, for every route discovery, it is necessary that the source and destination must have a security association between them. Moreover, this approach does not focus on the route error messages. Hence, they are not protected, and any malevolent node can just counterfeit error messages with other nodes as source.\par
ARIADNE \hyperref[b23]{[22]} is based on DSR \hyperref[b24]{[23]} and TESLA (on which its authentication approach is based). ARIADNE prevents attackers/compromised nodes from troublemaking uncompromised routes that consist of benign nodes. It employs highly effective symmetric key cryptography technique. ARIADNE does not offer effective security against passive attackers eavesdropping on the network traffic. It does not provide security from an attacker from inserting data packets. It is susceptible to active-1-1 attacker that lies along the identified route, which does not forward packets and does not cause error if it meets a broken link. It also needs clock synchronization, which is regarded as an unrealistic necessity for ad hoc networks.\par
Perlman proposed a link state routing protocol \hyperref[b25]{[24]} that attains Byzantine strength. Though, the protocol is extremely forceful, it needs a very high operating cost associated with public key encryption. Zhou and Haas \hyperref[b26]{[25]} chiefly describe key management in their paper to provide security to ad hoc networks. The author devotes a part to secure routing, but in essence concludes that "nodes can defend routing data in the similar way they protect data traffic". They also examine that denial-of-service attacks against routing will be considered as damage and it is routed around. Certain research has been done to secure ad hoc networks by means of misbehavior detection approaches. This technique has two major problems: Initially, it is fairly likely that it will be not possible to discover various kinds of misbehaving; and secondly, it has no real means to assure the integrity and authentication of the routing messages.\par
Dahill et al. [26] proposed ARAN. Managed open environment is considered in this approach, where there is an opportunity for pre-deployment of infrastructure. It consists of two distinctive stages. The first stage is the certification and end-to-end authentication stage. Here the source obtains a certificate from the trusted certification server, and then by means of this certificate, signs the request packet. Each intermediate node consecutively signs the request with its certificate. The destination then validates each of the certificates, hence the source and the intermediate nodes gets authenticated. The destination node then sends the reply through the route reverse to the one in the request; reply signed with the help of the certificate of the destination. The second stage is a noncompulsory stage which is used to identify the shortest path to the destination, but this stage is very costly. It is susceptible to reply attacks using error messages but for the nodes have time synchronization. 
\section[{III. PROBLEMS AND DIRECTIONS}]{III. PROBLEMS AND DIRECTIONS}\par
The lack of infrastructure and organizational setting of mobile ad-hoc networks creates unique chances to attackers. MANETs are generally organized without a central control unit; the devices in a MANET depend on other units to route data to their destinations. Moreover, MANET nodes are frequently constrained in power and this makes MANETs susceptible to several malevolent attacks and usage of the routing approaches that work with wired networks is infeasible.\par
It is the fact that secure ad hoc routing can be achieved at the expense of messages, time and computation power, and that the overhead stems mainly from the computation complexity of the cryptographic techniques employed in frequently repeated routing procedures.\par
The major factors that should be considered in the establishment of sufficient routing protocols are multi hop, mobility, large network size combined with device heterogeneity, bandwidth and battery power. In order to solve the challenging problem of routing in ad hoc wireless networks, a novel technique is needed. The field of artificial intelligence can provide significant solution to the security problems in routing. Specifically, techniques from Swarm Intelligence (SI) and many Optimization techniques can be taken into account. 
\section[{IV. CONCLUSION}]{IV. CONCLUSION}\par
To establish a secure MANET routing protocol with multiple metrics is a challenging task, particularly as the network topology and traffic are dynamic and changing all the time. This chapter focuses on the routing protocols in the ad hoc networks. In this paper, the routing algorithms that support communications in mobile ad hoc networks are discussed. The majority of the existing routing protocols suffer from various drawbacks and efficient security is not given to the MANET. This survey on the secure routing protocols is very much useful for the enhancement of the other routing protocol techniques. These routing protocols are the source for the development of new routing protocols with better security and performance.\begin{figure}[htbp]
\noindent\textbf{2011}\includegraphics[]{image-2.png}
\caption{\label{fig_0}A © 2011}\end{figure}
 			\footnote{© 2011 Global Journals Inc. (US)} 			\footnote{© 2011 Global Journals Inc. (US) Global Journal of Computer Science and Technology Volume XI Issue XVI Version I} 			\footnote{SeptemberA Study on Enhancement of the Security of the Routing Protocols in Adhoc Networks} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Liu]{b7}\label{b7} 	 		\textit{},  		 			Zhiyuan Liu 		.  		 	 
\bibitem[Afzal et al.]{b15}\label{b15} 	 		\textit{},  		 			S R Afzal 		,  		 			S Biswas 		,  		 			Jong-Bin Koh 		.  		 	 
\bibitem[Raza and Gunhee Lee]{b16}\label{b16} 	 		\textit{},  		 			T Raza 		,  		 			Gunhee Lee 		.  		 	 
\bibitem[ Global Journals Inc. (US) ()]{b27}\label{b27} 	 		\textit{},  	 	 		\textit{Global Journals Inc. (US)}  		2011.  	 
\bibitem[Imani et al. ()]{b18}\label{b18} 	 		‘A secure method on a routing protocol for ad hoc networks’.  		 			M Imani 		,  		 			M Taheri 		,  		 			M E Rajabi 		,  		 			M Naderi 		.  	 	 		\textit{2010 International Conference on Educational and Network Technology (ICENT)},  				2010. p. .  	 
\bibitem[Su ()]{b11}\label{b11} 	 		‘A Secure Routing Protocol against Byzantine Attacks for MANETs in Adversarial Environments’.  		 			Ming Yu Mengchu Zhou Wei Su 		.  	 	 		\textit{IEEE Transactions on Vehicular Technology}  		2009. 58  (1)  p. .  	 
\bibitem[Sanzgiri et al. ()]{b4}\label{b4} 	 		‘A secure routing protocol for ad hoc networks’.  		 			K Sanzgiri 		,  		 			B Dahill 		,  		 			B Levine 		,  		 			E Belding-Royer 		.  	 	 		\textit{Proceedings of IEEE ICNP},  				 (IEEE ICNP)  		2002.  	 
\bibitem[Dahill et al. ()]{b30}\label{b30} 	 		\textit{A secure routing protocol for ad-hoc networks},  		 			B Dahill 		,  		 			B N Levine 		,  		 			E Royer 		,  		 			C Shields 		.  		 UM-CS-2001-037.  		2001.  		 			Department of Computer Science, University of Massachusetts 		 	 	 (Technical Report) 
\bibitem[Abusalah et al. ()]{b2}\label{b2} 	 		‘A Survey of Secure Mobile Ad Hoc Routing Protocols’.  		 			L Abusalah 		,  		 			A Khokhar 		,  		 			M Guizani 		.  	 	 		\textit{IEEE Communications Surveys \& Tutorials}  		2009. 10  (4)  p. .  	 
\bibitem[Sheklabadi and Berenjkoub ()]{b10}\label{b10} 	 		‘An anonymous secure routing protocol for mobile ad hoc networks’.  		 			E Sheklabadi 		,  		 			Berenjkoub 		.  	 	 		\textit{2011 International Symposium on Computer Networks and Distributed Systems (CNDS)},  				2011. p. .  	 
\bibitem[Hu et al. (2002)]{b20}\label{b20} 	 		‘Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks’.  		 			Y.-C Hu 		,  		 			A Perrig 		,  		 			D B Johnson 		.  	 	 		\textit{Proceedings of MobiCom},  				 (MobiCom)  		September 2002.  	 
\bibitem[Hu et al. ()]{b23}\label{b23} 	 		\textit{ARIADNE: A secure on-demand routing protocol for ad-hoc networks},  		 			Y C Hu 		,  		 			A Perrig 		,  		 			D Johnson 		.  		 TR01-383.  		2001.  		 			Rice University 		 	 	 (Technical Report) 
\bibitem[Canetti et al. ()]{b29}\label{b29} 	 		 			R Canetti 		,  		 			J D Tygar 		,  		 			D Song 		.  	 	 		\textit{September A Study on Enhancement of the Security of the Routing Protocols in Adhoc Networks 19. A. Perrig},  				2002. 5.  	 
\bibitem[Saxena et al. ()]{b14}\label{b14} 	 		‘Efficient Node Admission and Certificateless Secure Communication in Short-Lived MANETs’.  		 			N Saxena 		,  		 			G Tsudik 		,  		 			Yi Jeong Hyun 		.  	 	 		\textit{IEEE Transactions on Parallel and Distributed Systems}  		2009. 20  (2)  p. .  	 
\bibitem[Perlman ()]{b25}\label{b25} 	 		‘Fault-tolerant broadcast of routing information’.  		 			R Perlman 		.  	 	 		\textit{Computer Networks}  		1983. 7 p. .  	 
\bibitem[Global Journal of Computer Science and Technology Volume XI Issue XVI Version I]{b28}\label{b28} 	 		\textit{Global Journal of Computer Science and Technology Volume XI Issue XVI Version I},  		39 p. 2011.  	 
\bibitem[Burmester and De Medeiros ()]{b13}\label{b13} 	 		‘On the Security of Route Discovery in MANETs’.  		 			M Burmester 		,  		 			B De Medeiros 		.  	 	 		\textit{IEEE Transactions on Mobile Computing}  		2009. 8  (9)  p. .  	 
\bibitem[Hu et al. (2003)]{b22}\label{b22} 	 		‘Packet leashes: A defense against wormhole attacks in wireless networks’.  		 			Yih-Chun Hu 		,  		 			Adrian Perrig 		,  		 			David B Johnson 		.  	 	 		\textit{Proceedings of IEEE Infocom},  				 (IEEE Infocom)  		April 2003.  	 
\bibitem[Naeem et al. ()]{b9}\label{b9} 	 		‘QOS based performance evaluation of secure on-Demand routing protocols for MANET's’.  		 			M Naeem 		,  		 			Z Ahmed 		,  		 			R Mahmood 		,  		 			M A Azad 		.  	 	 		\textit{International Conference on Wireless Communication and Sensor Computing},  				2010. p. .  	 	 (ICWCSC 2010) 
\bibitem[Ismail ()]{b0}\label{b0} 	 		‘Routing Protocols for Ad Hoc Wireless Networks’.  		 			M Ismail 		.  	 	 		\textit{M. Sc. (ISS) project}  		2001.  		 			Carleton University 		 	 
\bibitem[Keng et al. ()]{b3}\label{b3} 	 		‘Routing security and data confidentiality for mobile ad hoc networks’.  		 			Seng Keng 		,  		 			Ng 		,  		 			W K G Seah 		.  	 	 		\textit{The 57th IEEE Semiannual Vehicular Technology Conference},  				2003.  	 
\bibitem[Deng and Li ()]{b5}\label{b5} 	 		‘Routing Security in Wireless Ad Hoc Networks’.  		 			H Deng 		,  		 			W Li 		,  		 			D 		.  	 	 		\textit{IEEE Comm. Magazine}  		2002. 40  (10)  p. .  	 
\bibitem[Kim ()]{b17}\label{b17} 	 		‘RSRP: A Robust Secure Routing Protocol for Mobile Ad Hoc Networks’.  		 			Dong-Kyoo Kim 		.  	 	 		\textit{IEEE Wireless Communications and Networking Conference},  				2008. 2008. p. .  	 	 (page(s) 
\bibitem[Kotzanikolaou et al. ()]{b19}\label{b19} 	 		‘Secure Multipath Routing for Mobile Ad Hoc Networks’.  		 			P Kotzanikolaou 		,  		 			R Mavropodi 		,  		 			C Douligeris 		.  	 	 		\textit{WONS 2005. Second Annual Conference on Wireless On-demand Network Systems and Services},  				 (Page(s)  		2005. p. .  	 
\bibitem[Papadimitratos and Haas (2002)]{b21}\label{b21} 	 		‘Secure Routing for Mobile Ad Hoc Networks’.  		 			P Papadimitratos 		,  		 			Z J Haas 		.  	 	 		\textit{Proceedings of CNDS},  				 (CNDS)  		January 2002.  	 
\bibitem[Lu and Yan ()]{b8}\label{b8} 	 		‘Secure Routing Protocol based Trust for Ad Hoc Networks’.  		 			Shejie Lu 		,  		 			; Jun Yan 		.  	 	 		\textit{Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing},  				 (Page(s)  		2007. 1 p. .  	 
\bibitem[Zapata and Asokan (2002)]{b1}\label{b1} 	 		‘Securing Ad hoc Routing Protocols’.  		 			M 		,  		 			Guerrero Zapata 		,  		 			N Asokan 		.  	 	 		\textit{Proceedings of the 1st ACM workshop on Wireless security},  				 (the 1st ACM workshop on Wireless securityAtlanta, GA, USA)  		Sep 2002. p. .  	 
\bibitem[Zhou and Haas ()]{b26}\label{b26} 	 		‘Securing ad-hoc networks’.  		 			L Zhou 		,  		 			Z J Haas 		.  	 	 		\textit{IEEE Network Mag}  		1999. 13 p. .  	 
\bibitem[Cerri and Ghioni ()]{b12}\label{b12} 	 		‘Securing AODV: the A-SAODV secure routing prototype’.  		 			D Cerri 		,  		 			A Ghioni 		.  	 	 		\textit{IEEE Communications Magazine}  		2008. 46  (2)  p. .  	 
\bibitem[Venkatraman ()]{b6}\label{b6} 	 		‘Strategies for enhancing routing security in protocols for mobile ad hoc networks’.  		 			L Venkatraman 		,  		 			DP 		.  	 	 		\textit{J. Parallel Distrib. Comp}  		2002.  	 
\bibitem[Johnson ()]{b24}\label{b24} 	 		\textit{The dynamic source routing protocol for mobile ad-hoc networks (DSR)},  		 			D B Johnson 		.  		2002.  		 			MANET Working Group 		 	 	 (Internet draft) 
\end{bibitemlist}
 			 		 	 
\end{document}
