\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={Sree Vidyanikethan Engineering College, India Dual-Region Reputation based Resource Management in Mobile Ad Hoc Networks DualRegionReputationbasedResourceManagementinMobileAdHocNetworks},
 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{2015-03-15 (revised: 15 March 2015)}
\def\TheID{\makeatother }
\def\TheDate{2015-03-15}
\title{Sree Vidyanikethan Engineering College, India Dual-Region Reputation based Resource Management in Mobile Ad Hoc Networks DualRegionReputationbasedResourceManagementinMobileAdHocNetworks}
\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]{  K.Surendra}

             \author[2]{K.Delhi  Babu}

             \affil[1]{  sree vidyanikethan engineering college}

\renewcommand\Authands{ and }

\date{\small \em Received: 8 February 2015 Accepted: 4 March 2015 Published: 15 March 2015}

\maketitle


\begin{abstract}
        


A mobile ad hoc network (MANET) is a kind of wireless ad hoc network. It is a selfconfiguring network of mobile routers connected by wireless links. Since MANETs do not have a fixed infrastructure, it is a challenge to manage both mobility as well as resource utilizations for Ad hoc networks. In this paper, I propose a Reputation management scheme, called reputation factor (RF) effective resource selection using the reputation based approaches for node selection. The developed resource allocation algorithm is based on different parameters like time, cost, number of processor request etc. The developed priority algorithm is used for a better resource allocation of jobs in the network environment used for the simulation of different models or jobs in an efficient way. After the efficient resource allocation of various jobs, an evaluation is being carried out which illustrates the better performance. Performance is evaluated by using simulation.

\end{abstract}


\keywords{}

\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[{I.}]{I.}\par
Introduction \& Background e can described the life cycle of mobile ad hoc network into the first ,second and third generations. Present adhoc network are viewed as the third generation. The original ad hoc network can be followed back to 1970's. In 1970's, these are called Packet Radio Network (PRNET). The Defense Advanced Research Project Agency started examination of utilizing parcel changed radio correspondence to give solid correspondence in the middle of PCs and urbanized PRNET. Essentially PRNET utilizes the blend of Areal Location of Hazardous Atmospheres and Carrier Sense Multiple Access for various get to and separation vector directing.\par
To dynamically identify the optimal selection of Reputation values per mobile node based on the following: 1. Minimize the network cost based on resource management. 2. By using Reputation based approaches. 3. RF combines the strength of grid based location management and pointer forwarding strategy to achieve high scalability and low signaling cost. 4. The communication module acts as an interface for the RMS to communicate to neighbors RMS. The main purpose of this module is to exchange reputations with immediate neighbors through three types of messages:  
\section[{Related Work}]{Related Work}\par
? We assume that every mobile node has knowledge about the global partitioning as well as the hash function such that it is able to locate the center of the home region of any node. All mobile nodes within the home region of a mobile node serve as home region location servers for that node. DrMoM varies the home region size dynamically based on the mobile node's runtime mobility and service characteristics.\par
? The home region size can be expanded as needed to ensure that at least one node exists to serve as the location server. We assume that node distribution (e.g., random or city-style) is a predefined knowledge known to every node, so every node knows how far Rh should be in order to cover at least one node from the center of its home region. Besides the home region, each mobile node is also associated with a local region, and it exchanges location information with neighbors in the local region. Unlike the home region, which 
\section[{Year ( )}]{Year ( )}\par
does not move, the local region moves with the mobile node. ? The home region keeps location summary information of the node, i.e., the coordinate of the center and radius of the node's local region. Whenever the local region moves due to movement of the node, the location servers in the home region are updated with the location summary information. ? To locate the local region of a destination node, the source node sends a location query to the destination node's location servers.The coordinates of the center of a home region is statically determined, whereas the radius is dynamically determined on a per-node basis, depending on the node's mobility and service characteristics. The home region size, determined by its radius denoted by Rh, is a key factor balancing the tradeoff between the overhead for location queries/updates and the robustness of the location service. ? Specifically, a larger home region covers more location servers on average and consequently increases the chance of a successful location query. However, a larger home region also leads to larger overhead for location queries and updates. Because Rh is dynamic, the size of the home region is dynamic and not necessarily restricted by the size of the rectangular region. 
\section[{a) Taxonomy of Wireless Ad hoc Networks}]{a) Taxonomy of Wireless Ad hoc Networks}\par
In a MANET, mobile hubs shape an always showing signs of change topology. The configuration of effective and adaptable directing conventions is consequently a basic test. Two sorts of ad-hoc steering conventions have been proposed: topology-based and position-based (or geographic based). The topologybased steering conventions utilization message broadcasting to develop courses coordinated to every hub. In addition, every hub additionally keeps up a directing table to record courses to alternate hubs in the network. These conventions intensely depend on finding and keeping up virtual connection states, yet they additionally include some potential issues.\par
One of the issues comes from the breakage of the connections on a course where hubs move. Another issue would be the high activity overhead. Rather than topology-based steering conventions, position-based directing conventions are broadly considered as a possibly adaptable steering arrangement since they don't have to keep up steering tables. These conventions use location data of neighboring hubs and destination hub to settle on their sending choices with geographic sending calculations. One of the downsides of the position-construct conventions is their reliance in light of additional situating gadgets, for example, GPS (Global Positioning System) for securing location indevelopment. These situating gadgets for the most part lead to additional cost and force utilization. Yet, mobile gadgets with situating capacity are getting prevalent as of late because of the wealth of location-based applications. Case in point, situating gadgets have been generally conveyed in different hubs. 
\section[{b) Worldwide Mobile Information System(GloMo)}]{b) Worldwide Mobile Information System(GloMo)}\par
? The objective of the undertaking is to make the mobile environment a five star native in the Defense Information Infrastructure by giving easy to use integration and access to administrations for remote mobile clients.  
\section[{Proposed Work}]{Proposed Work}\par
To diminish the general network activity caused by mobility administration and parcel conveyance herewith we propose proficient mobility administration.\par
? The proposed plans to oversee both mobility and in addition asset uses for Ad hoc networks. 
\section[{Global Journal of C omp uter S cience and T echnology}]{Global Journal of C omp uter S cience and T echnology}\par
Volume XV Issue III Version I Year ( )\par
? For ideal home area size and nearby locale size (characterized by their particular radii meant by Rh and Rl) for every mobile hub in light of the mobile hub's runtime mobility and administration qualities to minimize the general network expense caused for location administration and information parcel conveyance. ? To rapidly distinguish the ideal determination of Reputation qualities every mobile hub taking into account the accompanying: ? Minimize the network expense taking into account asset administration. ? By utilizing Reputation based methodologies.\par
? RF joins the quality of framework based location administration and pointer sending system to accomplish high versatility and low flagging expense. ? Simulation utilizing NS2.\par
Mobility in remote networks can take diverse structures ,, for example, Terminal mobility: the capacity for a client terminal to keep on getting to the network when the terminal moves; 
\section[{a) Client mobility}]{a) Client mobility}\par
The capacity for a client to keep on getting to network administrations from distinctive terminals under the same client personality when the client moves. 
\section[{b) Administration mobility}]{b) Administration mobility}\par
The capacity for a client to get to the same administrations paying little respect to where the client is.\par
In addition, a terminal or a client may be considered by a network to have "moved" regardless of the possibility that the terminal or the client has not transformed its physical location. This may happen when the terminal changed its association starting with one kind of remote network then onto the next, e.g., from Mobility administration is the essential innovation to empower the consistent access to cutting edge remote networks and mobile administrations.\par
Future IP-based remote networks, for example, a wide range of media administrations including ongoing administrations, for example, voice and feature gushing and also non-continuous administrations, for example, email, web-perusing, and FTP. Fundamental necessities of mobility administration in cutting edge.remote networks ought to include: first and foremost, the backing of all types of mobility; second, the backing of mobility for both constant and nonongoing applications; third, the backing of clients consistently moving crosswise over heterogeneous remote networks in the same or diverse administrative areas.\par
Fourth, the backing of an on-set client application session to proceed without noteworthy interferences as the client moves. This session congruity ought to be kept up when a client changes its network connection focuses or moves starting with one sort of remote network then onto the next; and last, the backing of worldwide wandering, i.e., the capacity for a client to move into and use distinctive administrators' networks of home areas. 
\section[{c) Location administration}]{c) Location administration}\par
A procedure that empowers the framework to focus a mobile gadget's present location, i.e., the present network connection point where the mobile gadget can get activity from the framework. 
\section[{d) Handoff administration}]{d) Handoff administration}\par
A procedure that empowers a mobile gadget to change itsnetwork connection point while keeping its on-going activity continuous. In the event that the network connection point change includes the meandering into another network with an alternate administrator, then network access control is likewise included in the handoff process. Network access control incorporates confirmation (check the character of a client), approval (figure out if a client ought to utilize the network administration), and bookkeeping (gather data on the assets utilized by a client).\par
The framework model exhibited in this paper is in light of the taking after presumptions. Every hub has an interesting id and it can't be parodied.\par
? The network is sufficiently thick so that every hub has at least two one-bounce neighbors. ? A remote interface of every hub underpins indiscriminate mode operation: a hub dependably listens to each transmission within its one-jump neighborhood despite the fact that it doesn't involve in those transmissions. ? Links are bidirectional. At time t, if hub B can get a message from hub A, hub An ought to have the capacity to get a message from hub B at time t too. ? A radio wire utilized on every hub is an omnidirectional antenna which empowers its transmission to be observed by its one-jump neighbors.\par
? Each hub is free from one another, no conspiracy.\par
? We don't consider pernicious hubs, just egotistical hubs seeking to moderate their own asset. ? Flood to get a hub's location.\par
? Excessive flooding messages ? Central static location server.\par
? Not blame tolerant ? Too much load on focal server and close-by hubs ? The server may be far away/ parceled ? Every hub goes about as server for a couple of others. ? Good for spreading load and enduring disappointments. 
\section[{Year ( )}]{Year ( )}\par
? Limited assets and physical security.\par
? Intrinsic common trust helpless against assaults.\par
? Lack of approval offices. 
\section[{e) Solution Strategy}]{e) Solution Strategy}\par
The Reputation of the node can be calculated based on below assumptions:\par
i. The time used to send the packet to their adjacent nodes and ii. The number of processor requests it attains\par
The equation to find the neighbors based on the above two parameters is :\par
Reputation Factor (RF) for individual node =(min-time , max-processing power)    Similarly, The below figure shows the comparision of DrMOMand RMS with respect to the power.\par
The evaluation is measured in terms of cost factor i.e, based on max-power and number of nodes, the comparision is takes place. 
\section[{IV.}]{IV.} 
\section[{Conclusion}]{Conclusion}\par
A Reputation-based system as an extension to the existing resource management for detecting the neighbour nodes in mobile ad-hoc networks. The proposed system is evaluated by implementing it on ns2 Simulator.Although they could save their resources by not forwarding packets for others, their packets would not be delivered as well. some simulation results are provided to validate work and show its performance.\par
And also the evaluation of proposed system is expressed in the presence of nodes who forward only the necessary amount of packets so that they are not detected as malicious. This means that they try to keep their reputation in between the two thresholds which was categorized as suspicious nodes. To refer to this type of nodes, we use the term "partially cooperative".  Where the indication of hardness level is h80>>h40>>h20>>h10\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Fig:}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{b}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Fig b :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.8149155722326453\textwidth}P{0.006378986866791745\textwidth}P{0.014352720450281426\textwidth}P{0.009568480300187617\textwidth}P{0.004784240150093808\textwidth}}
\multicolumn{5}{l}{Upon receiving the REP REP, the communication}\\
\multicolumn{5}{l}{module forwards the received RF values to the}\\
\multicolumn{2}{l}{reputation manager.}\tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{5}{l}{3. ALARM Message: This message is sent to}\\
\multicolumn{5}{l}{neighbors when there is a node whose state is}\\
changed.\tabcellsep Upon\tabcellsep receiving\tabcellsep ALARM,\tabcellsep the\\
\multicolumn{5}{l}{communication module forwards the received RF}\\
\multicolumn{5}{l}{values to the reputation manager.scratch pad, and}\\
\multicolumn{5}{l}{so on. In the interim the Development of Standard}\\
\multicolumn{5}{l}{IEEE 802.11 (i.e. WLAN's) profited the ad hoc}\\
\multicolumn{5}{l}{network. Some different principles are likewise built}\\
\multicolumn{5}{l}{up that give advantages to the MANET like}\\
\multicolumn{3}{l}{Bluetooth and HIPERLAN.}\tabcellsep \tabcellsep \\
II.\tabcellsep \tabcellsep \tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.6542134831460674\textwidth}P{0.06685393258426967\textwidth}P{0.06685393258426967\textwidth}P{0.062078651685393255\textwidth}}
Inputs\tabcellsep Node-B\tabcellsep Node-C\tabcellsep Node-D\\
Min-Time\tabcellsep 10ms\tabcellsep 12ms\tabcellsep 5ms\\
Max-Proc.\tabcellsep 100w\tabcellsep 120w\tabcellsep 130w\\
Power\tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{4}{l}{Intermediate Process : cross-checking based on}\\
conditions\tabcellsep \tabcellsep \tabcellsep \\
Output : Node D\tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{3}{l}{The Process now processed as follows :}\tabcellsep \end{longtable} \par
 
\caption{\label{tab_2}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{P{0.1575609756097561\textwidth}P{0.17829268292682926\textwidth}P{0.48926829268292676\textwidth}P{0.024878048780487806\textwidth}}
Inputs\tabcellsep Intermediate\tabcellsep Outputs\tabcellsep \\
\tabcellsep Process\tabcellsep \tabcellsep \\
15-nodes\tabcellsep RF h10\tabcellsep \multicolumn{2}{l}{Adj node can be}\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{easily identified}\\
20-nodes\tabcellsep RF h20\tabcellsep Adj\tabcellsep node\\
\tabcellsep \tabcellsep identification\tabcellsep is\\
\tabcellsep \tabcellsep slightly hard\tabcellsep \\
40-nodes\tabcellsep RF h40\tabcellsep \multicolumn{2}{l}{Hard to resolve}\\
80-nodes\tabcellsep RF h80\tabcellsep \multicolumn{2}{l}{Very Hard to find}\\
\tabcellsep \tabcellsep \multicolumn{2}{l}{Reputation factor}\end{longtable} \par
 
\caption{\label{tab_3}Table 2 :}\end{figure}
 			\footnote{Dual-Region Reputation based Resource Management in Mobile Ad Hoc Networks © 2015 Global Journals Inc. (US)} 			\footnote{© 2015 Global Journals Inc. (US)} 			\footnote{Dual-Region Reputation based Resource Management in Mobile Ad Hoc Networks} 		 		\backmatter  			 			 			  				\begin{bibitemlist}{1}
\bibitem[Chen et al. ()]{b0}\label{b0} 	 		‘Agent-based forwarding strategies for reducing location management cost in mobile networks’.  		 			A R Chen 		,  		 			T Chen 		,  		 			C Lee 		.  	 	 		\textit{ACM Mobile Netw. Appl}  		2001. 6  (2)  p. .  	 
\bibitem[Hsu and Wu (2012)]{b1}\label{b1} 	 		‘An efficient cost based location service protocol for vehicular ad hoc networks’.  		 			C Hsu 		,  		 			S Wu 		.  	 	 		\textit{IEEE international Conference on Communication, Networks and Satellite},  				July 2012. p. .  	 
\bibitem[Michiardi and Molva (2002)]{b3}\label{b3} 	 		‘Core: A Collaborative Reputation mechanism to enforce node cooperation in Mobile Ad Hoc Networks’.  		 			Y Michiardi 		,  		 			R Molva 		.  	 	 		\textit{Communication and Multimedia Security Conference},  				September 2002.  	 
\bibitem[Bansal and Baker]{b4}\label{b4} 	 		\textit{Observation-based Cooperation Enforcement in Ad hoc Networks},  		 			Y Bansal 		,  		 			M Baker 		.  		 	 
\bibitem[Saleet et al. ()]{b2}\label{b2} 	 		‘Regionbased location service management protocol for VANETs’.  		 			H Saleet 		,  		 			O Basir 		,  		 			R Langar 		,  		 			R Boutaba 		.  	 	 		\textit{IEEE Trans. Veh. Technol}  		2010. 59  (2)  p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
