\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={An Efficient QOS based Routing Protocols for Next Generation Network (NGN)},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

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

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


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

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

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2014-01-15 (revised: 15 January 2014)}
\def\TheID{\makeatother }
\def\TheDate{2014-01-15}
\title{An Efficient QOS based Routing Protocols for Next Generation Network (NGN)}
\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]{icom  Technologies}

             \author[2]{Salavadi Ananda  Kumar}

             \author[3]{Dr. K.E.Sreenivasa  Murthy}

             \affil[1]{  Jawaharlal Nehru Technological University}

\renewcommand\Authands{ and }

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

\maketitle


\begin{abstract}
        


Next Generation Network (NGN) is envisioned to be an inter-working environment of heterogeneous networks of wired and wireless access networks, PSTN, satellites, broadcasting, etc., all interconnected through the service provider?s IP backbone and the Internet. NGN uses multiple broadband, QoS-enabled transport technologies and servicerelated functions independent from underlying transportrelated technologies. The operations and management of such interconnected networks are expected to be much more difficult and important than the traditional network environment. In this paper, we present an overview of the current status towards the management of NGN and discuss challenges in operating and managing NGN. We also present the operations and management requirements of NGN in accordance with the challenges and verified two routing protocols for QOS support and providing security using caesarchiper encryption/decryption in Ad-hoc networks and also provide QOS for wired networks by AQM techniques and simulated results of AQM, Routing protocols using NS-2 and Encryption/Decryption using Matlab tools.

\end{abstract}


\keywords{QOS AQM, NGN, red and drop tail.}

\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
GN is envisioned to be an answer to network operators and service providers to replace existing telephone networks as well as to introduce a new converged service platform between fixed and mobile telecommunication businesses \hyperref[b0]{[1]}. It is generally agreed that the main difference between traditional telecommunication networks and NGN is the shift from separate and vertically integrated applicationspecific networks to a single network capable of carrying any services. NGN is essentially about delivering new services that are available to any place, at any time, on any device, through any customerchosen access mechanism. NGN is expected to coexist and inter-work among wired networks (e.g., xDSL, Metro Ethernet, FTTH, leased lines, ISDN), wireless networks (e.g., 2G, 3G, WLAN, WiMAX/WiBro) as well as satellites and broadcasting networks, all interconnected through the service provider's IP backbone networks and the Internet.\par
In this heterogeneous networking environment, in addition to the traditional challenges such as security, QoS, and charging, new challenges such as generalized mobility, and network discovery and selection exist.\par
Providing effective, secure and efficient operations and management of the envisioned NGN environment is a huge challenge. In order to provide the creation, deployment, and management of all kinds of services, NGN operations are highly dependent on flexible and efficient management systems and processes \hyperref[b1]{[2]}. When the networks are evolving towards NGN, the scenario to support various services would become more complex.\par
The carrying of diverse traffic such as voice, data, video or signaling would be possibly integrated onto one common platform, which would call for the corresponding network management systems.\par
The ITU-T Recommendation Y.2401 \hyperref[b4]{[5]} presents the management requirements, general principles and architectural requirements for managing NGN to support business processes to plan, provision, install, maintain, operate and administer NGN resources and services \hyperref[b3]{[4]}.\par
Thus, we examine the challenges facing the management of NGN. The standards and research activities of NGN management are also presented. 
\section[{a) NGN Overview}]{a) NGN Overview}\par
NGN is a packet-based network to support the transfer of mixed traffic types such as voice, video, and data \hyperref[b0]{[1]}. It will integrate services offered by traditional networks and new innovative IP services into a single service platform. The key operation of the NGN is the separation of services and transport networks, which provides QoS-enabled transport technologies and service-related functions independent from underlying transport technologies \hyperref[b6]{[7]}. The transport functions provide transfer of information between peer entities; the services functions are concerned with the applications and services to be operated between peer entities \hyperref[b7]{[8]}.\par
Fig. \hyperref[fig_0]{1} shows typical NGN components: service network, core network, access network, and user equipment \hyperref[b7]{[8]}. The service network is composed of various servers such as Web Server, Authentication, Authorization and Accounting (AAA), SIP Proxy Server and LDAP Server, etc. The service network is only responsible for providing services and applications for NGN users. The connection between the service network and the core network can be implemented via gateways. The core network in NGN represents the transportation backbone in traditional networks, which is concerned with the transfer of information between peer entities. Besides the transfer of packets, control and management functions are also implemented in the core network. The access network in NGN is derived from the existing access technologies. To accommodate various access media, the access network is separated from the core network of NGN, which serves as an intermediate between user equipment's and core network.\par
Integrated Network Platform refers to the integration of all IP capable wireless and wire line systems for the seamless delivery of Internet data services.\par
The goal is to allow mobile users to move transparently from wired to wireless networks or viceversa without breaking their connection to the Internet. An office worker, connected to an Ethernet LAN, could transparently switch to a high-speed WLAN connection in order to maintain connectivity and provision of services. While moving around within the building, the node could switch transparently from one wireless subnet to another, and when leaving the building, could again switch transparently to a wide-area wireless data service such as GPRS or UMTS.\par
The increasing availability of wireless and wire line technologies with different properties will make the creation of an integrated network platform possible. Such integration should address following requirements:\par
? Enabling global mobility for users across different bearer types (integration of wireless \& wire line technologies). ? Integration of Ad-hoc networks ñ Coverage extension in environments without networking infrastructure.\par
? Intelligent multiple interface handling ñ Filtering data streams to utilize the best interface which are based on different bearer technologies. 
\section[{c) Ad-Hoc Networks}]{c) Ad-Hoc Networks}\par
An ad-hoc network consists of a collection of mobile nodes without the required intervention of a centralized access point or existing infrastructure. The links of the network are dynamic and are based on the proximity of one node to another node. These links are likely to break and change as the nodes move across the network. Because of the temporary nature of the network links, and because of the additional constraints on mobile nodes (limited bandwidth and power), conventional routing protocols are not appropriate for ad-hoc mobile networks. 
\section[{Protocols in Ad-hoc Networks}]{Protocols in Ad-hoc Networks}\par
Unlike the cellular networks where base stations are essential, ad-hoc networks is backed up by communications directly between mobiles, thus the routing protocols are central and deserve our focus on their mechanisms. And in ad-hoc networks, there exists several routing protocols as listed below, which will be demonstrated in this report: 1. DSDV: Destination Sequenced Distance Vector 2. AODV: Ad-hoc On Demand Distance Vector II. 
\section[{Backgrounds}]{Backgrounds}\par
AD HOC networks are networks of autonomous nodes that have wireless connections between each other. These connections can created and destroyed, changing the network topology as nodes change location, move out of range of other nodes or fail completely. Ad hoc networks pose an additional set of problems to those encountered in traditional fixed networks or wireless cellular networks. Dynamically forming the communications infrastructure from mobile devices is the source of these complications. One way of thinking about this is to imagine the problems caused by continually moving and changing the router you use to get from your local subnet to the rest of the world. How would packets get to or from you? This type of question has to be addressed along with requirements that affect traditional routing protocols such as loop free routing, completeness and stability.\par
As we have already seen, classical encryption techniques use scrambling of bits in order to encipher the message. In this section, we discuss three important classical cryptographic techniques namely, 1. Playfair Cipher 2. Vigenere Cipher 
\section[{Caesar Cipher}]{Caesar Cipher}\par
The Playfair cipher uses a 5 by 5 table containing a key word or phrase. To generate the key table, one would first fill in the spaces in the table with the letters of the keyword (dropping any duplicate letters), then fill the remaining spaces with the rest of the letters of the alphabet in order (put both "I" and "J" in the same space). The key can be written in the top rows of the table, from left to right, or in some other pattern, such as a spiral beginning in the upper-left-hand corner and ending in the center.\par
The Vigenere Cipher is the process of encrypting alphabetic text by using a series of different Caesar ciphers based on the letters of a keyword. To encrypt, a Vigenere square is used. It consists of the alphabet written out 26 times in different rows, each alphabet shifted cyclically to the left compared to the previous alphabet, corresponding to the 26 possible Caesar ciphers. At different points in the encryption process, the cipher uses a different alphabet from one of the rows. The alphabet used at each point depends on a repeating keyword.  The NGN functions are divided into service and transport strata. The transport stratum functions provide connectivity for all components and physically separated functions within the NGN. The service stratum functions provide session-based and non-sessionbased services, including subscribe/notify for presence information and a messaging method for instant message exchange \hyperref[b6]{[7]}. End-user functions are connected to the NGN by user-to-network interface (UNI), while other networks are interconnected through the network-to-network interface (NNI). The applicationto-network interface (ANI) provides a channel for interactions and exchanges between applications and NGN elements. 
\section[{III.}]{III.} 
\section[{Proposed Method}]{Proposed Method}
\begin{quote}
NGN Functional Architecture\end{quote}
 
\section[{a) Network Discovery And Selection}]{a) Network Discovery And Selection}\par
Since NGN consists of interconnected heterogeneous networks using heterogeneous user terminals, NGN should provide a seamless capability, independent of access method and network, and NGN also should address the identifying mechanisms \hyperref[b0]{[1]}. That is, each terminal can use more than one type of network and possibly access multiple networks simultaneously for different applications (e.g., one for voice and another for receiving streaming media).\par
In such an environment, a terminal must be able to discover what networks are available for use. One of the proposed solutions for network discovery is to use software-defined radio devices that can scan the available networks. After scanning, they will load the required software and reconfigure themselves for the selected network. The software can be downloaded from the media such as a server, smart card, memory card or over the air. 
\section[{b) Generalized Mobility}]{b) Generalized Mobility}\par
At present, mobility is used in a limited sense such as movement of user and terminal and with or without service continuity to similar public accessed networks (such as WLAN, GSM, UMTS, etc.) \hyperref[b5]{[6]}. this means the horizontal handoff, which involves a terminal device to change cells within the same type of network to maintain service continuity. In the future, mobility will be offered in a broader sense where users may have the ability to use more access technologies, allowing movements between public wired access points and public wireless access points of various technologies. That is, in NGN environment, in addition to the horizontal handoff, the vertical handoff must also be supported. The vertical handoff mechanism allows a terminal device to change networks between different types of networks (e.g., between 3G and 4G networks) in a way that is completely transparent to end user applications. Thus, the challenge is to allow vertical handoffs between pairs of different types of networks in the presence of 2G, 3G, WLAN, WMAN, satellite, and 4G networks. The greater challenge lies when the vertical handoffs must take place with a certain set of QoS requirements still satisfied. Roaming allows a customer to automatically make and receive voice calls, send and receive data, or access other services when traveling outside the geographical coverage area of the home network. Roaming is technically supported by mobility management, authentication and billing procedures. Establishing roaming between service providers is based on roaming agreements. If the visited network is in the same country as the home network, then it is known as national roaming. If the visited network is outside the home country, then it is known as global roaming. If the visited network operates on a different technical standard than the home network, then it is known as inter-standard roaming.\par
In NGN, all three types of roaming should be supported to roam through different network types, operating in different cities and countries. For true global roaming, roaming agreements must be set up among service providers among countries. Today, only a few service providers in different countries provide global roaming. The challenge is to provide more roaming agreements among the service providers in different countries. The greater challenge would be to provide inter-standard roaming in different countries. c) Qos Support Over the past decade, much research has been conducted in the area of QoS, and many protocols and methods have been proposed. However, the predominant method to support QoS by the Internet service providers (ISPs) today is over-provisioning. That is, instead of implementing complex QoS algorithms and methods, ISPs typically provide enough bandwidth in their backbone trunks so that their networks are hardly overloaded and thus there exists very little delay and few packets are lost in transit. This is quite feasible since a lot of fiber trunks have been installed over the past decade and the bandwidth cost of wired Internet trunks is very cheap. In the ISP's views, it is much simpler and cheaper to provide over-provisioned networks than implementing and managing complex QoS mechanisms. Although NGN is supposed to provide higher bandwidth and more cost-effective channels than its predecessor networks, the bandwidth cost in NGN wireless networks will remain higher than wired networks. Thus, over-provisioning in NGN will not be feasible and QoS support mechanisms will definitely be needed. Providing QoS support in NGN will be a major challenge thus much work is needed.\par
Congestion is an important issue which researchers focus on in the Transmission Control Protocol(TCP) network environment. To keep the stability of the whole network, congestion control algorithms have been extensively studied. Queue management method employed by the routers is one of the important issues in the congestion control study. Active queue management (AQM) has been proposed as a router-based mechanism for early detection of congestion inside the network. In this paper we analyzed several active queue management algorithms with respect to their abilities of maintaining high resource utilization, identifying and restricting disproportionate bandwidth usage, and their deployment complexity. Simulation is done by using Network Simulator (NS2) and the graphs are drawn using X-graph.\par
Throughput: This is the main performance measure characteristic, and most widely used. In communication networks, such as Ethernet or packet radio, throughput or network throughput is the average rate of successful message delivery over a communication channel. The throughput is usually measured in bits per second (bit/s or bps), and sometimes in data packets per second or data packets per time slot. This measure how soon the receiver is able to get a certain amount of data send by the sender. It is determined as the ratio of the total data received to the end to end delay. Throughput is an important factor which directly impacts the network performance. Delay: Delay is the time elapsed while a packet travels from one point e.g., source premise or network ingress to destination premise or network degrees. The larger the value of delay, the more difficult it is for transport layer protocols to maintain high bandwidths. We will calculate end to end delay. 
\section[{d) Routing Protocols}]{d) Routing Protocols}\par
Efficient routing protocols can provide significant benefits to mobile ad hoc networks in terms of both performance and reliability. Mobile Ad-hoc Network (MANET) is an infrastructure less and decentralized network which need a robust dynamic routing protocol. Many routing protocols for such networks have been proposed so far. Amongst the most popular ones are Dynamic Source Routing (DSR), Adhoc On-demand Distance Vector (AODV), and Destination-Sequenced Distance Vector (DSDV) routing protocol. To compare the performance of AODV and DSDV routing protocol, the simulation results were analyzed by graphical manner and trace file based on Quality of Service (QoS) metrics.  The simulation lasts 150 sec. At time 10, TCP connection using the DSDV ad-hoc routing protocol and the IEEE802.11 MAC protocol is initiated between node 0 and node 1. 
\section[{e) Security}]{e) Security}\par
Over the past few years, the Internet and enterprise networks have been plagued by denial of service attacks (DoS), worms and viruses, which have caused millions of computer systems to be shutdown or infected and the stored data to be lost, ultimately causing billions of dollars in loss. The introduction of wireless LANs (e.g., IEEE 802.11) into enterprises has made network security more vulnerable since rogue base stations (i.e., unauthorized private base stations) can be easily connected to existing wired networks, potentially becoming the source of security attacks inside firewalls and intrusion detection systems. Moreover, connecting malicious PC via a base station that is not well managed is also critical.\par
In cryptography, a Caesar cipher, also known as the shift cipher, is one of the simplest and most widely known encryption techniques. It is a type of substitution cipher in which each letter in the plaintext is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 3, A would be replaced by D, B would become E, and so on.\par
To pass an encrypted message from one person to another, it is first necessary that both parties have the 'key' for the cipher, so that the sender may encrypt it and the receiver may decrypt it. For the Caesar cipher, the key is the number of characters to shift the cipher alphabet. Here is a quick example of the encryption and decryption steps involved with the Caesar cipher. The text we will encrypt is 'defend the east wall of the castle', with a shift (key) of 1.\par
Plaintext: defend the east wall of the castle Cipher text: efgfoe uif fbtu xbmm pg uif dbtumf It is easy to see how each character in the plaintext is shifted up the alphabet. Decryption is just as easy, by using an offset of -1. 
\section[{Plain: abcdefghijklmnopqrstuvwxyz Cipher: bcdefghijklmnopqrstuvwxyza}]{Plain: abcdefghijklmnopqrstuvwxyz Cipher: bcdefghijklmnopqrstuvwxyza}\par
Obviously, if a different key is used, the cipher alphabet will be shifted a different amount. 
\section[{Mathematical Description}]{Mathematical Description}\par
First we translate all of our characters to numbers, 'a'=0, 'b'=1, 'c'=2... 'z'=25. We can now represent the Caesar cipher encryption function, e(x), where x is the character we are encrypting, as:\par
Where k is the key (the shift) applied to each letter. After applying this function the result is a number which must then be translated back into a letter. The decryption function is:  
\section[{Results}]{Results} 
\section[{a) Simulation Model}]{a) Simulation Model}\par
The objective of this paper is the performance evaluation of two routing protocol for mobile ad hoc networks by using an open-source network simulation tool called NS-2. Two routing protocols: DSDV and AODV have been considered for performance evaluation in this work. The simulation environment has been conducted with the LINUX operating system, because NS-2 works with Linux platform only.\par
Whole simulation study is divided into two part one is create the node (that may be cell phone, internet or any other devices) i.e. NS-2 output. It's called NAM (Network Animator) file, which shows the nodes movement and communication occurs between various nodes in various conditions or to allow the users to visually appreciate the movement as well as the interactions of the mobile nodes. And another one is graphical analysis of trace file (.tr).Trace files contains the traces of event that can be further processed to understand the performance of the network.\par
Figure  {\ref 7} : Simulation overview Figure  {\ref 7} depicts the overall process of how a network simulation is conducted under NS-2. Output files such as trace files have to be parsed to extract useful information. The parsing can be done using the awk command (in UNIX and LINUX, it is necessary to use gawk for the windows environment) or Perl script. The results have been analyzed using Excel or Matlab. A software program which can shorten the process of parsing trace files (Xgraph and Trace Graph) has also been used in this paper. However, it doesn't work well when the trace file is too large.    {\ref 1}, we can see the graphical variation between various performance metrics like throughput, drop, delay, jitter etc.\par
Figure \hyperref[fig_9]{9} shows how throughput varies w.r.t simulation time been depicted.  At time 28 another transmission attempt occurs.While the connection still could not be established.Then at around 55 sec, both nodes 0 as well as node 1 to be within the radio of node 2 so that when tcp connection is reattempted at that time a two hop path is established between node 0 a direct connection is established.\par
At the moment of the path change there is a single TCP packet loss that cause the window to decrease slightly.At time 125.5 nodes 0 and 1 are too far apart for the connection to be maintained and the conncetion breaks.\par
From fig 12 it is seen that at 40sec connection is established and window size increases smoothly without any path change also no packet loss up to 144sec then window size decreases due to connection break.  
\section[{Conclusions}]{Conclusions}\par
Simulation results show that DSDV compared with AODV, DSDV routing protocol consumes more bandwidth, because of the frequent broadcasting of routing updates. While the AODV is better than DSDV as it doesn't maintain any routing tables at nodes which results in less overhead and more bandwidth. AODV perform better under high mobility simulations than DSDV. High mobility results in frequent link failures and the overhead involved in updating all the nodes with the new routing information as in DSDV is much more than that involved AODV, where the routes are created as and when required. AODV use on -demand route discovery, but with different routing mechanics. AODV uses routing tables, one route per destination, and destination sequence numbers, a mechanism to prevent loops and to determine freshness of routes. \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Fig. 2}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-5.png}
\caption{\label{fig_4}Figure 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-6.png}
\caption{\label{fig_5}E}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-7.png}
\caption{\label{fig_6}Figure 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{56}\includegraphics[]{image-8.png}
\caption{\label{fig_7}Figure 5 :Figure 6 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{8}\includegraphics[]{image-9.png}
\caption{\label{fig_8}Figure 8 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{9}\includegraphics[]{image-10.png}
\caption{\label{fig_9}Figure 9 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{10}\includegraphics[]{image-11.png}
\caption{\label{fig_10}Figure 10}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{11}\includegraphics[]{image-12.png}
\caption{\label{fig_11}Figure 11 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{12}\includegraphics[]{image-13.png}
\caption{\label{fig_12}Figure 12 :}\end{figure}
 			\footnote{© 2014 Global Journals Inc. (US)} 		 		\backmatter  			 			 			  				\begin{bibitemlist}{1}
\bibitem[Itu-T (2006)]{b2}\label{b2} 	 		\textit{Functional requirements and architecture of the NGN},  		 			Itu-T 		.  		Sep. 2006.  	 	 (Recommendation Y.2012) 
\bibitem[Itu-T (2001)]{b0}\label{b0} 	 		\textit{General overview of NGN},  		 			Itu-T 		.  		2001. Dec. 2004.  	 
\bibitem[Itu-T ()]{b1}\label{b1} 	 		\textit{General principles and general reference model for Next Generation Networks},  		 			Itu-T 		.  		2011. Oct. 2004.  	 
\bibitem[Itu-T (2006)]{b5}\label{b5} 	 		\textit{Mobility management requirements for NGN},  		 			Itu-T 		.  		Nov. 2006.  	 	 (Recommendation Y.2801) 
\bibitem[Li and Sandrasegaran (2005)]{b7}\label{b7} 	 		‘Network Management Challenges for Next Generation Networks’.  		 			Mo Li 		,  		 			Kumbesan Sandrasegaran 		.  	 	 		\textit{IEEE Conference on Local Computer Networks},  				Nov. 2005. p. .  	 
\bibitem[Knight et al. (2005)]{b6}\label{b6} 	 		‘NGN architecture: generic principle, functional architecture, and its realization’.  		 			Keith Knight 		,  		 			Thomas Towle 		,  		 			Naotaka Morita 		.  	 	 		\textit{IEEE Communications Magazine}  		Oct. 2005. 43  (10)  p. .  	 
\bibitem[Itu-T (2006)]{b4}\label{b4} 	 		\textit{Principles for the Management of the Next Generation Networks},  		 			Itu-T 		.  		Mar. 2006.  	 	 (Recommendation Y.2401) 
\bibitem[Itu-T (2006)]{b3}\label{b3} 	 		\textit{Resource and admission control functions in Next Generation Networks},  		 			Itu-T 		.  		Sep. 2006.  	 	 (Recommendation Y.2111) 
\end{bibitemlist}
 			 		 	 
\end{document}
