\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={Replication in Mobile Ad-hoc Network using Hopfield Network},
 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{2013-01-15 (revised: 15 January 2013)}
\def\TheID{\makeatother }
\def\TheDate{2013-01-15}
\title{Replication in Mobile Ad-hoc Network using Hopfield Network}
\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]{Tanu  Chawla}

             \affil[1]{  }

\renewcommand\Authands{ and }

\date{\small \em Received: 9 December 2012 Accepted: 31 December 2012 Published: 15 January 2013}

\maketitle


\begin{abstract}
        


Mobile Ad hoc Network (MANET) is a network comprises of mobile nodes connected without any centralized administration. Each node in the network has the ability to share a large number of objects with other nodes. The nodes are connected with other nodes to forward a message to other nodes until the search for node that desire meets. This paper represents a new replication method to recover the performance in distributed system. Objects are replicated on different nodes in the network to minimize the search for an object. It is observed that mobility of nodes predicted using SOM (Self Organizing Maps) technique provides less accuracy. This paper represents an algorithm that uses the network parameters as input condition to replicate objects into the nodes. The decision for each node will be taken by gathering the input conditions and feed to the Hopfield Neural Network. It is view that it will provide more accuracy and improve the performance.

\end{abstract}


\keywords{hop field network, mobile ad hoc networks, neural networks, replication, routing, routing protocols.}

\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
ue to increase in the demand of the computers in our daily life, it increases the demand of connectivity. Through connectivity of various nodes in the network, these nodes in the network can easily share their data or objects. Wired network have been used for a long time. Due to some restrictions of wired network, requirement for the wireless network has been increased for sending messages, emails and communicate with other. So Mobile Ad-hoc Network (MANET) have been developed which comprises of a large number of nodes. In mobile ad-hoc network, nodes can communicates with the other nodes without any need of central administration or base station \hyperref[b1]{[2]}. MANET is commonly used for all purpose like offices for doing work and colleges for maintain details.\par
Authors ? e-mails: tanuchawla15@rediffmail.com, drmukeshji@gmail.com So today demand for the ad-hoc network enhances. Mobile Ad-hoc Network is an autonomous system of mobile routers which are connected with the wireless links and easily communicate with each other. Each node has the ability to move freely in the network at any place. In Mobile ad-hoc network, each node communicates with its neighbours by forward a query message and establishes the communication between them \hyperref[b2]{[3]}.\par
This shows that every node acts as a host as well as a router \hyperref[b3]{[4]}. Such a network may be used for the large number of nodes. So this network is a multi-hoped communication network. In this network, the routing protocols are used to transmit the data between the nodes in the network. MANET is used in many applications such as military services, healthcare \hyperref[b0]{[1]}. Inside the wired network, when one node goes outside from the network, then it disturbs the whole network and the problem will not easily solved. So these days, people prefers to wireless network scalability, fault-tolerance and accessibility of data services \hyperref[b5]{[6]}. It is a technique stored on the multiple locations which reduce the search size. To be most useful, data replication should be invisible to the user. The main improvement of using replication is that if you change only single copy of the data that presents in one node then data available on other nodes changes automatically. This solves a large number of problems. So replication is commonly used. Maintaining various copies of data is one of the most successful ways to stay away from database availability problems. After failure produced in one database, then you have the ability to use another local copy of the database or you can also competent of use the copy of the database that are present on other site. In networking, replication is well thought-out as a most important method to extend reliability \hyperref[b6]{[7]}.III. 
\section[{Overview on Artificial Neural Network}]{Overview on Artificial Neural Network}\par
Artificial Neural Network (ANN) is a computing system consists of a large number of processing elements which are used to take inputs and then processing takes place and then gives response to the inputs \hyperref[b7]{[8]}. A large Neural Network consists of a large number of processing elements \hyperref[b8]{[9]}.\par
Neural network is made up of a number of layers. Layers are prepared by a number of interconnected nodes which include an activation function. Patterns are represented in the network as the input layer, which has links to one or more 'hidden layers' and input layer communicates with middle layer known as hidden layer. In the hidden layer, processing is done through a number of weighted connections. The hidden layer directly linked to an output layer which has the capability to gives response to all the inputs \hyperref[b9]{[10]}.\par
IV. 
\section[{Role of Replication in Manet}]{Role of Replication in Manet}\par
Replication is one of the most important techniques is most commonly used in MANET which allow the nodes to come apart the objects between them. The objective of this technique is to care for a number of object replicas in excess of the time before a node exits in decentralized and amorphous environment \hyperref[b10]{[11]}. That is the reason that shows the need to replicate objects on the number of nodes that are linked to one another in the network, which is necessary \hyperref[b12]{[13]}. V. 
\section[{Related Work}]{Related Work}\par
We observe a large number of replication techniques that are most commonly used. Some of them are: reactive and proactive replication. Reactive replication is the generally used algorithm. In reactive replication, the requesting node has the copy of the object from the source node. After completion of the search, a copy of object is produced into the node where the query was generated. In this type of replication overhead is higher. But the main advantage of using this technique is that it minimizes the storage for replicas, so it provides better results. The only problem with this replication method is more overhead.\par
In proactive replication, the object is replicated from the node that is requested to the node that is provided only in the selected nodes. Sometimes it is copied along the complete path of the successful query from source node to requested node. It is called as the path replication. After the completion of the query, replication of object is takes place in the complete path from source node to node that are requested \hyperref[b12]{[13]}. Beyond that a new third type of replication algorithm is developed known as "random replication". In random replication, beyond the enquiry is completed, the objects are copied randomly in selective nodes along the path from the requester to the requested node. 
\section[{VI.}]{VI.} 
\section[{Problem Overview}]{Problem Overview}\par
A network consists of a large number of nodes. Each node in the network has the ability to share their objects with other nodes \hyperref[b0]{[1]}. By using one of the different kinds of search techniques, the location of the data is retrieved. A query for the certain object is initiated to perform the search among nodes. These nodes are linked with one another forward a request message from one node to another node until a search for a certain object is completed. The queries were processed on each node from source node to requested node. The message passes to the various nodes through connection between them until the node that is requested is determined. The nodes which are used to forward a message from source node to request node is known as the path. The shorter path length has more performance than a longer path.\par
Replication method is the one of the method to get a good performance in a search on a distributed system \hyperref[b12]{[13]}. This paper also calculates the predictability of the nodes. The main benefit of mobility prediction is to assign next access point before the mobile terminal leaves its current one which reduces the intrusion time in communication between terminal mobiles. Prediction is implemented using SOM (Self Organizing Maps) technique \hyperref[b12]{[13]}. But that offers less accuracy. This paper implements new prediction technique which is Hopfield Neural Network technique used in MANET that will offer high accuracy and provide high performance. 
\section[{VII.}]{VII.} 
\section[{Proposed Algorithm}]{Proposed Algorithm}\par
This algorithm is used to replicate the objects randomly on the nodes after the successful search to reduce our search and time and improve the performance of the system. This algorithm depends upon the theory of finding the conditions of the nodes that are moves out of network. According to this scheme, when a request for a certain object is created, and previously it is to be found then this algorithm is used to randomly replicate the objects along the path from source node to the node that is requested. The proposed algorithm uses the hops as an input condition to make the decision for replicate objects into the nodes. The decision made by gathering the input parameters of each node and feed this input parameters into the Hopfield Network technique.\par
The various steps of the proposed algorithm are as follows: 1. Firstly, a set of input parameters such as packet ratio, energy and E2E delay are gathered as inputs. 2. Then the algorithm has to choose the nodes that are needed to replicate. 3. Then it checks the state of the node using Hopfield Network algorithm. 4. The output "0" is for nodes about to leave the network and "1" for those who have enough time to stay in the network. 5. Once a nodes category is specified, the copy of the requested object is placed for those nodes whose category is set to "1". 6. On the other hand, those nodes which contains the "0" category, the replication scheme ignores the replication of object on that node. 7. Then the category for the next node to be evaluated. 8. The method keeps on going until the requesting node in the random replication is reached.\par
data is trained using the supervised learning. So it gives better performance than using SOM Algorithm. Flow Chart of the proposed algorithm is No Yes Yes No A set of input parameters are fed into Hopfield algorithm as input for each node to classify the input data into the groups. Only two categories of output are produced by Hopfield network for making decisions for the nodes. These are either "0" or "1". The number "0" indicates the nodes about to leave the network and "1" for those who are not going out from the network. When the search for all the data completed, then the random replication is used to replicate the objects randomly from the source node to requested node. It firstly checks the category of each node along the path by using the Hopfield algorithm. After the category for each node is explained, then replication scheme randomly copy the requested object for those nodes whose category is set to "1". On the other hand, the nodes which contain the "0" category, the replication scheme will not produce the replication of object for that node and check the category for the next node.  
\section[{Hopfield Network}]{Hopfield Network}\par
Hopfield Network is a neural recurrent network which is used to classify input data into groups. The  The inputs parameters for the nodes are distance energy and round trip time (RTT) and output contains only two values 0 or 1. This process is used for each node until the node that is requested is reached. 
\section[{a) Distance}]{a) Distance}\par
In the Mobile Ad-hoc Network, each node must be able to send a message to another node and able to establish the communication between them. Each node in the network sends the message to a node that it is linked is called initial node. The distance between two nodes is intended by using the simple equation which is expressed as:D= ?[???(??) ? ??(?? + 1)? 2 + ???(??) ? ??(?? + 1)? 2 ]\par
Here D shows the distance between two nodes and i shows the initial node from which we want to calculate the distance and sqrt is a square root function which is used to calculate the square root of given value. Each node in the network wants to communicate with the neighbouring nodes. Each node contains some energy. When the nodes communicate with neighbouring nodes, they consume some energy. Here energy factor is used to calculate the energy which is consumed when the nodes communicates with another nodes. 
\section[{IX.}]{IX.} 
\section[{Results}]{Results}\par
The performance evaluation of SOM and Hopfield Network was carried out using NS-2.34. For the experiments performed, a variable-size network of size 300 sq m was randomly generated with number of nodes typically in the range of 10-100. The power of the sensor radio transmitter was set so that any node within a 20 meter radius is within communication range and is called a neighbour of the sensor. Hopfield network provides better result than SOM Network.   It shows the packet delivery ratio and E2E Delay generated by SOM Algorithm using 100 nodes and compares it with the packet delivery ratio and E2E Delay generated by Hopfield Algorithm.\par
It shows the Generated and Received Packets by SOM Algorithm using 100 nodes and compares it with the Generated and Received Packets by Hopfield Algorithm.\par
X. 
\section[{Conclusion and Future work}]{Conclusion and Future work}\par
This paper has proposed a scheme that is used for replicating objects on various nodes in a shapeless, self-configuring and self-motivated network, which randomly replicate the objects by determining the states of the node. If the status of the node is 1, which means that object is replicated for that node and status 0 indicates that object is not replicated for that node. For this, we proposed a new algorithm. The proposed algorithm tries to increase the accuracy and enhance the performance in MANET. As a result, data will be available at more nodes and it will be accessible vastly. Due to this, it will improve the performance of the network and provides more accuracy. \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{21}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 2 :Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Figure 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{fig_3}©}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-6.png}
\caption{\label{fig_4}©}\end{figure}
      \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.060322580645161286\textwidth}P{0.7348387096774194\textwidth}P{0.05483870967741935\textwidth}}
Energy\tabcellsep Packet Ratio\tabcellsep End to End\\
\tabcellsep Input parameters\tabcellsep \\
\tabcellsep Choose Nodes to Replicate\tabcellsep \\
\tabcellsep Check Node State Using\tabcellsep \\
\tabcellsep Hopfield Algorithm\tabcellsep \\
\tabcellsep Is Leaving?\tabcellsep \\
\tabcellsep Replicate Object\tabcellsep \\
\tabcellsep More Nodes?\tabcellsep \\
\tabcellsep End\tabcellsep \\
VIII.\tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.40375\textwidth}P{0.24083333333333332\textwidth}P{0.20541666666666666\textwidth}}
100 Nodes in a\tabcellsep Packet\tabcellsep End to End\\
Network\tabcellsep Delivery Ratio\tabcellsep Delay\\
Existing Algorithm\tabcellsep 98.8202\tabcellsep 474.827\\
Proposed Algorithm\tabcellsep 99.1743\tabcellsep 362.867\end{longtable} \par
 
\caption{\label{tab_1}Table 1 For}\end{figure}
 			\footnote{Replication in Mobile Ad-hoc Network Using Hopfield Network} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Park and Corson ()]{b24}\label{b24} 	 		‘A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks’.  		 			V D Park 		,  		 			M S Corson 		.  	 	 		\textit{IEEE INFOCOM'97},  				1997.  	 
\bibitem[Broch et al. (1998)]{b21}\label{b21} 	 		‘A Performance Comparison of Multi-Hop Wireless Ad Hoc network Routing Protocols’.  		 			J Broch 		,  		 			D A Maltz 		,  		 			D B Johnson 		,  		 			Y Hu 		,  		 			J Jetcheva 		.  	 	 		\textit{Proc. of MobiCom'98},  				 (of MobiCom'98)  		Oct. 1998.  	 
\bibitem[Royer and Toh (1999)]{b23}\label{b23} 	 		\textit{A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks},  		 			E R Royer 		,  		 			C.-K Toh 		.  		Apr. 1999. IEEE Personal Communications.  	 
\bibitem[Pushpalatha et al. (2009)]{b13}\label{b13} 	 		‘An Approach to Design an Efficient Data Replication Algorithm in Mobile Ad hoc Networks’.  		 			M Pushpalatha 		,  		 			Revathi Venkatraman 		,  		 			T Ramarao 		.  	 	 		\textit{International Journal of Recent Trends in Engineering}  		May 2009. 1  (2) .  	 
\bibitem[Bisdikian (2001)]{b20}\label{b20} 	 		\textit{An overview of the Bluetooth wireless technology},  		 			C Bisdikian 		.  		December 2001. IEEE Communication Magazine.  	 
\bibitem[Ani1 et al. (1996)]{b7}\label{b7} 	 		\textit{Artificial Neural Network},  		 			K Ani1 		,  		 			Jianchang Jain 		,  		 			K M Mao 		,  		 			Mohiuddinn 		.  		March 1996.  	 	 (published in IEEE) 
\bibitem[Mukilan and Wahi (2012)]{b2}\label{b2} 	 		‘CDRA: Consistency based Data Replication Algorithm of MANET’.  		 			P Mukilan 		,  		 			A Wahi 		.  	 	 		\textit{International Journal of Computer Applications}  		August 2012. 51  (14)  p. .  	 
\bibitem[Sinha et al.]{b22}\label{b22} 	 		‘CEDAR: a Core-Extraction Distributed Ad hoc Routing algorithm’.  		 			P Sinha 		,  		 			R Sivakumar 		,  		 			V Bharghavan 		.  	 	 		\textit{IEEE INFOCOM'99},  				 	 
\bibitem[Frank-Florian Steege and Groß ()]{b10}\label{b10} 	 		‘Comparison of Long-Term Adaptively for Neural Networks’.  		 			Horst-Michael Frank-Florian Steege 		,  		 			Groß 		.  	 	 		\textit{Published in International Conference on Artificial Neural Networks},  				2012.  	 
\bibitem[Vorgelegt Von et al. ()]{b11}\label{b11} 	 		\textit{Consistent Data Replication in Mobile Ad Hoc Networks},  		 			Jorg Vorgelegt Von 		,  		 			Aus Hahner 		,  		 			Dusseldorf 		.  		2007.  	 	 (Published in IPVS) 
\bibitem[Patil et al. ()]{b15}\label{b15} 	 		‘Cross layer AODV with position based forwarding routing for mobile ad-hoc network’.  		 			R Patil 		,  		 			A Damodaram 		,  		 			R Das 		.  	 	 		\textit{Proc. of the 5th IEEE Conference on Wireless Communication and Sensor Networks},  				 (of the 5th IEEE Conference on Wireless Communication and Sensor Networks)  		2009.  	 
\bibitem[Christian (2010)]{b5}\label{b5} 	 		‘Database Replication’.  		 			Marius Christian 		,  		 			Mazilu 		.  	 	 		\textit{Database Systems Journal}  		Feb 2010. I.  	 
\bibitem[Wiesmann et al. ()]{b6}\label{b6} 	 		\textit{Database Replication Techniques: a Three Parameter Classification},  		 			Matthias Wiesmann 		,  		 			Fernando Pedone 		,  		 			Andre Schiper 		,  		 			Bettina Kemme 		,  		 			Gustav Alonso 		.  		2010.  	 	 (Research supported by EPFL-ETHZ DRAGON project) 
\bibitem[Dr. Robert Hecht-Nielsen: A Basic Introduction to Neural Network ()]{b4}\label{b4} 	 		\textit{Dr. Robert Hecht-Nielsen: A Basic Introduction to Neural Network},  		 \url{http://networkintroduction.com}  		1989.  	 
\bibitem[Lee and Gerla ()]{b16}\label{b16} 	 		‘Dynamic load-aware routing in ad hoc networks’.  		 			S.-J Lee 		,  		 			M Gerla 		.  	 	 		\textit{Proc. of IEEE International Conference on Communications},  				 (of IEEE International Conference on Communications)  		2001. p. .  	 
\bibitem[Larochelle et al. (2009)]{b8}\label{b8} 	 		‘Exploring Strategies for Training Deep Neural Networks’.  		 			Hugo Larochelle 		,  		 			Yoshua Bengio 		,  		 			Jerome Louradour 		,  		 			Pascal Lamblin 		.  	 	 		\textit{Journal of Machine Learning Research}  		Jan 2009.  	 
\bibitem[Uddin et al. (2012)]{b18}\label{b18} 	 		‘Improving Performance of Mobile Ad Hoc Networks Using Efficient Tactical on Demand Distance Vector (TAODV) Routing Algorithm’.  		 			Mueen Uddin 		,  		 			Azizah Abdul Rahman 		,  		 			Abdulrahman Alarifi 		,  		 			Muhammad Talha 		,  		 			Asadullah Shah 		.  	 	 		\textit{International Journal of Innovative Computing, Information and Control}  		June 2012. 8  (6) .  	 	 (Mohsin Iftikhar and Albert Zomaya) 
\bibitem[Ghosekar et al. ()]{b19}\label{b19} 	 		‘Mobile Ad Hoc Networking: Imperatives and Challenges’.  		 			Pravin Ghosekar 		,  		 			Girish Katkar 		,  		 			Dr Pradip Ghorpade 		.  	 	 		\textit{IJCA Special Issue on Mobile Ad-hoc Network}  		2010.  	 
\bibitem[Kaaniche and Kamoun (2010)]{b3}\label{b3} 	 		‘Mobility Prediction in Wireless Ad Hoc Networks using Neural Networks’.  		 			Heni Kaaniche 		,  		 			Farouk Kamoun 		.  	 	 		\textit{Journal of Telecommunications}  		April 2010. 2.  	 
\bibitem[Baladron et al. (2012)]{b9}\label{b9} 	 		\textit{Performance Study of the Application of Artificial Neural Networks to the Completion and Prediction of Data Retrieved by Underwater Sensors},  		 			Carlos Baladron 		,  		 			Javier M Aguiar 		,  		 			Lorena Calavia 		,  		 			Belén Carro 		,  		 			Antonio Sanchez-Esguevillas 		,  		 			Luis Hernandez 		.  		Jan 2012.  	 	 (Published in ISSN 1424-8220) 
\bibitem[Rashmi: Mobile Ad-hoc Network ()]{b1}\label{b1} 	 		\textit{Rashmi: Mobile Ad-hoc Network},  		 \url{http://MobileAdhocNetwork.htm}  		2008.  	 
\bibitem[Geofrey Cantara Soriano and Urano ()]{b12}\label{b12} 	 		\textit{Replication with State Using the Self-Organizing Map Neural Network},  		 			Yoshiyori Geofrey Cantara Soriano 		,  		 			Urano 		.  		2011.  	 	 (published in ICACT) 
\bibitem[Liu et al. ()]{b0}\label{b0} 	 		\textit{Security of Message in Multi-Path Ad Hoc Networks Using a Neural Network-Based Cipher},  		 			Che-Yu Liu 		,  		 			Isaac Woungang 		,  		 			Han-Chief Chao 		,  		 			Sanjay K Dhurandher 		,  		 			Ting-Yun 		,  		 			Mohammad S Chi 		,  		 			Obaidat 		.  		2011.  	 
\bibitem[Das et al. ()]{b14}\label{b14} 	 		\textit{Simulationbased performance evaluation of routing protocols for mobile ad hoc networks},  		 			S R Das 		,  		 			R Castaneda 		,  		 			J Yan 		.  		2000. Mobile Networks and Applications. 5 p. .  	 
\bibitem[The NS Manual Formerly NS Document ()]{b17}\label{b17} 	 		 \url{http://www.isi.edu/nsnam/ns/ns-documentation.html}  		\textit{The NS Manual Formerly NS Document},  				2005.  		 			VINT Project 		 	 
\end{bibitemlist}
 			 		 	 
\end{document}
