\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={A Quick Termination Detection Protocol by Reducing Overload for Mobile Ad Hoc Networks},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2012-05-15 (revised: 15 May 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-05-15}
\title{A Quick Termination Detection Protocol by Reducing Overload for Mobile Ad Hoc Networks}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Dr. Subrata Kumar  Das}

             \author[2]{Md. Asif  Nashiry}

             \author[3]{Md. Alam  Hossain}

             \affil[1]{  }

\renewcommand\Authands{ and }

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

\maketitle


\begin{abstract}
        


An ad hoc network is characterized by the fact that there is no fixed topology due to the mobility of nodes, interference, multipath propagation and path loss. Execution of applications in such kind of networks typically consists of a number of successive phases such as network reprogramming, localization, power monitoring, and parameter updates. Termination detection of a phase is therefore a critical operation to safely execute a new phase on some or all of the network nodes. In resource constrained network environment the overhead should be minimum in order to increase throughput and minimize delay. This paper studies the existing solutions for termination detection by analyzing their effectiveness. Moreover, in this paper, we propose an efficient algorithmic solution to encounter termination detection by minimizing the network overloads.

\end{abstract}


\keywords{Ad hoc networks, termination detection, network overloads, diffusion-based approach, distributed system.}

\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& 	 	 		 \par
re-programming of location aware application programs onto all nodes can be a subsequent application phase. Power monitoring and parameter updates can be regarded as separate phases. Hence the importance of termination detection across a diverse range of mobile applications is very crucial.\par
Minimizing these sorts of control messages is very important when dealing with ad hoc networks. Because nodes participating in ad hoc networks require need to store their battery power for further processing and longer stay in the network. So reducing overhead packets not only improve the throughput but also enhance network performance. So exchanging minimum number of control messages is required in resource constrained dynamic ad hoc networking environment.\par
There are many proposed algorithm for termination detection of distributed system considering on static system i.e. for systems comprising of a fixed set of nodes. There is relatively less work on dynamic systems, where nodes may be created as well as destroyed while the computation is in progress. As mobile ad hoc network is a dynamic process we have to develop a termination detection algorithm for dynamic systems permitting unrestricted connection and disconnection of nodes. A distributed computation is assumed to be structured in the form of a set of concurrent devices/ nodes \{Ni\}, with each node performing a specific computational task. Nodes can be connected or disconnected during the course of the computation. In according to \hyperref[b0]{(Dhamdhere, Reddy \& Iyer, 1992}) a node becomes idle on completing the computational task assigned to it, and awaits one of the following events: i.\par
assignment of a new computational task, ii.\par
receipt of a report killing it, or iii. declaration of termination.\par
In case (i), the node becomes active again,\par
In case (iii), it simply terminates.\par
The inter devices/nodes communication is assumed to be asynchronous with arbitrary. This ensures that all existing nodes participate in the termination detection. 
\section[{March}]{March}\par
The solution of termination detection problem can be classified into the following two categories:\par
In case (ii), it informs other nodes of its destruction and dies, while A Quick Termination Detection Protocol by Reducing Overload for Mobile Ad Hoc Networks weight throwing protocol \hyperref[b1]{(Mattern, 1989)}  \hyperref[b4]{( Misra \& Chandy, 1982)}. In the former one, a real number, called weight, is associated with every node involved in computation. The later one is a tree based scheme in which the root node initiates and coordinates the computation. Other nodes are added in the tree as and when they get their job. Weight throwing protocol has constant time, space and communication complexities and it is more efficient and scalable for the distribute system having mobility. But having least computation complexity the diffusion based protocol best suits the diverse nature of resource constrained mobile ad hoc networks. This paper is concerned with the development of a termination detection algorithm based on diffusion based protocol for use in ad hoc networking environments that reduces the overload of the network by exchanging lowest number of control packets among the nodes in the network.\par
The reminder of this paper is organized as follows: section 2 depicts the related works, section 3 introduces the major problem of diffusing computation and its solution, section 4 presents our proposed algorithm and its functionalities. In section 5, we mention an example to provide a more concrete understanding of the algorithm. Conclusion and future works are in section 6.  \hyperref[b6]{Lai (1986)} gives an algorithm for dynamic systems where nodes may be created and destroyed. In \hyperref[b7]{(Tseng \&Tan, 2001)}, the authors used a hybrid protocol for termination detection in mobile distributed environment by combining weight throwing and diffusion based approaches. This protocol works by applying weight throwing approach to all static processes and diffusion based scheme to all mobile processes.\par
Roman and Payton (2005) use a diffusion based scheme to detect termination in mobile ad hoc networks. This protocol requires that each node maintains a list of nodes that it activates and will be responsible to take further information till it becomes passive. The basic principle of this protocol is to use of a partial ordering of across all active nodes in the network for delivery of termination notices. This method is reliable indeed. But we have identified some sort of problems in the research works done in the past based on diffusion based approach of termination detection. We address and present these problems in section 3. The possible solutions of those problems also follow in this section. Thus our work complements previous works and can be combined to help in resource constrained ad hoc networking environment for termination detection.\par
Most of the research works done earlier based on diffusion computation depend on the relationship between root and all other nodes in the network. In those algorithms, to detect termination, root is explicitly and implicitly depend on all other nodes in the network and responsible for collecting all status information of other nodes to process and memorize these information. In this way the task of root becomes complex to execute. In this circumstance the problems that may create and their solutions are defined below.\par
Problem: Receiving an idle report from a node, the root node cannot prune that node due to having lack of knowledge about its parent.\par
According to \hyperref[b8]{(Roman \& Payton, 2005)}, after getting the idle report from some nodes the root cannot prune those nodes until it has not got the status of the parent of those nodes. This increases the overload of the network and to memorize the receiving idle report from the nodes until it has collected the information from all nodes of the network. If it is possible to prune the node after getting the idle report the overload of the network is decreased. For instance, consider the following figure \hyperref[fig_2]{1}.\par
In figure \hyperref[fig_2]{1}, at any instance of time, node E moves into the communication range of node D and passes its idle report. Then node D becomes idle and adds its information to the idle report, the node D eventually establish communication with node A and passes its idle report. In this situation, root A knows that E and D are idle. It also knows that E has no children and node D is the parent of nodes F and G. But root A does not know that B is the parent of nodes E and D. Also, root node A does not know the status of nodes B, F and G. Solution approach: To solve the problem mentioned above we propose a decentralized activity. Now, the root nodes only maintain the information of its children only. These children while behaving as parent will maintain the status of their children only and so on. So, in figure \hyperref[fig_2]{1}, node D maintain the status of nodes F and G, node B keeps track the status of E and D and at last root A knows the status of its children B and C. In this way, the root node A can know all idle reports and can easily detect the termination. By following this process, root A has not to maintain the status of all other nodes rather it maintain only the status of its children. For instant, if parent nodes had to maintain the status of its own children then after getting the idle report from node E (figure \hyperref[fig_2]{1}), the parent node B can prune its child E because it has no children at all. The advantage here is that it is not necessary to keep a node for long time, which reduces network overload, minimize the computation complexity of the root and requires small buffer to process; resulting performance enhancement. 
\section[{Global Journal of Computer Science and Technology Volume XII Issue VI Version I}]{Global Journal of Computer Science and Technology Volume XII Issue VI Version I}\par
Our proposed algorithm belongs to the category of diffusion-based algorithm. However, to overcome the drawbacks of the diffusion-based algorithm mentioned in section 3, we have designed the decentralized computation instead of centralized one.\par
In this system, each wireless device is considered as node except a node which is called the root initiate the computation. Other nodes are categorized two types: parent (defined as the node which has child/leaf) and child (defined as the node without any child that means leaf). In previous centralized system, the initiator which is considered as the root performed all the tasks to detect and declare termination. But in our designed system the others nodes are given the responsibility to keep the status of its own children. At first, the root will distribute the task among its children. Then the children of the root while behaving as parents will distribute the task to its children and so on. On the other hand, the idle reports are collected in the same way, but in reverse order.\par
Here each node maintains a data structure to store identities of its connecting nodes. Whenever two nodes Ni and Nj communicate with one another, their status are updated with each other's id's. When a process Ni kills process Nj, or Nj kill itself, Nj informs its parent. This leads to the deletion of Nj from the network. New nodes may be added to parent (Ni) without the concern of the root which will not make any hassle to detect termination.\par
An important issue is that every active node is reachable along a path from the root, but many of the links may no longer be up since nodes may have moved out of range with respect to the root. It may be that a node is the out of range of the root, but it is under the range of another parent node. Then the root cannot control that node or the node cannot send its status directly to the root. In this case, the parent of our proposed protocol can properly access such nodes that are the outside of the range of the root but within the range of the parent and help the root to detect termination quickly. So we have divided the functionalities of our protocol in three sections. Firstly, the execution will be started from the root which checks whether there are children or not. If the root does not find any of its children then it declares the system as terminated. If the children (nodes) are presented then the root executes the lines from 2 to 7. A child finishing its work sends the idle report to its root, then the root merge that report with its previous ones (line 3) and the child become idle and leave the network as it has not connected to any other node.\par
If any node is connected to the report sending child, mentioned above, will respond as a parent. Working as a parent, the node completes the tasks in sections (b) and (c) in the algorithm, then it sends the report to the root and only after that the root can declare the termination of the system. But if there is no node joined with the child, then it will be idle and disconnected. In our proposed decentralized protocol the parent plays an important role getting the idle report from its child. At first update the status of its idle report following prune the child (if it is a leaf) from the network then check whether any others nodes are exist or not. If there exist any other child then the precious process will repeat. Otherwise it will response as a child. In third -the node is in an idle state, initially true except of the initiator of the diffusing computation -the status of a node initially zero.\par
-a node is present in the network and active -the node prune from the parent or the network.\par
-a node has no child. a) Actions as the In this section, we present an example to explain the fundamental idea behind our proposed algorithm to detect the termination in the network.\par
Consider a network consists of ten hosts/nodes, shown in figure  {\ref 2}. These hosts do some tasks using some particular software installed on them. Suppose at any time, there is a need to update on of the software installed on all of the hosts by replacing its old version. Before processing any further task each and every host must be informed about that the up gradation of software reflects to all other nodes in that network.\par
According to our algorithm, the root node initiates the software up gradation process. With the reference of figure  {\ref 2}, at first, root node install the new version of software on it and sends it to its neighbours that lie within the communication range of the root; A, B, C, D and E, only.\par
After receiving this information node D install the new version on it and transmit this message to its neighbours, F and G. Similarly, node E first installs the software and then sends it to node H. At any instant of time if node I comes within the communication range of node E then it will be the child of node E. Then node E sends the up gradation request to node I.\par
The nodes that are out of range from root node such as F, G, H and I, send the confirmation report to their corresponding parent. The parent nodes D and E then send this to root node. In the mean time, root has the confirmation report of all nodes that lie within its communication range. So that, root has the confirmation  
\section[{2012}]{2012}\par
March reports of all nodes in the network. It can terminate the process of up gradation and initiates further tasks. Here each parent node is responsible to send and receive the information to/from its immediate children only. It is not worried about the rest. In this case, the task is totally distributed.\par
According to our example the problems mentioned in section 3 can easily be solved. Because, when child nodes F and G send the confirmation report to their parent node D then node D can prune those nodes, F and G from the network (solution of problem 1). Moreover, root node does not need to memorize the report of the nodes that lie outside its communication range. It only needs to keep track the reports of its neighbours, which reduces the computation complexity (solution of problem 2). 
\section[{Fig.2 Mobile Networks}]{Fig.2 Mobile Networks}\par
If a particular node is out of range from the root node then it can propagate its report via the intermediate nodes using ad hoc relay. Moreover, if a new node comes to the communication range of any other existing node then the former one will be the child of the later one. The new node will receives and/or send information/status to its parent only. In this way the root node can know the status of all nodes on the network directly or via other nodes.\par
In this paper, we have investigated and proposed a termination detection algorithm in mobile ad hoc networks. We have underscored some problems in this regard and provided solutions. As out of range communication between two hosts and link failure due to mobility are the fundamental concerns in ad hoc network, so relying on one node to collect status of all other hosts cannot be an effective formula. In our solution, every host exchange activation and idle information to its own child nodes only. It will send then to the initiator node by direct communication or relay. It minimizes delay, reduces complexity and enhances performance. More research is needed to detect termination in ad hoc networking environment. We plan to investigate the distribution of activation message as well as collecting idle report for multiple sources in future.\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{1}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Fig. 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{fig_3}©}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Global}\end{figure}
 			\footnote{© 2012 Global Journals Inc. (US) 2012 March} 			\footnote{© 2012 Global Journals Inc. (US)} 		 		\backmatter  			 			 			  				\begin{bibitemlist}{1}
\bibitem[Misra and Chandy ()]{b4}\label{b4} 	 		\textit{},  		 			J Misra 		,  		 			K M Chandy 		.  		1982.  	 
\bibitem[Baker and Ephremides ()]{b3}\label{b3} 	 		‘A Distributed Algorithm for Organizing Mobile Radio Telecommunication Networks’.  		 			D Baker 		,  		 			A Ephremides 		.  	 	 		\textit{Proceedings of the Second International Conference on Distributed Computer Systems},  				 (the Second International Conference on Distributed Computer Systems)  		1981. p. .  	 
\bibitem[Mittal et al. ()]{b10}\label{b10} 	 		‘A Family of Optimal Termination Detection Algorithms’.  		 			N Mittal 		,  		 			S Venkatesan 		,  		 			S Peri 		.  	 	 		\textit{DC}  		2007. Springer. p. .  	 
\bibitem[De et al. ()]{b9}\label{b9} 	 		‘A New Termination Detection Protocol for Mobile Distributed Systems’.  		 			S De 		,  		 			M Sameeruddin 		,  		 			S M De 		,  		 			V Sharma 		,  		 			N Nandi 		,  		 			H Dutta 		.  	 	 		\textit{Proc. ICIT 07},  				 (ICIT 07)  		2007. IEEE. p. .  	 
\bibitem[Roman and Payton ()]{b8}\label{b8} 	 		‘A termination detection protocol for use in mobile ad hoc networks’.  		 			G C Roman 		,  		 			J Payton 		.  	 	 		\textit{ASE}  		2005. Springer. p. .  	 
\bibitem[Dhamdhere et al. ()]{b0}\label{b0} 	 		‘Distributed termination detection for dynamic systems’.  		 			D M Dhamdhere 		,  		 			E K K Reddy 		,  		 			S R Iyer 		.  		 TR-081-92.  	 	 		\textit{IIT Bombay}  		1992.  	 
\bibitem[Cohen and Lehmann ()]{b5}\label{b5} 	 		‘Dynamic systems and their distributed termination’.  		 			S Cohen 		,  		 			D Lehmann 		.  	 	 		\textit{Proceedings of the first Annual ACM Symp. on Principles of distributed computing}  		1982. p. .  	 
\bibitem[Global Journal of Computer Science and Technology Volume XII Issue VI Version I]{b11}\label{b11} 	 		\textit{Global Journal of Computer Science and Technology Volume XII Issue VI Version I},  		 	 
\bibitem[Mattern ()]{b1}\label{b1} 	 		‘Global quiescence detection based on credit distribution and recovery’.  		 			F Mattern 		.  	 	 		\textit{IPL}  		1989. Elsevier. p. .  	 
\bibitem[Dijkstra and Scholten ()]{b2}\label{b2} 	 		‘Termination Detection for Diffusing Computations’.  		 			E C Dijkstra 		,  		 			C Scholten 		.  	 	 		\textit{IPL}  		1980. Elsevier. p. .  	 
\bibitem[Lai ()]{b6}\label{b6} 	 		‘Termination detection for dynamic distributed systems with non-first-in-firstout communication’.  		 			T H Lai 		,  		 			TH 		.  	 	 		\textit{Journal of Parallel and Distributed computing}  		1986. 3 p. .  	 
\bibitem[Tseng and Tan ()]{b7}\label{b7} 	 		‘Termination Detection Protocols for Mobile Distributed Systems’.  		 			Y Tseng 		,  		 			C Tan 		.  	 	 		\textit{IEEE Transactions on Parallel and Distributed Systems}  		2001. 12 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
