\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={Energy Efficient QoS Routing Protocol based on Genetic Algorithm in MANET},
 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{2014-01-15 (revised: 15 January 2014)}
\def\TheID{\makeatother }
\def\TheDate{2014-01-15}
\title{Energy Efficient QoS Routing Protocol based on Genetic Algorithm in MANET}
\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}

             \affil[1]{  }

\renewcommand\Authands{ and }

\date{\small \em Received: 12 December 2013 Accepted: 3 January 2014 Published: 15 January 2014}

\maketitle


\begin{abstract}
        


 Abstract- In mobile ad-hoc networks (MANETs), providing quality of service is more challenging than wired networks, because of multi hop communication, node connectivity and lack of central co-ordination. Mobile ad-hoc networks need sure distinctive characteristics which might cause difficulties providing QoS in such network. Coming up with of multi constrained QoS routing protocols remains troublesome. As a result of routing protocols must satisfy the numerous QoS metrics at a time. Genetic algorithm based routing protocol will give the solution for multi constrained QoS routing problem. In existing genetic algorithm based routing, achieving energy efficiency is the major drawback. To overcome this drawback, in this paper, we have proposed genetic algorithm based energy efficient QoS routing for MANET. Proposed GA based routing algorithm discovered the shortest path from source to destination, which can consumes less energy compare to existing algorithms. In this paper TCP,CBR and video sources are applied at a time then energy consumption of proposed algorithm is compared with existing normal GA based and AOMDV. Simulation results show that proposed algorithm consumes less energy towards given scenario. Simulations are performed in NS-2.

\end{abstract}


\keywords{multi constrained, genetic algorithm, energy consumption}

\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 a) MANET}]{INTRODUCTION a) MANET}\par
Mobile Ad hoc Network (MANET) consists of a collection of mobile nodes that are communicated in a multi-hop manner without any fixed infrastructure. Due to the characteristics like easy deployment and self-organizing capability, MANET has great potentials in many civil and military applications  {\ref [1] [3]}.\par
MANETs have become an important medium of present day communication, and is easily deployable and infrastructure less. These networks are particularly suitable for emergency situations like warfare, floods and other disasters where infrastructure networks are not possible to operate \hyperref[b2]{[3]}. In order to enable the data transfer, they communicate through single hop or through multiple hops with the help of intermediate nodes \hyperref[b8]{[9]}. Nodes in MANETs are small radio devices with Limited computational capacity and memory. Routes are mostly multi-hop because of the limited radio propagation range \hyperref[b9]{[10]}. In this regard multicasting protocol plays a critical role in the MANETs than uni cast protocols and are faced with the challenge of producing multi-hop routing under host mobility and band width constraint. 
\section[{b) QoS Routing}]{b) QoS Routing}\par
Quality of Service (QoS) routing algorithms is different from the conventional routing algorithms. In QoS routing, the path from the source to the destination must satisfy the multiple constraints simultaneously (e.g., bandwidth, reliability, end-to-end delay, jitter and cost), while in conventional routing, routing decisions are made based only on a single metric \hyperref[b1]{[2]}. The main purpose of QoS routing is to find a feasible path that has sufficient resources to satisfy the constraints. A main problem in QoS routing is to find a path between the source and destination that satisfies two or more end-to-end QoS constraints \hyperref[b3]{[4]}. In MANET, providing QoS is more challenging than in wired networks, mainly due to node mobility, multi hop communication, contention for channel access, and lack of central coordination \hyperref[b4]{[5]}  \hyperref[b5]{[6]}. The basic function of QoS routing is to find a network path, which satisfies the given constraints and optimize the resource utilization \hyperref[b6]{[7]}. The role of QoS routing strategy is to compute paths that are suitable for different type of traffic generated by various applications while maximizing the utilizations of network resources \hyperref[b7]{[8]}. The important objectives of QoS routing are:\par
? To find a path from source to destination while satisfying user's requirements. ? To optimize the usage of the network resource.\par
? To degrade the network performance when unwanted things like congestion, path breaks appear in the network \hyperref[b7]{[8]}. 
\section[{c) Energy Efficiency in MANET}]{c) Energy Efficiency in MANET}\par
The two important characteristics of multi-hop wireless networks are:\par
? Available battery power on the constituent lightweight mobile nodes (such as sensor nodes or smart phones) is quite limited. ? Communication costs (in terms of requirement of transmission energy) are much higher than computing costs (on individual devices). The insufficient lifetime of battery imposes a limitation on the network performance. To take the complete advantage of lifetime of nodes, traffic should be routed to minimize the energy consumption \hyperref[b4]{[5]}. Energy-aware routing protocols for such networks usually select routes that minimize the total transmission power. When the transmission power is fixed, each link has the same cost and the minimum hop path is selected. When the transmission power can vary with the link, as the link cost is higher for longer hops, the energy-aware routing algorithms select a path with large number of small-distance hops \hyperref[b5]{[6]}. 
\section[{II.}]{II.} 
\section[{Literature Review}]{Literature Review}\par
Jinhua Zhu and Xin Wang \hyperref[b10]{[11]} have proposed an accurate analytical model to track the energy consumption. Then, they proposed a simple energyefficient routing scheme called PEER to improve the performance of the routing protocol during route discovery and in mobility scenarios. Simulation results have indicated that PEER protocol reduces path discovery overhead and delay up to 2/3, and transmission energy consumption about 50 percent.\par
Gabriel Ioan Ivascu et al \hyperref[b13]{[14]} have presented a new approach called Quality of Service Mobile Routing Backbone over AODV (QMRB-AODV) for supporting QoS using a mobile routing backbone to dynamically distribute the traffic and to select the route that can support the best QoS connection. Nodes in real-life MANET are heterogeneous and have different characteristics. Based on these characteristics, their solution classifies nodes as either QoS routing nodes, simple routing nodes that route the packets through the network without providing special service provisions or transceiver nodes, that send and receive the packets but cannot relay them. Simulation result shows that QMRB-AODV gives the best result in terms of packet delivery ratio and bandwidth utilization. The drawback of this paper is that this protocol cannot perform well when the number of route requests increased. Since it increases the average queuing time for packets, which leads to higher end-to-end delay.\par
In \hyperref[b12]{[13]}, a GA based QoS routing algorithm is proposed for solving the MCP problem. It is able to produce multiple feasible paths, which makes the algorithm more robust when the actual state information in the network changes. In GA, multiple feasible paths can be created by iterating the algorithm until multiple feasible paths are found. This process increases the success of finding feasible path that can fulfill the QoS requirement. The drawbacks of this paper are: Increase in end-to-end delay in the network.\par
? Lack of energy efficiency constraints.\par
? Less efficient utilization of bandwidth.\par
? Decrease in packet delivery ratio.\par
In \hyperref[b11]{[12]}, the minimum bandwidth, end-to-end delay and connectivity metrics are considered for fitness function. But, it does not consider the energy efficiency. Then various constraints like end-to-end delay, available bandwidth, and node connectivity index and resource availability are combined into a single constraint. In GA based routing algorithm, the fitness function is modified by incorporating the combined metric in such a way that it satisfies the set of QoS requirement. In this, we have given the preference for dynamic aspects of node while determining its performance in the network.\par
By implementing this method, we are minimizing the QoS values on links from source to destination and increasing the possibility for the path to satisfy the given QoS requirement and hence we can overcome the MCP problem. 
\section[{III.}]{III.} 
\section[{Proposed Solution}]{Proposed Solution}\par
Initially, a minimum energy shortest path is discovered. Several paths may exist between the source and the destination. Among them, the minimum energy shortest path (energy-efficient) is selected using this method.\par
For example, in an 802.11 network, the energy consumption by the RTS,CTS and Ack packets accounts for a significant part of the total energy consumption without considering such energy consumption, these protocols may tried to used a larger number of intermediate nodes. These resulting in more energy consumption, a lower throughput and /or a higher end to end packet error rate.\par
To address the deficiencies of the existing approach, in this section more accurate energy consumption model is applied, which uses minimum energy routing scheme. 
\section[{a) Determining Average Power For Transmission}]{a) Determining Average Power For Transmission}\par
There are two types of MAC schemes in IEEE 802.11: Distributed Coordination Function (DCF) and Point Coordination Function (PCF). In our proposed protocol we will implement DCF as PCF is a centralized protocol.\par
DCF is actually based on Carrier Sensing Multiple Access with Collision Avoidance (CSMA/CA) mechanism that consists of two carriers sensing schemes: physical carrier sensing and virtual carrier sensing. The virtual carrier sensing scheme is implemented along with Network Allocation Vector (NAV). If a node receives a packet (such as RTS, CTS, and DATA packet) it updates NAV along with the duration included in the received packet. The NAV value indicates while the on-going transmission session ends. When a node wants to send data packet to another node, it first checks its NAV. If the NAV is larger than 0, it has to wait till NAV reaches 0. After this only, sender transmits RTS packet when the channel is available for a period greater than DCF InterFrame Space (DIFS) or when the backoff timer reaches zero. The receiver responds along with a CTS packet after receiving The RTS packet. After receiving the CTS, sender sends out the data packet and receiver reply with ack packet after (1) \hyperref[b10]{[11]} Average total receiving power PR to receive a packet from node i to node j is given by \hyperref[b10]{[11]} where N K = N + N hdr + N phy N r = N rts + N phy N c = N cts + N phy N a = N ack + N phy Here the network considers the transmission power PT and receiving power PR to estimate the link cost in the network. We assume that there are I-1 intermediate nodes between source and destination. Also the nodes along the path from source to destination are numbered from 0 to I.) ( j) (i, P , ,\textbf{, , , , , , , , ,}R j i a j i j i c j i c j i a j i K a j i K c K r p p p p p p N N p N N N N + + + = (2)\par
Then, the total power required for reliable transmission along the path from source to destination is given by ( )) 1 , (\textbf{) 1 , ( P 1 0 T}? ? = + + + = I i R m i i P i i P (3) [11] 
\section[{b) Minimum Energy Shortest Route Discovery Process}]{b) Minimum Energy Shortest Route Discovery Process}\par
Using the minimum energy shortest route discovery process, multi-route is selected. The main route is selected based on the QoS metric. The combined QoS constraint consists of end-to-end delay, bandwidth, packet loss rate, and node connectivity index (Ni) and dynamic resources availability. In this paper, we present simulation results only for energy consumption for TCP, CBR and video sources.\par
Proposed Genetic algorithm based energy efficient routing protocol (GAEEQR) discovered the optimized energy route from source to destination. 
\section[{IV.}]{IV.} 
\section[{Simulation Results}]{Simulation Results} 
\section[{a) Simulation Model and Parameters}]{a) Simulation Model and Parameters}\par
The Network Simulator (NS2)  {\ref [16]} is used to simulate the proposed architecture. In the simulation, the mobile nodes move in a 1250 m x 1250 m region for 50 seconds of simulation time. All available nodes have the same transmission range of 250 meters. The traffic used for simulation is Constant Bit Rate (CBR), Video and TCP. The parameters used for simulation are summarized in table. The proposed Genetic Algorithm based QoS Routing is compared with the GA based QoS Routing technique \hyperref[b12]{[13]} and AOMDV. The performance is evaluated mainly, energy consumption between the source and destination. Fig1 shows the energy consumption of all the 3 protocols for different number of nodes scenario. We can observe that the energy consumption of GAEEQR is 7\% less than GAQR and 17\% less than AOMDV. 
\section[{ii. Based on Speed}]{ii. Based on Speed}\par
In this experiment, we may vary the mobile speed as 10, 20, 30, 40 and 50 m/s protocols for different speed scenario. We can observe that the energy consumption of GAEEQR approach is 6.4\% less than GAQR and 12\% less than AOMDV. 
\section[{iii. Based on Rate}]{iii. Based on Rate}\par
In this experiment, by varying the rate as 50,100,150,200 and 250kbits then Energy consumption has calculated for three algorithms.  
\section[{Conclusion}]{Conclusion}\par
this paper, we have proposed GA based Energy Efficient QoS routing and Optimization Protocol in MANET. There are several paths between the source and destination, among them, the minimum energy shortest path (energy-efficient) is selected. Using the Minimum Energy Shortest Route Discovery Process, multiple routes are selected. The main route is selected based on the QoS metric. By observing above simulation results, it is conclude that,the proposed GA based energy efficient QoS routing protocol consumes less energy compare to existing GA based algorithm and AOMDV. \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
    \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.4348837209302326\textwidth}P{0.4151162790697674\textwidth}}
No. of Nodes\tabcellsep 30,50,70,90 and 110\\
Area Size\tabcellsep 1250 X 1250\\
Mac\tabcellsep IEEE 802.11\\
Transmission Range\tabcellsep 250m\\
Simulation Time\tabcellsep 50 sec\\
Traffic Source\tabcellsep CBR,Video and TCP\\
Packet Size\tabcellsep 512\\
Routing Protocol\tabcellsep AOMDV,GA,GAEEQR\\
Speed\tabcellsep 10,20,30,40 and 50m/s\\
Rate\tabcellsep 50,100,150,200 and 250kb\\
Initial Energy\tabcellsep 10.3 J\\
Transmission Power\tabcellsep 0.660\\
Receiving power\tabcellsep 0.395\end{longtable} \par
 
\caption{\label{tab_1}Table 1 :}\end{figure}
 			\footnote{© 2014 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Yussof et al. ()]{b12}\label{b12} 	 		‘A Robust GAbased QoS Routing Algorithm for Solving Multiconstrained Path Problem’.  		 			Salman Yussof 		,  		 			Hang Ong 		,  		 			See 		.  	 	 		\textit{JOURNAL OF COMPUTERS}  		SEPTEMBER 2010. 5  (9) .  	 
\bibitem[Santhi and Nachiappan (2010)]{b8}\label{b8} 	 		\textit{A SURVEY OF QOS ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS},  		 			G Santhi 		,  		 			Alamelu Nachiappan 		.  		August 2010.  	 
\bibitem[Hanzo and Tafazolli ()]{b4}\label{b4} 	 		\textit{A SURVEY OF QOS ROUTING SOLUTIONS FOR MOBILE AD HOC NETWORKS},  		 			Lajos Hanzo 		,  		 			Rahim Tafazolli 		.  		2007.  	 
\bibitem[Hanzo and Tafazolli ()]{b5}\label{b5} 	 		\textit{A Survey of QoS Routing Solutions for Mobile Ad hoc Networks},  		 			L Hanzo 		,  		 			R Tafazolli 		.  		2007.  	 
\bibitem[Asokan et al. ()]{b3}\label{b3} 	 		\textit{A Swarm-based Distance Vector Routing to Support Multiple Quality of Service (QoS) Metrics in Mobile Adhoc Networks},  		 			R Asokan 		,  		 			A M Natarajan 		,  		 			A Nivetha 		.  		2007.  	 
\bibitem[Saida Ziane and Mellouk ()]{b6}\label{b6} 	 		\textit{AMDR: A Reinforcement Adaptive Mean Delay Routing Algorithm for MANET},  		 			Abdelhamid Saida Ziane 		,  		 			Mellouk 		.  		2007.  	 
\bibitem[Deepalakshmi et al. (2009)]{b7}\label{b7} 	 		\textit{Ant Colony Based QoS Routing Algorithm For Mobile Ad Hoc Networks},  		 			P Deepalakshmi 		,  		 			. S Dr 		,  		 			Radhakrishnan 		.  		May 2009.  	 
\bibitem[Li and Garcia-Luna-Aceves (2006)]{b1}\label{b1} 	 		\textit{Finding multi-constrained feasible paths by using depth-first search},  		 			Zhenjiang Li 		,  		 			? J J Garcia-Luna-Aceves 		.  		July 2006.  	 
\bibitem[Abdullah et al. (2008)]{b11}\label{b11} 	 		‘GA-based QoS route Selection Algorithm for Mobile Ad-Hoc Networ:ks’.  		 			Jiwa Abdullah 		,  		 			M Y Ismail 		,  		 			N A Cholan 		,  		 			S A Hamnzah 		.  	 	 		\textit{Proceedings of IEEE 2008 6th National Conference on Telecommunication Technologies and IEEE 2008 2nd Malaysia Conference on Photonlis},  				 (IEEE 2008 6th National Conference on Telecommunication Technologies and IEEE 2008 2nd Malaysia Conference on PhotonlisPrjaya, Malaysia)  		26-27 August 2008.  	 
\bibitem[Thenmozhi (2010)]{b9}\label{b9} 	 		\textit{Highly Ensured QOS Routing in Mobile Ad Hoc Networks Based on Multiple Constraints},  		 			D S Thenmozhi 		,  		 			DrR 		.  		October 2010.  	 
\bibitem[Floriano De Rango et al. ()]{b14}\label{b14} 	 		‘Link-Stability and Energy aware Routing Protocol in Distributed Wireless Networks’.  		 			Francesca Floriano De Rango 		,  		 			Peppino Guerriero 		,  		 			Fazio 		.  	 	 		\textit{IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS}  		2012.  	 
\bibitem[Inhua Zhu and Wang ()]{b10}\label{b10} 	 		‘Model and Protocol for Energy-Efficient Routing over Mobile Ad Hoc Networks’.  		 			Xin Inhua Zhu 		,  		 			Wang 		.  	 	 		\textit{IEEE TRANSACTIONS ON MOBILE COMPUTING}  		NOVEMBER 2011. 10  (11) .  	 
\bibitem[Kone and Nandi ()]{b2}\label{b2} 	 		\textit{QoS Constrained Adaptive Routing Protocol For Mobile Adhoc Networks},  		 			Vinod Kone 		,  		 			Sukumar Nandi 		.  		2006.  	 
\bibitem[Xiao et al. ()]{b0}\label{b0} 	 		\textit{QoS Routing Protocol for Ad Hoc Networks with Mobile Backbones},  		 			Wendong Xiao 		,  		 			Hee Boon 		,  		 			Choi Look Soong 		,  		 			Yong Law 		,  		 			Liang Guan 		.  		2005.  	 
\bibitem[Ivascu et al. ()]{b13}\label{b13} 	 		‘QoS routing with traffic distribution in mobile ad hoc networks’.  		 			Gabriel Ivascu 		,  		 			Samuel Ioan 		,  		 			Alejandro Pierre 		,  		 			Quintero 		.  	 	 		\textit{Computer Communications}  		2009. 32 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
