\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={Priority based Congestion Control Mechanism in Multipath Wireless Sensor Network},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

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

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


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

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

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2014-01-15 (revised: 15 January 2014)}
\def\TheID{\makeatother }
\def\TheDate{2014-01-15}
\title{Priority based Congestion Control Mechanism in Multipath Wireless Sensor Network}
\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]{Nazrul  Islam}

             \author[2]{Md. Ahsanul  Hoque}

             \author[3]{Sajjad  Waheed}

             \affil[1]{  Mawlana Bhashani Science and Technology University, Tangail-1902, Bangladesh.}

\renewcommand\Authands{ and }

\date{\small \em Received: 13 December 2013 Accepted: 31 December 2013 Published: 15 January 2014}

\maketitle


\begin{abstract}
        


Wireless Sensor Network (WSN) is a network composed of distributed autonomous devices using sensors. Sensor nodes send their collected data to a determined node called Sink. The sink processes data and performs appropriate actions. Nodes using routing protocol determine a path for sending data to sink. Congestion occurs when too many sources are sending too much of data for network to handle. Congestion in a wireless sensor network can cause missing packets, long delay, overall channel quality to degrade, leads to buffer drops. Congestion control mechanism has three phases, namely congestion detection, congestion notification and congestion control. In this paper is propose two bit binary notification flag to notify the congested network status for implicit congestion detection. For congested network status, we propose a priority based rate adjustment technique for controlling congestion in link level. Congested packet will be distributed equally to the child node to avoid packet loss and transition delays based on technique. Furthermore, this technique allocates the priority of many applications simultaneously running on the sensor nodes, which route is own data as well as the data generated from other sensor nodes. The results show that the proposed technique achieves better normalized throughput and total scheduling rate with the avoiding packet loss and delay.

\end{abstract}


\keywords{congestion control, multipath, weighted fairness, queue overflow and channel overloading.}

\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
ireless sensor network typically has little or no infrastructure. It consists of a number of sensor nodes (few tens to thousands) working together to monitor a region to obtain data about the environment. WSN has gained worldwide attention in recent years. These sensor nodes can sense, measure to gather information from the environment. Based on some local decision process, they can transmit the sensed data to the user. A variety of mechanical, thermal, biological, chemical, optical, and magnetic sensors may be attached to the sensor node to measure properties of the environment. WSN consists of spatially distributed autonomous sensor nodes to cooperatively monitor physical or environmental conditions.\par
The sensor nodes of a WSN sense the physical phenomena and transmit the information to base stations. When an event occurs, the load becomes heavy and the data traffic also increases. This might lead to congestion.\par
There are mainly two causes for congestion in WSN. The first case is node level congestion, which occurs when the packet-arrival rate exceeds the packetservice rate. This is more likely to occur at sensor nodes close to the sink, as they usually carry more combined upstream traffic. The second case is link level congestion, which occurs due to contention, interference, and bit-error rate. Congestion control mechanism has three phases: congestion detection, congestion notification and congestion control with rate adjustment technique.\par
In recent years, lots of work going on in congestion control for wireless sensor network. Most of the work deals with the priority based rate adjustment algorithm for different types of application for heterogeneous traffic. Congestion Control and Fairness for Many-to-one Routing in Sensor Networks \hyperref[b0]{[1]} proposes a distributed and scalable algorithm that eliminates congestion within a sensor network and that ensures the fair delivery of packets to a central node or base station. Priority Based Congestion Control for Heterogeneous Traffic in Multipath Wireless Sensor Networks \hyperref[b1]{[2]} proposes a priority based congestion control for heterogeneous traffic in multi path wireless sensor network. The proposed protocol allocates bandwidth proportional to the priority of many applications simultaneously running on the sensor nodes. Congestion Detection and Avoidance (CODA) \hyperref[b3]{[4]} uses buffer occupancy and the channel load for measuring congestion level. It handles both transient and persistent congestion. For transient congestion, the node sends explicit backpressure messages to its neighbors were as for persistent congestion; it needs explicit ACK from the sink. It uses three mechanisms as follows: 1) Receiver based congestion detection, 2) open loop, hop-by hop backpressure, 3) closed loop multi source regulation. PCCP (Priority Based Congestion Control Protocol) \hyperref[b6]{[7]} is a node priority based congestion control protocol. It defines priority from the nodes point of view instead of the traffic flows point of view.\par
For implicit congestion detection, we proposed two bit binary flags such as 00, 01, 10 or 11 for congestion notification. Based on congested or heavily loaded network status, we propose different activities such as pass packet with delay factor or pass packets with rate adjustment technique. In rate adjustment technique, here also calculated with a delay factor. The rate adjustment technique also distributes congested packet, equally to all child nodes to avoid packet loss.\par
The structure of this paper is as follows. Section II represents the research methodology of the study. Section III represents details about the technical implementation. Section IV provides result and discussion on the basis of technical implementation of the research. This section also shows a comparison between simple fairness and weighted fairness. Finally, section V summarized a set of conclusion and through an outlook of the future work. 
\section[{II.}]{II.} 
\section[{Research Methodology}]{Research Methodology}\par
A literature review to find about wireless sensor network and also find about congestion in it. Congestion in wireless sensor network causes overall channel quality to degrade and loss rates rise, leads to buffer drops, packet loss and increased delays. Most of the work in recent years has been done in congestion control to avoid packet loss or to minimize packet loss.\par
In order to find a congestion control technique which avoid packet loss and capable of reducing delay. In these circumstances we discover a system architecture which contains congestion detection unit, congestion notification unit and congestion controlling unit. The analytical data provide different network status from which we can make a decision whether the congestion is occurring or not.\par
Furthermore, we found some analytical data from the multipath multihop network model. From the basis of these analyses data, a plot represents the comparison of simple fairness, weighted fairness and throughput. Finally, careful study of the plots is expected to provide a fairness measure of the effect of different packets. 
\section[{III.}]{III.} 
\section[{Technical Implementation a) System Architecture}]{Technical Implementation a) System Architecture}\par
In Figure  {\ref 1} represents the system architecture of the proposed work. The Congestion Detection Unit (CDU) calculates the packet service ratio \hyperref[b7]{[8]}. With the help of congestion control Unit each packet, equally distributed to the child node with existing priority allocates the bandwidth to the child nodes according to the source traffic priority and transit traffic priority. The Congestion Notification Unit (CNU) uses an implicit congestion notification by piggybacking the rate information in its packet header. All the child nodes of a parent node overhear the congestion notification information \hyperref[b12]{[12]}. ? Scheduling rate r i sch : It is defined as the rate at which the scheduler schedules the packets from the queues. The scheduler of node i, forwards the packet from node i-1 to the next node i+1. The scheduler schedules the packets from queues according to the queue priority \hyperref[b9]{[10]}. The packets from a higher priority queue will be serviced more than the packets from the lower priority queue. The packets in a particular queue are processed based on its sourced traffic and transit traffic \hyperref[b2]{[3]}. Transit traffic gives more priority than source traffic, since the transit traffic data have already been traversed several paths, and dropping them would cause more waste of network resources. The classifier differentiates the transit traffic from source traffic by examining the source address in the packet header \hyperref[b10]{[11]}. 
\section[{Sink}]{Sink}\par
Congestion control mechanism containing three phase congestion detection, congestion notification and finally congestion control with rate adjustment technique \hyperref[b4]{[5]}. Theoretically, we implement our proposed technique that avoids congestion occurrence and minimize packet loss. 
\section[{i. Congestion Detection}]{i. Congestion Detection}\par
For congestion detection we use, congestion notification flag based on different types of data stored in a single queue to pass the packet through the channel to destination. Sensor node may have multiple sensors with different types of characteristics stored in a single queue. Based on queue for different types of data with different characteristics we use, congestion notification flag such as if the queue is lightly loaded than it notify 00 and the packet pass through the channel without any modification, if it is loaded then it notify 01 and the packet also pass through the channel with queue priority. If the queue is heavily loaded, then it notifies 10 and we propose a delay to avoid congestion in our mechanism and if the queue notify 11 means congestion than we control it with our proposed priority based rate adjustment technique. When each node receives the congestion notification information, it adjusts the queue rate accordingly \hyperref[b14]{[14]}.\par
The following describe the rate adjustment technique: The packet service ratio r (i) is used to measure the congestion level at each node i. The packet service ratio is calculated as follows: r(i)=rs(i)/rsch(i) Here r(i) denoted as packet service ratio used to measure the congestion level for each node where rs(i) denotes packet service rate of node i and rsch(i) denotes packet scheduling rate of node i.\par
The average service time can be calculated as follows by using Exponential weighted moving average formula.?? s (i)=(1-k)?? s (i)+KT s (i)\par
Where K is a constant value in the range between 0<K<1 and TS(i) denotes the service time of the current packet in sink node. By using EWMA formula is updated each time a packet is forwarder to the next \hyperref[b5]{[6]}. The average packet service rate is calculated as the inverse of the average service time.R i serv = 1 ??s(i)\par
If r(i)<Qmin normal operation. Else if r(i)>= Qmin\& r(i) <Qavr prefer queue priority and pass packet. Else if r(i)>=Qavr\& r(i)<Qwarn pass packet with delay to avoid congestion. Else r(i)>=Qmax distribute packet to the child node.\par
Let the traffic source priority SP(i) for parent node i of application j where j as child node and i as sense node. For each node i, total traffic source priority can be calculated as the sum of all application running in it.SP(i)= ? ?SP ?? ?? ? ?? ?? =1\par
Where SPij denotes the traffic source priority of application j. The symbol n denotes the number of application running in sensor node i under multipath routing. The packets of a flow may pass through multiple paths before they arrive at the sink and only a fraction of a flow passes through a particular node or link. The traffic of a particular flow forwarded in one path is defined as a sub flow \hyperref[b15]{[15]}. Transit traffic priority at sensor node i is used to represent the relative priority of transit traffic from other nodes routed through node i.\par
Let dlyji for application j in sense node i carries priority that depends on child node that means single node to single node or single node to multi node. If we denote transit priority TP(i) for node i than it would beTP(i)=dly j i ×? ????(??) ?? =1 ?? =0 
\section[{GP(i)=SP(i)+TP(i)}]{GP(i)=SP(i)+TP(i)}\par
Where GP(i) stands for global priority for node i , Here (dlyji) calculation depends on node number, here we assume that if single node to single node, the value of dlyji must be 1, otherwise it is calculated by dividing delay with the number of parent node connected with \hyperref[b13]{[13]}. Where SP(i) denotes the source priority for each node carrying with. The process running continuously to pass packet to the sink varied with transit priority and global priority. The packet service ratio reflects the congestion level at each sensor node. When this ratio is equal to 1, the scheduling rate is equal to the service rate. When this ratio is greater than 1, the scheduling rate is less than the packet service rate. In both these cases, there is no congestion. When the packet service ratio is less than 1, the scheduling rate is more than service rate and it causes the queuing up of packets. It indicates congestion. Let threshold value is 0.75. If the packet service ratio is less than the threshold value, it notifies congestion. Then node i will adjust the scheduling rate. If the packet service ratio is greater than 1, indicates that the packet service rate is greater than the scheduling rate. So each node will increase the scheduling rate for parent j to improve link utilization otherwise the packet service rate is equal to the scheduling rate. r sch (i)=GP(i)/(GP(i-1)+ GP(i)+ GP(i+1)) Tr sch (i)= r sch (i)/ (r sch (i-1)+ r sch (i)+ r sch (i+1))\par
Scheduling rate can be calculated based on threshold and its directly connected to service ratio to pass packet, and if the service ratio r(i) exceeds the queue maximum value distribute the packet to the child node to avoid packet loss and continue the process to avoid congestion. 
\section[{IV.}]{IV.} 
\section[{Result and Discussion}]{Result and Discussion}\par
All the child nodes of the node i overhear the congestion notification information and they control their rate according to it. Rate adjustment is done in a queue. It ensures that the heterogeneous data from different class will reach the base queue at the desired rate. When the queue explodes the congestion notification flag, it adjusts its rate accordingly. Figure \hyperref[fig_3]{3}, shows the multipath multi hop heterogeneous network model considered in the network. In case of multipath routing, each node divides its total traffic into multipath flows and those flows pass through multiple downstream nodes. For simplicity, we assume that each node divides its rate equally among all its parents. We assume that application 1 generates traffic of class 1 and its priority is 1 and for application 2 the priority is 2 and so on. Then the total priority is calculated based on the traffic class of application running on the nodes. The rate allocates to each node is calculated based on the total priority. Table  {\ref II} shows the source traffic priorities of nodes i in heterogeneous environments.\par
As shown in line 5, node 5 has applications 2 and 3 running on it, which generates heterogeneous data with traffic class priority 2 and 3 respectively. The source traffic priority of node 5 is 0+2+3 = 5.\par
The source traffic priority of all the other nodes can be calculated by the sum of source traffic priorities of traffic classes of individual applications running in it. Node 2 routes the traffic from 4, 5 and 6. The delay factor must be 1/3. The transit traffic priority of node 2 is calculated from the global priorities of nodes 4, 5 and 6. Figure \hyperref[fig_5]{4}.compares the normalized throughput obtained from the proposed technique for priority based weighted fairness with the simple fairness case. As shown in Figure \hyperref[fig_5]{4}, in simple fairness when the priorities of all nodes are same, they receive equal throughput. The proposed method provides priority based weighted fairness for all the sensor nodes according to the priority of heterogeneous traffic generated by the applications.TP(i)= dly j ?? × ? GP(j) ?? =1 ?? =0 TP(2) =1/3×29=10\par
The rate allocation and scheduling are made according to the priority. The node 10 which has higher priority has highest normalized throughput and nodes 15 and 1 got lowest normalized throughput. Thus, the proposed mechanism allocates the bandwidth to each sensor node based on its priority.   
\section[{Conclusions}]{Conclusions}\par
In this paper is proposed a priority based congestion control mechanism for heterogeneous data for multipath environment. We have calculated source priority depending on running applications of the sensor nodes and also calculates transit priority by multiplying with delay factor and global priority. In the proposed method the queue divides its congested packet to the child nodes equally and then running the controlling mechanism to prevent or avoid congestion. The proposed technique minimizes congestion occurrence through packet drop ratio, delay and normalized throughput.\par
In future work, a real time application will be made and the performance will be evaluated through congestion avoidance technique. It is anticipated that will be no packet loss or any kind of delay in packet transmission. \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure1:G}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-4.png}
\caption{\label{fig_3}Figure 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{fig_4}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-6.png}
\caption{\label{fig_5}Figure 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-7.png}
\caption{\label{fig_6}G}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.2125\textwidth}P{0.178125\textwidth}P{0.459375\textwidth}}
\multicolumn{3}{l}{Table1: Congestion Notification Flag and Action Status}\\
CN\tabcellsep Network Status\tabcellsep Action\\
Flag\tabcellsep \tabcellsep \\
00\tabcellsep Lightly loaded\tabcellsep Pass packet without modification\\
01\tabcellsep Loaded\tabcellsep Pass packet based on queue priority\\
10\tabcellsep Heavily loaded\tabcellsep Using delay factor \& pass packet\\
11\tabcellsep Congested\tabcellsep Controlling with rate adjustment\\
\tabcellsep \tabcellsep technique\end{longtable} \par
  {\small\itshape [Note: iii. Rate Adjustment TechniqueRate adjustment is done in the single queue. It ensures that the heterogeneous data from different queue will reach the base queue at the desired rate.]} 
\caption{\label{tab_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3} \par 
\begin{longtable}{P{0.22135416666666669\textwidth}P{0.031875\textwidth}P{0.07083333333333333\textwidth}P{0.11864583333333334\textwidth}P{0.07791666666666666\textwidth}P{0.14875\textwidth}P{0.18062499999999998\textwidth}}
\multicolumn{3}{l}{Node TP(i) dly i j}\tabcellsep GP\tabcellsep r sch (i)\tabcellsep Tr sch (i)\tabcellsep Normalizd\\
\tabcellsep \tabcellsep \tabcellsep (i)\tabcellsep \tabcellsep \tabcellsep throughput\\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep of node i\\
1\tabcellsep 12\tabcellsep 1\tabcellsep \multicolumn{2}{l}{15 0.555}\tabcellsep 0.643\tabcellsep 0.643\\
2\tabcellsep 10\tabcellsep \multicolumn{3}{l}{0.33 12 0.307}\tabcellsep 0.254\tabcellsep 0.254\\
3\tabcellsep 11\tabcellsep 0.5\tabcellsep \multicolumn{2}{l}{12 0.342}\tabcellsep 0.344\tabcellsep 0.344\\
4\tabcellsep 9\tabcellsep 0.5\tabcellsep \multicolumn{2}{l}{11 0.343}\tabcellsep 0.344\tabcellsep 0.344\\
5\tabcellsep 4\tabcellsep 0.5\tabcellsep 9\tabcellsep 0.310\tabcellsep 0.328\tabcellsep 0.328\\
6\tabcellsep 8\tabcellsep \multicolumn{2}{l}{0.33 9}\tabcellsep 0.290\tabcellsep 0.295\tabcellsep 0.295\\
7\tabcellsep 9\tabcellsep 0.5\tabcellsep \multicolumn{2}{l}{13 0.382}\tabcellsep 0.369\tabcellsep 0.369\\
8\tabcellsep 6\tabcellsep 1\tabcellsep \multicolumn{2}{l}{12 0.387}\tabcellsep 0.362\tabcellsep 0.362\\
9\tabcellsep 3\tabcellsep 1\tabcellsep 6\tabcellsep 0.334\tabcellsep 0.376\tabcellsep 0.376\\
10\tabcellsep 1\tabcellsep 1\tabcellsep 2\tabcellsep 0.112\tabcellsep 0.114\tabcellsep 0.114\\
11\tabcellsep 5\tabcellsep 1\tabcellsep \multicolumn{2}{l}{10 0.556}\tabcellsep 0.60\tabcellsep 0.60\\
12\tabcellsep 3\tabcellsep 1\tabcellsep 6\tabcellsep 0.254\tabcellsep 0.208\tabcellsep 0.208\\
13\tabcellsep 4\tabcellsep 1\tabcellsep 8\tabcellsep 0.445\tabcellsep 0.454\tabcellsep 0.454\\
14\tabcellsep 3\tabcellsep 1\tabcellsep 6\tabcellsep 0.230\tabcellsep 0.177\tabcellsep 0.177\\
15\tabcellsep 6\tabcellsep 1\tabcellsep \multicolumn{2}{l}{12 0.670}\tabcellsep 0.730\tabcellsep 0.730\\
\multicolumn{5}{l}{Table III. shows the scheduling rate and the}\tabcellsep \tabcellsep \\
\multicolumn{3}{l}{normalized throughput of the sensor nodes.}\tabcellsep \tabcellsep \tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_1}Table 3 :}\end{figure}
 			\footnote{© 2014 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[ Proceedings IEEE]{b11}\label{b11} 	 		\textit{},  	 	 		\textit{Proceedings IEEE}  		IEEE. 3 p. .  	 
\bibitem[Yaghmaee and &adjeroh (2008)]{b6}\label{b6} 	 		‘A new priority based congestion control protocol for wireless multimedia sensor networks’.  		 			M H Yaghmaee 		,  		 			D \&adjeroh 		.  	 	 		\textit{International Symposium on a World of Wireless, Mobile and Multimedia Networks},  				2008. June. 2008. WoWMoM 2008. 2008. IEEE. p. .  	 
\bibitem[Tassiulas ()]{b7}\label{b7} 	 		‘Adaptive back-pressure congestion control based on local information’.  		 			L Tassiulas 		.  	 	 		\textit{IEEE Transactions on Automatic Control}  		1995. 40  (2)  p. .  	 
\bibitem[Sarkar and &tassiulas ()]{b8}\label{b8} 	 		‘Back pressure based multicast scheduling for fair bandwidth allocation’.  		 			S Sarkar 		,  		 			L \&tassiulas 		.  	 	 		\textit{INFOCOM 2001.Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies.Proceedings.IEEE},  				2001. IEEE. 2 p. .  	 
\bibitem[Shakkottai et al. ()]{b14}\label{b14} 	 		‘Bounds on the throughput of congestion controllers in the presence of feedback delay’.  		 			S Shakkottai 		,  		 			R Srikant 		,  		 			S P \&meyn 		.  	 	 		\textit{IEEE/ACM Transactions on Networking (TON)}  		2003. 11  (6)  p. .  	 
\bibitem[Bender et al. ()]{b15}\label{b15} 	 		\textit{CDMA/HDR: a bandwidth efficient high speed wireless data},  		 			P Bender 		,  		 			P Black 		,  		 			M Grob 		,  		 			R Padovani 		,  		 			N Sindhushyana 		,  		 			A Viterbi 		.  		2000.  	 
\bibitem[Wan et al. (2003)]{b3}\label{b3} 	 		‘CODA: congestion detection and avoidance in sensor networks’.  		 			C Y Wan 		,  		 			S B Eisenman 		,  		 			A T Campbell 		.  	 	 		\textit{Proceedings of the 1st international conference on Embedded networked sensor systems},  				 (the 1st international conference on Embedded networked sensor systems)  		2003. November. ACM. p. .  	 
\bibitem[Ee and &bajcsy (2004)]{b0}\label{b0} 	 		‘Congestion control and fairness for many-to-one routing in sensor networks’.  		 			C T Ee 		,  		 			R \&bajcsy 		.  	 	 		\textit{Proceedings of the 2nd international conference on Embedded networked sensor systems},  				 (the 2nd international conference on Embedded networked sensor systems)  		2004. November. ACM. p. .  	 
\bibitem[Johari and Tan ()]{b13}\label{b13} 	 		‘End-to-end congestion control for the Internet: Delays and stability’.  		 			R Johari 		,  		 			D K H Tan 		.  	 	 		\textit{IEEE/ACM Transactions on Networking}  		2001. 9  (6)  p. .  	 
\bibitem[Chen et al. (2005)]{b10}\label{b10} 	 		‘Joint congestion control and media access control design for ad hoc wireless networks’.  		 			L Chen 		,  		 			S H Low 		,  		 			J C Doyle 		.  	 	 		\textit{INFOCOM 2005.24th Annual Joint Conference of the IEEE Computer and Communications Societies},  				2005. March.  	 
\bibitem[Tassiulas and &sarkar ()]{b9}\label{b9} 	 		‘Maxmin fair scheduling in wireless networks’.  		 			L Tassiulas 		,  		 			S \&sarkar 		.  	 	 		\textit{INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings.IEEE},  				2002. IEEE. 2 p. .  	 
\bibitem[Hull et al. (2004)]{b5}\label{b5} 	 		‘Mitigating congestion in wireless sensor networks’.  		 			B Hull 		,  		 			K Jamieson 		,  		 			H \&balakrishnan 		.  	 	 		\textit{Proceedings of the 2nd international conference on Embedded networked sensor systems},  				 (the 2nd international conference on Embedded networked sensor systems)  		2004. November. ACM. p. .  	 
\bibitem[Monowar et al. (2008)]{b2}\label{b2} 	 		‘Multipath congestion control for heterogeneous traffic in wireless sensor network’.  		 			M M Monowar 		,  		 			M O Rahman 		,  		 			C S Hong 		.  	 	 		\textit{10th International Conference on Advanced Communication Technology},  				2008. February. 2008. 2008. IEEE. 3 p. .  	 
\bibitem[Sridevi et al. (2012)]{b1}\label{b1} 	 		‘Priority based congestion control for heterogeneous traffic in multipath wireless sensor networks’.  		 			S Sridevi 		,  		 			M Usha 		,  		 			G P A \&lithurin 		.  	 	 		\textit{International Conference on Computer Communication and Informatics (ICCCI)},  				2012. January. 2012. IEEE. p. .  	 
\bibitem[Wang et al. (2006)]{b4}\label{b4} 	 		‘Priority-based congestion control in wireless sensor networks’.  		 			C Wang 		,  		 			K Sohraby 		,  		 			V Lawrence 		,  		 			B Li 		,  		 			Y Hu 		.  	 	 		\textit{IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing},  				2006. June. 2006. IEEE. 1 p. 8.  	 
\bibitem[Paganini et al. ()]{b12}\label{b12} 	 		‘Scalable laws for stable network congestion control’.  		 			F Paganini 		,  		 			J Doyle 		,  		 			S Low 		.  	 	 		\textit{Proceedings of the 40th IEEE Conference on Decision and Control},  				 (the 40th IEEE Conference on Decision and Control)  		2001. 2001. IEEE. 1 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
