\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={Multilevel Downlink Relay Queue Aware and Loss Recovery Scheduling for Media Transmission in Wireless Cellular 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-01-15 (revised: 15 January 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-01-15}
\title{Multilevel Downlink Relay Queue Aware and Loss Recovery Scheduling for Media Transmission in Wireless Cellular 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]{A.Veerabhadra  Reddy}

             \author[2]{Dr. D. Sreenivasa  Rao}

             \affil[1]{  Jawaharlal nehru university - Anantapur.}

\renewcommand\Authands{ and }

\date{\small \em Received: 6 December 2011 Accepted: 31 December 2011 Published: 15 January 2012}

\maketitle


\begin{abstract}
        


In this document, we study the result of multi hop relaying on the throughput of the downstream channel in cellular networks. In particular, we contrast the throughput of the multi hop method through that of the conventional cellular system, representing the feasible throughput development by the multi hop relaying under transitive transmission considerations. We moreover propose a hybrid control plan for the multi hop communicate, in which we activist the use of in cooperation, the straight transmission and the transitive multi hop relaying. Our study illustrates that the majority of the throughput gain can be obtained with the related of a transitive relaying scheme. Important throughput improvement could be moreover obtained by operating the simultaneous relaying transmission in conjunction with the non simultaneous transmission. We also disagree here that the multi hop relaying technology can be developed for mitigating injustice in qualityof- service (QoS), which arrive due to the location-dependent signal quality. Our outcomes demonstrate that the multi hop system can provide more even QoS over the cell district. The multi hop cellular system design can also be used as a selfconfiguring network mechanism that efficiently contains variability of traffic distribution. We have studied the throughput development for the consistent, as well as for the non uniform traffic distribution, and we conclude that the utilization of transitive relaying in cellular networks would be relatively robust to alter in the actual traffic distribution.

\end{abstract}


\keywords{Mobility prediction, mobile positioning, location tracking, handoff prioritization, dynamic, resource reservation.}

\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
ULTI HOP cellular networks have been proposed as an addition to the conventional single-hop cellular network by joining the fixed cellular infrastructure with the multi hop relaying technology that is frequently used in ad hoc networks. Due to the potential of the multi hop relaying to enhance coverage, ability and flexibility, the multi hop cellular networks have been drawing considerable notice. This approach of augmenting cellular communication with multi hop relaying was also used in the consistency effort to include the multi hop relaying into the thirdgeneration (3G) mobile communication systems \hyperref[b0]{[1]}. The main advantage of the multi hop relaying arrives from the reduction in the overall path loss among a base station (BS) and a mobile station (MS) \hyperref[b1]{[2]}.\par
However, the penalty for using multi hop relaying is in the necessitating for extra radio channels. Another advantage of the multi hop relaying is the path diversity increase that can be achieved by picking the mainly favorable multi hop path in the shadowed environment. This diversity increase can increase with the quantity of MSs, as then the quantity of potentially transmit candidates raise and the likelihood of finding a relay with lesser path loss increases as well.\par
In addition, the system's ability can additionally increase by permitting concurrency among the multi hop broadcast. However, such concurrency also raises the interference. So, the overall result is not instantly clear.\par
As we saw above, the performance of the multi hop cellular networks is ruled by different tradeoffs. Thus, to get advantage from the multi hop relaying, the different tradeoffs must be comprehensively studied. However, the study of such tradeoffs in the literature is extremely limited. In scrupulous, the analysis of the transaction caused by the simultaneous transmissions among the interference and the channel reuse efficiency is of very importance. Toumpis and Goldsmith \hyperref[b2]{[3]} showed that the simultaneous transmission can improve the system capacity of the multi hop cellular networks. However, their outcomes were obtained for a single cell system and in just two cases of complex topology, i.e., a linear topology and a single comprehension of a haphazard topology. Hence, those outcomes are inadequate to demonstrate, in common, the concurrency exchange. Moreover, numerous studies account that it is not easy to improve the capacity of code-division multiple-access (CDMA) systems by utilize of the multi hop relaying \hyperref[b4]{[5]} - \hyperref[b8]{[9]}. This is mostly due to the interference increase resulting from the simultaneous transmissions. Such interference may be the most significant factor limiting the network capacity. Hence, the collision of the concurrent transmission must be carefully investigated. The multi hop relaying technology can give a significant flexibility in the design and the operation of the cellular system. On the multi hop cellular system, MS preserve decide to utilize the multi hop relaying instead of the single-hop direct transmission. Such a hybrid operation can be exploited for different purposes; one of which is to mitigate the unfairness in the quality of service (QoS) between the users. In cellular networks, there is a tradeoff difficulty between system throughput and QoS fairness \hyperref[b3]{[4]}. Since the established signal excellence depends on the user location, it is not easy to give an even QoS over the entire cell service region and to maximize the system throughput at the similar time. On the other hand, the use of multi hop relaying, instead of a direct link, can develop the QoS of the users with poor direct links who are situated near the cell boundary or in a deep shadowed district. Therefore, the equation, as well as scheme throughput in the cellular network can be better through the use of the multi hop relaying.\par
An additional application exploiting the flexibility of the multi hop relaying technology is to mitigate the inefficiency due to the temporal changes in traffic demand in cellular scheme. To optimize the appearance of a cellular scheme, discover the optimum positions of the cell sites is a fundamental problem with interferenceimperfect systems, such as the CDMA category scheme. However, due to the ever-changing traffic demand patterns, optimal placement of cell site is a complex problem. Even if the traffic allocation could be predictable, it would still be complex to optimally plan the radio network, as the fixed cell sites cannot be relocated whenever the traffic allocation changes. Hence, there is a requirement for a self-configuring network, which would be capable of automatically coping with the alteration in traffic distribution. In the multi hop cellular system, the unusual collection of the multi hop path can allow flexible design of the cell site, which is mainly important in the case of non regular traffic allocation. Thus, the multi hop cellular system design can be utilized as a self-configuring network method that can efficiently accommodate the spatial and temporal inconsistency of traffic patterns.\par
Although the multi hop relaying technology has been future as one of the key technologies of the selfconfiguring cellular networks \hyperref[b9]{[10]}, \hyperref[b10]{[11]}, there have been merely little numerical results clarifying how the selfconfiguring feature achieved during the multi hop relaying can develop the system's ability for non consistently distributed traffic case. Although Wu et al. \hyperref[b11]{[12]} evaluated the capacity of the multi hop system with non consistent traffic, such that when the traffic among adjacent cells is unstable, that paper focused only on the channel borrowing among adjacent cells through multi hop relaying. Moreover, a few features of the multi hop transmit, such as path-loss diminution and path variety, were not measured in their study. Hence, their outcome may not be able to completely explain the behavior of the self-configuring capability of multi hop relaying itself.\par
The problem studied here is to plan a scheduling algorithm for multi-hop relay wireless cellular networks, so that it can correctly position the concurrent transmission scenarios for multi-hop relay links, and the overall network throughput can be improved. 
\section[{II.}]{II.} 
\section[{Related work}]{Related work}\par
The study of combining relay networks with cellular networks has been going on for quite a while. In \hyperref[b11]{[12]}, an RS is equipped with together WLAN and cellular network interfaces to help with cellular traffic forwarding with WLAN links, aiming to achieve throughput development and load balancing. In \hyperref[b12]{[13]}, the MS is assumed to contain both WLAN and 3G interfaces for traffic communicates. On-demand direction-finding protocols are urbanized to discover relay paths, and incentive schemes are designed to encourage the MS to transmit traffic for other MS. In \hyperref[b13]{[14]}, a clique discovery algorithm is proposed to place the concurrent transmissions in a multi-hop relay cellular system, and relay nodes contain WLAN or WPAN edge in addition to the cellular network interface. The authors believe that the MS is presented all over in the relay path and can serve as a communicate node. Dissimilar from the over loom where a separate relay interface is required, other approaches illustrate below let the relay path share the identical physical interface of the cellular system. In \hyperref[b14]{[15]}, multiple portable stations appearance multi-hop ad hoc network inside cellular system and ad hoc steering is oppressed to extend system throughput. In \hyperref[b15]{[16]}, the MS is used to communicate traffic, while simultaneous transmissions are investigated with an easy network topology, though the source is based on account and hence is not appropriate for practical purpose. In \hyperref[b16]{[17]}, a distributed scheduling algorithm is developed to schedule concurrent transmissions in a cellular relay network aiming at maximizing throughput while avoiding data collision in the communicate links. As a consequence, each mobile knob has to pay for the signaling and bandwidth overhead for the distributed algorithm. The over approaches have one thing in general, which is the ad hoc implementation of a relay network within cellular network architecture. One benefit of the ad hoc implementation is the abundance of ad hoc routing protocols that can provide in communicates routing. Besides, the ad hoc steering protocol consequences in flexibility in the selection of relay routes. However, the ad hoc implementation has a few drawbacks. The first drawback is that ad hoc routing needs every node in the relay network to contribute in the route discovery process that involves distribution, feedback, and onward of routing communication, and this participation need significant modifications of the signaling protocols of wireless cellular system. These momentous modifications in the indication protocols of the BS and the MS make the present cellular network operator reluctant to deploy relay network. Second, the algorithm for discovery ad hoc routing occupies a definite amount of bandwidth from every mobile node, and additional bandwidth expenditure is anticipated in order to continue the routing bench up to date, since nodes are movable in the scheme. Third, the recurrent alter in the routing table decrease the consistency of the data delivery and authority the total complex throughput. Therefore, the ad hoc implementation is unattractive to the network machinist in manufacturing, since the BS, the RS, and the MS all embrace to correct for the architecture changes of the cellular network, and the additional signaling overhead and bandwidth consumption incurred for each MS is significant. Observing the disadvantage of the ad hoc implementation of a relay network, we prefer an approach that involves least network architecture changes and still can enjoy the advantages of multi-hop simultaneous transmissions. A desirable solution must be able to incorporate a relay network into the existing cellular network with unimportant architecture modification and little realization slide, and the new network construction is still handy from the point view of the network operator.\par
When designing a relay network within the cellular network, there are several optional factors, such as whether or not the relay networks accepts the ad hoc implementation as converse over, and whether or not the RS must use the identical cellular spectrum to relay traffic, referred to as in-band relay. Other option include whether or not the MS can provide as the RS and whether or not the scheduling algorithm for simultaneous transmissions should be centralized. How to wisely select among these options to form an adaptive relay network is a difficult task. With such effort is the development of a WiMAX draft standard, 802.16j \hyperref[b19]{[20]}, which is a revision of WiMAX with the aim of incorporating relay network into WiMAX network. This 802.16j draft standard has the subsequent characteristics. The RS in 802.16j is for relay traffic simply, and the forecast algorithm is federal and run in the BS. The RS uses the identical spectrum as the BS and the MS, and no ad hoc steering is suitable in the relay paths. The approach in 802.16j permit WiMAX network to incorporate relay network without sacrificing WiMAX network architecture, and the WiMAX BS is still able to control the RS. One research work \hyperref[b17]{[18]} study the scheduling algorithm in 802.16j, and it utilizes directional antennas to exploit the space use again of frequency resources in multi-hop relay cellular network under a Manhattan-like environment. Although scheduling algorithm is given to improve network throughput, but how to decide the simultaneous transmissions on the relay network is not addressed.\par
What inspires our research is the work in \hyperref[b18]{[19]}, which suppose a multi-hop wireless mesh backhaul network with in-band communicate. Each RS cumulates the traffic from the close MS. A linear programming model is then developed to evaluate the minimum time to transmit a fixed data load from the BS to every RS above likely multiple hops. Since the transmission time is reduced for the fixed information load, throughput is exploiting. However, it does not in use into reflection the varying line size of each relay station; neither does it relate the frame boundary of cellular network into the transmission. Since wireless cellular networks are mainly frame-based, it is non-trivial to study the scheduling algorithm for multi-hop relay network under frame-based statements. 
\section[{III.}]{III.} 
\section[{Network architecture and challenges}]{Network architecture and challenges}\par
In a cellular network with frame-based transmissions, base Station attach to relay station and/or mobile station, and every relay station can attach further to additional relay station and/or mobile position. Relay position only ahead traffic to/from mobile station and produce no traffic on its own. Relay station is visible to a mobile station, and mobile station does not engage in routing packets for additional mobile station. Base station, relay station, and mobile station all share the similar spectrum, thus no additional hardware such as a second physical interface is required. Base station needs to meet the downlink real time queue range of its related relay station and this queue information is sent to the base station with uplink bandwidth. The resulting signaling change due to uplink queue status report is unimportant, and the matching uplink bandwidth consumption is neglect able. After gathering relay station queue.\par
Queue information, base station runs the scheduling algorithm to get the downlink scheduling results and broadcasts the outcome to relay station and mobile station.\par
As the input for the scheduling algorithm, simultaneous transmission scenarios need to be resolved in a capable way. When adding a link candidate into a simultaneous transmission scenario, it must be sure that adding this link will not decrease the total throughput of this scenario. However, it is not practical to cross all possible links searching for simultaneous scenarios due to the nonlinear development of links with respect to number of MS and RS.\par
The challenge is due to information that wireless cellular networks are mainly frame-based, and the equivalent scheduling algorithm must take this factor into consideration. In each frame, different simultaneous scenarios must share this frame period. Thus arises the matter of a fair share of time resources between different MS who share one frame, while still achieving the goal of achieving max network throughput.\par
The third challenge is to let the scheduling algorithm regulate to the real time queue size change in RS. Implementation of Scheduling Algorithm under Linear Programming:\par
Volume XII Issue XIII Version I  The number of links grows non-linearly with the number of nodes in the network; it is impractical to use a comprehensive algorithm to search for all probable scenarios.\par
We use a linear programming model confirmed to compute the transmission schedules for all simultaneous transmission scenarios, aiming at maximizing the throughput in each frame. Here we consider the transmission schedules those subjective by the transitive relations between BS and RS. 
\section[{b) Structure of Greedy effect}]{b) Structure of Greedy effect}\par
In this Greedy Approach we apply the back force flow control mechanism. This mechanism states that in order to maximize the end to-end throughput in multi hop wireless network, the chosen simultaneous transmissions must be able to get the most out of the object function. We use a greedy algorithm to get a set of simultaneous transmission scenarios, with the back force flow control mechanism included in the greedy algorithm. Which are defined as:\par
IV. 
\section[{Implementation methodology and results}]{Implementation methodology and results}\par
The Queue aware scheduling under transitive connection considerations has been implemented using mxml and action script. The accomplishment is based on multi-hop relay based wireless cellular network routing functions that are added. In additional to building QoS routes, the protocol also establishes a best schedule plan when it learns such obligation. The best-effort scheduling is used to enhance the throughput. A distributed protocol which dynamically generates and updates broadcast schedules between the nodes has been used. Assumed transmission rate is 1 Mbps. The proposed model detects all simultaneous transmissions, and responds by invoking scheduling behavior as suitable. The relay station queues that are transitively associated with BS also be measured to end the Queue capacity of the relay station that relies on the middle between BS and transitive relay station. We apply greedy search techniques to recognize simultaneous relations of the replication. And finally end the scheduling strategy using the linear program technique proposed. These greedy searches and linear approach we implemented using action script. The linear approach considers the 6 different constraints explored above.\par
Volume XII Issue XIII Version I  Where 'i' is RS index and r is transitive RS index and tc is transitively associated relay station count. 's' and 'w' stands for node i's upstream and downstream node, correspondingly;\par
3.\par
( , ) ( , ) ( ) m ij ij k m x k t w k t T t ? × ? 4. 
\section[{Conclusion and future work}]{Conclusion and future work}\par
We have offered a Transitive relation aware scheduling algorithm for multi-hop relay wireless cellular networks. Through our analysis, we dispute that following a centralized approach for building cellular relay networks best reflects the interest of the cellular networks. This central approach implies that relay stations and mobile stations do not form ad hoc networks and they are under the control of bottom station. Another selection of building communicates cellular networks we follow include using in-band spectrum of relay stations, not permit mobile stations to provide as relay position, and relate centralized preparation algorithm. An essential scheduling algorithm is developed and base stations will run this preparation \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-4.png}
\caption{\label{fig_2}4 :,}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{fig_3}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{12}\includegraphics[]{image-6.png}
\caption{\label{fig_4}Fig. 1 :Fig. 2 :}\end{figure}
 			\footnote{© 2012 Global Journals Inc. (US)Global Journal of Computer Science and Technology} 		 		\backmatter  			 
\subsection[{Year}]{Year}\par
algorithm. In the preparation algorithm, initial a locate of simultaneous transmission scenarios is the result and then it is used as input for a linear programming model that decide the transmission schedules for the multi-hop communicate network. The linear encoding model aims at exploiting the overall throughput of the all the mobile stations, while taking into attention the frame-based environment of cellular networks and the dynamic queue modify in the relay position The skin of frame-based and queue-awareness of the preparation algorithm are the single assistance that have not been addressed by earlier work. Simulations calculate performance metrics such as throughput and equality of the proposed scheduling algorithm. Two extra scheduling algorithms are evaluated with our approach via simulations. One is scheduled for straight transmission only, and the other is scheduled with no buffer in the communicate nodes. The effectiveness of our loom is authenticated by the replication results.			 			  				\begin{bibitemlist}{1}
\bibitem[Lee et al. (2007)]{b16}\label{b16} 	 		‘A Novel Distributed Scheduling Alorithm for Downlink Relay Networks’.  		 			Y.-N Lee 		,  		 			J.-C Chen 		,  		 			Y.-C Wang 		,  		 			J.-T Chen 		.  	 	 		\textit{IEEE Trans. Wireless Commun}  		Jun. 2007. 6  (6)  p. .  	 
\bibitem[Fujiwara (2002)]{b4}\label{b4} 	 		‘Area coverage and capacity enhancement by multi hop connection of CDMA cellular network’.  		 			A Fujiwara 		.  	 	 		\textit{Proc. IEEE Vehicular Technology Conf. 2002 Fall},  				 (IEEE Vehicular Technology Conf. 2002 FallVancouver, BC, Canada)  		Sept. 2002. p. .  	 
\bibitem[Becher et al. (2001)]{b10}\label{b10} 	 		‘Broad-band wireless access and future communication networks’.  		 			R Becher 		,  		 			M Dillinger 		,  		 			M Haardt 		,  		 			Mohr 		.  	 	 		\textit{Proc. IEEE},  				 (IEEE)  		Jan. 2001. 89 p. .  	 
\bibitem[Rouse et al. (2002)]{b8}\label{b8} 	 		‘Capacity and power investigation of opportunity driven multiple access (ODMA) networks in TDDCDMA based systems’.  		 			T Rouse 		,  		 			I Band 		,  		 			S Mclaughlin 		.  	 	 		\textit{Proc. IEEE ICC},  				 (IEEE ICCNew York)  		2002. Apr. 2002. p. .  	 
\bibitem[Toumpis and Goldsmith (2002)]{b2}\label{b2} 	 		‘Capacity regions for wireless ad hoc networks’.  		 			S Toumpis 		,  		 			A Goldsmith 		.  	 	 		\textit{Proc. IEEE ICC},  				 (IEEE ICCNew York)  		2002. Apr. 2002. p. .  	 
\bibitem[Rouse et al. (2001)]{b7}\label{b7} 	 		‘Coveragecapacity analysis of opportunity driven multiple access (ODMA) in UTRA TDD’.  		 			T Rouse 		,  		 			S Mclaughlin 		,  		 			H Haas 		.  	 	 		\textit{Proc. IEE 3G Mobile Communication Technologies},  				 (IEE 3G Mobile Communication Technologies)  		Mar. 2001. p. .  	 
\bibitem[Wu et al. (2001)]{b11}\label{b11} 	 		‘Integrated Cellular and Ad-hoc Relay Systems: iCAR’.  		 			H Wu 		,  		 			C Qiao 		,  		 			S De 		,  		 			O Tonguz 		.  	 	 		\textit{IEEE J. Sel. Areas Commun}  		Oct. 2001. 19  (10)  p. .  	 
\bibitem[Lin and Hsu ()]{b14}\label{b14} 	 		‘Multi hop Cellular: A New Architecture for Wireless Communication’.  		 			Y D Lin 		,  		 			Y C Hsu 		.  	 	 		\textit{Proc. IEEE INFOCOM},  				 (IEEE INFOCOM)  		2000. p. .  	 
\bibitem[Radunovic and Proutiere ()]{b13}\label{b13} 	 		‘On Downlink Capacity of Cellular Data Networks with WLAN/WPAN Relays’.  		 			B Radunovic 		,  		 			A Proutiere 		.  	 	 		\textit{Proc. 3rd IEEE RAWNET},  				 (3rd IEEE RAWNET)  		2007. p. .  	 
\bibitem[Cho and Hass (2004)]{b15}\label{b15} 	 		‘On the Throughput Enhancement of the Downstream Channel in Cellular Radio Networks Through Multi hop Relaying’.  		 			J Cho 		,  		 			Z J Hass 		.  	 	 		\textit{IEEE J. Sel. Areas Commun}  		Sept. 2004. 22  (7)  p. .  	 
\bibitem[Opportunity driven multiple access 3GPP (1999)]{b0}\label{b0} 	 		‘Opportunity driven multiple access’.  		 ver. 1.0.0.  	 	 		\textit{3GPP}  		Dec. 1999.  	 
\bibitem[Harrold and Nix (2002)]{b6}\label{b6} 	 		‘Performance analysis of intelligent relaying in UTRA TDD’.  		 			T J Harrold 		,  		 			A R Nix 		.  	 	 		\textit{Proc. IEEE Vehicular Technology Conf. 2002 Fall},  				 (IEEE Vehicular Technology Conf. 2002 FallVancouver, BC, Canada)  		Sept. 2002. p. .  	 
\bibitem[Zadeh and Jabbari (2001)]{b5}\label{b5} 	 		‘Performance analysis of multi hop packet CDMA cellular networks’.  		 			A N Zadeh 		,  		 			B Jabbari 		.  	 	 		\textit{Proc. IEEE GLOBECOM},  				 (IEEE GLOBECOMSan Antonio, TX)  		2001. Nov. 2001. p. .  	 
\bibitem[Airy and Rohani (2000)]{b3}\label{b3} 	 		‘QoS and fairness for CDMA packer data’.  		 			M Airy 		,  		 			K Rohani 		.  	 	 		\textit{Proc. IEEE Vehicular Technology Conf. 2000 Spring},  				 (IEEE Vehicular Technology Conf. 2000 SpringTokyo, Japan)  		May 2000. p. .  	 
\bibitem[Lin et al. ()]{b17}\label{b17} 	 		‘Resource Schduling with Directional Antennas for Multi hop Relay Networks in Manhattan-linke Environment’.  		 			S.-J Lin 		,  		 			W H Sheen 		,  		 			I.-K Fu 		,  		 			C.-C Huang 		.  	 	 		\textit{Proc. IEEE Mobile WiMAX Symp},  				 (IEEE Mobile WiMAX Symp)  		2007. p. .  	 
\bibitem[Spilling et al. (2000)]{b9}\label{b9} 	 		‘Self-organization in future mobile communications’.  		 			A G Spilling 		,  		 			A R Nix 		,  		 			M A Beach 		,  		 			T J Harrold 		.  	 	 		\textit{Electron. Commun. Eng. J}  		June 2000. p. .  	 
\bibitem[Luo et al. (2007)]{b12}\label{b12} 	 		‘The Design and Evaluation of Unified Cellular and Ad Hoc Networks’.  		 			H Luo 		,  		 			X Meng 		,  		 			R Ramjee 		,  		 			P Sinha 		,  		 			L Li 		.  	 	 		\textit{IEEE Trans. Mobile Comp}  		Jun. 2007. 6  (9)  p. .  	 
\bibitem[Viswanathan and Mukherjee (2006)]{b18}\label{b18} 	 		‘Throughput-Range Tradeoff of Wireless Mesh Backhaul Networks’.  		 			H Viswanathan 		,  		 			S Mukherjee 		.  	 	 		\textit{IEEE J. Sel. Areas Commun}  		Mar. 2006. 24  (3)  p. .  	 
\bibitem[Viswanathan and Mukherjee (2006)]{b19}\label{b19} 	 		‘Throughput-Range Tradeoff of Wireless Mesh Backhaul Networks’.  		 			H Viswanathan 		,  		 			S Mukherjee 		.  	 	 		\textit{IEEE J. Sel. Areas Commun}  		Mar. 2006. 24  (3)  p. .  	 
\bibitem[UMTS; UTRA; Concept evaluation (UMTS 30.06) (1997)]{b1}\label{b1} 	 		\textit{UMTS; UTRA; Concept evaluation (UMTS 30.06)},  		 TR 101 146.  		Dec. 1997.  	 	 (ETSI, ver. 3.0.0) 
\end{bibitemlist}
 			 		 	 
\end{document}
