\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={MALMR: Medium Access Level Multicast Routing for Congestion Avoidance in Multicast Mobile Ad Hoc Routing Protocol},
 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{2012-01-15 (revised: 15 January 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-01-15}
\title{MALMR: Medium Access Level Multicast Routing for Congestion Avoidance in Multicast Mobile Ad Hoc Routing Protocol}
\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]{  G.S.Sreedhar}

             \author[2]{Dr.  A.Damodaram}

             \affil[1]{  Jawaharlal Nehru Technological University - Hyderabad.}

\renewcommand\Authands{ and }

\date{\small \em Received: 12 December 2011 Accepted: 3 January 2012 Published: 15 January 2012}

\maketitle


\begin{abstract}
        


This paper is focused on a new solution for congestion avoidance in ad hoc multicast routing by bearing the congestion situations. As the routing strategy belongs to Medium Access Level, the routing strategy is named Medium Access Level Multicast Routing short MALMR. MALMR is aimed at Congestion Avoidance in Multicast Mobile Ad hoc routing protocol. The present MAC level routing strategy is independent which can work with any multicast routing protocol irrespective of tree or mesh structure. During the study of MALMR performance, the MALMR tested along with On-Demand Multicast Routing Protocol where simulation results proved that MALMR raises the performance of ODMRP in order of magnitude.

\end{abstract}


\keywords{Multicast, on-demand routing, congestion control, ad hoc network, MALMR.}

\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
reat numbers of routing protocols for Ad Hoc network are presented by classifying from many aspects. Protocols are of three types such as reactive protocols, proactive protocols and composite protocols that integrate the discovering process of the above ones. Depending on the structure of network topology, the protocols are divided in two types. They are plane ones and clustering ones. Depending on load balance mechanism, the protocols are grouped as single path ones and multi-path ones. A great number of routing protocols such as Dynamic Source Routing (DSR), Ad Hoc On-Demand Distance Vector Routing (AODV), Destination-Sequenced Distance-Vector Routing (DSDV), Temporally Ordered Routing Algorithm (TORA) and Zone Routing Protocol (ZRP), are identified but the possibility of using them and their efficiency remained doubt in view of the only min-hop metric as routing selection criterion. MANET has no difference between a host and a router, because all nodes are senders or receivers and also forwarders of traffic where all MANET members can deleted easily. Having high mobility nature, MANETs can be used in the environments, which need robust and reliable capacity like military battlefield, emergency rescue, vehicular communication, mining operations etc. For these applications, multicast is paramount and helpful in holding down network bandwidth and resources, as one message from one source can be sent to multiple receivers at a time. The main risk for multicast routing in MANETs is maintaining of robust capacity even in the condition of frequent, mainly high-speed agility and nodes outages. So mesh-based protocols builds a mesh for forwarding multicast packets for sending even in the presence of links breaking, and reaches robustness and reliability demands with path repetition owing to meshes on networks. Present multicast routing protocols for MANET is divided into two types: treebased and mesh-based protocols. The tree based ones, i. e. MAODV (Multicast of Ad hoc On Demand Distance Vector) generally have tree-based schemes, unfits highspeed ad hoc networks. Common mesh-based multicast routing protocol is ODMRP (On-Demand Multicast Routing Protocol) \hyperref[b1]{[2]}, that uses the concept of forwarding group, builds multicast mesh that is done in soft state and acquires high performance \hyperref[b2]{[3,}\hyperref[b3]{4]}. In \hyperref[b4]{[5]}, V.  {\ref Kumar, et al.} obtains comparative conclusions about MAODV and ODMRP based on the simulation results. Even though the performance of all multicast protocols degrade in terms of packet sending and group reliability as node mobility and traffic load augments, mesh-based protocol ODMRP do better job than tree-based protocol MAODV. ODMRP can bring forth decent robustness based on its mesh structure. MAODV performs less when compared to other protocols in packet delivery ratio and group reliability. 
\section[{II.}]{II.} 
\section[{Related work}]{Related work}\par
Based on the researches on real life Ad Hoc network and references, it is seen that a prodigious of real life Ad Hoc networks works without following rules which are included in our theoretical analysis. In contrast to above, selfish nodes hinder the network process. The selfish nodes are intended in participating of the natural network information exchange procedure like routing discovery, routing maintenance and packets forwarding etc. The reason for selfishness of these nodes comes from the various advantages of various organizations who own the various groups of nodes. Because of the existence of selfish nodes, a few relay nodes remains as "hot spots" which leads to "death" due to power decrease resulting in total disabling of entire network.  \hyperref[b5]{[6]} that, particular nodes in an Ad Hoc network might become antagonistic and thus refuse to cooperate with each other. In addition to, Ad hoc network posses semiautonomous nodes owned by different entities may not be distributed with common goal, and thus the nodes may not work together which is supposed to do. In \hyperref[b6]{[7]}, Buttayan et.al; presented "Nuglets" protocol for reducing the impact of nodes selfishness on entire network performance. The effectiveness gets "rewards" and in efficiency will be given "penalties"; In \hyperref[b7]{[8]},"SPRITE" protocol is designed to control the selfishness by constructing a credit clearing service(CCS) server which provides a credit to every node in the network. The node selection depends on its credit for path. The above mentioned protocols focused on selfishness of nodes and how to overcome this selfishness. Whatever may so, implementation contains complexity in the channel fading, retransmission and collision etc. Thus these protocols remain incompetent. 
\section[{III.}]{III.} 
\section[{Medium access level multicast routing (malmr)}]{Medium access level multicast routing (malmr)}\par
The core point of MALMR is reliability transmission of every packet to every neighbor. The presented MALMR designed using a transmission window structure that influenced by IEEE 802.11 transmission structure, thus a brief operational overview of 802.11 transmissions is as follows. a) IEEE 802.11 Transmission Overview IEEE 802.11 used a collision avoidance scheme including RTS/CTS/ACK control frames for transmission of unicast packets. In 802.11, the Distributed Coordination Function (DCF) shows the basic access method that mobile nodes uses for sharing wireless channel. The scheme combines CSMA with Collision Avoidance (CSMA/CA) and acknowledgement (ACK). The mobile nodes based on need they can use the virtual carrier sense mechanism which provided RTS/CTS exchange for channel reservation and fragmentation of packets in situations. The CSMA/CA works in transmission of senses the channel. If the channel is free for a time equal to the DCF Inter Frame Space (DIFS) interval, the node transmits. If the channel is busy, the node enters a state of collision avoidance and backs off from transmitting for a specified interval. In the collision avoidance state, the node sensing the channel busy will suspend its back off timer, only resuming the back off countdown when the channel is again sensed free for a DIFS period. Common sequence of exchanges in 802.11 utilizing the virtual carrier sensing mechanism contains the source node first sensing the channel utilizing CSMA/CA. After the execution of CSMA/CA, RTS is transmitted by the source node, which follows responding of node with CTS, after responding the source node sends the data frame and subsequently with the conformation of destination node with an ACK to the source node. Receiving RTS, CTS or data frame is not real destination of any node but it should complete the data exchange is real destination of node. For broadcast packets, IEEE 802.11 nodes simply execute collision avoidance and then transmit the data frame. b) MALMR Transmission Window Structure MALMR, multicast node nm need to manage two lists, target nodes list (TNL), which is hop level destinations, Frames Sent (FS), transmission history. Receptions of frames (RTS/CTS/DATA/ACK/HELLO) are used by nm to maintain track of its targeted nodes. Every nm also maintains a FS. The FS contains copies of the frames which are already transmitted which may be need even later for retransmission. After receiving by neighbor a copy will be removed from the FS. FS size must be larger than targets number for any nm . In addition to the FS, there is possibility of storing yet to be transmitted packets which is called. Every target node maintains a list for frame received which is symbolized as FR. FR stores when a target node receives a new frame, it records the frame's sequence number in FR.\par
When a nm node transmits RTS to a destination node specifying a range of (from and to) sequence numbers, the destination node examines its FR to determine whether it is missing any previous sequence numbers in the specified range. If so, the destination node replies with the missing sequence number in the CTS response.\par
Generally in MALMR, If an " nm " has to transmit a packet, it should first test the channel and then a collision avoidance (CSMA/CA) step like that of 802.11. After the collision avoidance step completion the channel becomes free, the nm sends RTS to its target picked from TNL from particular range of sequence numbers which are already sent where the present sequence number is to be transmitted. All the process will be achieved by pulling the least sequence number from the FS and defining it into the RTS frame with the present sequence number which is expected by the source node. After receiving the RTS, the determine target test its FR and decides the needed sequence numbers. CTS response frame will react if the target node doesn't find precedent sequence number.\par
Similarly, CTS response frame will also react even in case of present sequence number. All other targets hearing the RTS will yield long enough for the CTS/DATA/ACK transmission. Upon the receiving of the CTS, the " nm "transmits the DATA (packet) according to the sequence number determined in the CTS frame. After receiving the DATA, the target node updates its FR and answer with an ACK. Remaining neighboring nodes which receive the DATA updates their FR. After receiving the ACK, if the DATA sent DATA is wrong but obtain from the buffer, the source node its process with the destination node with another RTS until the present( D D D D ) E 2012\par
Year DATA is sent from the queue. After transmission of the present DATA and acknowledged, the source node then buffers the packet and chooses the next neighbor in its NEIGHBOR LIST and repeats the whole process over again then the collision avoidance step is neglected. In MALMR, ordered first strategy is used that picks a target node from TNL chronologically. During this process target nodes order changes depending on their current ingress ability status. The ordered first strategy sends packets and works comfortably. If, there are no packets for transmission of queue, the ordered first process will be stopped until next target in the TNL received all the broadcast DATA until there is a new packet to send. For preventing this, MALMR utilizes flag cs that set to true and then next node in the TNL will be selected and the ordered first process repeats. In between if new sequence numbers joined then flag cs will be set false then remaining targets are visited in the ordered first process without considering the current sequence numbers if any. Upon the completion of RTS to all targets in ordered first process if still no new sequence numbers are identified then ordered first process stops the RTS process till there a new packet is ready for transmission. If new sequence numbers is identified then the flag cs sets wrong and ordered first process repeats.\par
IV. 
\section[{Congestion avoidance in odmrp using malmr}]{Congestion avoidance in odmrp using malmr}\par
A few multicast routing protocols contains AMRoute \hyperref[b8]{[9]}, AMRIS \hyperref[b9]{[10]}, CAMP \hyperref[b10]{[11]} , multicast AODV \hyperref[b11]{[12]}, and the On-Demand Multicast Routing Protocol (ODMRP) \hyperref[b12]{[13,}\hyperref[b13]{14,}\hyperref[b14]{15]}. ODMRP distracts multicast packets on a mesh in place of the traditional multicast tree. By utilizing a mesh, ODMRP bring out excess to combat packet loss in ad hoc networks where channel noise, collisions and mobility are universal. With low traffic load, ODMRP does efficiently. Nevertheless, as traffic load augments, ODMRP continuously suffers from network congestion. Though this disadvantage is not limited to ODMRP it is wide spread among other multicast protocols. The present paper introduces a new MAC protocol, MALMR that allows reliable MAC broadcast in ad hoc networks. In addition to, by excess using MALMR, it is said that congestion control in ODMRP decreases network load when contention is high. This MALMR is not limited only to ODMRP but can apply even on other multicast protocols, like multicast AODV. ODMRP protocol is explained in the sub section I and ODMRP with our congestion avoidance scheme MALMR is explained in the sub section ii where simulation results are provided in section 4. Subsequently, section 5 explains the conclusion of the paper. a) On-Demand Multicast Routing Protocol ODMRP creates a group-shared forwarding mesh for every group. Every source carries out periodic flood-response cycles creating multicast forwarding state without depending on present forwarding state. The frequent state discovery helps the protocol to find the present simple paths between every source and the multicast receivers and develops the boisterous protocol due to multiple forwarding paths may present between group members. Due to this ODMRP's packet send number of sources and receivers per multicast group augments and even sometimes increases mobility: the repeat forwarding state devises ODMRP's packet produces ability due to it behaves error correction, and does the protocol robust to mesh. Nevertheless, the frequent identification produces and great number of data transmissions identically augments network load.\par
Ever multicast source for a group G in ODMRP regularly moves the network with a JOIN QUERY packet that forwards by all nodes in the network. REFRESH INTERVAL, e. g., every 3 seconds send by this packet. Every multicast receiver reacts to this flow by delivering a JOIN REPLY packet that is forwarded in a simple path back to the multicast source that started the QUERY. Anterior of forwarding the packet, every node waits for JOIN AGGREGATION TIMEOUT, and mixes all JOIN REPLYs for the group received during this time into one JOIN REPLY. Every node that forwards the REPLY packet generates (or refreshes) forwarding state for group G.\par
Every node with forwarding state for G forwards every data packet delivered by a multicast source for G. A data packet use the simplest paths to the multicast receivers within the forwarding mesh, it may even forwarded to other sources of the group who are group members. Forwarding state is ceased after a multiple of regular breaks to assure that in the event that some number of forwarding nodes' multicast state is not refreshed due to packet loss, the forwarding state generated from a earlier flood is also authenticated. This mechanism develops the boisterous protocol, where many overlapping trees will be activated in the network parallel; everything is produced finally by JOIN QUERY flood \hyperref[b15]{[16]}.  
\section[{Year}]{Year}\par
In MALMR, route finds is started and managed by the source. When the source contains packets for transmission for a certain multicast group, the source first decides if there is a route to the group. If a route is not present, MALMR tries to create one through the route finding process. The route finding process is equal to on-demand unicast routing protocols like AODV \hyperref[b16]{[17]} and DSR \hyperref[b17]{[18]}. Route discovery process has two steps.\par
In the request round, the source moves the network with a member advertisement packet with the data piggybacked which is named as JOIN QUERY. These JOIN QUERY packets regularly broadcast to the total network to refresh membership information and recreate new multicast routes. After receiving a nonduplicate JOIN QUERY, a node inserts or updates in its ROUTING TABLE the upstream node indicates as the next node to the source node. The ROUTING TABLE can also be utilized even in a JOIN REPLY depending on need of the source during the reply round, called as backward learning \hyperref[b18]{[19]}.\par
After reaching a non-duplicate JOIN QUERY to multicast member the reply round starts. In the reply round, the multicast member generates and broadcasts JOIN REPLY packet to the network with the address of the node the member receives the JOIN QUERY from stamped in the JOIN REPLY. After receiving the JOIN REPLY, a node decides if its address is stamped in the JOIN REPLY. If so, the node knows it is on the path to the source and set the path FORWARDING\textunderscore GROUP\textunderscore FLAG and be a part of the forwarding group. After that, the node resends JOIN REPLY with the upstream node address to the source stamped in the JOIN REPLY. The upstream node address is got from the ROUTE TABLE via backward learning. This process goes on until the JOIN REPLY meets the source. The source receives JOIN REPLY, a mesh of nodes, or forwarding groups, is formed and packets can be sent to the members.\par
ODMRP manages the group by regular broadcasting JOIN QUERY to the network and receiving JOIN REPLY. The regular broadcast of JOIN QUERY updates the forwarding group nodes and takes membership fluctuations. 
\section[{b) On-Demand Multicast Routing Protocol With Congestion avoidance}]{b) On-Demand Multicast Routing Protocol With Congestion avoidance}\par
To accomplish congestion avoidance, MALMR is utilized as the underlying MAC layer. MALMR is needed because ODMRP broadcasts data packets to all neighbors in spite of sending them point-to-point to choose individual neighbors, as causally done by multicast protocols. The underlying MAC protocol utilized for broadcast, CSMA avoiding ACK. CSMA, the queue length will denote perfect measure of congestion. Broadcast packets are sending "blindly". If the packet is not reached because of receive-buffer excess flow or channel congestion. it is stopped and no retransmission is done. Accordingly, even in presence of congestion, the queue length is small. In opposite to, the version of the IEEE 802.11 protocol utilized in unicast, point-topoint transmissions is filled with RTS and CTS control packets and ACKs. It is used against receive-buffer overflow and hidden terminals, and thus supplies perfect congestion feedback. This unicast version accordingly is not so attractive for multicast applications because it cannot misuse "broadcast advantage" of the wireless channel, and needs an individual transmission to every multicast member. Hence, MALMR is required to perfect description of the network state via queue lengths as MALMR supply reliable delivery of packets that are broadcasted in the context of multicast.  ) is used. We now imagine that node H5 desires to multicast packets to H1, H4, H6, H9 in Figure  {\ref 3 and fig 4}. At the stage of transmitting first packet Node H5 first decides a target node H1 from TNL and sends RTS with sequence numbers ranging from f0 to f0 since no DATA frames have yet been sent. Node H1, upon receiving the RTS frame, responds with sequence number f0 in the CTS frame. Nodes H6, H9, and H4, after receiving the RTS frame, gives for the CTS/DATA/ACK interchange between node H5 and H1. After receiving the CTS frame, node H5 multicasts DATA with sequence number 0 in broadcasting manner. Node 1, after receiving DATA, updates its FR and responds with an ACK. For explanation requirement, a node H6 did not receive the DATA (possibly due to interference from neighboring nodes) while node H9 and H4 received the DATA perfectly. Hence, node H9 and H4 also update their RF. After receiving the ACK, node H5 copies the DATA that was delivered into the FS and goes on to choose nodes from TNL in ordered first form.\par
If we imagine that node H6 chosen in order as immediate neighbor for transmission after executing the collision avoidance round, node H5 delivers RTS with sequence number range f0 to f1. After receiving the RTS, node H6 looks its FR and noticed that frame f0 haven't received. Node H6 then delivers CTS desired sequence number f0. Node H5, after receiving the CTS, gets the DATA with sequence number f0 from the FS and transmits the DATA. After receiving the DATA, node H6 updates its FR and responds with an ACK. Upon receiving the ACK, node H5 delivers RTS repeatedly with sequence number range f0 to f1 since the most recent DATA will not been sent. Node H6, after receiving the RTS, delivering CTS with sequence number 1 after checking its FR. Node H5, upon receiving the CTS, sends the DATA with sequence number f1. Node H6, after receiving the DATA, response with an ACK Again, for explanation process , let's say nodes H1, H9 and H4 receive the DATA and update their respective FR. Node H5, after receiving the ACK, buffers the DATA in FS and selects node H9 as its immediate neighbor. After the collision avoidance round, node H5 transmits RTS with sequence number range f0 to f2. After receiving the RTS, node H9 inquiry its received sequence number list and delivers CTS requesting sequence number f2 (since f0 and f1 were successfully received previously). Node H5, after receiving CTS, transmits DATA with sequence number f2. Node H9, after receiving DATA, transmits ACK and updates its FR. Node H5, after receiving ACK, buffers the DATA in FS, choose node H4 as it's immediate neighbor to transmit to, and the process starts again . In this process if node H5 found that no data with new sequence numbers available, then it set flag cs true and goes on delivering RTS with sequence range already delivered and cached in FS to nodes in TNL in ordered first form. After sending RTS to all the nodes in TNL, checks for data. If still no data with new sequence numbers then this process stops till it discovers data with new sequence numbers. If data is discovered with new sequence number then flag cs sets to wrong and promotes multicast process.\par
ii. 
\section[{MALMR Algorithm}]{MALMR Algorithm}\par
Description of the notations I.\par
nm ?Node participating in multicasting II.\par
nu ?Node participating in one of the unicasting path of nm Table1 : Simulation parameters that we considered for experiments\par
The metrics to verify the performance of the present protocol as follows: ? Data packet delivery ratio: Data packet delivery ratio is calculated as the ratio between the number of data packets that are delivering by the source and the number of data packets that are received by the sink.\par
( D D D D )\par
Figure \hyperref[fig_4]{5}(a) displays the Packet Delivery Ratio (PDR) for ODMRP \hyperref[b14]{[15]} and ODMRP with MALMR. Depending on the results it is clear that MALMR reduces the loss of PDR that observed in ODMRP \hyperref[b14]{[15]}. The approximate PDR loss recovered by MALMR over \hyperref[b14]{[15]} is 14. 471\%, this is an average of all pauses. The minimum individual recovery observed is 5. 91\% and maximum is 30. 345\%. The packet delivery fraction (PDF) is denoted as:   \hyperref[b14]{[15]} where the magnitude growth in packet overhead in different pause intervals. Because of congestion avoidance routing mechanism of MALMR this benefit is possible. The average Packet overhead observed for 12 intervals in ODMRP with MALMR is 117. 9 more than packet overhead observed for 12 intervals in ODMRP. But the average growth of the packet over head in ODMRP is 26. 36\%, but in the case of ODMRP with MALMR, the average growth in packet over head is 3. 34\%. This advantage of ODMRP with MALMR over ODMRP happens due to the collision and congestion avoidance strategy introduced in MALMR. The advantage of ODMRP with MALMR over ODMRP in MAC load overhead control is shown in the Figure \hyperref[fig_4]{5}(c), . The average growth in MAC load over head in ODMRP with MALMR is 14. 32\% is almost equal to MAC load overhead in ODMRP, which are 14. 17\%, this resulted due to multicasting of the packets in MALMR to all target nodes unlike in ODMRP, a unicasting packet. 
\section[{VI. Conclusion}]{VI. Conclusion}\par
This paper expatiate a MAC level multicast routing algorithm called "Medium Access Level Multicast Routing" i. e. MALMR. The present routing strategy aims at avoidance of congestion at group levels formed in multicast route discovery. This protocol derives an algorithm that transmits the data in multicast manner at group level unlike other multicast protocols, concentrating of data transmission in a sequence to every targeted node. Being independent, the MALMR works with group of either tree or mesh. The present mentioned MALMR is tested by associating with ODMRP where the simulation results indicated that the MALMR improves the PDR and reduces the Packet overhead of ODMRP in order of magnitude. It is further planned to develop an extension to MALMR which can even control the congestion besides avoiding congestion.\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_1}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1234}\includegraphics[]{image-3.png}
\caption{\label{fig_2}Fig. 1 :Fig. 2 :Fig. 3 :Fig. 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_3}P}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-5.png}
\caption{\label{fig_4}Fig. 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.09166666666666667\textwidth}P{0.7583333333333333\textwidth}}
\tabcellsep D D D D )\\
\tabcellsep (\\
III.\tabcellsep TNL ?Target Node List\\
IV.\tabcellsep nm bp ?Buffer of Packets to multicast at nm\\
VII.\tabcellsep cs ? Boolean flag\end{longtable} \par
  {\small\itshape [Note: V.nm FS ? Buffer of Frames already sent by nm VI.tn FR ?Buffer of frames received by target node tn that listed in TNL]} 
\caption{\label{tab_1}table 1 .}\end{figure}
 			\footnote{© 2012 Global Journals Inc. (US)} 			\footnote{© 2012 Global Journals Inc. (US) Global Journal of Computer Science and Technology} 		 		\backmatter  			 
\subsection[{Year}]{Year}\par
? Packet Delivery Fraction: It is the ratio of data packets send to the destinations to those created by the sources. The PDF says about the performance of a protocol that how successfully the packets have been send. Higher the value produces the better results. ? Average End to End Delay: Average end-to-end delay is an average end-to-end delay of data packets. Buffering during route discovery latency, queuing at interface queue, retransmission delays at the MAC and transfer times, may cause this delay.\par
Once the time difference between packets sent and received was recorded, dividing the total time difference over the total number of CBR packets received provided the average end-to-end delay for the received packets. Lower the end to end delay better is the performance of the protocol. ? Packet Loss: It is defined as the difference between the number of packets sent by the source and received by the sink. In our results we have calculated packet loss at network layer as well as MAC layer. The routing protocol forwards the packet to destination if a valid route is known; otherwise it is buffered until a route is available. There are two cases when a packet is dropped: the buffer is full when the packet needs to be buffered and the time exceeds the limit when packet has been buffered. Lower is the packet loss better is the performance of the protocol. ? Routing Overhead: Routing overhead is calculated at the MAC layer which is defined as the ratio of total number of routing packets to data packets.			 			  				\begin{bibitemlist}{1}
\bibitem[Madhan et al. ()]{b3}\label{b3} 	 		‘A Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks’.  		 			P Madhan 		,  		 			J James 		,  		 			K Murugan 		,  		 			V Ramachandran 		.  	 	 		\textit{9th International Conference on High Performance Computing (HiPC)},  				2002.  	 
\bibitem[Lee et al. ()]{b2}\label{b2} 	 		‘A performance comparison study of ad hoc wireless multicast protocols’.  		 			S J Lee 		,  		 			W Su 		,  		 			J Hsu 		,  		 			M Gerla 		,  		 			R Bagrodia 		.  	 	 		\textit{Proceedings of the IEEE INFOCOM'00},  				 (the IEEE INFOCOM'00)  		2000.  	 
\bibitem[Lee et al. (2000)]{b13}\label{b13} 	 		‘A Performance Comparison Study of Ad Hoc Wireless Multicast Protocols’.  		 			S.-J Lee 		,  		 			W Su 		,  		 			J Hsu 		,  		 			M Gerla 		,  		 			R Bagrodia 		.  	 	 		\textit{Proceedings of IEEE INFOCOM2000},  				 (IEEE INFOCOM2000Tel Aviv, Israel)  		Mar. 2000.  	 
\bibitem[Zhong et al. ()]{b7}\label{b7} 	 		‘A Simple, Cheat-proof, Credit-based System for Mobile Adhoc Networks’.  		 			S Zhong 		,  		 			J Chen 		,  		 			R Yang Sprite 		.  	 	 		\textit{IEEE INFOCOM},  				 (San Francisco, USA)  		2002. IEEE Press.  	 
\bibitem[Wu et al. (1998)]{b9}\label{b9} 	 		\textit{Ad hoc Multicast Routing Protocol utilizing Increasing id-numberS (AMRIS) Funcational Specification},  		 			C W Wu 		,  		 			Y C Tay 		,  		 			C.-K Toh 		.  		Nov. 1998.  	 	 (Internet-Draft, draft-ietf-manet-amris-spec-00.txt. Work in progress) 
\bibitem[Perkins and Royer (1999)]{b16}\label{b16} 	 		‘Ad-Hoc On Demand Distance Vector Routing’.  		 			C E Perkins 		,  		 			E M Royer 		.  	 	 		\textit{Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA)},  				 (the 2nd IEEE Workshop on Mobile Computing Systems and Applications (WMCSA)New Orleans, LA)  		Feb. 1999.  	 
\bibitem[Keshav ()]{b18}\label{b18} 	 		\textit{An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network},  		 			S Keshav 		.  		1997. Menlo Park, California: Addison-Wesley.  	 
\bibitem[Haartsen et al. (1998)]{b15}\label{b15} 	 		‘Bluetooth: Vision, Goals, and Architecture’.  		 			J Haartsen 		,  		 			M Naghshineh 		,  		 			J Inouye 		,  		 			O J Joeressen 		,  		 			W Allen 		.  	 	 		\textit{ACM SIGMOBILE Mobile Computing and Communications Review}  		Oct. 1998. 2  (4)  p. .  	 
\bibitem[Dewan et al. (2004)]{b5}\label{b5} 	 		 			Prashant Dewan 		,  		 			Partha Dasgupta 		,  		 			Amiya Bhattacharya 		.  	 	 		\textit{On Using Reputations in Ad hoc Networks to Counter Malicious Nodes" Tenth International Conference on Parallel and Distributed Systems},  				2004. 2004. July 2004.  	 
\bibitem[Johnson and Maltz (ed.) ()]{b17}\label{b17} 	 		\textit{Dynamic Source Routing in Ad Hoc Wireless Networks},  		 			D B Johnson 		,  		 			D A Maltz 		.  		Tomasz Imielinski and Hank Korth (ed.)  		1996. Kluwer Academic Pusblishers.  	 	 (Mobile Computing) 
\bibitem[Butty´an and Hubaux ()]{b6}\label{b6} 	 		‘Enforcing Service Availability in Mobile Adhoc WANs’.  		 			L Butty´an 		,  		 			J.-P Hubaux 		.  	 	 		\textit{ACM international symposium on Mobile ad hoc networking and computing},  				 (Boston, Massachusetts)  		2000. ACM Press. p. .  	 
\bibitem[Kumar et al. ()]{b4}\label{b4} 	 		‘Exploring meshand tree based multicast routing protocols for MANETs’.  		 			V Kumar 		,  		 			O Katia 		,  		 			T Gene 		.  	 	 		\textit{IEEE Transactions on Mobile Computing}  		2006. 5 p. .  	 
\bibitem[Lee et al. (2000)]{b14}\label{b14} 	 		\textit{Internet Draft, draftietf-manet-odmrp-02.txt},  		 			S.-J Lee 		,  		 			W Su 		,  		 			M Gerla 		.  		Jan. 2000.  	 
\bibitem[Bommaiah et al. (1998)]{b8}\label{b8} 	 		\textit{Internet-Draft, draft-talpade-manet-amroute-00.txt},  		 			E Bommaiah 		,  		 			M Liu 		,  		 			A Mcauley 		,  		 			R Talpade 		.  		Aug. 1998.  	 	 (AMRoute: Ad-hoc Multicast Routing Protocol. Work in progress) 
\bibitem[Royer and Perkins (1999)]{b11}\label{b11} 	 		‘Multicast Operation of the Ad-hoc On-Demand Distance Vector Routing Protocol’.  		 			E M Royer 		,  		 			C E Perkins 		.  	 	 		\textit{Proceedings of ACM/IEEE MOBICOM'99},  				 (ACM/IEEE MOBICOM'99Seattle, WA)  		Aug. 1999.  	 
\bibitem[Lee et al. (1999)]{b12}\label{b12} 	 		‘On-Demand Multicast Routing Protocol’.  		 			S.-J Lee 		,  		 			M Gerla 		,  		 			C.-C Chiang 		.  	 	 		\textit{Proceedings of IEEE WCNC'99},  				 (IEEE WCNC'99New Orleans, LA)  		Sep. 1999. p. .  	 
\bibitem[Sung-Ju et al. ()]{b1}\label{b1} 	 		\textit{On-demand multicast routing protocol in multihop wireless mobile networks},  		 			L Sung-Ju 		,  		 			S William 		,  		 			G Mario 		.  		2001. Mobile Networks and Applications.  	 
\bibitem[Krishna ()]{b0}\label{b0} 	 		\textit{Routing protocols in mobile ad-hoc networks},  		 			G Krishna 		.  		 \url{http://www.cs.umu.se/education/examina/Rapporter/KrishnaGorantala.pdf}  		2006. p. .  	 
\bibitem[Garcia-Luna-Aceves and Madruga (1999)]{b10}\label{b10} 	 		‘The Core-Assisted Mesh Protocol’.  		 			J J Garcia-Luna-Aceves 		,  		 			E L Madruga 		.  	 	 		\textit{IEEE Journal on Selected Areas in Communications}  		Aug. 1999. 17  (8)  p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
