\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={QFSRD: Orthogenesis Evolution based Genetic Algorithm for Qos Fitness Scope aware Route Discovery in Ad Hoc 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{2015-03-15 (revised: 15 March 2015)}
\def\TheID{\makeatother }
\def\TheDate{2015-03-15}
\title{QFSRD: Orthogenesis Evolution based Genetic Algorithm for Qos Fitness Scope aware Route Discovery in Ad Hoc 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]{M.L.Ravi  Chandra}

             \author[2]{Dr.P.Chandra Sekhar  Reddy}

\renewcommand\Authands{ and }

\date{\small \em Received: 11 February 2015 Accepted: 3 March 2015 Published: 15 March 2015}

\maketitle


\begin{abstract}
        


Here in this paper we devised a novel orthogenesis evolution based GA technique for QoS fitness scope aware routing in Mobile Ad hoc Networks. The past decade research towards route discovery strategies for mobile ad hoc networks is continuing with magnitude speed. However, the majority of the routing solutions devised in past are dealing only with the optimality of the data transmission. QoS aware hop level connections in a given rute are not supported with the desired frequency. Hence the QoS aware routing in mobile ad hoc networks is grabbing the attention of many researchers as this domain is on the hot edge of the current research.

\end{abstract}


\keywords{othogenesis evolution, QOS fitness scope.}

\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
ANETs are wireless mobile Ad Hoc Networks that operate without any infrastructure, can be implemented quickly and are flexible to the connectivity and environment of the traffic and mobility patterns.\par
MANET is unlike a traditional wireless networks that have a wired network supporting them for providing data services to mobile users. The network can be setup anywhere for sharing data where there is no pre existing wired network. The applications of mobile Adhoc network vary such as, setting up a communications network in a local area for conferences, meetings, advertising, e-classes, media events, for communications used in battlefields, for telecommunication networks in traffic control \hyperref[b14]{[15]}, for communication in disaster recovery areas, etc.\par
In MANET the network communication is a peer-to-peer wireless connectivity between nodes with either a single hop between a mobile cell and a base station or multi-hop wireless transmission without any base stations.\par
The nodes are mobile and act as hosts as well as routers. A node functions, as a host transmitting data to other nodes, as a destination node for receiving the data and also as a router for routing the data to other nodes.\par
The study in the field of routing in Mobile Ad hoc Networks has been extensive however is mostly based on the best effort data traffic \hyperref[b0]{[1,}\hyperref[b1]{2]} that is not actually a Quality of Service. Similar studies based on QoS objective in wire line network routing \hyperref[b2]{[3,}\hyperref[b3]{4]} devised algorithms for routing that face in MANETs implementation problems due to the networks dynamic topology and bandwidth constraints.\par
The increasing availability and use of mobile devices and requirement for wireless access of Internet, television, VOIP, multimedia audio/video, and especially real time audio and video streaming requires these services to be implemented in MANETs with Quality of Service (QoS) routing. The need for implementing MANETs is increasing parallel to the growth in access of mobile data.\par
The service quality is defined by efficiency of the data flow which can be measured with a set of constraints such as bandwidth, response time of service, end-to-end delay, interruptions, packet loss, etc.\par
In path discovery the algorithms for routing try to find a path having suitable QoS specified resources while minimizing the search, distance and traffic problems. A Mobile Adhoc network is depicted in the below Figure  {\ref 1}. A topology of a wireless paths is obtained from the Figure  {\ref 1} and is depicted in the below Figure  {\ref 2}. The nodes that are mobile in nature are represented by A, B, C, K letters and the bandwidth available with the wireless links is represented adjacent to every edge with 1,2,3,4,5,6 numbers. If we require determining a path between source node A and destination node G, the path that is shortest according to a general technique of path finding would be "A-B-H-G". The selection of the QoS route is completely different from the general practice as criterions such as bandwidth etc are considered as QoS metric. If a path between node A and node G is required with minimum of 4 mbps bandwidth then path that is shortest "A-B-H-G" cannot offer the needed bandwidth and so the possible QoS aware path would be "A-B-C-D-E-F-G." 
\section[{Mobile Node Shortest Path Signal Range}]{Mobile Node Shortest Path Signal Range}\par
QoS satisfied path Wireless Link Figure  {\ref 2} : an example of QoS routing in Manet Figure  {\ref 1} : An example Manet connectivity\par
The research work developed till date for QoS based routing of Mobile Adhoc Networks are, QoS models \hyperref[b4]{[5,}\hyperref[b5]{6]}, QoS resource reservation signaling \hyperref[b6]{[7]}, QoS Medium Access Control (MAC) \hyperref[b7]{[8]}, QoS scheduling \hyperref[b8]{[9]}, and QoS routing \hyperref[b9]{[10,}\hyperref[b10]{11,}\hyperref[b11]{12,}\hyperref[b12]{13,}\hyperref[b13]{14]}.\par
The complex QoS functionality involved in MANET implementation is limited by available resources and dynamic network topology. The flow could be inelastic i.e. uni or multicast, elastic involving TCP or the QoS may have multiple client requirements making the QoS routing very difficult \hyperref[b11]{[12,}\hyperref[b13]{14]} as determined in previous research. In a dynamic environment as the nodes are mobile the addition and deletion of nodes makes the creation of routing paths very complicated. To handle the sudden changes affecting the MANET topology and delivering a multi-path QoS routing requires designing approximated solutions and efficient routing algorithms with various techniques and the latest techniques such as Fuzzy Logic (FL), Artificial Intelligence (AI), Neural Networks (NNs), Genetic Algorithm (GAs) etc.\par
In this paper an orthogenesis GA based QoS fitness scope aware route selection strategy for MANETs called QFSDR is presented. This technique is devised with the motivation gained from the earlier model called GA based routing method GAMAN \hyperref[b17]{[18]}. The objective of the proposed model is, unlike GAMAN and other benchmarking models it should consider many QOS factors along with other contextual QoS metrics and also should achieve the optimality in evolution complexity. The performance of the method is assessed with simulations based tests in different network topologies.\par
The paper is structured as below. Section 2 shows the confirmed contemporary related work. The devised model is explored in Section 3. The results of the simulation tests are shown in the Section 4. The conclusions are finally presented in Section 5. 
\section[{II.}]{II.} 
\section[{Related Work}]{Related Work}\par
In this section a review of the routing techniques based on QoS in MANETs are given as follows,\par
A QoS-aware routing path discovery approach called "ticket-based probing algorithm" by Nahrstedt et al \hyperref[b9]{[10]} is based on controlling with a calculated number of tickets the total messages flooded in a route. A message for probing comprises of minimum one ticket and a message on arrival at a node if it does not contain only one ticket may be divided into several probes and routed to other nodes. In this way every child probe consists of tickets subset to its parent. The probe carrying the hop-by-hop path or the delay/bandwidth data is used in reserving the resources based on the QoS requirements. The developers of the ticket based algorithm have built the technique on an imprecise model. Unlike wire line networks, Mobile Adhoc networks are constantly affected by link breakages resulting in the information transmitted being of imprecise type. So for the ticket-based probing algorithm is based on a plain model of imprecise nature where the history and current (estimated) delay variations are computed to determine the current delay depicted in a range [delay?, delay + ?]. This algorithm applies route redundancy at various levels by including in route maintenance the techniques of pathrepairing as well as re-routing. Here in the process, a node on detecting a path that is broken notifies the source node. The source node then uses the technique of path-repair for repairing the old path using local reconstructions. The transmission is rerouted with a new possible route while notifying the subsequent release of resources at the nodes existing between in the old route.\par
Here unlike the technique of re-routing, a completely new path is not found and instead the approach attempts to adjust to the MANETs dynamic environment.\par
A routing approach based on QoS for Mobile Ad hoc networks of size in the range of small and medium called "Core Extraction Distributed Ad hoc Routing (CEDAR)" \hyperref[b10]{[11]}. The CEDAR approach involves 3 main mechanisms. First, the Core Extraction mechanism selects a group of nodes based on the MANETs minimum dominating group or links having large bandwidth of stable nature, to create the core that manages the nodes local topology and computes the route based on the requirement and the state of local conditions. Next Link State Propagation mechanism distributes to all the core nodes the information of the bandwidth available with stable links. The routing based on QoS is attained by passing stable links related highbandwidth information to distant nodes in the network and by containing dynamic links low bandwidth information in the area locally. establishes a core route from the source node domain to the destination node domain. This data of the core path is used to determine iteratively a partial route in the path that forms the core from the source to the farthest domain node possible in terms of the demanded bandwidth. In the next iteration this node acts as the source node.\par
In the strategy of CEDAR, the core mechanism offers a capable and cost effective platform for routing and the state propagation guarantees link-state information accessibility to core nodes with minimal expenses.\par
A protocol for routing given in \hyperref[b13]{[14]} is built on QoS criteria and based on the estimation of the bandwidth. This bandwidth assessment is done by disseminating with "Hello" messages the information of the bandwidth. A contrast of two dissimilar approaches of bandwidth estimation is given here. When the criterion of bandwidth release is primarily essential, the functionality of the estimation method based on "Hello" bandwidth is efficient in comparison to the assessment approach based on "Listen" bandwidth. When the criterion of topologies of static nature using huge weight factors to minimize the congestion as well as the incorrect signaling of broken routes by lost "Hello" messages is considered the methods "Hello" and "Listen" show good functionality that is mostly same. When the criterion of mobile topology is considered "Hello" strategies functionality is more effective with respect to end-to-end throughput whereas the "Listen" strategies functionality is good with respect to the packet delivery ratio.\par
Genetic Algorithm-Based QoS Routing Protocol for MANETS (GAMAN) \hyperref[b17]{[18]} for ad hoc networks is the most recent and best of its kind. The GAMAN is devised to identify optimal routes that are specific to two QoS factors called end-to-end delay and max transmission success ratio. The GAMAN is aimed to define QoS aware optimal routes for mobile ad hoc networks (MANTETs). Under the impact of mobility, the Quality of Service is proportionate to the node connectivity. The GAMAN is based on single point crossover and mutation and fitness function is assessing only the endto-end delay and max transmission success ratio. The GAMAN evolutions are elitist that maintains best fit route remains unchanged in further evolutions. The experimental results explored by the authors concluding that it is optimal and robust for sparse to lower range of dense size networks. Moreover the fitness assessment is specific to a particular QoS factor; hence the route discovery is not optimal in regard to other QoS factors. The elitist model is optimal, but evolutions count is not in control for networks with nodes having QoS metric values distribution with high skewness  {\ref [20]}.\par
Leonard Barolli, Makoto Ikeda et al., \hyperref[b18]{[19]} devised a novel local search optimization strategy, which is an extension to their earlier work GAMAN \hyperref[b17]{[18]} that referred as E-GAMAN. The devised search space reduction algorithm (SSRA) is mainly aimed to minimize the crossover complexity observed in GAMAN. So that the local search become much faster, hence the time taken for optimal route selection will be low and the GAMAN can find a feasible wireless path very fast. But the issue of considering the impact of QoS factors other than mobility remains same and the evolutions count is still not in control for networks with nodes having QoS metric values distribution with high skewness  {\ref [20]}.\par
In a gist, almost all of these benchmarking models including GAMAN \hyperref[b17]{[18]} are specific to one or two QOS factors. The GAMAN is also not confident when QoS metric values are distributed with high skewness  {\ref [20]}. Henceforth, here in this paper we devised a novel orthogenesis genetic algorithm for optimal QoS aware route selection for mobile ad hoc networks. Unlike GAMAN the said model is equally considering all QoS metric values to assess the fitness of the resultant route. Since the GA that considered is following orthogenesis approach and the statistical strategy used to fix the need and scope of further evolutions, the number of evolutions is in control, which leads to minimize the search space Unlike the traditional GA, the proposed model is constructing new generations by progressive evolution strategy. The progressive evolution strategy generates the child elements having more fitness than one or both of the parent elements. Hence the number of evolutions can be limited. The other contribution in devised model is fitness assessment that considers the many metrics with equal priority and the same time not losing the influence of prime QoS metric such as energy efficiency, connectivity or bandwidth availability. The QoS fitness scope assessment strategy proposed in this paper is based on the QoS factors of route and their earlier allocation impacts, which are described below:\par
? A route can be rated best under a specific QoS factor, but might fail to deliver the same performance under the consideration of multiple QoS factors. ? A route can be rated divergently with respect to its various QoS factors. As an example, a route can be best with respect to bandwidth availability, but the same route might be moderate in terms of packet delivery ratio scope, worst in the context of end-toend delay scope. The QoS metrics of each edge between hop level nodes of route are considered to assess the best fit route and these metric are categorized as positive and negative, which is based on their value. The metrics with desired value as high referred as positive metrics and the metrics with desired value low are referred as negative metrics. The scope of the described metrics is assessed against the transmission of n packets. These metrics are described below. ? Connectivity (+) = Due to the factor of mobility, the connectivity between the nodes is a sensitive metric towards QoS aware Routing. This is appositive metric, since connectivity with high value is desirable. This metric can be assessed as follows The QoS factor ( ) i eu e is taken as prime metric (any QoS metric can be selected as prime metric, which based on the routing context), which is using to order the routes. These QoS metrics of the routes are categorized as positive and negative metrics. If the incremental values of the metrics are optimal then those metrics are referred as positive metrics and if decrement values are optimal then those metrics are negative metrics.\par
Henceforth the values of negative and positive metrics should be normalized, which is as follows:\par
Foreach route [ ] r r R ? ? begin For each QoS metric \{ ( ) \} k k m r m M r R ? ? ? ? of route r Begin ( ) 0 k m r = End For each edge\{ \} i i e e r ? ? Begin For each metric [ ( ) ( ) ] k i k i m e m e M ? ? edge i e Begin // here M represents values of selected edge of route r If ( ) k i m e is value of +ve metric then 1 ( ) 1 ( ) k i k i m e m e = ? Else If ( ) k i m e is value of -ve metric then 1 ( ) ( ) k i k i m e m e = ( ) ( ) ( ) k k k i m r m r m e = + End End For each QoS metric \{ ( ) \} k k m r m M r R ? ? ? ? of route r Begin ( ) ( ) | | 1 k k m r m r r = ?\par
// each QoS metric value of each route , //which is an average of that QoS metric //value observed at all edges in that route End Then the available routes R are ranked by their normalized metric scores \{ ( ) \} k k m r m M r R ? ? ? ? from maximum to minimum, such that each route r gets different rank for different metric ( ) k m r . Further these ranks will be used as input to measure the QoS fitness scope qfs .\par
Let Rank set of a route [ ]i i r r R ? ? is 1 2 3 | | ( ) \{ ( ),\textbf{( ), ( ),}\par
........, ( )\}i i i i M i\par
O r om r om r om r om r = (here | | M indicates the total number of metrics) and then QoS fitness scope ( qfs ) of each route can be measured as follows.| ( )| 1 ( ) [ ( ) ( ) ( )] | ( ) | i i O r k i k i i k O r i om r om r O r O r µ = ? ? =\par
? // the above equation represents the average of the ranks obtained for different metrics of route i r1 2 | ( )| ( [ ( ) ( ) ( )]) ( ) 1 ( ) 1 | ( )| O r i m r m r O r k i k i i O r i k qfs r i O r i µ ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? = ? ? ? ? = ? ? ? ? ? ? ? ? ? ? ?\par
The above equation is derived from the process of calculating variance between given number of attribute values. Subtracting variance observed, from 1 gives fitness scope. Here in above equation,( ) i O r\par
µ represents the mean of the all ranks of different QoS metrics of the route i r . Then these routes will be ordered based on the prime QoS metric. Among the ordered routes, the best routes in regard to prime QoS factor will be selected, and then they will be ordered from maximum to minimum of their qfs value. 
\section[{a) Exploration of Orthogenesis Genetic Evolution for QoS Fitness Scope Aware Route Selection}]{a) Exploration of Orthogenesis Genetic Evolution for QoS Fitness Scope Aware Route Selection}\par
The devised orthogenesis GA performs progressive evolution process. In the context of optimal QoS aware route discovery, these progressive evolutions will be applied on set possible routes R found between source and destination nodes. The number of evolutions is initially limited to max evolution count given, further, the kurtosis [20] of the qfs distribution across the routes in resultant R is assessed. (i) If the kurtosis of the qfs distribution is mesokurtic (kurtosis is equal to 3), which indicates that the variation of qfs distribution is reflecting moderate then the further evolutions continues by adjusting the max evolution count to half of its current value . (ii) If distribution is reflecting leptokurtic, which indicates the variation of the qfs distribution is high then the further evolutions continues for max evolution count number of times. If distribution is platykurtic, which indicates that the qfs distribution is with negligible variation, hence stop further evolutions.    
\section[{Empirical Analysis and Results Exploration}]{Empirical Analysis and Results Exploration}\par
The empirical analysis was done by a simulated mobile ad hoc network environment, which is build by using NS2 to visualize and TCL to control The network environment build on the simulation is considering the randomized node placement with random waypoint mobility. The opted QoS metric values observed at hop level edges on an event of time was randomly distributed under the context of poison distribution. The simulation environment was bounded to the parameters 
\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 ( ) explored in table1. The simulation was opted to AODV strategy to discover the possible routes between given source and destination nodes. Further to obtain the QoS fitness scope aware routes from the discovered routes was done by using the expression language called R. The experiments were done on simulated network environment with divergent count of nodes range from 50 (sparse) to 250 (dense). In other dimension the experiments were done under nodes with divergent mobility speeds. The results observed from experiments indicating that the proposed Orthogenesis GA for QoS fitness scope aware route discovery (QFSRD) is scalable and robust that compared to GAMAN \hyperref[b17]{[18]} and E-GAMAN \hyperref[b18]{[19]}. The completion evolution completion time is considerably low and scalable (see figure  {\ref 3}), the evolution complexity observed at proposed QFSRD scalable and stable (see figure \hyperref[fig_3]{4}). The skewness observed for QoS fitness distribution over top n (here in experiments 10 n = ) resultant routes from the QFSRD is low and optimal (see figure  {\ref 5}).   
\section[{Conclusion}]{Conclusion}\par
Orthogenesis based Genetic algorithm has been devised here in this paper, which is in the context of QoS fitness scope aware route discovery for mobile ad hoc networks. The limits observed in earlier GA based QoS aware routing discovery strategies called GAMAN \hyperref[b17]{[18]} and E-GAMAN \hyperref[b18]{[19]}, motivated us to devise this Orthogenesis based Genetic Algorithm for QoS fitness scope aware route discovery. Unlike these two models \hyperref[b17]{[18]}[19], the devise model is assessing the fitness of the route by considering all QoS factors along with prime QoS metrics such as connectivity, bandwidth. The progressive evolution strategy of orthogenesis approach is another key contribution of the proposed model. This progressive evolution minimizes the number of evolutions compared to the traditional GA with elitist (best fit remain unchanged) strategy. The major contribution this paper is the QoS fitness scope assessment strategy, unlike any existing benchmarking strategies that considers a specific QoS metric, the devised fitness scope assessment model considers many QoS factors along with prime QoS metrics that are related to the routing context. In the best our knowledge, 
\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 ( ) the fitness scope assessing and progressive evolution strategies are used first in the class of QoS aware routes discovery. The experimental results concluding the magnified scalability, optimality and robustness of the proposed model that compared other benchmarking strategies called GAMAN and E-GAMAN. This work is inspiring us for further research. One future direction of research would be finding hybrid soft-computing strategies for QoS aware route discovery.\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}R}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{14}\includegraphics[]{image-4.png}
\caption{\label{fig_2}1 8?Here in the above equation 4 m represent the fourth moment of the qfs distribution 4 =}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-5.png}
\caption{\label{fig_3}Figure 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{55}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Figure 5 : 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.85\textwidth}}
? Input: All possible routes as routes set R ? Fitness factors: o connectivity (+), bandwidth (+), end-to-end delay (-), reputation (+) , energy usage(-) and other metrics if any ? QoS Fitness Scope ( qfs ) calculation: o 1 mv , here mv is metric value o normalization of positive factor will be 1 1 mv ? o o Verify the kurtosis of the qfs distribution among the resultant routes, if kurtosis is leptokurtic, and then continue Orthogenesis evolution for next max evolution count given. If kurtosis is mesokurtic or platykurtic then stop evolutions and select n\end{longtable} \par
  {\small\itshape [Note: ? The importance of the QoS factors might vary from one routing context to other.? According to the impact of QoS factors of the routes described, it is evident that the best ranked route under single QoS factor is not always the optimal III.Orthogenesis number of routes from the resultant routes set R]} 
\caption{\label{tab_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.5332699619771863\textwidth}P{0.3167300380228137\textwidth}}
The range of Nodes\tabcellsep 50 to 250\\
The range of mobility speed\tabcellsep 0.5m to 3m/sec\\
Communication Strategy\tabcellsep MAC 802.11 DCF\\
Network Occupancy\tabcellsep 1000 X 1500 m2\\
Node transmission frequency scope\tabcellsep 100 meter\\
Packet type\tabcellsep CBR \& FTP\\
Node Mobility Strategy\tabcellsep Random way point\\
Simulation Time\tabcellsep 100, 300 Sec\end{longtable} \par
 
\caption{\label{tab_3}Table 1 :}\end{figure}
 			\footnote{© 2015 Global Journals Inc. (US)} 			\footnote{© 2015 Global Journals Inc. (US) © 2015 Global Journals Inc. (US)} 			\footnote{© 2015 Global Journals Inc. (US) 1} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Xiao et al. (2000)]{b4}\label{b4} 	 		‘A Flexible Quality of Service Model for Mobile Ad-Hoc Networks’.  		 			H Xiao 		,  		 			W K G Seah 		,  		 			A Lo 		,  		 			K C Chua 		.  	 	 		\textit{Proc. of IEEE VTC2000},  				 (of IEEE VTC2000Tokyo)  		May 2000. 1 p. .  	 
\bibitem[Stine and Veciana ()]{b12}\label{b12} 	 		‘A Paradigm of Qualityof-Service in Wireless Ad Hoc Networks Using Synchronous Signaling and Node States’.  		 			J A Stine 		,  		 			G Veciana 		.  	 	 		\textit{IEEE Journal on Selected Areas in Communications}  		2004. 22  (7)  p. .  	 
\bibitem[Royer and Toh (1999)]{b1}\label{b1} 	 		‘A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks’.  		 			E M Royer 		,  		 			C K Toh 		.  	 	 		\textit{IEEE Personal Communications}  		April 1999. 6  (2)  p. .  	 
\bibitem[Barolli et al. ()]{b18}\label{b18} 	 		‘A Search Space Reduction Algorithm for Improving the Performance of a GA-based QoS Routing Method in Ad-Hoc Networks’.  		 			Leonard Barolli 		,  		 			Makoto Ikeda 		,  		 			Giuseppe De Marco 		,  		 			Arjan Durresi 		,  		 			Akio Koyama 		,  		 			Jiro Iwashige 		.  		 \xref{http://dx.doi.org/10.1080/15501320601067881}{10.1080/15501320601067881}.  	 	 		\textit{International Journal of Distributed Sensor Networks}  		 1550-1329 print/1550-1477 online.  		2007. Taylor \& Francis Group. 3 p. .  	 	 (LLC) 
\bibitem[Perkins ()]{b0}\label{b0} 	 		\textit{Ad Hoc Networking},  		 			C E Perkins 		.  		2001. Addison-Wesley.  	 
\bibitem[Chen and Nahrstedts ()]{b2}\label{b2} 	 		‘An Overview of Quality of Service Routing for Next-Generation HighSpeed Networks: Problems and Solutions’.  		 			S Chen 		,  		 			K Nahrstedts 		.  	 	 		\textit{IEEE Network, Special Issue on Transmission and Distribution of Digital Video}  		1998. 12  (6)  p. .  	 
\bibitem[Sivakumar et al. ()]{b10}\label{b10} 	 		‘CEDAR: a Core-Extraction Distributed Ad-Hoc Routing Algorithm’.  		 			R Sivakumar 		,  		 			P Sinha 		,  		 			V Bharghavan 		.  	 	 		\textit{IEEE Journal of Selected Areas in Communications}  		1999. 17  (8)  p. .  	 
\bibitem[Chen et al. ()]{b7}\label{b7} 	 		‘Cross-Layer Design for Data Accessibility in Mobile Ad Hoc Networks’.  		 			K Chen 		,  		 			S H Shah 		,  		 			K Nahrstedts 		.  	 	 		\textit{Wireless Personal Communications, Special Issue on Multimedia Network Protocols and Enabling Radio Technologies},  				2002. 21 p. .  	 
\bibitem[Wu and Harms ()]{b11}\label{b11} 	 		\textit{Crossing Boundaries an interdisciplinary journal},  		 			K Wu 		,  		 			J Harms 		.  		2001. 1 p. .  	 	 (QoS Support in Mobile Ad Hoc Networks) 
\bibitem[Chen and Nahrstedt ()]{b9}\label{b9} 	 		‘Distributed Quality-of-Service Routing in Ad-Hoc Networks’.  		 			S Chen 		,  		 			K Nahrstedt 		.  	 	 		\textit{IEEE Journal on Selected Areas in Communications}  		1999. 17  (8)  p. .  	 
\bibitem[Chao and Liao ()]{b8}\label{b8} 	 		‘Fair Scheduling with QoS Support in Wireless Ad Hoc Networks’.  		 			H L Chao 		,  		 			W Liao 		.  	 	 		\textit{IEEE Transactions on Wireless Communications}  		2004. 3  (6)  p. .  	 
\bibitem[Barolli et al. ()]{b15}\label{b15} 	 		‘GAMAN: A GA Based QoS Routing Method for Mobile Ad-hoc Networks’.  		 			L Barolli 		,  		 			A Koyama 		,  		 			T Suganuma 		,  		 			N Shiratori 		.  	 	 		\textit{Journal of Interconnection Networks (JOIN)}  		2003. 4  (3)  p. .  	 
\bibitem[Barolli et al. ()]{b17}\label{b17} 	 		‘GAMAN: a GA based QoS routing method for mobile Ad-Hoc networks’.  		 			L Barolli 		,  		 			A Koyama 		,  		 			T Suganuma 		,  		 			N Shiratori 		.  	 	 		\textit{Journal of Interconnection Networks}  		2003. 4  (3)  p. .  	 
\bibitem[Goldbergs ()]{b16}\label{b16} 	 		\textit{Genetic Algorithms in Search, Optimization, and Machine Learning},  		 			D E Goldbergs 		.  		1989. Addison-Wesley.  	 
\bibitem[Lee et al. (2000)]{b6}\label{b6} 	 		‘INSIGIA: An IP-Based Quality of Service Framework for Mobile Ad Hoc Networks’.  		 			S B Lee 		,  		 			G S Ahn 		,  		 			X Zhang 		,  		 			A T Campbell 		.  	 	 		\textit{Journal of Parallel and Distributed Computing}  		April 2000. 60  (4)  p. .  	 
\bibitem[Chen and Heinzelman ()]{b13}\label{b13} 	 		‘QoS-Aware Routing Based on Bandwidth Estimation for Mobile Ad Hoc Networks’.  		 			L Chen 		,  		 			W B Heinzelman 		.  	 	 		\textit{IEEE Journal on Selected Areas in Communications}  		2005. 23  (3)  p. .  	 
\bibitem[Lee et al. ()]{b3}\label{b3} 	 		‘Routing Subject to Quality of Services Constraints in Integrated Communications Networks’.  		 			W C Lee 		,  		 			M G Hluchyj 		,  		 			P A Humblet 		.  	 	 		\textit{IEEE Network}  		1995. 9  (4)  p. .  	 
\bibitem[Special Issue on Computational Intelligence in Telecommunication Networks Computer Communications ()]{b14}\label{b14} 	 		‘Special Issue on Computational Intelligence in Telecommunication Networks’.  	 	 		\textit{Computer Communications}  		2002. 25  (16) .  	 
\bibitem[Ahn et al. ()]{b5}\label{b5} 	 		‘Supporting Service Differentiation for RealTime and Best-Effort Traffic in Stateless Wireless Ad Hoc Networks (SWAN)’.  		 			G S Ahn 		,  		 			A T Campbell 		,  		 			A Veres 		,  		 			L H Sun 		.  	 	 		\textit{IEEE Transactions on Mobile Computing}  		2002. 1  (3)  p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
