\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={Performance Evaluation of Ad Hoc Network over Moving Vehicles in a City},
 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{2020-01-15 (revised: 15 January 2020)}
\def\TheID{\makeatother }
\def\TheDate{2020-01-15}
\title{Performance Evaluation of Ad Hoc Network over Moving Vehicles in a City}
\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]{Md. Shamim  Hossain}

             \author[2]{Joyassree  Sen}

             \author[3]{Md. Alamgir  Hossain}

             \author[4]{M. Muntasir  Rahman}

             \author[5]{Md. Ibrahim  Abdullah}

\renewcommand\Authands{ and }

\date{\small \em Received: 6 December 2019 Accepted: 4 January 2020 Published: 15 January 2020}

\maketitle


\begin{abstract}
        


A mobile ad hoc network (MANET) is a collection of wireless mobile nodes that can dynamically form a temporary network without the aid of any existing network infrastructure. Wireless connectivity on vehicles is an important mode of communication. It is more challenging to provide high-bandwidth networking over fast moving vehicles. Ad Hoc network can be formed on fast moving vehicles where the interior node acts as rely node. A dynamic routing protocol is needed for a node to exchange data with another. In this research work, we consider the traffic density of a typical district town where traffic density much lower than a metropolitan city and vehicle speed is regulated according to traffic law. We have studied two routing protocols AODV and DSR in city traffic. According to our study, AODV shows performance than DSR on city road

\end{abstract}


\keywords{MANET, routing protocols, end-to-end delay, throughput, routing overhead}

\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[{I. Introduction}]{I. Introduction}\par
n an ad hoc network, mobile nodes self-organize to form a network without the need for infrastructure such as base stations or access points. Each mobile node acts as a router, forwarding packets on behalf of other nodes, creating "multihop" paths that allow nodes beyond direct wireless transmission range of each other to communicate. Routing protocols for ad hoc networks must discover such paths and maintain connectivity when links between nodes in these paths break due to factors such as node motion or wireless propagation and interference changes \hyperref[b0]{[1]}. Ad hoc networks have seen tremendous growth in their popularity over the past decade. It may used in an interactive lecture, airport terminal, emergency rescue, business associates sharing information during a meeting, or in battle field.\par
People of modern society take the advantages of information technology in their everyday life such as web browsing, email, chatting. An executive always need to keep up to date information when he leave for a meeting. Or he needs to share information with other participants of the meeting when he moves. These can be enabled in a general way by equipping cars with access points for existing portable devices like note books or PDA's. Ad hoc users on road do not always satisfied due to limited radio range, obstacles in radio frequency propagation and lack of ad hoc devices. As a result, many packets are dropped and the overhead due to route repairs or failure notifications increases significantly, leading to low delivery ratios and high transmission delays.\par
To overcome the limitations of ad hoc users on road Vehicular Ad-hoc Networks (VANETs) is proposed. Similar to MANETs, nodes in VANETs self-organize and self-manage information in a distributed fashion without a centralized authority or a server dictating the communication. In this type of network, nodes engage themselves as servers and/or clients, thereby exchanging and sharing information like peers. Moreover, nodes are mobile, thus making data transmission less reliable and suboptimal. Apart from these characteristics, VANETs possess a few distinguishing characteristics \hyperref[b1]{[2]}, and hence presents itself as a particular class of MANETs.\par
The topology formed by VANETs is always changing as vehicles are moving at high speed. On highways, vehicles are moving at the speed of 60-70 mph (25 m/sec) and vary for different vehicles. If the radio range between two vehicles is 125 m then the link between the two vehicles would last at most 10 sec \hyperref[b2]{[3]}. The highly dynamic topology results in frequently disconnected network. The problem is further worsened by varying node density where there are different frequency of nodes for different roads and highways. The propagation model in VANETs is usually not assumed to be free space because of the presence of buildings, trees, vehicles and other obstacles. A robust routing protocol is hence needed to recognize the frequent disconnectivity and to provide an alternate link quickly to ensure uninterrupted communication. The routing protocols of VANETs fall into two major categories of topology-based and position-based routing \hyperref[b1]{[2]}.\par
In this work we evaluate MANET routing protocols used in the VANET context. Objective of this work is to observe the performance of MANET routing protocols on a city road of a district town where traffic is less than metropolitan city. Traffic speed is restricted and directed by traffic authority. We evaluate two routing protocol DSR \hyperref[b5]{[6]} and AODV \hyperref[b6]{[7]} that common for both MANET and VANET. 
\section[{I}]{I}\par
Md. Shamim Hossain ? , Joyassree Sen ? , Md. Alamgir Hossain ? , M. Muntasir Rahman ? \& Md. Ibrahim Abdullah ¥\par
The rest of the paper is organized as follows. In section 2, we present the routing protocols used for the evaluation. Section 3 of this paper describes related work. The simulation scenario and the evaluation results are discussed in section 4. Finally, the paper closes with a conclusion in section 5. 
\section[{II. Routing Protocols in MANET}]{II. Routing Protocols in MANET}\par
The routing protocols in a MANET can be classified as (i) Proactive (ii) Reactive and (iii) Hybrid \hyperref[b3]{[4]} \hyperref[b4]{[5]}. In Proactive routing protocol, each node in a network maintains one or more routing tables which are updated regularly. Destination Sequenced Distance Vector (DSDV), Fisheye State Routing (FSR) protocol are the examples of Proactive protocols. In reactive type of routing protocol, each node in a network discovers or maintains a route based on-demand. It floods a control message by global broadcast during discovering a route and when route is discovered then bandwidth is used for data transmission. Dynamic Source Routing (DSR), Ad-hoc On Demand Routing (AODV) is the examples of Proactive protocols. Hybrid Protocols of MANET is a combination of proactive and reactive protocols taking the best features from both worlds. An example of hybrid routing protocol is ZRP (Zone Routing Protocol). In this section we describe two reactive ad hoc routing protocols in the ad hoc networking that common to MANET and VANET.\par
Dynamic Source Routing Protocol (DSR): The Dynamic Source Routing (DSR) \hyperref[b5]{[6]} protocol is an ondemand routing protocol based on source routing. In the source routing technique, a sender determines the exact sequence of nodes through which to propagate a packet. The list of intermediate nodes for routing is explicitly contained in the packet's header. In DSR, every mobile node in the network needs to maintain a route cache where it caches source routes that it has learned. When a host wants to send a packet to some other host, it first checks its route cache for a source route to the destination. In the case a route is found, the sender uses this route to propagate the packet. Otherwise the source node initiates the route discovery process. In route discovery, the source floods a query packet through the ad-hoc network, and the reply is returned by either the destination or another host that can complete the query from its route cache. Upon reception of a query packet, if a node has already seen this ID (i.e. it is a duplicate) or if it finds its own address already recorded in the list, it discards the copy and stops flooding; otherwise, it appends its own address to the list and broadcasts the query to its neighbors. For route maintenance when a route failure is detected the node detecting the failure sends an error packet to the source, which then uses the route discovery protocol to find a new route.\par
Ad hoc On-demand Distance Vector Routing (AODV): The AODV \hyperref[b6]{[7]} is a reactive protocol, which combines both DSR and DSDV characteristics. AODV borrows the basic route discovery and routemaintenance of DSR as well as hop-by-hop routing, sequence numbers and beacons of DSDV. When a source node desires to establish a communication session, it initiates a route discovery process by generating a route request (RREQ) message, which might be replied by the intermediate nodes in the path to destination or the destination node itself with the route reply (RREP) message contains the whole path to destination. Failure of a link can be detected via hello messages. Failure to receive three consecutive HELLO messages from a neighbor is taken as an indication that the link to the neighbor in question is down. 
\section[{III. Related Work}]{III. Related Work}\par
There are several works on mobility model of ad hoc network. Most of the works relates ad hoc network with cellular network. Qiao et al. \hyperref[b7]{[8]} presented architecture for enhancing cellular networks called iCar, in which wireless relay stations are placed on the borders between cells and are used to improve the load balancing of the traffic among the cells and to decrease call blocking. Hsieh et al. \hyperref[b8]{[9]} also proposed a system for enhancing a cellular network with ad hoc network routing, in which nodes use ad hoc routing to reach the base station along multiple hops and switch to cellular operation when the bandwidth available in ad hoc mode is lower than that achievable in cellular mode. Some models of vehicular motion have also been proposed in the literature \hyperref[b9]{[10]} to model the movement of cars on highways based on driver behavior models. Today VANET is a promising research field for high speed vehicle. This work differs from VANET in that we consider only a pattern of ad hoc users on road who travels within limited speed. 
\section[{IV. Simulation}]{IV. Simulation}\par
In our simulation model, we assume a 2km road of a typical district town of where traffic density (number of vehicles) much lower than a metropolitan city. We assume that there are some vehicles that equipped with ad hoc devices. The node densities are 4/8/16/20/24/32 and there are one, two and three sources, each node move towards destination with maximum 14m/s on unidirectional waypoint. The User Datagram Protocols as transport layer protocol and the traffic application as CBR (constant Bit Rate). The sending data rate is 64kbps. The simulation parameters are summarized in table -1. We have used NS2 for simulation.  For analyzing the performance of AODV and DSR, we considered three typical performance measures for ad hoc networks: end to end delay, throughput or packet delivery fraction (PDF) and routing overhead.\par
Average end-to-end delay is the time a data packet takes in traversing from the time it is sent by the source node till the point it is received at the destination node. This metric is a measure of how efficient the underlying routing algorithm is, because primarily the delay depends upon optimality of path chosen, the delay experienced at the interface queues and delay caused by the retransmissions at the physical layer due to collisions.  1 shows the relative delay performance of two routing protocols AODV and DSR .When the traffic density increases the end-to-end delay of packet delivery increases. This is because when a node establishes a route it requires more time due to lower traffic density. The packets need to be travel more interior nodes and held within the intermediate node until favorable forwarding paths appeared to reach desired destination, thus increasing the delay. The delay also increases as the number of sources increase because when more sources send packets, they contend to reach the destination. AODV shows the lowest end-to-end packet delay than DSR. This is due to the frequency of route discoveries in AODV is directly proportional to the number of route breaks but in DSR the route is discovered by only the sources. So the source need more time to collect the routing information for various destinations. Throughput forms an important metric for performance evaluation of an ad hoc routing protocol because, given similar scenarios, the number of data packets successfully delivered at the destination depends mainly on path availability, which in turn depends on how effective the underlying routing algorithm is in a mobile scenario.\par
Fig. 2 shows when the number of sources increases the packet delivery fraction (PDF) decreases. This is because when the traffic density increases there are more intermediate relay node between source and destination. In our scenario the distance between source and destination is more as increasing the node density. When the packets relay from source to destination more link will be break thus increasing the packet loss i.e. decreasing the packet delivery fraction. It is seen that the DSR shows approximately 100\% throughput on single source but the AODV shows higher throughput than DSR when source increases. Thus we conclude the performance of DSR with fewer nodes is better but the AODV shows good throughput with more nodes and with more sources. In Fig. 3, we have plotted the normalized routing overload of the routing protocols AODV and DSR. The routing overload of AODV and DSR almost zero at lower traffic density. This is because once a rout discovery process is completed; there is no need to perform the discovery process again. The protocols impose different amounts of routing overload, as in the graph. DSR has the least routing overload than AODV and the routing overload increases slightly as traffic density increases. Because, the routing overload increased when there are many interior node between source and destination. And as the number of sources increases, it has to send more routing packets due to there are more destinations to which the network must maintain working routes i.e. for available nodes it has to send more routing packets to establish various routes, this is also because when a host wants to send a packet to some other host, it first checks its route cache for a source route to the destination. In the case a route is found, the sender uses this route to propagate the packet. 
\section[{V. Conclusion}]{V. Conclusion}\par
Ad hoc network is a rapid solution when there is not any infrastructure. In a road such infrastructure less environment comes in front. In this paper we have studied two MANET routing protocols when a user is moving in a city. The routing protocols are AODV and DSR. According to our study, on road side DSR has the higher end to end delay than AODV. Delay increases on number of sources and traffic density. When the number of sources increases DSR shows lower throughput than AODV. Moreover routing overhead of DSR is high than AODV. Though at lower traffic density, DSR shows low routing overload than AODV. But it increases when traffic density increases. According to our study AODV has better performance than DSR. Its mechanism of storing route information on intermediate nodes causes the lowest overhead. Moreover, it has the highest throughput and is able to deliver packets quite fast.    \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.482716049382716\textwidth}P{0.3672839506172839\textwidth}}
Parameter\tabcellsep Value\\
Examined protocols\tabcellsep AODV \& DSR\\
Simulation duration\tabcellsep 150 seconds\\
Node Buffer size\tabcellsep 50 packets\\
Simulation area\tabcellsep 2000 m x 30 m (flat grid)\\
Numbers of nodes\tabcellsep 4,8,16,20,24,32\\
Maximum speed\tabcellsep 14 m/s\\
Traffic type\tabcellsep TCP\\
Mobility model\tabcellsep Unidirectional waypoint\\
Data payload\tabcellsep 512 bytes/packet\\
Rate\tabcellsep 64Kbps\\
Node pause time\tabcellsep 0 seconds\\
a) Simulation Results\tabcellsep \end{longtable} \par
 
\caption{\label{tab_0}Table 1 :}\end{figure}
 			\footnote{© 2020 Global Journals} 			\footnote{© 2020 Global JournalsPerformance Evaluation of Ad Hoc Network over Moving Vehicles in a City} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Broustis et al.]{b4}\label{b4} 	 		\textit{A Comprehensive Comparison of Routing Protocols for Large-Scale Wireless MANETs},  		 			I Broustis 		,  		 			G Jakllari 		,  		 			T Repantis 		,  		 			M Molle 		.  		 \url{http://www.cs.ucr.edu/\textasciitilde mart/preprints/iwwan06.pdf}  		 	 
\bibitem[Hsieh et al. (2002)]{b8}\label{b8} 	 		‘A Hybrid Network Model for Cellular Wireless Packet Data Networks’.  		 			H.-Y Hsieh 		,  		 			R Siva 		,  		 			Kumar 		.  	 	 		\textit{Proceedings of the IEEE Global Communications Conference (GLOBECOM)},  				 (the IEEE Global Communications Conference (GLOBECOM))  		November 2002.  	 
\bibitem[Elizabeth and Chai-Keong ()]{b0}\label{b0} 	 		\textit{A review of current routing protocols for ad hoc mobile wireless networks},  		 			M R Elizabeth 		,  		 			T Chai-Keong 		.  		1999.  		 			University of California and Georgia Institute of Technology, USA 		 	 	 (Technical report) 
\bibitem[Perkins et al. ()]{b6}\label{b6} 	 		\textit{Ad hoc On demand Distance Vector (AODV) routing},  		 			C E Perkins 		,  		 			E M Royer 		,  		 			S R Das 		.  		 \url{IETFInternetDraft-www.ietf.org/rfc/rfc3561.txt}  		2003.  	 
\bibitem[Chen et al. (2001)]{b9}\label{b9} 	 		‘Ad Hoc Relay Wireless Networks over Moving Vehicles on Highways’.  		 			Z D Chen 		,  		 			H T Kung 		,  		 			D Vlah 		.  	 	 		\textit{Proceedings of the Second ACM Symposium on Mobile Ad Hoc Networking and Computing},  				 (the Second ACM Symposium on Mobile Ad Hoc Networking and Computing)  		MobiHoc 2001. October 2001.  	 
\bibitem[Ranjan and Ahirwar ()]{b2}\label{b2} 	 		‘Comparative Study of VANET and MANET Routing Protocols’.  		 			P Ranjan 		,  		 			K K Ahirwar 		.  	 	 		\textit{Proc. of the International Conference on Advanced Computing and Communication Technologies (ACCT 2011)},  				 (of the International Conference on Advanced Computing and Communication Technologies (ACCT 2011))  		2011. p. .  	 
\bibitem[Qiao and Wu (2000)]{b7}\label{b7} 	 		‘iCAR: An Integrated Cellular and Ad-Hoc Relay System’.  		 			C Qiao 		,  		 			H Wu 		.  	 	 		\textit{Proceedings of the IEEE Conference of Computer Communications and Networks (IC3N)},  				 (the IEEE Conference of Computer Communications and Networks (IC3N))  		October 2000. p. .  	 
\bibitem[Boukerche ()]{b3}\label{b3} 	 		‘Performance Evaluation of Routing Protocols for Ad Hoc Wireless Networks’.  		 			Azzedine Boukerche 		.  	 	 		\textit{Mobile Networks and Applications 9},  				2004. Kluwer Academic Publishers. p. .  	 
\bibitem[Lee et al. (2009)]{b1}\label{b1} 	 		‘Survey of Routing Protocols in Vehicular Ad Hoc Networks’.  		 			Kevin C Lee 		,  		 			Uichin Lee 		,  		 			Mario Gerla 		.  	 	 		\textit{Advances in Vehicular Ad-Hoc Networks: Developments and Challenges},  				Oct, 2009. IGI Global.  	 
\bibitem[Broch et al. ()]{b5}\label{b5} 	 		\textit{The Dynamic source routing protocol for Mobile Ad hoc networks},  		 			J Broch 		,  		 			D Johnson 		,  		 			D Maltz 		,  		 			Y C Hu 		,  		 			G Jetcheva 		.  		 \url{www.ietf.org/rfc/rfc4728.txt}  		2001.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
