\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={Longer Distance Hop Count based Priority Congestion Control Technique for Wireless Sensor 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{2014-01-15 (revised: 15 January 2014)}
\def\TheID{\makeatother }
\def\TheDate{2014-01-15}
\title{Longer Distance Hop Count based Priority Congestion Control Technique for Wireless Sensor 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]{Neelu  Rajput}

             \author[2]{Dr. Dharm  Singh}

             \author[3]{Dr. Naveen  Choudhary}

             \affil[1]{  Maharana Pratap University Of Agriculture and Technology,Udaipur, Rajasthan India}

\renewcommand\Authands{ and }

\date{\small \em Received: 16 December 2013 Accepted: 5 January 2014 Published: 15 January 2014}

\maketitle


\begin{abstract}
        


Wireless Sensor Network consists of large number of tiny sensor nodes (Tsodes) distributed in an area, having insufficient processing power, communicating over a network. These Tsodes are circulated in given network environment so that they gather data, process that data and send it to the destination. Rising large applications need to transport massive data packets to the sink node from different sensor nodes without having much loss of data packets in the network. Network must be escaped from the congestion, occurs usually at the Tsodes nearer to base station / sink node. Congestion not only causes packet loss, but also leads to unnecessary energy consumption as well as delay. Therefore, in order to extend network lifetime and improve fairness and provide better quality of service, developing a novel solution for congestion estimation and control is important to be considered. This paper proposes a approach of packet level priority for controlling the congestion in WSN. It uses the hop count value and the distance vector among sink and Tsodes. The technique avoids the congestion faster and improves the overall network throughput and delay too for WSN.

\end{abstract}


\keywords{wireless sensor network, congestion control, priority congestion control protocol.}

\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
wireless sensor network (WSN) is a network of hundreds or thousands of Tsodes(tiny sensor nodes), where each node is capable of sensing, processing the data and communicating with other Tsodes through the components such as transmitter and receiver. Usually these Tsodes are found in the form of accelerometer, temperature sensors , acoustic, thermal and visual sensors, these are used for sensing the environmental characteristic like lightning condition, sound, direction or size of any object. A typical WSN is usually installed for the task requiring very precarious duty but at the same time the system must be able to operate automatically without necessitating human caution while extending the lifetime of whole network. These WSNs devices are very small in size but the network puts some constrains on Tsodes like the limited computation capability, limited battery life and off course the limited memory or space of each Tsode. Hence, in order to deploy such network i.e. a WSN, these constraints must be considered before creating the network.\par
The autonomous Tsodes of WSNs communicate with each other to exchange and to forward the data gathered by sensing the environment and its physical condition parameters.\par
Typically, WSNs are considered as the network of lighter operations, but sometime network may undergo the sudden fluctuations of large, massive and immediate synchronized needs of data, these needs may suddenly result in congestion. Alternatively, some Tsodes may be the reason of constant generation of data streams. And this data is transmitted towards a single sink/Base Station. These large numbers of packets at sudden instance of time make the network condition unbalanced as such traffic load is uncontrollable for limited link capacity. Various other reasons like single intermediate Tsode failure and security attacks can also make the condition worsened. The network must be protected from such congestion building situations in WSN environment. This paper explores the problems faced by various congestion controlling protocols in WSNs. We propose a new packet level priority-based congestion control protocol (PPCCP). We aids following: 1. We use hop count value and distance vector to decide the priority of every node in order to control the congestion while data is being transmitted from Tsodes to Base Station(Sink). Hop count is the number of intermediate nodes between source and sink node in route while transmitting the upstream data.The distance vector is the distance(in meters) between source and sink node. It is more about avoiding the congestion rather than handling it. 
\section[{It recognizes the priority dependent fairness among}]{It recognizes the priority dependent fairness among}\par
Tsodes so that high throughput can be achieved by controlling congestion at each node. 3. It avoids the high buffer occupancy. As a result it achieves the low packet delay and high link utilization.\par
The research paper is organized as follows: Section II gives a short description of congestion and their controlling phases for WSNs. Section III presents the priority based congestion controlling approach for WSNs. In Section IV, the existing techniques have been presented, and then in troducinga new technique to  
\section[{Congestion in wsn}]{Congestion in wsn}\par
Congestion is an additional problem that must be considered carefully in transport protocols because the impacts of congestion are very drastic in terms of both packets and energy loss. And these influence the overall network delay, through put and efficiency of WSN. Congestion cannot be neglected when the priority of traffic is high as sometimes in some critical areas the loss packets and delay can bring down the system to failure permanently. It is also a major reason for cost concern. WSN needs very high attention towards the congestion control as: 
\section[{Energy (Transmission of one KB data) =Energy(Execution of three million instructions)}]{Energy (Transmission of one KB data) =Energy(Execution of three million instructions)}\par
The above statement shows that the loss data/ packets is not simply affordable in WSNs. Network must be protected from congestion.\par
Packets are discarded because the network is not adopting any fairness among Tsodes; sometimes the higher priority traffic is compromised and discarded unselectively. Network is needed to afford high energy consumption for communicating the data and this flooded data causes the failure of channels. These over flooded channels make the life of whole network diminished. The problem of congestion increases when some nodes are ideal but still they are wasting the energy by occupying the routes worthlessly. The drastic impacts of congestion cannot be ignored, an effective step is needed to control the congestion while there are various schemes have been coined to mitigate the congestion, these schemes are usually found in the form of differentiated and priority based technique.\par
Each Tsode has a limited battery life; the undesired retransmission of packets requires the higher power consumption, which is worthless when the packet drops increases above a threshold value. Because, the life of network has already been deteriorated.\par
Typically sensor networks suffer from two types of congestion. One of them is node level congestion that is triggered by node's queue or buffer overflow and results in high packet loss, and high queuing delay also. The lost packets are required to be retransmitted and therefore it requires more or additional energy.\par
When the architecture of network is consisted of a simple flat topology, a single sink/base station node design, the probability of occurring congestion is higher at the node deployed nearer to the base station. These nodes are called as intermediate nodes also, having higher probability of congestion because all data is routed through these nodes.\par
Congestion of packets at such nodes causes the high packet loss as sometimes the number of source Tsodes connected to intermediate nodes is very high. The energy consumed in such dropped packets is also worthless after congestion. The problem increases when large number of Tsodes attempt to access the same medium or channel at the same time for packet transmission. The number of packets goes beyond the capacity of channel and this state makes the network condition worsened. It drops the channel utilization factor by great extent. Consequently it decreases the overall network throughput. The congested WSN is not efficient in terms of energy as well as in terms of QoS, makes the network unreliable also. 
\section[{III.}]{III.} 
\section[{Congestion Control in wsn}]{Congestion Control in wsn} 
\section[{Congestion}]{Congestion}\par
Congestion occurs mainly in the sensor to sink way when packets are transmitted in a many to one direction. Therefore mainly various congestion control techniques are invented to lighten the congestion in this direction only.\par
Congestion control generally goes through three phases: Detection of Congestion, notification, and congestion handling i.e. rate adjusting. The proficiency of any wireless sensor network can be determined by considering the following qualifying parameters: 1.System must be energy efficient; loss of power consumption is undesirable for such networks.2. Each Tsode must be treated impartially, fairness should be maintained to avoid the unwanted packet loss, and queue management is also an essential feature for any node. 3. Network must be responsive about the overall throughput, delay and packet loss rate, it is very important to be cautious about the networks Qos all the time. 
\section[{IV. Priority based Congestion Control}]{IV. Priority based Congestion Control}\par
Technique-an Overview\par
The section presents the scheduling rate based priority congestion control technique for WSNs. Usually WSN is considered as the network of light load or slighter capacity but sometimes large number of nodes try to transmit the packet to a single sink node or a single intermediate node. .Congestion occurs mainly in the sources to sink directions when packets are transmitted in a many to one way. Therefore, many congestion controlling techniques usually aim toward this direction only.\par
PCCP(Priority Based Congestion Control Protocol) is designed to acquire following goals : i) In every WSN ,each sensor node might have different priorities due to their functionality or their location. So a PCCP technique is required to guarantee the biased equality among all nodes where each intermediate node gets a biased fair throughput from all Tsodes. 2) Network must have such congestion controlling techniques that should be able to improve energy efficiency and various Qos must not be compromised at any stage of transmission.\par
PCCP tries to confine the packet loss rate as low as possible by allowing the biased fairness for all Tsodes and it is also responsible for controlling the overhead of multipath routing. PCCP operates in three stages: Detection of Congestion, Congestion Notification Implicitly, and congestion handling/priority based flow rate adjustment.\par
First stage analyses the packet service time and packet inter arrival time to detect the congestion. It results in congestion detection by using this ratio, and therefore it provides very helpful and rich congestion detection information.\par
Priority based techniques introduces a sensible approach for notifying the congestion to network, called as implicit congestion notification. It does not need the extra overhead of notification bit explicitly. Information of congestion is implanted in the header field itself.\par
Finally, the PCCP technique aims to design the most promising approach for controlling the traffic scheduling rate at each Tsode to make sure that no impartiality is found among Tsodes. Throughput or fairness is not compromised for any Tsode. Here each Tsode/source is allotted a priority value. The rate adjustment algorithm is designed to sure that:1 Large Channel Bandwidth is allotted to the Tsode having higher priority value all the time. 2. No impartiality for two Tsodes having equal priority. 3. Another aspect for maintaining the fairness among all Tsodes is to ensure that more bandwidth should be allotted to the node having higher traffic generation capability. The use of three types of priority index makes the PCCP with highly flexible in weighted fairness. 
\section[{a) Proposed Technique i. Network Model}]{a) Proposed Technique i. Network Model}\par
The upstream congestion controlling approach for a WSN has been proposed in the paper. It maintains the single-path routing. In Fig. 1, Each Tsode (Tiny Sensor Node) generates its own continuous source traffic and these all Tsodes form many-to-one convergent stream of traffic towards the upstream path. We assume that they are implementing CSMA-like MAC protocol. Each Tsode is founded to have two categories     
\section[{Longer Distance Hop Count Prioritization Congestion Controlling Approach}]{Longer Distance Hop Count Prioritization Congestion Controlling Approach}\par
To avoid the congestion, we assign the priority to each node on the basis of their hop count value i.e the number of hops between the source node and Base Station (Sink). When two or more nodes have number of hop count value then the node with the longest distance is assigned higher priority to send the packets first.\par
To handle the congestion, whenever congestion is detected at any node, the approach says that the packets from higher priority nodes must not be Two novel approaches were coined for congestion control:\par
The first is AIMD(Additive Increase and Multiplicative Decrease) this approach uses the principle of detecting the congestion first and then it tries to solve the problem. It is being employed for TCP protocol. The information about congestion is propagated through congestion notification message bit. Unfortunately, AIMD is found to be inefficient as network has already made much loss of packets and the traffic scheduling rate adjustment procedure is not quite effectual after the congestion has already been detected. The congestion notification message does not contain the adequate information about the congestion. Sometimes the approach starts to work after the channels /links have already been declared failed by the network protocols.\par
To overcome the problem of AIMD, a new approach named as PRA(Priority Rate Adjustment) was introduced; the approach is capable to control the congestion to a great extent. Before the congestion is detected at any node, we can follow the given priority decision procedure to avoid the congestion . 
\section[{Priority\textunderscore Decision():}]{Priority\textunderscore Decision():}\par
(1)Initialization with default values (2)flag=0,i=0,node=-1,l=0,maximum=2500,Distance=0,ThresholdDistance =0,Packet\textunderscore Size=256,Interval=0.05,count=0,p=1 First the paper considers it to be a single-path routing, where each packet is routed through the chain of Tsodes connected in single parent fashion. 1) The nodes within in the range of 160 meters from any particular node are considered as neighbouring nodes. Among all these neighbouring nodes, the node which is at longest distance from Base Station is chosen to send the Packets as First Source Tsode.\par
2) The traffic generated by the highest distance node is given the priority to be scheduled first.\par
3) The decision of priority can be taken through the hop count value of each packet also at initial stage . Higher the hop count value, obtains the highest priority to schedule the traffic first.\par
However if congestion is detected at any node then it can be handled in the similar fashion. For e.g. If any intermediate node x gains the information of congestion about the Tsodes connected to this through the congestion notification. Node x then tries to mitigate congestion by altering the transit traffic rate or Tsode source traffic generation rate. 
\section[{VI.}]{VI.} 
\section[{Simulation Results}]{Simulation Results}\par
Even though PCCP could be affordable in terms of time, space complexity and consumed energy to mitigate the congestion in network, but the proposed approach shows that how PCCP can be extended to  
\section[{a) Throughput}]{a) Throughput}\par
The following graph shows that how at simulation time=50 ns , the throughput is increased from 80 kbps to 120 kbps. This is because some nodes always gets the higher priority to send the data and the packet drop of such nodes is always avoided so this can be seen here that the throughput is constant for such approach and higher than existing technique i.e. PCCP. 
\section[{b) Delay}]{b) Delay}\par
The following graph shows the overall network delay. Delay decreases dramatically as fairness is always maintained, the node at highest distance claims to be the first sender, the delay for such nodes is lowest and other nodes also gets their transmission on low delay because they are not so far from base station , it does not take high delay for such nodes. 
\section[{Packet Drop}]{Packet Drop}\par
The proposed approach claims to minimize the number of packet drops because the traffic generated at higher priority node will never be allowed to compromise at any instance of time. Longer the distance of source node from sink, gets higher priority and in this way the packet transmitted from such nodes are never dropped. The following graph shows the number of packet drops at different-different instance of simulation time. 
\section[{VII.}]{VII.} 
\section[{Conclusion}]{Conclusion}\par
The proposed longer distance hop count based approach for Wireless Sensor Networks works on the principle of packet level priority for each node. The results show that how it can be proved better than the existing one, when it is used to extend the PCCP. Simulation results show that: (1) Proposed approach achieves high throughput; (2) It claims to avoid/reduce packet drop and therefore improves energy-efficiency, and graphs show the lower delay than existing one. Year 2014\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}A}\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{© 2014 Global Journals Inc. (US)} 			\footnote{© 2014 Global Journals Inc. (US) Longer Distance Hop Count based Priority Congestion Control Technique for Wireless Sensor Networks} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Zawodniok and Jagannathan ()]{b5}\label{b5} 	 		\textit{},  		 			M Zawodniok 		,  		 			S Jagannathan 		.  		2005.  	 
\bibitem[Yong-Min et al. ()]{b0}\label{b0} 	 		\textit{A Extended DCCP Congestion Control in Wireless Sensor Networks},  		 			L Yong-Min 		,  		 			J Xin-Hua 		,  		 			Ieee 		,  		 			W Ding 		,  		 			G Marchionini 		.  		2009. 1997.  		 			University of Maryland at College Park 		 	 	 (Technical Report) 	 (A Study on Video Browsing Strategies) 
\bibitem[Bandyopadhyay and Coyle ()]{b2}\label{b2} 	 		\textit{An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks},  		 			S Bandyopadhyay 		,  		 			E J Coyle 		.  		2003. IEEE.  	 
\bibitem[Azizi et al. (2013)]{b9}\label{b9} 	 		‘Bandwidth Assignment in a Cluster-based Wireless Sensor Network’.  		 			L Azizi 		,  		 			R Beghdad 		,  		 			M Oussalah 		.  		 WCE2013.  	 	 		\textit{Proceedings of the World Congress on Engineering}  		2013. July 3 -5, 2013. II.  	 
\bibitem[Deshpande et al. ()]{b3}\label{b3} 	 		\textit{Congestion Control In Wireless Sensor Networks using Differed Reporting Rate},  		 			V S Deshpande 		,  		 			P P Chavan 		,  		 			V M Wadhai 		,  		 			J B Halonde 		.  		2012. World Congress On Information And Communication Technologies.  	 
\bibitem[Li and Jing ()]{b8}\label{b8} 	 		\textit{Feedback Congestion Control Protocol for Wireless Sensor Networks IEEE},  		 			M Li 		,  		 			Y Jing 		.  		2012.  	 
\bibitem[Li and Jing ()]{b10}\label{b10} 	 		\textit{Feedback Congestion Control Protocol for Wireless Sensor Networks IEEE},  		 			M Li 		,  		 			Y Jing 		.  		2012.  	 
\bibitem[Sergiou ()]{b7}\label{b7} 	 		\textit{Performance-Aware Congestion Control in Wireless Sensor Networks using Resource ControlIEEE},  		 			C Sergiou 		.  		2013. 2013.  	 
\bibitem[Predictive Congestion Control MAC Protocol For Wireless sensor Networks International Conference on Control and Automation]{b6}\label{b6} 	 		‘Predictive Congestion Control MAC Protocol For Wireless sensor Networks’.  	 	 		\textit{International Conference on Control and Automation},  				 	 
\bibitem[Sridevi et al. (2012)]{b4}\label{b4} 	 		‘Priority Based Congestion Control For Heterogeneous Traffic’.  		 			S Sridevi 		,  		 			M Usha 		,  		 			G P A Lithurin 		.  	 	 		\textit{Multipath Wireless Sensor Networks International Conference on Computer Communication and Informatics (ICCCI -2012)},  				 (Coimbatore, INDIA)  		2012. Jan. 10 -12, 2012.  	 
\bibitem[Winstein and Balakrishnan ()]{b11}\label{b11} 	 		‘TCP ex Machina: Computer-Generated Congestion Control’.  		 			K Winstein 		,  		 			H Balakrishnan 		.  	 	 		\textit{ACM SIGCOMM 2013 annual conference in Hong Kong},  				2013.  	 
\bibitem[Wang et al. (2007)]{b1}\label{b1} 	 		‘Upstream Congestion Control in Wireless Sensor Networks Through Cross-Layer Optimization’.  		 			C Wang 		,  		 			B Li 		,  		 			K Sohraby 		,  		 			M Daneshmand 		,  		 			Y Hu 		.  	 	 		\textit{IEEE journal on selected areas in communications}  		2007. may 2007. 25  (4) .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
