\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={Cluster based Multicast Adhoc on Demand Routing Protocol for Increasing Link Stability in Manets},
 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{2017-01-15 (revised: 15 January 2017)}
\def\TheID{\makeatother }
\def\TheDate{2017-01-15}
\title{Cluster based Multicast Adhoc on Demand Routing Protocol for Increasing Link Stability in Manets}
\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.  Vijayalakshmi}

             \author[2]{Dr. D  Sreenivasarao}

             \affil[1]{  G.Narayanamma Institute of Technology and Science}

\renewcommand\Authands{ and }

\date{\small \em Received: 13 December 2016 Accepted: 5 January 2017 Published: 15 January 2017}

\maketitle


\begin{abstract}
        


The critical issues faced in the MANET energy consumption, QoS (Quality of Services), exposure to attacks, link stability. Link stability is much essential to be discussed for improving communication. ?Link Stability? is significant because radio links are generally varied due to node mobility. This instability leads to increased rerouting which further escalates routing overhead. One way of reducing routing overhead is to use multicasting instead of unicast routing. Multicast Routing Protocol transmits data concurrently to a group of destination nodes to achieve better resource utilization. This paper present a multicasting routing protocol Link Stability based Multicast Adhoc on demand routing protocol (LSMAODV) that uses received signal strength as a metric to estimate link stability and node stability. The comparison between AODV, MAODV and LSMAODV is measured for link and node stability. In this paper, three clusters are created and one node from each cluster is selected as cluster head based on the packet priority. This paper aims to find the link with high probability of longer lifetime between the nodes. The simulation are carried out and compared the result of the proposed routing protocol (LSMAODV) based on minimum hop count. Analysis of simulation results show improvement of various routing performance metrics such as routing overhead and packet drop ratio.

\end{abstract}


\keywords{link stability, node stability; multicast routing; mobile adhoc network.}

\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. INTRODUCTION}]{I. INTRODUCTION}\par
obile Adhoc networks (MANET) are collections of wireless mobile devices, which can communicate with each other without any infrastructure support. It is denoted as self-configured and self-maintained network. Every node in MANET acts as both the host and a router and it communicate with each other without the support of any fixed centralized control. In MANET, the mobile nodes are interconnected by multi-hop wireless links in a dispersed manner \hyperref[b0]{[1]}. The design of MANET routing protocol vary from wired network routing protocol; since a MANET is categorized by node mobility, node link unreliability, limited energy, limited bandwidth, high error rates, and security risk. The essential characteristics needed to design a routing protocol are dynamic topology, limited bandwidth, battery, CPU resources and multi-hop communication. There are many routing protocols projected for MANET. Based on the principles of routing, the protocols can be classified either proactive or reactive. Proactive routing protocols use to communicate regularly and update routes for every pair of nodes at every time of period. Every mobile node will operate as a sender, receiver or an intermediate node of the data in the system. Thus system will create the awareness towards the findings to deliver an outstanding merits and flexibility related to bandwidth spatial reuse, intrinsic fault tolerance and lowcost fast distribution \hyperref[b1]{[2]}. In the network, the each node receives the information from the packet and updates their interpretation by applying a shortest-path algorithm to find the next hop node to reach the endpoint.\par
The main principle of a MANET routing protocol develop a competent route between the communicating nodes to reach the end point. Thus, the message will deliver on time with less number of packets drops providing stable connectivity with less routing overheads. MANET routing protocol is generally classified into two types. They are table-driven and source-initiated \hyperref[b2]{[3]}. Table-driven routing protocol sustain with one or more tables at each node to save routing information. This protocol is used when there is a change in network topology in order to propagate the updates throughout the network to maintain a reliable network. Existing table-driven routing protocols include the following routing methods such as DSDV (Destination Sequenced Distance Vector) \hyperref[b3]{[4]}, CGSR (Cluster head Gateway Switch Routing) \hyperref[b4]{[5]}, and WRP (Wireless Routing Protocol) \hyperref[b5]{[6]}. Source-initiated routing protocols are used when a source node requests for a route. This protocol process is inspected with only the possible routes. For example, source-initiated protocols contain AODV (Ad Hoc on Demand Distance Vector) \hyperref[b6]{[7]}, DSR (Dynamic Source Routing) \hyperref[b7]{[8]}, TORA (Temporally Ordered Routing Algorithm) \hyperref[b8]{[9]}, ABR (Associativity Based Routing) and SSR (Signal Stability Routing) \hyperref[b9]{[10]}, etc.\par
Link stability rely on wireless link features such as link failures, packet loss rate, channel sensing rate, channel fading rate, bit error rate, band width fluctuations and environmental effects. The wireless channel variation due to the packet loss resulting in link failures and reduces link reliability. Thus, the failure in channel sensing and channel fading increase the errors that existing communication systems use checksum and sequence numbering for controlling the errors and some of them use positive recovery of packet retransmission. If checksum technique is not performed in the system then it affects the system performance. Similarly, Route stability relies on the performance of source, destination and intermediate nodes and the wireless channel connecting end-to-end route. When the lifespan of a route decreases, then the probability of end-to-end delivery can be improved with alternate routes between source and destination. Finally, to develop the route stability, there is a necessity to improve the constructed mesh based and multipath routing techniques.\par
The stability based routing protocols are intended to choose the stable route for passing through the stable links. These link stability and route stability protocols increases the lifetime of routing and the packet delivery. These protocols are compared with the shortest path routing protocols. Since mobile networks are very unstable links and the stability of routes becomes a main objective in the development of a mobile routing protocol. Communication links in Adhoc network are fundamentally unreliable because of their medium characteristics and varying internode distances due to node mobility. This leads to disconnection and result in reconfiguration of communication links. Each reconfiguration needs initiation of route discovery process and is expensive. Reconfiguration also expose to resourceconstrained network as mobile devices that constitute MANET have limited resources in terms of computing power, memory, transmission power, and battery life.\par
A major challenge of MANET is to implement QoS to prevention of attacks, reduction in energy consumption, incorporating fault-tolerance and delay of nodes \hyperref[b11]{[12]}. The primary objective of this paper is to improve QoS by improving the Priority based Adhoc on Demand Routing Protocol (PAODV) and thus increase the route stability through proper selection of links that are likely to be more stable. Some of the applications of MANET are rescue operations in military battlefield, disaster relief efforts, and audio and video conferencing. This applications needs support of survivable, reliable and efficient communication. Hence, this paper focus on developing a clustering based Priority Adhoc on demand routing protocol for increasing link stability and node stability in MANET. 
\section[{II. LITERATURE SURVEY}]{II. LITERATURE SURVEY}\par
Currently, there are several new multicast routing protocols are estimate to achieve efficient multicasting in MANET. Some of the routing protocols are Multicast Adhoc On-Demand Vector (MAODV), Adhoc Multicast Routing protocol Utilizing Increasing ID Numbers (AMRIS), Core Assisted Mesh Protocol (CAMP), Location Guided Tree (LGT), Lightweight Adaptive Multicast (LAM), and Differential Destination Multicast (DDM). The above protocols are mainly based on the features of distance vector routing or link-state routing with some benefits to help the routing process in definite ways \hyperref[b12]{[13]}. Many multicast routing protocols reviewed in \hyperref[b1]{[2]} which were scheduled to enhance QoS broadly and their behavior were assessed in terms of latency, packet loss ratio, jitter etc. Similarly, the performance in Ad-hoc networks was reviewed in \hyperref[b13]{[14]}. Collision is a major problem since it results in packet drops, extensive delay of data and queuing of packets. So, the performance of Ad-hoc networks also reduces adversely. Hence, this paper proposed the model framework with the Enhanced Cluster head Gateway Switch Routing Protocol (ECGSR) with the origin of Ad-hoc On-demand Distance Vector Routing (AODV) based technique collision evading. A new AODV routing protocol was presented in \hyperref[b14]{[15]}, to enhance the stable link. In this paper the parameters are used for the establishment of Quality of Service (QoS) by node stability, load stability and least residual distance in order to select the link to the endpoint. The result showed that the proposed protocol enhanced the performance. Thus, the proposed work did not measure the power of the received signal at the endpoint though moving over the route.\par
Similarly, \hyperref[b15]{[16]} examined an innovative Enhanced Adhoc On-demand Distance Vector (E-AODV) protocol which is related to AODV. AODV can be modified with reduced end to end delay with enriched packet distribution ratio. The ad hoc networks mainly select AODV protocols as it can deliver low routing overhead with high performance. His study proved that QoS in the MANET has no universally predefined parameters. But it was commonly a well-defined group of service quality which has the necessity to be achieved by the network while transferring a packet stream from a transmitter to its receiver end. The researchers also described that QoS is associated with certain parameters such as throughput, delay, and drop of packets. This would be established and approved by the mark of end user. QoS model also described an architecture that delivered the possible best facility.\par
Cluster Based Routing Protocol is intended to use in mobile ad hoc network (MANET). In this study, the mobile nodes of the Adhoc network is separated into a number of overlying or disjoints 2-hop distance clusters by the protocol in a dispersed manner \hyperref[b16]{[17]}. Among the clusters, a cluster head is selected to maintain the information of all the cluster members. By this cluster participation, the information from Inter-cluster routes are projected dynamically and kept at each cluster head. Thus, by using this clustering technique, the flooding traffic between the data communication and the route discovery is competently minimized by the protocol and speeds up this process as well. The MANET network has two main protocols that are Tree-based protocols and mesh based protocols. MAODV and ODMRP (On-Demand Multicast Routing Protocol) are two popular 
\section[{Global Journal of Computer Science and Technology}]{Global Journal of Computer Science and Technology}\par
Volume XVII Issue II Version I 2 Year 2017 ( ) E multicast routing protocols for tree-based and mesh based protocols, respectively.\par
The performance comparison and study of multicast protocols was reported by \hyperref[b17]{[18]} which affords a vision into the functionality and presentation. Similarly, \hyperref[b2]{[3]} justified MAODV as an on-demand routing protocol that determined the route only when a node has something to send. It is a hard state usage of protocol. This study revealed that if a member node of a multicast group needs to terminate its group membership, it must give a request for termination but, when a mobile node wants to join a multicast group or send a message but not having a route to the group, a Route Request (RREQ) was originated. All the nodes that are members of a multicast group and the non-member nodes that are not members of the group but their position are very critical for forwarding the multicast information that compose the tree structure. Every multicast group is recognized by a unique address and group sequence numbers for tracing the newness of the group situation.\par
In other study \hyperref[b19]{[19]} examined an ant metaphor in dynamic routing for MANET, where ants spread the gathered data to nearest sources. Thus the dispersed routing system for motor vehicles that direct them through the city using the shortest way in time and the account of load is described. Similarly, a routing protocol based on swarm intelligence by using ants was reported by \hyperref[b20]{[20]} where ants use heuristics to find the routes in multi-hop ad hoc networks. The other efficient hybrid multicast routing protocol suitable for high mobility applications was presented by \hyperref[b21]{[21]} that addresses the scalability issue of ODMRP protocol. The data forwarding path and join query forwarding path were separate in this protocol. A routing protocol for MANET named as terminates routing, which has the purpose for keeping the assistance of scalability by considering the locationbased routing, irregular topology and node mobility. A Mobility Prediction Aided Dynamic Multicast Routing (MPADMR) algorithm was proposed by \hyperref[b22]{[22]}. Hence, this algorithm contains two steps, the construction of link lifetime constrained minimum hop count multicast tree and the dynamic multicast tree maintenance procedure.\par
The other study proved by \hyperref[b23]{[23]} described multicast protocols performance characterization over a wide range of MANET situations. The performance of mesh and tree-based multicast routing schemes which related to flooding are evaluated and recommend by the protocols which is suitable for specific MANET situations. New algorithm for online multicast routing in ad hoc networks was proposed in \hyperref[b24]{[24]}. A two level management approach for efficient constructing and maintaining a QoS routing path in ad hoc wireless networks was proposed in \hyperref[b25]{[25]}. This scheme considerably reduced the quantity of control packets. So, for implementing realtime multicast services, degree constrained QoS aware routing algorithm was given by \hyperref[b26]{[26]}. This scheme increased the overall performance of application-layer multicast services. Hence, this study proposed the new algorithm to find the clustering based Priority Adhoc on demand routing protocol for increasing link stability and node stability in MANET.\par
Similarly, the researches \hyperref[b29]{[29]} established a Quality of Service (QoS) involved multi-cast routing protocol to select reliable neighbor nodes, which is named as QMRPRNS. Compared to other protocols this protocol have better reliability pair factor, hence it is preferable for reliable data transmission. QMRPRNS protocols select the route to transfer the data with more stability, reduced transmission delay. Further, it requires less time to data transmission, and the node failure probability is less due to QMRPRNS reliability pair factoring scheme. Moreover, these nodes have high reliability pair factor and associated with threshold reliability pair factor were designated for data transmission. 
\section[{III. Existing Protocols}]{III. Existing Protocols}\par
To increase the performance of the MANET, many researchers mainly suggest their view on the route discovery. In MANET the AODV routing protocol is mostly used for path discovery. The AODV routing protocol which creates less reactive routing protocol is used to determine the route after accepting the route request (RREQ) and the communication from the sender node. In this protocol, the route failure in the network was projected by sending the Route Error (RERR) indication message to the source node and it is achieved by the AODV protocol. Then the AODV resends the information's to the receiving node. In MANET system, MAODV is used to multicast the data packets. This multicast protocol creates the multicast group by developing the multicast tree. MAODV is the most effective protocol used for multicasting to provide service quality. The main drawbacks of MAODV and the chief principle of the group is it continuously send the multiple messages even if there is no transmitter, because of which the next sender will get delay and the controversy will be large in MAODV \hyperref[b27]{[27]}. Metric based enhancement to AODV protocol \hyperref[b11]{[12]} suggested reducing the link failure by picking the best link. Hence, this protocol accepts the route constancy to reach the endpoints. In order to avoid the overload of the messages due to traffic, the EM-AODV routing protocol supported various links as well as path to the endpoint. When compared with the AODV this protocol provides enhanced performance \hyperref[b28]{[28]}. The major drawback of reactive routing protocol is the respective route detection methods were not considered with loss of route reply message during data communication which indicates the drop of network efficiency. Hence, \hyperref[b29]{[29]} QMRPRNS: QoS based multicast routing protocol scheme only used to select reliable neighboring nodes for data transmission. 
\section[{IV. PROPOSED METHODOLOGY}]{IV. PROPOSED METHODOLOGY}\par
The study deployed few mobile nodes randomly in a specific region which are associated with some initial energy. Here a reliability pair factor (F th RP) = 2.8 is taken as a threshold value. However, in general the value of (F th RP) is application dependent and fixed by the system administrator. Since multicast routing in MANET for a group communication is needed to establish a reliable communication links among the neighbouring nodes.\par
So in order to overcome the limitations of the MAODV multicast routing protocol, this paper presents a Link Stability based Priority Multicast Adhoc on demand routing protocol. The proposed protocol is processed in several phases such as basic idea formulation, route discovery mechanism, route reply process and route maintenance process. 
\section[{a) Proposed Link Stability Based Priority Multicast}]{a) Proposed Link Stability Based Priority Multicast}\par
Adhoc On Demand Routing Protocol induced by mobility. For example, in Figure  {\ref 1}, route (P3) A ? C ? G ? J? L is established as soon as (P4) A ? D ? F ? M is disrupted because of movement of J. As a result, this mesh structure is more resilient to tree-like topology as there is no requirement to reconfigure the entire route in change of node position. 
\section[{b) Link Stability}]{b) Link Stability}\par
Fluctuating link stability induced by mobility and/or medium characteristics in wireless network impacts network performance. Efficiency of a dynamic routing protocol can be characterized by its ability to deal with link unreliability and routing overhead in terms of computation and reconfiguration/ rerouting (Torkestani, 2011).\par
Using link stability as a basis for routing decision can lead to protocol being, Less the link delay, smaller is the distance and hence more probability of link remaining intact. Smaller BER means higher bandwidth and better quality of link. 
\section[{c) Mathematical modeling of the proposed system}]{c) Mathematical modeling of the proposed system}\par
Link Stability is given by,2 , , 2\textbf{1}i j i j v DSS LS v v ? = ? (1)\par
Where, DSS is the differential signal strength. It is computed as follows., , , i j i j i j DSS SScur SSnew = ?\textbf{(2)}\par
Where, SS represents Signal Strength at nodes in the interval i and j. 
\section[{Global Journal of Computer Science and Technology}]{Global Journal of Computer Science and Technology}\par
Volume XVII Issue II Version I  
\section[{A path between source and destination is given as}]{A path between source and destination is given as}\par
Cluster based Multicast Adhoc on Demand Routing Protocol for Increasing Link Stability in Manets\par
? Energy Efficient: low communication and computation overhead as less number of link breaks reduces number of re-routings.\par
? Resilient to Mobility: links are selected to resist connectivity breaks for longer periods in events of node movements ? Stable: same path is sustained for longer duration reducing overhead on routing tables. Link stability can be estimated using parameters such as (1) Signal to interference plus noise ratio, (2) Energy, (3) Link Delay and (4) Bit Error Rate. If node has more energy, it is likely to remain alive for a longer duration and its transmission range is higher. 
\section[{Figure 1: Flow diagram of LS PMAODV}]{Figure 1: Flow diagram of LS PMAODV}\par
The flow of LS PMAODV protocol is illustrated in Figure  {\ref 1}. In this topology there is one sender, two receivers M and L (denoted by double ring). In LS PMAODV, forwarding nodes use the shortest path between multicast group members. Red arrow indicates 'JOIN Query' and blue arrow indicates 'JOIN Reply'. Weight on an arrow indicates hop count value for respective link. A link marked with both red and blue arrow is part of a path which returns back to source. Information about other possible paths is not discarded and is used to establish links in event of disconnections According to LS PMAODV protocol, minimum hop count is utilized to determine the paths between source and destination nodes. Figure  {\ref 1} shows paths between source A and destinations L and M is P3 and P4 that obtained from LS PMAODV protocol using minimum hop count while P3 and P4 are shown in Figure  {\ref 1}  The feasible path is represented by, ( , ) 0, 1,... 
\section[{P s d P P Pn = (4)}]{P s d P P Pn = (4)}\par
Here, P is define as the path stability, by the product of link stability of its edges as follows, Where, LS is the Link Stability. 
\section[{d) Algorithm of proposed protocol}]{d) Algorithm of proposed protocol}\par
In this section the algorithms for link stability discovery process and Link stability maintained process are provided.\par
i  
\section[{V. Results and Discussion}]{V. Results and Discussion}\par
The parameters used in stimulation, are shown in Table  {\ref I}. The proposed LS PMAODV protocol and the technique is implemented using Network Simulator 2 (NS-2) software. Generally, NS-2 is the most standard nonspecific network simulator which supports a wide range of protocols in all layers. It uses OTcl as configuration and script interface. NS-2 is the paradigm of reusability. The network size of the proposed simulation model in terrain area is 100 m x 100 m using Adhoc On-Demand Distance Vector (AODV) routing protocol for monitoring the important parameters like Packet Delivery Ratio (PDR), end-to-end Delay, energy consumption, network life time, computation overhead, connectivity, link stability and throughput. The parameters used in stimulation, which are shown in Table \hyperref[tab_2]{1}.\par
achieves high packet delivery ratio than other protocols. Fig.  {\ref 3} shows the packet delivery ratio for varied speed. The proposed protocol LS PMAODV has high packet delivery ratio when compared to other protocols.    
\section[{c) Energy Consumption}]{c) Energy Consumption}\par
The energy consumption is the total of utilized energy of the considerable number of nodes in the system, where the energy is utilized due to transmitting (P t ), reception (P r ), and initialization (Pi). Accepting every transmission expends a vitality unit, the aggregate energy utilization is proportional to the aggregate number of parcels sent in the system.        Connectivity plays the main role, which have the ability to report information to the fusion center, even though it has the critical for sensing the coverage. A wireless sensor network (WSN) is a network comprises of enough space for distributing the autonomous devices using sensors to screen the physical or environmental conditions. A WSN framework combines to form a portal that gives remote network which acts a backbone to the wired world and conveyed hubs.   \hyperref[fig_14]{12} shows the connectivity for different number of nodes. It is evident the proposed approach provide high connectivity than other protocols. From Fig Figure  {\ref 13}: Connectivity Vs Speed 
\section[{g) Link Stability}]{g) Link Stability}\par
Link Stability is a statistical-based approach has been adopted in order to discriminate among several links which are more stable for some periods of time without exactly predicting the residual link lifetime of each link. Thus, to enable mobile devices to make smart decisions in connection to the stability, a practical method is used, based exclusively on observations related to the link, in previous time instants. As a result, this analysis produces an evaluation of the link residual lifetime of the link, since the stability of a link is given by its probability of persisting for a certain time span.     
\section[{VI. Conclusions}]{VI. Conclusions}\par
This research paper describes the link stability based priority multicast Adhoc and demand distance vector routing protocol to enhance the route discovery of nodes which is stable of MANET .The proposed LSMAODV protocol is implemented using Network Simulator 2 (NS-2). The support level of predictable performance for network system is decreased the delay and to enhance the efficiency. The QoS metrics such as delay, energy consumption, an end to end latency, loss, overhead are minimized and PDR, throughput are enhanced using the proposed protocol compared to the existing AODV and MAODV routing protocols. The clustering arrangement stores the energy of the cluster member nodes. Hence, the proposed method is enormously energy efficient which is linked to the AODV and MAODV algorithm in achieving high QoS in MANET.\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-3.png}
\caption{\label{fig_2}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{37}\includegraphics[]{image-4.png}
\caption{\label{fig_3}Figure 3 : 7}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-5.png}
\caption{\label{fig_4}Figure 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-6.png}
\caption{\label{fig_5}Figure 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-7.png}
\caption{\label{fig_6}Fig. 6}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-8.png}
\caption{\label{fig_7}Figure 6 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7}\includegraphics[]{image-9.png}
\caption{\label{fig_8}Figure 7 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{8}\includegraphics[]{image-10.png}
\caption{\label{fig_9}Figure 8 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{9}\includegraphics[]{image-11.png}
\caption{\label{fig_10}Figure 9 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{10}\includegraphics[]{image-12.png}
\caption{\label{fig_11}Figure 10 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{11}\includegraphics[]{image-13.png}
\caption{\label{fig_12}Figure 11 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{10}\includegraphics[]{image-14.png}
\caption{\label{fig_13}Fig. 10}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{12}\includegraphics[]{image-15.png}
\caption{\label{fig_14}Figure 12 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{7}\includegraphics[]{image-16.png}
\caption{\label{fig_15}7}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{14}\includegraphics[]{image-17.png}
\caption{\label{fig_16}Figure 14 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1516}\includegraphics[]{image-18.png}
\caption{\label{fig_17}Figure 15 :Figure 16 :}\end{figure}
  \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.5479942693409743\textwidth}P{0.024964183381088825\textwidth}P{0.023137535816618912\textwidth}P{0.0012177650429799427\textwidth}P{0.0012177650429799427\textwidth}P{0.0006088825214899714\textwidth}P{0.0030444126074498567\textwidth}P{0.0012177650429799427\textwidth}P{0.017048710601719197\textwidth}P{0.007306590257879656\textwidth}P{0.0006088825214899714\textwidth}P{0.0024355300859598855\textwidth}P{0.0024355300859598855\textwidth}P{0.0006088825214899714\textwidth}P{0.13030085959885387\textwidth}P{0.08219914040114613\textwidth}P{0.003653295128939828\textwidth}}
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep 5. If the node\tabcellsep i N received the route repair reply\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep (RR\textunderscore REP) packet return from node\tabcellsep i N -1 within a\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep fixed timeout ( timeout T\tabcellsep ). Then\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep 6. The node\tabcellsep i N is ready to send a request packet\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep (RQ) to node j N .\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep 7. Else\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep 8. The node\tabcellsep i N send a route error (RE) packet to\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep source node S to restart the routing discovery\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep process\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep 9. End if\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep 10. End if\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep 11. End\\
1. Begin\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{2}{l}{2. Initialize}\tabcellsep F\tabcellsep th\tabcellsep RP\tabcellsep =\tabcellsep \multicolumn{3}{l}{2.8,}\tabcellsep RQ\tabcellsep =\tabcellsep \{ S\tabcellsep addr\tabcellsep ,\tabcellsep MC\tabcellsep addr\tabcellsep ,...\}\\
\multicolumn{15}{l}{and other fields of the request packet at S.}\\
\multicolumn{15}{l}{3. S broadcast the (RQ) packet to its adjacent nodes}\\
\multicolumn{15}{l}{those are coming in its transmission range.}\\
\multicolumn{15}{l}{4. For every packet request (RQ) packet attained at its}\\
\multicolumn{7}{l}{neighboring node do}\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{15}{l}{5. If there is no neighbor of a particular node which}\\
\multicolumn{7}{l}{broadcast the packet}\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{3}{l}{6. Go to step 17.}\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
7. Else\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{6}{l}{8. If RP F (Rec node) <}\tabcellsep F\tabcellsep th\tabcellsep RP\tabcellsep \multicolumn{4}{l}{value then}\tabcellsep \\
\multicolumn{5}{l}{9. Discard the packet}\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
10. Else\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{15}{l}{11. Store the request (RQ) packet at received node}\\
\multicolumn{15}{l}{header and broadcast further across the network.}\\
\multicolumn{15}{l}{12. Repeat step 3-13 until destination nodes received}\\
\multicolumn{9}{l}{the request (RQ) packets.}\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
13. End if\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{2}{l}{14. End for}\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
15. End\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{15}{l}{ii. Algorithm 2 (Link stability maintained process)}\\
1. Begin\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{2}{l}{2. If a node}\tabcellsep \multicolumn{13}{l}{i N send a request (RQ) packet to the}\\
node\tabcellsep \multicolumn{14}{l}{j N however, the node j N go out from the}\\
\multicolumn{15}{l}{transmission range of the node i N (i.e.) there is no}\\
\multicolumn{15}{l}{channel exist between the these two nodes then}\\
\multicolumn{8}{l}{3. At this stage the node}\tabcellsep \multicolumn{7}{l}{i N saves the current data}\\
\multicolumn{15}{l}{packet in its multicast routing information table}\\
\multicolumn{2}{l}{(MRIT)}\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{15}{l}{N -1 to repair the 4. After channel break down node i path.}\end{longtable} \par
 
\caption{\label{tab_1}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.5774456521739131\textwidth}P{0.27255434782608695\textwidth}}
Parameters\tabcellsep Values\\
No of nodes\tabcellsep 60\\
Number of clusters\tabcellsep 3\\
Network size\tabcellsep 1000 × 1000 m 2\\
Node placement\tabcellsep Random\\
Node mobility\tabcellsep Mobility\\
MAC layer protocol\tabcellsep IEEE 802.11\\
Simulation time\tabcellsep 100sec\\
Initial energy\tabcellsep 100j\end{longtable} \par
 
\caption{\label{tab_2}Table 1 :}\end{figure}
 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Rango et al. ()]{b17}\label{b17} 	 		\textit{},  		 			F Rango 		,  		 			De 		,  		 			P Fazio 		.  		2012.  	 
\bibitem[Huang and Shen ()]{b11}\label{b11} 	 		‘A comparison study of omnidirectional and directional MAC protocol for ad-hoc networks’.  		 			Z C Huang 		,  		 			C C Shen 		.  	 	 		\textit{IEEE Global Telecommunications Conference},  				2002. p. .  	 
\bibitem[Cheng et al. ()]{b25}\label{b25} 	 		‘A fast and efficient multicast algorithm for QoS group communications in heterogeneous network’.  		 			H Cheng 		,  		 			J Cao 		,  		 			X Wang 		.  	 	 		\textit{Computer Communications}  		2007. Elsevier. 30 p. .  	 
\bibitem[Jiang et al. ()]{b24}\label{b24} 	 		‘A prediction-based link availability estimation for routing metrics in MANETs’.  		 			S Jiang 		,  		 			D He 		,  		 			J Rao 		.  	 	 		\textit{IEEE/ACM Transactions on Networking}  		2005. 13 p. .  	 
\bibitem[Layuan and Chunlin ()]{b0}\label{b0} 	 		‘A QoS multicast routing protocol for clustering mobile ad hoc networks’.  		 			L Layuan 		,  		 			L Chunlin 		.  	 	 		\textit{Computer Commu-nications}  		2007.  (7)  p. .  	 
\bibitem[Royer and Toh (1999)]{b2}\label{b2} 	 		\textit{A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks},  		 			E Royer 		,  		 			Chai-Keong Toh 		.  		April 1999. IEEE Personal Communications. p. .  	 
\bibitem[Sutariya and Kamboj ()]{b1}\label{b1} 	 		\textit{A Survey of QOS Multicast Routing Protocol for MANET},  		 			D Sutariya 		,  		 			P Kamboj 		.  		2013. 73 p. .  	 
\bibitem[Perkins ()]{b6}\label{b6} 	 		\textit{Ad hoc On-Demand Distance Vector (AODV) routing},  		 			C Perkins 		.  		 \url{<http://www.ietf.org/rfc/rfc3561.txt>}  		2003.  	 	 (RFC3561[S) 
\bibitem[Ramanathan and Hain ()]{b26}\label{b26} 	 		\textit{An ad hoc wireless testbed for scalable, adaptive QoS support, Wireless Communications and Networking Conference},  		 			R Ramanathan 		,  		 			R Hain 		.  		2000. 3 p. .  	 
\bibitem[Shree and Garcia-Luna-Aceves ()]{b5}\label{b5} 	 		‘An efficient routing protocol for wireless networks’.  		 			M Shree 		,  		 			J J Garcia-Luna-Aceves 		.  	 	 		\textit{ACM Mobile Networks and Application Journal}  		1996. 1 p. .  	 
\bibitem[Geunes et al. (2002)]{b20}\label{b20} 	 		‘Ara-the ant-colony based routing algorithm for manets’.  		 			M Geunes 		,  		 			U Sorges 		,  		 			U 		,  		 			I Bouazizi 		,  		 			I 		.  	 	 		\textit{ICPP workshop on Ad Hoc Networks},  				August 2002. p. .  	 	 (IWAHN 2002) 
\bibitem[Biswas et al. (2004)]{b21}\label{b21} 	 		‘Efficient hybrid multicast routing protocol for ad-hoc wireless networks, local computer networks’.  		 			J Biswas 		,  		 			M Barai 		,  		 			S K Nandy 		.  	 	 		\textit{29th Annual IEEE International Conference on},  				November 2004. p. .  	 
\bibitem[Lakshmi and Sikamani ()]{b28}\label{b28} 	 		‘Energy-aware multicast opportunistic routing protocol (Eamor) to optimize lifetime of MANET’.  		 			S M Lakshmi 		,  		 			K T Sikamani 		.  	 	 		\textit{Current Trends in Engineering and Tech-nology (ICCTET), International Conference},  				2013. p. .  	 
\bibitem[Devarajan and Padmathilagam ()]{b13}\label{b13} 	 		‘Enhanced Cluster Gateway Switch Routing Protocol (ECGSR) for Congestion Control using AODV Algorithm in MANET’.  		 			K Devarajan 		,  		 			V Padmathilagam 		,  		 			An 		.  	 	 		\textit{International Journal of Computer Applications}  		2015.  (3)  p. 123.  	 
\bibitem[Viswanath et al. ()]{b23}\label{b23} 	 		‘Exploring mesh and tree-based multicast routing protocols for MANETs’.  		 			K Viswanath 		,  		 			K Obraczka 		,  		 			G Tsudik 		.  	 	 		\textit{IEEE Transactions on Mobile Computing}  		2006. 5  (1)  p. .  	 
\bibitem[Phate et al. ()]{b16}\label{b16} 	 		\textit{High temperature fiber optic laser-induced breakdown spectroscopy sensor for analysis of molten alloy constituents, Minimizing conges-tion and improved QoS of AODV using clustering in mobile ad hoc network},  		 			N Phate 		,  		 			M Saxena 		,  		 			M A Rizvi 		.  		2014. p. .  	 
\bibitem[Perkins and Bhagwat ()]{b3}\label{b3} 	 		‘Highly dynamic Destination Sequenced Distance-Vector routing (DSDV) for mobile computers’.  		 			C E Perkins 		,  		 			P Bhagwat 		.  	 	 		\textit{Proceedings of SIGCOMM'94 Conference on Communications Architectures, Protocol and Applications},  				 			T Imielinski,  			H Korth 		 (ed.)  		 (SIGCOMM'94 Conference on Communications Architectures, Protocol and ApplicationsLondon, UK)  		1994. ACM. p. .  	 
\bibitem[Vinay and Viradia ()]{b15}\label{b15} 	 		‘Improved AODV Routing Protocol for MANET’.  		 			P Vinay 		,  		 			Viradia 		.  	 	 		\textit{Journal of Engineering Research and Applica-tions}  		 2248-9622.  		2014. 4  (1)  p. .  	 
\bibitem[Link Stability and Energy Aware Routing Protocol in Distributed Wireless Networks IEEE Trans. on Parallel and Distributed systems]{b18}\label{b18} 	 		‘Link Stability and Energy Aware Routing Protocol in Distributed Wireless Networks’.  	 	 		\textit{IEEE Trans. on Parallel and Distributed systems}  		23 p. .  	 
\bibitem[Biradar et al. ()]{b19}\label{b19} 	 		‘Link stability based multicast routing scheme in MANET’.  		 			Rajashekhar Biradar 		,  		 			Sunilkumar Manvi 		,  		 			Mylara Reddy 		.  	 	 		\textit{Computer Networks}  		2010. 54  (7)  p. .  	 
\bibitem[Rong et al. ()]{b22}\label{b22} 	 		‘Mobility prediction aided dynamic multicast routing in MANET’.  		 			B Rong 		,  		 			G Amoussou 		,  		 			Z Dziong 		,  		 			M Kadoch 		,  		 			K E Ahmed 		.  	 	 		\textit{Proceedings of the IEEE/ Sarnoff symposium on advances in wired and wireless communication},  				 (the IEEE/ Sarnoff symposium on advances in wired and wireless communicationPrinceton, NJ)  		2005. p. .  	 
\bibitem[De et al. ()]{b14}\label{b14} 	 		‘Multicast over wireless mobile ad-hoc networks: present and future direc-tions’.  		 			M C C De 		,  		 			H Gossain 		,  		 			D P Agrawal 		.  	 	 		\textit{IEEE Network}  		2003. p. 5259.  	 
\bibitem[Chen and Wu ()]{b12}\label{b12} 	 		\textit{Multicasting techniques in mobile ad-hoc networks, The Handbook of Ad-hoc Wireless Networks},  		 			X Chen 		,  		 			J Wu 		.  		2003. p. .  	 
\bibitem[Yadav and Tripathi ()]{b29}\label{b29} 	 		\textit{Qmrprns: Design of qos multicast routing protocol using reliable node selection scheme for manets. Peer-to-Peer Networking and Applications},  		 			A K Yadav 		,  		 			S Tripathi 		.  		2016. p. .  	 
\bibitem[Chiang ()]{b4}\label{b4} 	 		‘Routing in clustered multihop mobile wireless networks with fading channel’.  		 			C C Chiang 		.  	 	 		\textit{Proceedings of the IEEE Singapore International Conference on Networks},  				 			T S Chua,  			H K Pung,  			T L Kunii 		 (ed.)  		 (the IEEE Singapore International Conference on NetworksSingapore)  		1997. Springer. p. .  	 
\bibitem[Sedrati et al. ()]{b27}\label{b27} 	 		 			M Sedrati 		,  		 			A Bilami 		,  		 			M Benmohamed 		,  		 			M-Aodv 		.  		\textit{AODV variant to Improve Quality of Service in MANETs, arXiv preprint arXiv},  				2011. p. .  	 
\bibitem[Dube et al. ()]{b9}\label{b9} 	 		‘Signal stability based adaptive routing for ad hoc mobile networks’.  		 			R Dube 		,  		 			C D Rais 		,  		 			K Wang 		,  		 			S K Tripathi 		.  	 	 		\textit{IEEE Personal Communications}  		1997. 4 p. .  	 
\bibitem[Park and Corson (1997)]{b8}\label{b8} 	 		\textit{Temporally ordered routing algorithm (TORA) version 1: functional specification, Internet Draft, draft-ietfmanet-toraspec-00.txt},  		 			V D Park 		,  		 			M S Corson 		.  		November 1997.  	 
\bibitem[Johnson et al. ()]{b7}\label{b7} 	 		\textit{The dynamic source routing protocol for mobile ad hoc networks, Internet Draft, draft-ietfmanet-dsr-10.txt},  		 			D B Johnson 		,  		 			D A Maltz 		,  		 			Y C Hu 		.  		2004.  	 
\bibitem[
			Charles
		 ()]{b10}\label{b10} 	 		\textit{Wireless access technology -WiFi and WiMAX},  		 			Charles 		.  		 \url{http://network.chinabyte.com/222/12223722.shtml}  		July 2014. 2011.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
