\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={Broadcasting methods in mobile ad hoc networks: Taxonomy and current state of the art},
 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 2012-05-15 (revised: January 2012 15 May 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-01 2012-05-15}
\title{Broadcasting methods in mobile ad hoc networks: Taxonomy and current state of the art}
\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]{shaik jaffar  }

             \author[2]{Dr. M.V.  Subramanyam}

             \affil[1]{  Madina Engineering College}

\renewcommand\Authands{ and }

\date{\small \em Received: 6 April 2012 Accepted: 2 May 2012 Published: 15 May 2012}

\maketitle


\begin{abstract}
        


Flooding also known as broadcasting is one of the most primitive methodologies that focus on investigating searches concerning mobile ad hoc networking due to poorer network procedures which is a main feature in the concept of broadcasting which provides implications to superior applications that includes routing. Broadcasting means in conventional ways transmitting messages from a given branch to all other branches present in a network. The whole grid of the network is manned to ensure that the transmitted data is uniformly ported to the remaining nodes in a decentralized type of network setup. The two issues that renders nodes out of reach all the time are limited radio range and their immovability which assists in concluding that te issue of data transmission covering all networks is assumed to be a multi-objective issue that aims at increasing the count of number of nodules and also decreasing the time taken to reach the specified nodules and also reducing the network overhead which is a crucial characteristic because of the fact that this may direct to congestion also known as broadcast storm issue. This article aims at giving an insight of the taxonomy of transmitting methodologies in MANETS and current state of the art.

\end{abstract}


\keywords{}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{INTRODUCTION}]{INTRODUCTION}\par
mobile ad hoc ne twork ensures building a provisional network sans the involvement of a recognized transportation or an integrated administration. MANETs are usually used for the common usage to emergency situations in warfields, rescue sites etc.\par
Every node present in MANET can be considered a router. The source node utilizes the intermediate nodes to transmit the message towards the destination node if a source node fails to transmit a message unswervingly to its destination node. MANET networks propose reliability, bandwidth and battery power and have erratic traits like topology. Strength signal and transmission routes. Transmission algorithms and procedures are supposed to be very light to save energy and bandwidth in computation and storage necessities  {\ref [1, 2, 3, 4, and 5]}.\par
Author : Associate professor, Madina Engineering college, kadapa, India. Telephone: 919441112010, E-mail : sj3j@rediffmail.com Author : Dr.M.V Subramanyam Ph.D, Principal, Santhi ram Engineering College, Nandyal, Kurnool Dist, A.P, India. Telephone: 919440352909 E-mail : mvsraj@yahoo.com Routing information discovery is crucial for all MANET networks using standards such as dynamic source routing (DSR), ad hoc on demand distance vector (AODV), zone routing protocol (ZRP) and location aided routing (LAR) employ the procedure of transmission to launch routes, which can be achieved through the process of data transmission where sender sends a data packet to rest all branches present in MANET. Node mobility and limited system reserves pose serious issues in broadcasting MANETs as compared to wired networks. 
\section[{II.}]{II.} 
\section[{RELATED WORK}]{RELATED WORK}\par
Transmission standards have been categorized into 4 groups namely simple flooding, probability-based methods, area-based methods and neighbor knowledge based methods, in accordance with the fact that the branches should be in order so as to be implemented by Williams and Camp. Simple flooding involves forwarding received data packets by branches one at a time resulting in jamming of network. Probability related methodologies are typically appraised time and again whenever a packet reaches the destination node which happens with some specific probability. When some extra topographical locations are covered due to some emission process, then re-transmission can be expected where area and location related methods explain whether the facades or the span of the projected area is low or not and if yes, then the message is not resent.\par
GPS or estimation by the triangulation procedure or calculation of power of radio signals hold basis for provision of network information. SBA, Flooding With Self-Pruning (FSWP), AHBP, Multi-point Relaying, etc are few neighbor knowledge related procedures which are essential to procure information of neighborhood neighbors like FWSP uses 1-hop neighbors, SBA, Multipoint Relaying and AHBP uses 2hops neighbors etc. They comprise the last category of transmission methodologies which are again segregated into 2 sub-divisions: neighbor-designating and self-pruning methods whose standard procedure themselves take a decision whether to retransmit the message or not while the former functions by activating its fellows wich are ready to relay a packet.\par
Stojmenovic and Wu introduced some classifications for transmitting standards which are dependent on their algorithmic nature or the data that is essential for its implementation (network information, the network are taken into consideration. Probabilistic schemes and area-based methods are almost always risky to rely upon due to the fact that they usually fail in terms of randomness and heuristics, respectively.\par
Wu and Lou introduced a concept stating the quantity of data needed for transmission and also classified standards based on whether they depend on areas including global, quasi-global, local or quasi-local knowledge of the prevalent network wherein global and quasi-global transmitting algorithms are known as centralized standards whose main disadvantage is they are not scalable and hence can be utilized in MANETs. There are few localized standards whose examples are 1 and 2-hops neighborhood standards whose network status information and its topology are exchanged between various branches which is transmitted either by some random "hello" message or transmitted messages whose data content lays down a grave collision on the network throughput ultimately. ? Messages are distributed to all the neighboring nodes by a source node in MANET, the nodes will scan and check whether they have already seen the transmitted message and if yes, the packet is discarded and if not, t will again be re-initiated to all the potential nodes until the message reaches to every node present in the network. This methodology poses the issue of network jamming and weakening of battery power due to the presence of low concentration of nodes and high mobile power. If the messages constitute a polynomial number whose magnitude is (n2), it is of size n and is portrayed in the above diagram.\par
The topology of the prevalent network designs options for retransmitting of nodes based on probability standards.\par
? Probability Based Approach: This concept helps to identify and rectify the issues created due to the application of simple flooding methodology. A fixed probability pi for retransmission is assigned for each node I 2 N which involves lessening of the jamming circumstance and avoiding collisions. In situations when pi=1, then this concept turns itself towards simple flooding concept. There is a sufficient decrease in pi if there exists efficient transmission because of the increase and reduction in the count of neighbor density nodes. ? Counter-Based Scheme Approach: The random assessment delay (RAD) is posted, a threshold K is resolved and a counter k >= 1 is fixed on the basis of the count of the received transmitted message which in due course of RAD is increased considerably by one for every acknowledged message. The message is declined when RAD terminates and k >= 1. Few nodes won't be permitted to re-transmit in an opaque MANET while in a less intense MANET, all nodes will retransmit the messages. An area related common broadcasting span is presumed and a node retransmits the message if there is a provision of adequate coverage location. Span and area based approaches are included in the methodologies mentioned below which can be explained as follows:\par
Distance Based Approach: The counter is made use of in the counter based approach to decline or retransmit a message wherein here, the span concerning the source and the destination node will be chosen by them both, say suppose the span is d. if the value of d is small, the retransmitting coverage span is less and if d is large enough, then the coverage will also be large but if d=0, then the coverage value is 0. The threshold span D is established by a receiving nodule and then RAD is preset where superfluous messages will be preserved until RAD is terminated. Now if d<D, then received transmitted messages will be declined else they'll be retransmitted again. It has been proposed by Ni et al that signal strengths are made use of to estimate the span starting from the source nodule. Span is capable enough to restore signal power by handling the signal threshold. first deemed and extra coverage span is estimated where the message is declined in case RAD terminates when span area is considerably less than the given threshold. The price of estimating extra coverage spans, Location Based Approach: This is concerned with every nodule covering the basic need of instituting self sites for calculating extra coverage more clearly which is based on the global positioning system (GPS). Every node in MANET takes care in attaching its self area to the header part of every message that it is sending or retransmitting. The location of the sender is also considering estimations of intersections among circles is a setback for this approach which can consume the inadequate energy currently available.\par
Neighborhood based: Status that is prevalent in the neighborhood is managed by the same method wherein matter received from the fellow nodes is employed for retransmission.\par
Self Pruning: Every node present in this feature is supposed to be aware of who its neighbors are, which can be attained by episodic messages. The receiving nodule evaluates with the source's list as to who all its neighbors are and may retransmit if extra nodes are within reach, else they will al be declined. Figure below depicts retransmission of message from node 2 to node 1 which retransmits them to node 3 and 4 respectively as they are extra nodes and so does node 5 with node 4. Idleness is rampant here even under such circumstances.\par
? Scalable Broadcasting Approach: Self pruning is enhanced here as there exist higher opportunities for message broadcasting later and also is supposed to make sure that all nodes present in the network are aware of their neighbors until the 2 hop span as each and every node in this methodology consists of a two-hop topology information, which is instituted by "Hello" messages. ? Ad Hoc Broadcasting Approach: This methodology permits only nodules chosen as gateway nodules and a transmission message controller to retransmit the message. It can be explained in detail as follows:\par
1. Choose one hop fellow nodule as gateway from amongst all the two hop neighboring nodes that can be accessible to a one hop fellow node. 2. Estimate cover set which receives message from the presently in use gateway set. 3. Chose and fix a one hop fellow node as gateway which can cover almost every two hp neighbor that's not present in the cover set. 4. Continue the above processes 2 and 3 till all two hop fellow nodules are enclosed. 5. The nodule which receives a message and is known to be a gateway, decides on which of its fellow nodules have already accepted delivery of the message, they are then presumed to be covered and is declined by the fellow nodule to chose the subsequent hop gateways.\par
c) Cluster Based Broadcasting Methods Data traffic organization schemas, routing severities, fault tolerance problems are few topics of concern for which clustering approach is considered.\par
For enlightening its existence, every nodule sends timely "Hello" messages and possesses an exclusive ID. A group of nodes is collectively known as a cluster which can be fashioned as follows: A nodule possessing a restricted negligible IT will nominate self as the cluster in-charge within where a gateway is utilized for transmission between two members of different clusters. In case the two in-charge heads come together, the nodule with the bigger ID status sacrifices its head position. Cluster configuration can be portrayed as follows:\par
X is a gateway here while Y is the in-charge head. 
\section[{d) Tree Based broadcasting Methods}]{d) Tree Based broadcasting Methods}\par
This methodology is usually not preferable and termed as unsuitable for MANETs even though transmission with the help of tree techniques in wired networks is a famous and technique that is in use too often as they portray a drastic and a powerful transformation in network topologies. 
\section[{e) Technical challenges}]{e) Technical challenges}\par
This segment focuses on few issues of importance that are to be tackled during the tenure of outlining transmission standards. 
\section[{January 2012 f) Hidden and exposed node problems}]{January 2012 f) Hidden and exposed node problems}\par
This issue is of a major concern during transmission as it renders the transport of nodes to all locations unfeasible concerning a given phase of network subsets. This is supposed to be rectified by the usage of acknowledgement packets (ACKs) but this would be against the rule of transmission that specifies to reduce the count of data packet production. Subsequently, the main principle of transmission within a static ad hoc network is to avail to as many nodes that are within reach. A transmitting standard may be unsuccessful even at the slightest hint of non-availability of acknowledgement packets. 
\section[{g) Mobility and Partitioning}]{g) Mobility and Partitioning}\par
Mobility is another important issue of concern, the transmitting standards are supposed to face.\par
Transmission of messages on the basis of spanning trees endures problems posed by the mobility factor, which can now be dealt with expertly because of the availability of many equipped algorithms that are competent enough. These methodologies also are not specific on which application they want to work with. Hence, considering transmission tends to give an idea as to how the corresponding spanning tree is supposed to be built, which is done by exploring group of relevant nodes that have already been recipients of the sender.\par
This issue in static ad hoc networks can also unwillingly pave way to separated networks which is another issue of major concern, taking broadcasting in particular. A transmitting standard is supposed to be searching evidently for a methodology which can permit a transmitting message to leap to various subsets, so as to cover as many nodules as it is permitted. Epidemic dispersive replicas can be correlated with this concern. 
\section[{h) Frequently cited broadcasting methods literature}]{h) Frequently cited broadcasting methods literature}\par
The cluster that materializes in MANET is supposed to be preserved on a regular basis as said by Ni et al by the fundamental cluster algorithm. All the remaining nodules in a cluster other than the controlling nodule can be enveloped by the retransmission done by the controller. Gateway nodes are extensively utilized for retransmitting message to other nodules in various clusters and hence there is no extreme necessity of a non-gateway nodule to retransmit the same message. Even though there may be presence of many gateway nodules in various clusters, te specified gateways may probably utilize and employ different transmission concepts mentioned earlier to ascertain whether to retransmit or not.\par
Spanning trees are widely built though which transmission of messages is done by promoting messages only to the fellow nodules present in the tree which is basically acyclic in nature. Hence, every transmitted message is acquired only once at a time by the prevailing nodes. Many algorithms are available for building and upholding trees like the bridged Ethernet network's spanning tree algorithm which are built to prove suitable for working in stable networks rather than the ever-changing topology of a MANET.\par
Multicast trees and their uses have already been specified and explained in detail by many authors but what is nagging is the fact their algorithms are not qualified and efficient enough for dealing with the topology related modifications. Few algorithms render their services useless for handling the tree in an everchanging topology even though they may involve a phase of building a spanning tree.\par
The logic of one-to-one broadcasting is proved feasible by the tree related technique as compared to other methods as many disadvantages of limited transmissions do not influence the algorithm thankfully, it is secure enough for transmissions.\par
A noteworthy point to mention is there is minimum or no effort required to be at par with the network states as it has been proposed from the start to reduce signaling traffic. i) Current state of the art A multiple channel medium access control (MAC) standard was recommended by Jenhui Chen et al which was named as ad hoc multichannel negotiation protocol (AMNP) used mainly for transmitting messages across multiple channels in a uniform manner and also referred to the problem of distributed scheme allowance for multihop MANETs but in the presence of one transceiver. Augmentation of description of AMNP known as AMNP with channel development was brought into existence.\par
The replication results prove worthy to make its stand that the throughput is comparatively large in comparison to its single path equivalent. Only a single transceiver is deployed by the recommended AMNP but with a specified constraint of suspending right to admission for a specific time period while getting swapped to a chosen data route.\par
It has been suggested by Chien-Chung Shen et al, a diagram-prospect related directional to curve percolation and also for omni-directional transmission for spot percolation and also gives a detailed explanation about the compilation of directional transmitter related transmission methods for static ad hoc networks. The author squabbles to support the stipulation of suggested copy, that countless transmission designs have been recommended almost all of which presumed the practice of omni-directional transmitters and transmission overhead is taken into consideration advancing number of dispatching nodules. Directional transmitters possess tapered emissions and can gradually diminish transmission overheard with respect to number of acknowledged packets to the count of nodules that expects transmission packets.\par
Observation: It has been suggested that diagram-prospect related directional to curve percolation and also for omni-directional transmission for spot percolation and also gives a detailed explanation about the compilation of directional transmitter related transmission methods for static ad hoc networks. A specific quantity of battery power is safeguarded by decreasing the count of replica of data packets that is acknowledged. For utilizing the longer range characteristics of directional transmitters for deceasing the delay, it is but essential to scrutinize the recommended ideas.\par
Transmission storm issue would be a troubling factor if the accelerating nodules are not cautiously allocated in the transmission procedure in static ad hoc networks (MANETs) said Wei Lou et al. The main idea behind diminishing transmission idleness is a foremost issue of concern in MANETs and so an easy transmission algorithm has been recommended known as double-covered broadcast (DCB), which benefits from the transmission idleness state for enhancing delivery ratio in a high broadcasting error rate surrounding subset.\par
Few chosen promoting nodules rebroadcast the transmitted message from among the 1-hop fellow nodules pertaining to the sender. The above mentioned nodules are chosen as follows:\par
1) 2-hop fellow nodules of the source initiator are swathed and 2) The source initiator's 1-hop fellow nodules are either advancing nodules or non advancing ones that are enveloped by a minimum of two promoting fellow nodules.\par
The source initiator acquires hold of the rebroadcasts of the promoting nodules as authentication of reaction of the data packet. The non promoting 1-hop fellow nodules of the source initiator fail to admit the response reaction of their transmission which provokes the initiator to retransmit the data packet in case of it failing to recognize all the promoting nodules broadcast till large count of retries has been reached.\par
Observation: Suppose in DCB, a nodule v promotes a data packet choosing division of the prevalent 1-hop fellow nodules as promoting nodules depending on the greedy algorithm for the issue pertaining to Set Cover with certain restrictions which are as follows: (1) All the 2-hop fellow nodules of node v are supposed to be addressed by the chosen advancing nodes and (2) the 1-hop fellow nodules available in node v can either be chosen as an advancing nodule r enveloped by a minimum of two promoting nodes. Then, the IDs of the chosen promoting nodules to the relevant data packet is appended to the node v and then the same packet is transmitted. It is assumed beforehand by a 1-hop fellow node that the about-to-be received data packet is of a promoting nature and transmission procedure continues as it was before concerning node v. Another noteworthy characteristic of DCB is that whenever a nodule tends to broadcast a packet secure connections are ensured. Node v delays time to eavesdrop on transmission from all its chosen promoting nodules and if it falls short for the same, then rebroadcasting is permitted until all nodules are swathed and maximum tries are attained. 
\section[{j) Limits and obstacles observed in Existing}]{j) Limits and obstacles observed in Existing}\par
Broadcasting Methods\par
The disadvantages construed from itemizing relative studies are as follows:\par
1. There is a need for many retransmissions concerning with the count of the rebroadcasting nodules for all methodologies explained except for the neighbor related techniques.\par
2. RAD implemented techniques drowned in high density MANETs acclimatize RAD nodules concerning its surrounding conduct is cultivated. 
\section[{The ad hoc transmitting technique faces}]{The ad hoc transmitting technique faces}\par
discrepancies in a typically high static MANET network because of the fact that it fails to make use of local data to confirm whether to retransmit the packet or not.\par
On the basis of the wide proportional research on already existing transmitting techniques, it has been observed that every transmitting technique failed to work in wide ranging MANET surroundings.\par
Scalable transmission based line of attack has provided with noteworthy and promising results as compared to the non-adaptive tactics.\par
There is an urgent need to cultivate new competent data transmission tactics with the main intention of preserving the existing meager reserves in MANETs. 
\section[{VII.}]{VII.} 
\section[{CONCLUSION}]{CONCLUSION}\par
Transmission is an indispensible feature for any MANET network, so it is vital to exploit the most proficient transmitting techniques that can make sure that a secure network is provisioned. This paper also has presented a brief synopsis on all chief transmission methodologies available in the prose, mainly concentrating on the intricacies of their roles and also the threats posed by them and also, recommending upgrading for few of the enumerated techniques. There is not one most favorable algorithm in existence for all the concerning techniques in the present circumstances\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}}\end{figure}
 			\footnote{© 2012 Global Journals Inc. (US) Global Journal of Computer Science and Technology Volume XII Issue I Version I} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Lou]{b39}\label{b39} 	 		\textit{},  		 			Wei Lou 		.  		 	 
\bibitem[Chiu]{b41}\label{b41} 	 		\textit{},  		 			Chun-Yuan Chiu 		.  		 	 
\bibitem[Chiu]{b43}\label{b43} 	 		\textit{},  		 			Ge-Ming Chiu 		.  		 	 
\bibitem[Twc ()]{b47}\label{b47} 	 		\textit{},  		 			/ Twc 		.  		2007. p. 5210.  	 
\bibitem[Park and Corson ()]{b0}\label{b0} 	 		‘A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks’.  		 			S Park 		,  		 			Corson 		.  	 	 		\textit{INFOCOM}  		1997. 97 p. .  	 
\bibitem[Haas ()]{b1}\label{b1} 	 		‘A New Routing Protocol for Reconfigurable Wireless Networks’.  		 			Z Haas 		.  	 	 		\textit{ICUPC}  		1997. 97 p. .  	 
\bibitem[Wolf et al. (2007)]{b46}\label{b46} 	 		‘A protocol for construction of broadcast transmission schedules in mobile ad hoc networks’.  		 			B J Wolf 		,  		 			J L Hammond 		,  		 			D L Noneaker 		,  		 			H B Russell 		.  	 	 		\textit{Wireless Communications}  		Jan. 2007. January 2012. 6  (1)  p. .  	 	 (IEEE Transactions on) 
\bibitem[Wu and Chen (2007)]{b42}\label{b42} 	 		‘A Reliable and Efficient MAC Layer Broadcast Protocol for Mobile Ad Hoc Networks’.  		 			E H Wu 		,  		 			.-K.; Gen-Huey Chen 		.  		 \xref{http://dx.doi.org/10.1109/TVT.2007.897654}{10.1109/TVT.2007.897654}.  	 	 		\textit{Vehicular Technology}  		July 2007. 56  (4)  p. .  	 	 (IEEE Transactions on) 
\bibitem[Jetcheva et al. ()]{b13}\label{b13} 	 		\textit{A Simple Protocol for Multicast and Broadcast in Mobile Ad hoc Networks. Internet Draft, draftietfmanet-simple-mbcast-01},  		 			J Jetcheva 		,  		 			Y Hu 		,  		 			D Maltz 		,  		 			D Johnson 		.  		2001.  	 	 (txt) 
\bibitem[Haas and Liang ()]{b8}\label{b8} 	 		‘Ad hoc mobility management with randomized database groups’.  		 			Z Haas 		,  		 			B Liang 		.  	 	 		\textit{Proceedings of the IEEE International Conference on Communications},  				 (the IEEE International Conference on Communications)  		1999. p. .  	 
\bibitem[Perkins et al. (2003)]{b6}\label{b6} 	 		\textit{Ad hoc on Demand Distance Vector (AODV) Routing. Request for Comments 3561},  		 			C Perkins 		,  		 			E Beldig-Royer 		,  		 			S Das 		.  		July 2003.  	 
\bibitem[Perkins and Royer ()]{b2}\label{b2} 	 		‘Ad hoc on Demand Distance Vector Routing’.  		 			C Perkins 		,  		 			E Royer 		.  	 	 		\textit{2nd IEEE Workshop on Mobile Computing Systems and Applications},  				1999. p. .  	 
\bibitem[Perkins et al. (2002)]{b36}\label{b36} 	 		\textit{Ad hoc Ondemand Distance Vector (AODV) Routing. IETF Internet-Draft, draft-ietf-manet-aodv-11.txt},  		 			C Perkins 		,  		 			E Royer 		,  		 			S Das 		.  		Aug 2002.  	 
\bibitem[Perkins et al. (2002)]{b33}\label{b33} 	 		\textit{Ad hoc Ondemand Distance Vector (AODV) Routing. IETF Internet-Draft, draft-ietf-manet-aodv-11.txt},  		 			C Perkins 		,  		 			E Royer 		,  		 			S Das 		.  		Aug 2002. October 2002.  	 	 (Protocol Specification (Revised), IETF Internet-Draft, draft-ietf-pim-dm-new-v2-02.txt) 
\bibitem[Adams et al.]{b28}\label{b28} 	 		 			A Adams 		,  		 			J Nicholas 		,  		 			W Siadak 		.  		\textit{Protocol Independent Multicast-Dense Mode (PIM-DM)},  				 	 
\bibitem[Chen (2010)]{b37}\label{b37} 	 		‘AMNP: ad hoc multichannel negotiation protocol with broadcast solutions for multi-hop mobile wireless networks’.  		 			J Chen 		.  		 \xref{http://dx.doi.org/10.1049/iet-com.2009.0318}{10.1049/iet-com.2009.0318}.  	 	 		\textit{Communications, IET}  		March 26 2010. 4  (5)  p. .  	 
\bibitem[Stojmenovic and Wu ()]{b17}\label{b17} 	 		‘Broadcasting and activity scheduling in ad hoc networks’.  		 			J Stojmenovic 		,  		 			Wu 		.  	 	 		\textit{Mobile Ad Hoc Networking},  				 			S Basagni,  			M Conti,  			S Giordano,  			I Stojmenovic 		 (ed.)  		2004. p. .  	 
\bibitem[Pelc ()]{b19}\label{b19} 	 		\textit{Broadcasting in wireless networks. Handbook of Wireless Networks and Mobile Computing},  		 			A Pelc 		.  		2002. p. .  	 
\bibitem[Broadcasting methods in mobile ad hoc networks: Taxonomy and current state of the art Global Journal of Computer Science and Technology Volume XII Issue I Version I 64 Global Journals Inc (2012)]{b29}\label{b29} 	 		‘Broadcasting methods in mobile ad hoc networks: Taxonomy and current state of the art Global Journal of Computer Science and Technology Volume XII Issue I Version I 64’.  	 	 		\textit{Global Journals Inc}  		January 2012. 2012. US.  	 
\bibitem[Sinha et al. ()]{b3}\label{b3} 	 		‘CEDAR: A Core Extraction Distributed Ad hoc Routing Algorithm’.  		 			P Sinha 		,  		 			R Sivakumar 		,  		 			V Bharghavan 		.  	 	 		\textit{INFOCOM}  		1999. 99 p. .  	 
\bibitem[Williams and Camp ()]{b11}\label{b11} 	 		‘Comparison of Broadcasting Techniques for Mobile Ad hoc Networks’.  		 			B Williams 		,  		 			T Camp 		.  	 	 		\textit{Proceedings of the ACM Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC)},  				 (the ACM Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC))  		2002. p. .  	 
\bibitem[Williams and Camp ()]{b15}\label{b15} 	 		‘Comparison of broadcasting techniques for mobile ad hoc networks’.  		 			B Williams 		,  		 			T Camp 		.  	 	 		\textit{Proc. of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC)},  				 (of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC))  		2002. p. .  	 
\bibitem[Ballardie et al. ()]{b26}\label{b26} 	 		\textit{Core Based Trees (CBT) an Architecture for Scalable Interdomain Multicast Routing},  		 			A Ballardie 		,  		 			P Francis 		,  		 			J Crowcroft 		.  		1993. San Francisco. 93 p. .  	 
\bibitem[Shen; Zhuochuan Huang; Chaiporn and Jaikaeo (2006)]{b38}\label{b38} 	 		‘Directional broadcast for mobile ad hoc networks with percolation theory’.  		 			Chien-Chung Shen; Zhuochuan Huang; Chaiporn 		,  		 			Jaikaeo 		.  		 \xref{http://dx.doi.org/10.1109/TMC.2006.1599402}{10.1109/TMC.2006.1599402}.  	 	 		\textit{IEEE Transactions on}  		April 2006. 5  (4)  p. .  	 	 (Mobile Computing) 
\bibitem[Waitzman et al. (1988)]{b31}\label{b31} 	 		\textit{Distance Vector Multicast Routing Protocol. RFC 1075},  		 			D Waitzman 		,  		 			C Partridge 		,  		 			S Deering 		.  		November 1988.  	 
\bibitem[Waitzman et al. (1988)]{b34}\label{b34} 	 		\textit{Distance Vector Multicast Routing Protocol. RFC 1075},  		 			D Waitzman 		,  		 			C Partridge 		,  		 			S Deering 		.  		November 1988.  	 
\bibitem[Johnson and Maltz ()]{b4}\label{b4} 	 		\textit{Dynamic Source Routing in Ad hoc Wireless Networks. Mobile Computing},  		 			D Johnson 		,  		 			D Maltz 		.  		1996. Academic Publishers. p. .  	 
\bibitem[Young (2009)]{b44}\label{b44} 	 		‘Exploiting In-Zone Broadcasts for Cache Sharing in Mobile Ad Hoc Networks’.  		 			Cheng-Ru Young 		.  		 \xref{http://dx.doi.org/10.1109/TMC.2008.127}{10.1109/TMC.2008.127}.  	 	 		\textit{IEEE Transactions on}  		March 2009. 8  (3)  p. .  	 	 (Mobile Computing) 
\bibitem[Ho et al. ()]{b12}\label{b12} 	 		\textit{Flooding for Reliable Multicast in Multi-hop Ad hoc Networks. International Workshop in Discrete Algorithms and Methods for Mobile Computing and Communication},  		 			C Ho 		,  		 			K Obraczka 		,  		 			G Tsudik 		,  		 			K Viswanath 		.  		1999. p. .  	 
\bibitem[Wu and Lou ()]{b18}\label{b18} 	 		‘Forward-node-set-based broadcast in clustered mobile ad hoc’.  		 			J Wu 		,  		 			W Lou 		.  	 	 		\textit{Wireless Communications and Mobile Computing}  		2003. 3 p. .  	 
\bibitem[IEEE Specification 820.1d MAC Bridges D9 (1989)]{b25}\label{b25} 	 		\textit{IEEE Specification 820.1d MAC Bridges D9},  				July 14, 1989.  	 
\bibitem[IETF Internet-Draft, draft-ietf-pim-dm-new-v2-02.txt Protocol Specification (Revised) (2002)]{b30}\label{b30} 	 		‘IETF Internet-Draft, draft-ietf-pim-dm-new-v2-02.txt’.  	 	 		\textit{Protocol Specification (Revised)}  		October 2002.  	 
\bibitem[Xie et al. (2006)]{b45}\label{b45} 	 		‘Improving the reliability of IEEE 802.11 broadcast scheme for multicasting in mobile ad hoc networks’.  		 			J Xie 		,  		 			A Das 		,  		 			S Nandi 		,  		 			A K Gupta 		.  		 \xref{http://dx.doi.org/10.1049/ip-com:20045271}{10.1049/ip-com:20045271}.  	 	 		\textit{Communications}  		1 April 2006. 153  (2)  p. .  	 
\bibitem[Ko and Vaidya ()]{b9}\label{b9} 	 		‘Location-aided Routing (LAR) in Mobile Ad hoc Networks’.  		 			Y Ko 		,  		 			N Vaidya 		.  	 	 		\textit{Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM)},  				 (the ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM))  		1998. p. .  	 
\bibitem[Casteigts ()]{b21}\label{b21} 	 		‘Model driven capabilities of the da-grs model’.  		 			A Casteigts 		.  	 	 		\textit{International Conference on Autonomic and Autonomous Systems (ICAS'06)},  				 (San Francisco, USA)  		2006. IEEE.  	 
\bibitem[Moy ()]{b32}\label{b32} 	 		‘Multicast Routing Extensions for OSPF’.  		 			J Moy 		.  	 	 		\textit{CACM}  		1994. 37 p. .  	 
\bibitem[Moy ()]{b35}\label{b35} 	 		‘Multicast Routing Extensions for OSPF’.  		 			J Moy 		.  	 	 		\textit{CACM}  		1994. 37 p. .  	 
\bibitem[Gerla and Tsai ()]{b22}\label{b22} 	 		‘Multicluster, Mobile, Multimedia Radio Network’.  		 			M Gerla 		,  		 			J T Tsai 		.  	 	 		\textit{ACM-Baltzer Journal of Wireless Networks}  		1995. 1  (3)  p. .  	 
\bibitem[Estrin (1998)]{b27}\label{b27} 	 		\textit{Protocol Independent MulticastSparse Mode (PIM-SM). Protocol Specification RFC 2362},  		 			D Estrin 		.  		June 1998.  	 
\bibitem[Alagar et al. ()]{b23}\label{b23} 	 		‘Reliable Broadcast in Mobile Wireless Networks’.  		 			S Alagar 		,  		 			S Venkatesan 		,  		 			J Cleveland 		.  	 	 		\textit{Military Communications Conference, MILCOM Conference Record},  				1995. 1 p. .  	 
\bibitem[Ni et al. ()]{b14}\label{b14} 	 		‘The Broadcast Storm Problem in a Mobile Ad hoc Network’.  		 			S Ni 		,  		 			Y Tseng 		,  		 			Y Chen 		,  		 			J Sheu 		.  	 	 		\textit{International Workshop on Mibile Computing and Networks}  		1999. p. .  	 
\bibitem[Ni et al. ()]{b16}\label{b16} 	 		‘The broadcast storm problem in a mobile ad hoc network’.  		 			Sze-Yao Ni 		,  		 			Yu-Chee Tseng 		,  		 			Yuh-Shyan Chen 		,  		 			Jang-Ping Sheu 		.  	 	 		\textit{Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking},  				 (the 5th annual ACM/IEEE international conference on Mobile computing and networking)  		1999. p. .  	 
\bibitem[Johnson et al. ()]{b5}\label{b5} 	 		\textit{The Dynamic Source Routing Protocol for Mobile Ad hoc Networks. Internet Draft: draft-ietf-manet-dsr-09.txt},  		 			D Johnson 		,  		 			D Maltz 		,  		 			Y Hu 		.  		2003.  	 
\bibitem[Haas and Pearlman ()]{b7}\label{b7} 	 		‘The Performance of Query Control Schemes for the Zone Routing Protocol’.  		 			Z Haas 		,  		 			M Pearlman 		.  	 	 		\textit{IEEE/ACM Transactions on Networking}  		2001. 9  (4)  p. .  	 
\bibitem[Wu (2007)]{b40}\label{b40} 	 		‘Toward Broadcast Reliability in Mobile Ad Hoc Networks with Double Coverage’.  		 			Jie Wu 		.  		 \xref{http://dx.doi.org/10.1109/TMC.2007.31}{10.1109/TMC.2007.31}.  	 	 		\textit{IEEE Transactions on}  		Feb. 2007. 6  (2)  p. .  	 	 (Mobile Computing) 
\bibitem[Jttner and Dm Magi ()]{b24}\label{b24} 	 		\textit{Tree Based Broadcast in Ad hoc Networks. MONET Special Issue on WLAN Optimization at the MAC and Network Levels},  		 			Alpr Jttner 		,  		 			Dm Magi 		.  		2004.  	 	 (to appear) 
\bibitem[Kaplan ()]{b20}\label{b20} 	 		\textit{Understanding GPS: Principles and Applications},  		 			E D Kaplan 		.  		1996. Boston, MA: Artech House.  	 
\bibitem[Committee ()]{b10}\label{b10} 	 		\textit{Wireless LAN Medium ACCESS CONTROL (MAC) and Physical Layer Specifications. IEEE 802.11 Standard},  		 			I S Committee 		.  		1997. New York: IEEE.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
