\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={A Novel Approach for Always Best Connected in Future Wireless 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{2011-09 2011-08-21 (revised: 2011 September 21 August 2011)}
\def\TheID{\makeatother }
\def\TheDate{2011-09 2011-08-21}
\title{A Novel Approach for Always Best Connected in Future Wireless Networks}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

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

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

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

\usepackage[absolute,overlay]{textpos}

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

             \author[1]{Dr. Kailash  Chander}

             \author[2]{Dr. Dimple  Juneja}

             \affil[1]{  Maharishi Markandeshwar University}

\renewcommand\Authands{ and }

\date{\small \em Received: 18 July 2011 Accepted: 8 August 2011 Published: 21 August 2011}

\maketitle


\begin{abstract}
        


Basically, Vertical handover (VHO) decision relies on the selection of the ?best? available network that could meet the QoS requirements for the end-user. Therefore, a network selection mechanism is required to help mobile users choose the best network; that is, one that provides always best connected (ABC) that suits users needs and is able to change dynamically with the change in conditions. The definition of best depends on a number of different aspects such as user personal preferences, device size and capabilities, application requirements, security, present network traffic, and network signal strength. This work proposes to assign weight to all the above stated aspects so as to compute ABC. The novelty of this work is to exploit intelligent agents for weight calculations after analyzing the explored parameters for various networks. An analysis and a comparison of both services and factors for different networks are also provided in the paper.

\end{abstract}


\keywords{ABC networks, Weights and Rewards, Intelligent Agents, Quality of Service (QoS), Vertical Handove).}

\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
he ultimate goal of ABC is to provide QoS to the end users where QoS is defined with respect to various parameters as given in Table1. 
\begin{quote}
Packet Loss\end{quote}
\par
The probability of loss of packets during transmission. 
\section[{Signal Strength}]{Signal Strength}\par
Available signal strength during transaction. 
\section[{Services}]{Services}\par
Type of services supported by a network.\par
In addition to the above mentioned parameters A network selection also depends upon the type of service (such as Internet Surfing, Voice Data, and Video streaming) it offers, which in turn depends upon various factors such as Cost of Service, Data Rate, Mobility of Mobile Node, Signal Strength, Present Network Traffic, Security Parameter, and Drainage rate of Battery. It is obvious that selection of network is initially dependent on the end user requirements, but since a user is provided with many choices, the choice becomes QoS dependent. An obvious choice would be the network that offers maximum QoS. This work analyzes QoS parameters for the type of service offered by network and factors on which a network selection depends. The work aims to assign weight to each parameter and factor as well. Our earlier work proposed deployment of agent in 4G networks and hence we propose that deployed agents shall do all weight computations, reducing the overhead of service providers and enhancing the QoS to service users.\par
The paper has been organized in four sections. Section II presents the related work. Section III discusses the proposed solution and compares the results. Finally conclusions and future scope are presented in Section IV. 
\section[{II.}]{II.} 
\section[{RELATED WORK}]{RELATED WORK}\par
In fourth generation (4G) communication \hyperref[b25]{[26]}, selection of the best access network is the major challenge for future research. Many researchers \hyperref[b18]{[19,}\hyperref[b19]{20,}\hyperref[b20]{21,}\hyperref[b21]{22]} proposed different solution for achieving "Always Best Connected". Authors \hyperref[b4]{[5]} proposed Game theoretical modelling to solve the network selection problem. Game theory is the study of a mathematical model of conflict and co-operation between intelligent reasonable decision makers \hyperref[b5]{[6]}. According to a Game theoretical Model \hyperref[b6]{[7]}, the players of the game are the individual access network (WLAN, GSM, WCDMA, WiMAX, WiFi etc.) each of which contends to win a service request.\par
Another solution to select an appropriate network is based on distance function \hyperref[b7]{[8]}. Distance function generates an ordered list of various access technologies called networks in a particular region according to multiple user preferences and level of interest. The proposed algorithm works on the userspecified parameters i.e. Bandwidth Utilization, Call Drop during Handoff, Cost of Services, Battery Power etc.\par
Work in \hyperref[b8]{[9]} provided an efficient load balancing based access point selection algorithm which consider the direction of advancement of the mobile node and hence is able to extract the best possible network for the user equipment to link up, as it moves. Exploiting ants in telecommunication  {\ref [23, 24, and 25]} has been the interest of researchers and it has been proved that such agent based frameworks have been instrumental in improving the performance of existing networks.\par
Weighted distance function \hyperref[b9]{[10]} is obtained based on multiple QoS parameters as per user needs. The proposed algorithm shows better results compared to single parameter based system, under a heterogeneous network system.\par
Another solution of network selection is through QoS Broker \hyperref[b10]{[11]}. This Broker monitors the QoS performance actively for each wireless network, and then the result of this monitoring will be passed to analysis statistics of all the QoS parameters in each network to get the best network.\par
In \hyperref[b11]{[12]} authors developed a process to evaluate three packet-switched networks (UMTS, WLAN and GPRS) in reference to the QoS offered. It also identifies the weak points of a network and finally selects the network that offers the highest standard for QoS.\par
Further, focusing on the use of mobile agents in telecommunication section, Literature \hyperref[b0]{[1,}\hyperref[b1]{2,}\hyperref[b14]{15]} indicates communication applications are modeled as a collection of agents and each agent occupies different locations at different times since it can move from one place to another.\par
Mobile AGeNt Architecture (MAGNA) \hyperref[b1]{[2]} is being developed by GMD-Fokus for future telecommunications applications, in which the conventional client server concept is cordially complemented by agent concepts. This framework is used for the development of agent-based telecommunications applications which exhibit rapid, decentralized provisioning of intelligent services on demand.\par
Among the different paradigms of intelligent agents, Reinforcement Learning (RL) \hyperref[b16]{[17]} appears to be particularly appropriate to address a number of the challenges of the future mobile communication. RL involves learning what to do and how to map situations with actions to maximize a numerical value signal \hyperref[b2]{[3]}. A Reinforcement Learner Agent (RLA) ascertains on its own which actions to take to get the maximum weight value. The agent learns from its mistakes and come up with a policy based on its experience to maximize the attained weight value \hyperref[b3]{[4]}.\par
Focusing our attention to agent-based solutions, it is apparent that there is a scope of an agent based solution for ABC network in future. Next section presents such a solution. 
\section[{III.}]{III.} 
\section[{PROPOSED SOLUTION}]{PROPOSED SOLUTION}\par
The process of network selection refers to the process of deciding over which network to connect at any point in time. On the other hand user wants the selection of service among the available networks according to his/her requirements. Thus a novel network selection mechanism is being proposed such that the selected network satisfies the current session's QoS requirements. Each network would be assigned a weight which is based on the QoS parameters and factors that it provides and satisfies the end user requirements. The agent is then required to compute the sum of all weight assigned to a particular network which is then normalized within the range of 0-1. A network scoring maximum (i.e. 1) shall be the best available network while a network scoring less than a specified threshold (<.5) shall be ignored and similarly, a network gaining a zero weight shall be straightaway discarded. Following section presents the rule set that must be followed by agent for assigning weights. e. Present Network Traffic : Every network provides services to its user based on contention ratio such as 1:1 or 1:10 or 1:50. Therefore the total bandwidth is divided based on this ratio. If a network is providing service with a content ratio of 1:20 and presently only four users are logged in then user will get more bandwidth and higher speed.\par
f. Security Parameter : A secure network is always treated as a best network because of security threats. Selecting best secure network is a challenging task. A good network is that which supports maximum security layers. Some of security layers are Network Intrusion Detection System, Firewall, Email Scanning, Internet Security, Server Level Virus Scanning, Workstation Virus Scanning, and Updated Communication Software. Agents calculate the weight value based on number of layers supported by a network. g. Drainage rate of Battery : An algorithm in \hyperref[b14]{[15]} proposes to shift to the lesser power demanding network in case the present battery status of mobile node is not sufficient for current transaction. Here, again the value is calculated on the basis of consumption of battery life for a particular application for a particular network by comparing present battery life of mobile node i.e. drainage of battery is application dependent for instance heavy application implies more consumption of battery.\par
The weights assigned as per the rules mentioned above are being listed in Table \hyperref[tab_1]{2}. The above factors compute the weight-age for available networks. Some of the above factors have higher impact while others have less for network selection decision. For an ABC network, the user agent computes the sum of all weights (computed as per the rule set given above) as per the following formula: IV. 
\section[{SEQUENCE DIAGRAM}]{SEQUENCE DIAGRAM}\par
A user agent is invoked whenever a user demands for ABC network. An individual user agent cannot evaluate the complete rule set for different types of network. Therefore, it broadcasts the request and in response to this request, various network agents respond with bid to the user agents.\par
The bid comprises of weights which have been computed on the basis of rule set as already defined. User agent then computes the sum of weights to find out the ABC network shown in Figure 1. It is obvious that a network having maximum weight will be selected and rest would be discarded. Each network agent is responsible for providing the data on the basis of their rule set and all agents are set to move and execute state as every network service provider would intend to provide service to a mobile user.\par
The following algorithm for MAGagent given below provides the details of working of the proposed framework for its implementation. Algorithm : Algorithm: MAG agent ----------------------------------------------------------------------  
\section[{DEMONSTRATION AND PROOF OF CONCEPT}]{DEMONSTRATION AND PROOF OF CONCEPT}\par
In this section the concept is demonstrated by taking different possible weight values for the parameters and sum of all the parameter values is computed to decide on the best network at any point. The algorithm will process the input provided in this format and will decide which network can provide best services to the subscriber at that time. 
\section[{CASE-1 (Available}]{CASE-1 (Available}Network) Parameters (A) (B) (C) (D) (E) (F) (G) (Sum)\par
Net -1 0.75 0.50 1.00 0.50 0.50 0.25 0.50 4.00\par
Net -2 1.00 0.50 1.00 0.25 0.25 0.50 1.00 4.50\par
Net -3 0.25 1.00 1.00 1.00 0.75 0.75 0.25 5.00 CASE-2(Available Network) Parameters (A) (B) (C) (D) (E) (F) (G) (Sum)\par
Net -1 0.25 0.75 0.75 0.50 1.00 1.00 0.  In the first case the mobile node is in static mode, thus Net-3 will be selected since it is providing high data at low cost while in the second case mobile node will prefer Net-1 because of its security although the cost of network is high. In the second case status being mobile the node will prefer secure transaction, even with more cost. 
\section[{VI.}]{VI.} 
\section[{CONCLUSION}]{CONCLUSION}\par
In future 4G mobile environments, various access technologies will coexist, complementing each other. Therefore, a network selection mechanism is required to help mobile users choose the best network; that is, one that provides always best connected (ABC) that suits users needs, and changes, if conditions changes. Thus a novel network selection mechanism using intelligent agents has been proposed, which select the best network based on QoS parameters. The security aspect of agents has been ignored and would be taken up in future works.\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
    \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.15563380281690142\textwidth}P{0.6943661971830986\textwidth}}
Parameters\tabcellsep Meaning\\
Speed\tabcellsep The time period required for a packet to reach its destination\\
Reliability\tabcellsep Reliability depends on the Bit Error Rate (BER)\end{longtable} \par
 
\caption{\label{tab_0}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{P{0.06235521235521236\textwidth}P{0.10666023166023166\textwidth}P{0.12635135135135137\textwidth}P{0.09025096525096525\textwidth}P{0.06891891891891892\textwidth}P{0.15752895752895751\textwidth}P{0.07055984555984555\textwidth}P{0.16737451737451736\textwidth}}
Parameters\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
Weight (W)\tabcellsep Cost of Service Offered (A)\tabcellsep Data Transfer Rate (DTR) (B)\tabcellsep Mobility of Node (C)\tabcellsep Signal Strength (D)\tabcellsep Network Traffic (E)\tabcellsep Security (F)\tabcellsep Drainage Rate of Battery (G)\\
1.0\tabcellsep Zero\tabcellsep 11mbps-100mbps\tabcellsep Static\tabcellsep Excellent\tabcellsep Very few users/ Single User\tabcellsep Fully Secure\tabcellsep Very Light Application\\
0.75\tabcellsep Negligible\tabcellsep 2mbps-11mbps\tabcellsep Walking\tabcellsep High\tabcellsep Moderate\tabcellsep High\tabcellsep Light Application\\
0.50\tabcellsep Moderate\tabcellsep 128kbps-2mbps\tabcellsep --\tabcellsep Good\tabcellsep High\tabcellsep Moderate\tabcellsep Moderate\\
0.25\tabcellsep High\tabcellsep <128kbps\tabcellsep --\tabcellsep Low\tabcellsep Very High\tabcellsep Low\tabcellsep Heavy\\
0.0\tabcellsep Unaffordable\tabcellsep --\tabcellsep Very High Mobility\tabcellsep Nil\tabcellsep Extreme (All routes are busy)\tabcellsep None\tabcellsep Very Heavy Application\end{longtable} \par
 
\caption{\label{tab_1}Table 2 :}\end{figure}
 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Sutton and Barto]{b3}\label{b3} 	 		\textit{},  		 			Richard S Sutton 		,  		 			Andrew G Barto 		.  		 	 
\bibitem[Antoniou and Pitsillides ()]{b6}\label{b6} 	 		‘4G Converged Environment: Modeling Network Selection as a Game’.  		 			J Antoniou 		,  		 			A Pitsillides 		.  	 	 		\textit{Proc. of IST Mobile Summit},  				 (of IST Mobile SummitBudapest, Hungary)  		2007.  	 
\bibitem[Sazid Zaman Khan ()]{b4}\label{b4} 	 		‘A Network Selection Mechanism for Fourth Generation Communication Networks’.  		 			Mohammod Sazid Zaman Khan 		.  	 	 		\textit{Journal of Advances in Information Technology}  		2010. 1 p. .  	 
\bibitem[Yuhang (2007)]{b19}\label{b19} 	 		\textit{A New 4G Architecture Providing Multimode Terminals Always Best Connected Services},  		 			Chen Yiping And Yang Yuhang 		.  		April 2007. IEEE Wireless Communications.  	 
\bibitem[Yiping and Yuhang ()]{b12}\label{b12} 	 		\textit{A New 4G Architecture providing Multimode Terminals Always Best Connected Services" IEEE Wireless Communications},  		 			Chen Yiping 		,  		 			Yang Yuhang 		.  		2007. p. .  	 
\bibitem[Mohammad Mursalin Akon and Goswami ()]{b23}\label{b23} 	 		‘A New Routing Table Update and Ant Migration Scheme for Ant Based Control in Telecommunication Networks’.  		 			Dhrubajyoti Mohammad Mursalin Akon 		,  		 			Goswami 		.  	 	 		\textit{Proceedings of the 7th International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04)},  				 (the 7th International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04))  		2004. IEEE.  	 
\bibitem[Devi ()]{b7}\label{b7} 	 		‘A Novel Approach for Optimal Network Selection in Heterogeneous Wireless Networks’.  		 			T 		,  		 			Nisha Devi 		.  	 	 		\textit{Proceedings of the International Joint Journal Conference on Engineering and Technology (IJJCET)},  				 (the International Joint Journal Conference on Engineering and Technology (IJJCET))  		2010. p. .  	 
\bibitem[Misra and Banerjee]{b8}\label{b8} 	 		\textit{A Novel Load Sensitive Algorithm for AP selection in 4G Networks},  		 			I S Misra 		,  		 			A Banerjee 		.  		 	 
\bibitem[Chen and Deng ()]{b21}\label{b21} 	 		\textit{Access Discovery in Always Best Connected Networks},  		 			Yiping Chen 		,  		 			Chen Deng 		.  		2008. IEEE.  	 
\bibitem[Ronal Van Eijk et al.]{b25}\label{b25} 	 		‘Access Network Selection in a 4G Environment and the Roles of Terminal and Service Platform’.  		 			Jacco Ronal Van Eijk 		,  		 			Jeroen Brok 		,  		 			Bryan Van Bemmel 		,  		 			Busropan 		.  	 	 		\textit{In Wireless World Research Forum}  		 	 
\bibitem[Eva Gustafsson and Jonsson ()]{b13}\label{b13} 	 		‘Always Best Connected’.  		 			Annika Eva Gustafsson 		,  		 			Jonsson 		.  	 	 		\textit{IEEE Wireless Communications}  		2003. p. .  	 
\bibitem[Lee and Choi ()]{b24}\label{b24} 	 		\textit{An Ant-Assisted Path-Flow Routing Algorithm for Telecommunication Networks},  		 			Heesang Lee 		,  		 			Gyuwoong Choi 		.  		2004. IEEE.  	 
\bibitem[Braun]{b15}\label{b15} 	 		\textit{Ant-Based Mobile Routing Architecture in Large-Scale Mobile Ad-Hoc Networks},  		 			Torsten Braun 		.  		 	 
\bibitem[Distributed Dynamic Routing Using Ant Algorithm For Telecommunication Networks Lu guoying Zhang subing Liu zemin ()]{b22}\label{b22} 	 		‘Distributed Dynamic Routing Using Ant Algorithm For Telecommunication Networks’.  	 	 		\textit{Lu guoying Zhang subing Liu zemin},  				2000. IEEE.  	 
\bibitem[Gervais (1998)]{b0}\label{b0} 	 		‘Enhancing Telecommunications Service Engineering with Mobile Agent Technology and Formal Methods’.  		 			Marie-Pierre Gervais 		,  		 			Et 		.  	 	 		\textit{IEEE Communications Magazine}  		July 1998.  	 
\bibitem[Chung and Yuan ()]{b20}\label{b20} 	 		\textit{Extending Always Best Connected Paradigm for Voice Communications in Next Generation Wireless Network},  		 			Tein-Yaw Chung 		,  		 			Fong-Ching Yuan 		.  		2008. IEEE.  	 
\bibitem[Myerson ()]{b5}\label{b5} 	 		\textit{Game Theory: Analysis of Conflict},  		 			Roger Myerson 		.  		1997. Harvard University Press.  	 
\bibitem[Sutton]{b16}\label{b16} 	 		\textit{Generalization in Reinforcement Learning: Successful Examples Using Sparce Coarse Coding},  		 			Richard S Sutton 		.  		 	 
\bibitem[Krause and Magedanz (1996)]{b1}\label{b1} 	 		‘Intelligence on Demand in Telecommunications’.  		 			S Krause 		,  		 			T Magedanz 		.  	 	 		\textit{Proc, IEEE GLOBECOM '96},  				 (IEEE GLOBECOM '96London, UK)  		Nov. 1996.  	 	 (Mobile Service Agents Enabling) 
\bibitem[Kailash Chander and Juneja]{b14}\label{b14} 	 		‘Mobile Agent based Emigration Framework for 4G: MAEF " communicated to’.  		 			Dr Dimple Kailash Chander 		,  		 			Juneja 		.  	 	 		\textit{International Journal of Information and Computing Science}  		 	 
\bibitem[Mr and Mohammed Saeed Jawad (2008)]{b10}\label{b10} 	 		‘Optimizing Network Selection to Support End-User QoS Requirements for Next Generation Network’.  		 			Mr 		,  		 			Mohammed Saeed Jawad 		.  	 	 		\textit{International Journal of Computer Science and Network Security}  		June 2008. 8  (6)  p. .  	 
\bibitem[Charilas ()]{b11}\label{b11} 	 		‘Packet-switched network selection with the highest Qos in 4G networks’.  		 			Dimitris Charilas 		.  	 	 		\textit{Computer Networks}  		2008. Elsevier. 52 p. .  	 	 (Science Direct) 
\bibitem[Fodor and Eriksson (2003)]{b18}\label{b18} 	 		\textit{Providing Quality of Service in Always Best Connected Network},  		 			Gabor Fodor 		,  		 			Anders Eriksson 		.  		July 2003. IEEE.  	 
\bibitem[Sehgal and Agrawal (2010)]{b9}\label{b9} 	 		‘QoS Based Network Selection Scheme for 4G Systems’.  		 			Amit Sehgal 		,  		 			Rajeev Agrawal 		.  	 	 		\textit{IEEE Transactions on Consumer Electronics}  		May 2010. 56  (2)  p. .  	 
\bibitem[Abdulhai and Kattan ()]{b2}\label{b2} 	 		‘Reinforcement learning: Introduction to theory and potential for transport applications’.  		 			B Abdulhai 		,  		 			L Kattan 		.  	 	 		\textit{Canadian Journal of Civil Engineering}  		2003. 30  (6)  p. .  	 
\bibitem[Ahdi and Khalaj ()]{b17}\label{b17} 	 		\textit{Vertical Handoff Initiation Using Road Topology and Mobility Prediction},  		 			F Ahdi 		,  		 			B H Khalaj 		.  		2006. IEEE.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
