\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={Proportional air Multiusers Selective and Switched Channel Scheduling Schemes},
 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{2013-01-15 (revised: 15 January 2013)}
\def\TheID{\makeatother }
\def\TheDate{2013-01-15}
\title{Proportional air Multiusers Selective and Switched Channel Scheduling Schemes}
\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]{Rupinder  Kaur}

             \author[2]{Muhammad Ejaz Aslam  Lodhi}

             \affil[1]{  IGIT NEW DELHI, India.}

\renewcommand\Authands{ and }

\date{\small \em Received: 7 December 2012 Accepted: 31 December 2012 Published: 15 January 2013}

\maketitle


\begin{abstract}
        


Presents increasing demand of rates in any digital communication system that excites the research idea of scheduling channel access methodology so as to results in maximizing the sum rate. The reduction in feedback messages for channel state information provides great savings in channel bandwidth for multiuser switched diversity scheduling systems. The present proposed work demonstrates that maximization of sum capacity can be achieved using optimization of per user threshold rate along with some prior estimation of channel state information.The results shown in higher achievable rate. Furthermore the proposed novel multiuser switched diversity MUSD system also achieves proportional fairness criteria along with decentralization of optimization threshold channel.

\end{abstract}


\keywords{multiuser diversity; per user threshold; proportional fairness scheduling.}

\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
ne of the features of multiuser communication on fading channels is multiuser diversity \hyperref[b0]{[1]}. By exploiting the fading conditions independently, the multiuser diversity gain can be obtained and scheduling only the users with good channels \hyperref[b1]{[2]}. To maximize the capacity of information of the uplink in single-cell multiuser communications with frequency-flat fading at any given time, only one user is allowed to transmit with the best channel condition.\par
Transmitting over the best channel maximizes the system sum-throughput, but results in "Unfair" allocation of the wireless resources among the users. Proportional fair scheduler (PF) which has been studied in this paper provides a good compromise between multiuser diversity gains and fairness \hyperref[b2]{[3]}. The main goal of this research work or project work is to develop a noble architecture or design of Multiuser switched diversity scheduling scheme that can accomplish the following objectives: a) Obtain the fairness in Scheduling scheme Design a system in which a single radio or air link resource can be used for Multi user communication scenario. In spite of conventional selection based scheduling here in this research work, a switching based scheduling scheme has to be obtained that may perform better than the existing systems. 
\section[{b) Comparison}]{b) Comparison}\par
A comparison of MUSD schemes with fullfeedback multiuser selective diversity opportunistic scheduling schemes is needed to evaluate how much rate we lose due to the feedback savings.\par
Multiuser switched diversity is to find user with good channel condition instead of best user among all suggested in \hyperref[b6]{[7]}.so channel condition if acceptable or not will be determined by considering predefined threshold .per user channel state threshold will be used in this paper \hyperref[b7]{[8]}. All the users are assigned with time slotted channel .each time slot channel will send one bit flag signal if its achievable rate is more than threshold \hyperref[b8]{[9]} .so feedback in MUSD will be reduced by assigning this threshold and assigning time slotted channel to users instead of per user feedback channel. This method also removes the congestion by using ordered scheduling. 
\section[{II.}]{II.} 
\section[{Review of Multiuser Selection Diversity}]{Review of Multiuser Selection Diversity}\par
R Knopp and Humblet in \hyperref[b1]{[2]} explained the power control mechanism at transmitter in which capacity is increased by transmitting one user at one time over the entire bandwidth having Best channel quality. Received power is estimated at base section to control the transmit power to obtain high capacity. D. Tse in \hyperref[b9]{[10]} provide solution to multi path fading and losses by dynamically allocation to resources to users based on condition of channel quality of users. So when With existing full feedback multiuser diversity scheduling system In all wireless communication system, transmitter send pilot signal to all the receivers to measure the condition of channel mention in \hyperref[b3]{[4]}.in opportunistic system, mobile user continuously send the feedback information to base station which causes wastage of air link resources and mobile battery power.so there is need to reduce the feedback load by different methods \hyperref[b4]{[5]}and \hyperref[b5]{[6]}. Different methods that can be employed are lossy and lossless compression ,scalar quantization method, Schemes exploiting the fact that only the best user will be allowed to transmit (max-SNR scheduling), and consequently that feedback the reception at base station is week user as allocated with more power. T Ericksson and Tony Ottoson in \hyperref[b4]{[5]} states that sum capacity can be increased by feedback reduction methods. Feedback can be minimized without losing gain by different methods. First: Quantization, in which SNR is quantized before transmission. Second: Max SNR, in which users with only high SNR send feedback. Users with low SNR is unnecessary. Third: Data Compression, In this lossy and lossless compression techniques are used. Lossy compression techniques are transform coding and linear prediction coding etc. lossless compression techniques are arithmetic coding and 54Lempel ziv etc. M. S Alouni in \hyperref[b10]{[11]} explained that user transmit information only when its channel quality exceed threshold. if channel quality of number of users exceed threshold then random user is selected. But the problem occur when multiple users reply to same threshold then chances of collision occur. So Aim of this paper is to provide solution of various challenges occur in MUSD system. These challenges are; user with strong channel may not get access to the channel, so need is to obtain the fairness by scheduling the users with best channel conditions first rather than others; optimization at central scheduler is not easy because it needs knowledge of pdf of all the users \hyperref[b11]{[12]}; comparison of multiuser switched diversity with full feedback is required to calculate how much rate is lost. We propose proportional fairness scheme in multiuser switched diversity scheduling by using per-user threshold optimization with the principal function of maximizing the sum of the logarithms of the achievable rates. For each user, independent equations are used that provide solution to optimization. 
\section[{III.}]{III.} 
\section[{System Model}]{System Model}\par
Consider if there is no delay in the decision of scheduling and block fading channel are used as medium between base station and users. Time slotted channel is used in orthogonal access scheme manner \hyperref[b12]{[13]}. Each user is allocated with slotted channel include guard band and data burst .guard band is used to send flag signal to base station if its channel quality is higher than feedback threshold. Scheduling is done on following conditions if its channel quality is better than threshold Value \hyperref[b13]{[14]}. Users prior to given one has achievable Rate less than threshold value. Consider if r i * is the threshold value of user i where achievable rate of user I is r i . User i is scheduled only if r i *<ri.r is vector of achievable rates of m users r= [r 1 r 2 ???. . r M ] in this paper, threshold is computed in term of achievable rate.\par
Channels are considered to be stationary and independent to each other. Probability density function of rate is f R (r) .pdf of m users are given by is SNR of ith user than achievable rate in term of snr is given as ri\textunderscore  = log (1 +? i ) and interm of PDF of snr is f R (r) = exp(r) . fr (exp(r) -1). 
\section[{Conditional and unconditional Expected achievable rates of user In switched scheduling systemic Average}]{Conditional and unconditional Expected achievable rates of user In switched scheduling systemic Average}\par
Achievable rate by each user is calculated terms of fri ( ? i). The conditional expected achievable rate by user i is given as \hyperref[b0]{(1)} Where E[] is the expectation operator. Whereas, the unconditional expected value of the achievable rate by user i, denoted as Ri, equals\par
As the fading channels are independent so event r Si happens with probability Pr Users are scheduled by different time slotted channels.so channel access ratio can be calculated as 
\section[{IV. Optimization of per user Threshold}]{IV. Optimization of per user Threshold}\par
In multiuser switched scheduling different users use its different threshold. in comparison to conventional system in multiuser switched scheduling higher capacity is obtained when the optimal threshold is used. Per user threshold can be optimized by maximizing the sum capacity of all users. Optimization problem can be formulated as \hyperref[b2]{(3)} Threshold optimization of achievable rate is given by .the sum achievable rate, ? can be maximized by equation To obtain the optimal value of threshold, gradiant of is taken w.r.tr i * for three conditions .these are i>j, i=j, i<j and equate it equal to 0 solved using \hyperref[b8]{[9]}. by putting values in M.Computing result will be \hyperref[b3]{(4)} maximize the sum capacity to obtain the optimal value of threshold is always not desirable as it causes problem in fairness so another method proportional fairness scheduler is used. 
\section[{V. Proportional Fair Scheduler Scheme}]{V. Proportional Fair Scheduler Scheme}\par
Proportional fairness that provides a good trade-off between the aggregate rate over the network and fairness among user \hyperref[b14]{[15]} R c i =E [r i |r?s i ] = ?? r f ? ?r ? ? dr ? ? f ? ?r ? ? ??? .if ? ? R i =E[r i ] = E [r i |r ? s i ]. Pr\{r ?Si\} = ? j<i f Rj (r j * ?.)? r f ? ?r ? ? dr ? * AR i = (1-F Ri (r i * ) .? j<i f Rj (r j * )). ???? ? * ? ? ? ? ??? ? * ? arg max ? ? * ???? ? * ? ? ??? ? * ? = ? ? ? ?? ? ?? ? * = 0,?i ? M ??? ? * = ? ? ? ? ?? ? ? ? ? ? ? * ? ????\par
system can be resolved by Proportional fairness scheme by allocating each user with capacity according to its channel condition.in proportional fairness scheme?Si\} = ? ??? ? ? ???? * ? ?\par
optimization can be obtained by maximizing the sum of log of achievable rates . gradient and equate it equal to Z Z Z Z zero, optimal value of threshold is obtained.\par
( 
\section[{VI. Simulation Results Comparison with ul-eedback Schemes}]{VI. Simulation Results Comparison with ul-eedback Schemes}\par
The performance of MUSD scheduling schemes is compared with the performance of full-feedback selective scheduling schemes in given figures. Sum capacity for multiuser selective diversity is evaluated and then compared with switched diversity in which feedback bits are minimized by comparing the achievable rate with optimal threshold value. Analyse the case of independent and identically distributed Rayleigh block-faded channels. Comparison between multiuser switched and multiuser selective diversity schemes under i.i.d. Rayleigh blockfading conditions is considered for average SNR of 30db and eight no of users. The maximum sum achievable rates are used for the comparison. The sum capacity were computed for the MUSD scheme and selective system where the peruser thresholds optimization shows that switched diversity scheduling schemes operate within 0.3 bits/sec/Hz from the ultimate network capacity of full feedback systems in Rayleigh block fading conditions over wide range of SNR and for any number of users. Also proportional fairness is achieved as the no of user are increased.  M independent equations are used for optimizing the system instead of solving dependent equations in case of MUSD scheduling schemes. So channel of each individual user and location of each user will determines its optimal value of achievable threshold.so threshold value of each user is obtained locally in this case.so in this base station need not to have knowledge of pdf of all user channel thus eliminate the challenge of centralized threshold optimization of conventional MUSD schemes. Optimal value of threshold in the form of SNR is F F\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}F}\end{figure}
    			\footnote{© 2013 Global Journals Inc. (US) © 2013 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Jain et al.]{b14}\label{b14} 	 		\textit{A quantitative measure of fairness and discrimination for resource allocation in shared computer sysstems},  		 			R Jain 		,  		 			D Chiu 		,  		 			W Hawe 		.  		 TR-301.  		 \url{http://www.cs.wustl.edu/jain/papers/ftp/fairness.pdf}  		 	 	 (DEC Research Report) 
\bibitem[Wang et al. (2007)]{b2}\label{b2} 	 		‘A unified approach to QoSguaranteed scheduling for channel-adaptive wireless networks’.  		 			X Wang 		,  		 			G Giannakis 		,  		 			A Marques 		.  	 	 		\textit{Proc. IEEE},  				 (IEEE)  		Dec. 2007. 95 p. .  	 
\bibitem[Love et al. (2008)]{b5}\label{b5} 	 		‘An overview of limited feedback in wireless communication systems’.  		 			D Love 		,  		 			R Heath 		,  		 			V Lau 		,  		 			D Gesbert 		,  		 			B Rao 		,  		 			M Andrews 		.  	 	 		\textit{IEEE J. Sel. Areas Commun}  		Oct. 2008. 26  (8)  p. .  	 
\bibitem[Eriksson and Ottosson (2007)]{b4}\label{b4} 	 		‘Compression of feedback for adaptive trans mission and scheduling’.  		 			T Eriksson 		,  		 			T Ottosson 		.  	 	 		\textit{Proc. IEEE},  				 (IEEE)  		Dec. 2007. 95 p. .  	 
\bibitem[Dual-Hallen (2007)]{b3}\label{b3} 	 		‘Fading channel prediction for mobile radio adaptive transmission systems’.  		 			A Dual-Hallen 		.  	 	 		\textit{Proc. IEEE},  				 (IEEE)  		Dec.2007. 95 p. .  	 
\bibitem[Knopp and Humblet]{b1}\label{b1} 	 		‘Information capacity and power controlin single-cell multiuser communications’.  		 			R Knopp 		,  		 			P A Humblet 		.  	 	 		\textit{Proc. IEEE Int. Conf. Commun},  				 (IEEE Int. Conf. Commun)  		p. .  	 
\bibitem[Tse and Hanly (1998)]{b9}\label{b9} 	 		‘Multi access fading channelspart 1: polymatroid structure, optimal resource allocation and throughput capacities’.  		 			D Tse 		,  		 			S Hanly 		.  	 	 		\textit{IEEE Trans. Inf. Theory}  		Nov. 1998. 44  (7)  p. .  	 
\bibitem[Nam and Alouini (2010)]{b7}\label{b7} 	 		‘Multiuser switched diversity scheduling systems with per-user threshold’.  		 			H Nam 		,  		 			M.-S Alouini 		.  	 	 		\textit{IEEE Trans. Commun}  		May 2010. 58  (5)  p. .  	 
\bibitem[Nam and Alouini]{b8}\label{b8} 	 		‘Multiuser switched diversity scheduling systems with per-user threshold and post-user selection’.  		 			H Nam 		,  		 			M.-S Alouini 		.  	 	 		\textit{Proc. 2010 IEEE Int. Symp. Inf. Theory},  				 (2010 IEEE Int. Symp. Inf. Theory)  		p. .  	 
\bibitem[Holter et al.]{b6}\label{b6} 	 		‘Multiuser switched diversity transmission’.  		 			B Holter 		,  		 			M.-S Alouini 		,  		 			G E Oien 		,  		 			H.-C Yang 		.  	 	 		\textit{Proc. 2004 IEEE Veh. Technol. Conf.-Fall},  				 (2004 IEEE Veh. Technol. Conf.-Fall)  		3 p. .  	 
\bibitem[Viswanath et al. (2002)]{b12}\label{b12} 	 		‘Opportunistic beam forming using dumb antennas’.  		 			P Viswanath 		,  		 			D Tse 		,  		 			R Laroia 		.  	 	 		\textit{IEEE Trans. Inf. Theory}  		June 2002. 48  (6)  p. .  	 
\bibitem[Suoranta et al. ()]{b11}\label{b11} 	 		‘PDF estimation using order statistic filter bank’.  		 			R Suoranta 		,  		 			K Estola 		,  		 			S Rantala 		,  		 			H Vaataja 		.  	 	 		\textit{Proc. IEEE Int. Conf. Acoust., Speech, Signal Process}  		1994. 3 p. .  	 
\bibitem[Nam et al. (2008)]{b13}\label{b13} 	 		‘Performance analysis of joint switched diversity and adaptive modulation’.  		 			H Nam 		,  		 			Y Ko 		,  		 			M.-S Alouini 		.  	 	 		\textit{IEEE Trans. Wireless Commun}  		Oct. 2008. 7  (10)  p. .  	 
\bibitem[Yang and Alouini (2006)]{b10}\label{b10} 	 		‘Performance analysis of multiuser selection diversity’.  		 			L Yang 		,  		 			M.-S Alouini 		.  	 	 		\textit{IEEE Trans. Veh. Technol}  		Nov. 2006. 55  (6)  p. .  	 
\bibitem[Tseand and Viswanath ()]{b0}\label{b0} 	 		 			D Tseand 		,  		 			P Viswanath 		.  		\textit{Fundamentals of Wireless Communication},  				2005. Cambridge University Press.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
