Shopping cart
0 Items | US$ 0.00
Anchor Academic Publishing
disseminate knowledge
Experimental study of Network based
Novel Adaptive Routing Algorithm for
Wireless Ad-Hoc Network
Jagrut Solanki
Solankr, Jagrut: Experimental study of Network based Novel Adaptive Routing
Algorithm for Wireless Ad-Hoc Network, Hamburg,
Anchor Academic Publishing 2015
PDF-eBook-ISBN: 978-3-95489-944-9
Druck/Herstellung: Anchor Academic Publishing, Hamburg, 2015
Bibliografische Information der Deutschen Nationalbibliothek:
Die Deutsche Nationalbibliothek verzeichnet diese Publikation in der Deutschen
Nationalbibliografie; detaillierte bibliografische Daten sind im Internet über
http://dnb.d-nb.de abrufbar.
Bibliographical Information of the German National Library:
The German National Library lists this publication in the German National Bibliography.
Detailed bibliographic data can be found at: http://dnb.d-nb.de
All rights reserved. This publication may not be reproduced, stored in a retrieval system
or transmitted, in any form or by any means, electronic, mechanical, photocopying,
recording or otherwise, without the prior permission of the publishers.
Das Werk einschließlich aller seiner Teile ist urheberrechtlich geschützt. Jede Verwertung
außerhalb der Grenzen des Urheberrechtsgesetzes ist ohne Zustimmung des Verlages
unzulässig und strafbar. Dies gilt insbesondere für Vervielfältigungen, Übersetzungen,
Mikroverfilmungen und die Einspeicherung und Bearbeitung in elektronischen Systemen.
Die Wiedergabe von Gebrauchsnamen, Handelsnamen, Warenbezeichnungen usw. in
diesem Werk berechtigt auch ohne besondere Kennzeichnung nicht zu der Annahme,
dass solche Namen im Sinne der Warenzeichen- und Markenschutz-Gesetzgebung als frei
zu betrachten wären und daher von jedermann benutzt werden dürften.
Die Informationen in diesem Werk wurden mit Sorgfalt erarbeitet. Dennoch können
Fehler nicht vollständig ausgeschlossen werden und die Diplomica Verlag GmbH, die
Autoren oder Übersetzer übernehmen keine juristische Verantwortung oder irgendeine
Haftung für evtl. verbliebene fehlerhafte Angaben und deren Folgen.
Alle Rechte vorbehalten
© Anchor Academic Publishing, Imprint der Diplomica Verlag GmbH
Hermannstal 119k, 22119 Hamburg
http://www.diplomica-verlag.de, Hamburg 2015
Printed in Germany
Experimental study of Network based Novel Adaptive
Routing Algorithm for Wireless Ad-Hoc Network
JAGRUT SOLANKI
1
PIYUSH PATEL
2
ANAND CHAUHAN
3
STUDENT (M.E. C.S.E.) ASST. PROF & HOD, CSE DEPARTMENT ASST. PROF CSE DEPARTMENT
NSIT COLLEGE JETALPUR NSIT COLLEGE JETALPUR
NSIT COLLEGE JETALPUR
Jagrutsolanki1@gmail.com
piyush.patel@nsitgurukul.com
anand.ldce@gmail.com
ABSTRACT
Ad hoc network is a collection of mobile nodes which dynamically form a temporary network
without any infrastructure or centralize entity. There are number of routing protocol exists in ad
hoc network and this protocols have been compared. These protocols are like DSR (Dynamic
Source Routing), AODV (Ad-hoc On Demand Distance Vector Routing Algorithm), and TORA
(Temporally Ordered Routing Algorithm) like more. AODV is Reactive routing protocol. We
modify the existing AODV protocol. All Routing Protocol have different Strategies of routing
like End to End delay, Packet delivery ratio, Traffic overhead and Power Consumptions. Routing
Deals with route discovery between source and destination. Aim of Dissertation is to improve
route error tolerance mechanism of AODV. In our propose scheme the transmission starts from
closest neighbor node if the link fail in middle of the transmission. That shows very important
reductions in delay and it improves the packet delivery ratio. It also reduces the routing overhead
by reducing frequency of route discovery process.
Keywords:- MANET, AODV, DSR,
ZRP
.
1. INTRODUCTION
A mobile ad hoc network is a collection of Different mobile nodes that are connected by wireless
links there is no fixed infrastructure or centralize entity. In MANET every node not only act as
only host but also as a router .Every device in MANET is independently movable device in any
direction and according to that modification of their link frequently changes.
Different Routing Protocols are divided into 3 categories 1) Reactive -On Demand, 2) Proactive -
Table Driven, 3) Hybrid
In Proactive Every node maintain its own routing table and contain every route entry of other
nodes within the network. In Reactive if node want to send a packet to destination and that is not
reachable then node initiates the route discovery process to find the destination node to deliver
the message. The goal of the ad hoc routing protocol is to supply correct and effective route
establishment between pair of different nodes and in order of that message could also delivered
on time
Proactive protocols are also known to be Table Driven Protocols like OLSR DSDV in that every
node maintains routing information in routing table of all nodes while reactive routing protocols
are known to be an on demand protocols because they initiate route discovery when that needed,
the protocols are like AODV, DSR. Hybrid protocols are combination of Reactive and Proactive
Routing Protocols that are like ZRP
AODV protocol is Reactive protocol in its nature and it's widely used for route discovery in
MANET. The communications starts from Route Discovery process. There are 3 AODV
message used Route Request (RREQs), Route Replies (RREPs), and Route Errors (RERRs)
Figure 1: RREQ and RREP messages in MANET using AODV
In above figure Source node A broadcast the route request message RREQ in network to
destination B. The RREQ message is shown by Black Bold line from source node to several
directions. Source node A Broadcast the Route request RREQ message to its neighbor nodes
when the neighbor node receive the request of source node then to create reverse route to source
node. All neighbor nodes are nearest to the source nodes. The hop count is incremented when it
forwards the request. A neighbor also can check the node is active or not if it is active route then
it forwards the RREP message to the source node If the Route is not active then it re initiate the
route discovery process by incrementing its hop counts. RREQ message is Flood in network to
find the perfect destination node B. Intermediate node only can reply to the RREQ message
when the DSN (Destination Sequence Number) is adequate or Larger than the number of RREQ
packet header
Figure 2: Working of AODV protocol
Neighboring nodes sporadically exchange hello message, Absence of hello message is used as a
sign of link failure
Reactive protocols establish the route once source has data send to destination. Examples for
Reactive protocols are AODV and DSR routing protocol. during this paper, our work is to
enhance performance of AODV routing protocol. during this section, we'll see the function of
AODV routing protocol and literature survey of various routing protocols that optimizes the
performance of AODV. AODV (Ad hoc On demand Distance Vector) Routing Protocol was
proposed [8] and it's designed for nodes that are in mobile fashion to line up an ad hoc Network.
As a reactive routing protocol, AODV protocol maintains the routing information of all
destinations within the routing table
In AODV every node have latest information available about the sequence number for the IP
address of destination node for which the route table entry is maintain, this sequence number call
destination sequence number to enable Fresh route and to avoid loop free mechanism AODV use
destination sequence numbers. AODV is hop by hop routing protocol that sends and receives
data and maintain active route using Route Request (RREQ), Route Reply (RREP), Route Error
(RERR) and HELLO message[23].
A node can change the sequence number in entry of routing table of destination when the node is
destination node itself and offers new routes itself, or it receive the new information of sequence
number of destination node or path of Destination node expire or break. A destination node can
increments its own sequence number in two ways , when a node originate a route discovery or a
destination node originate route reply in response to route request in this circumstances it must
update its own sequence number to the maximum of current sequence number and destination
sequence number in RREQ packet.
In Route Discovery phase source node want to send data to destination node but if it not have
route to destination it broadcast the RREQ with incrementing the broadcasting id and destination
sequence number. Intermediate node receives RREQ and send RREP if it have active route
available for destination otherwise it broadcast again RREQ[10]. Route request packet travels
entire in network, intermediate node receive the packet and add node address in routing table
from which it has received for reversed route if it does not has route. Intermediate node or
Excerpt out of 14 pages
- scroll top
Details
- Quote paper
- , 2015, Experimental study of Network based Novel Adaptive Routing Algorithm for Wireless Ad-Hoc Network, Hamburg, Bedey Media GmbH, https://www.anchor-publishing.com/document/302336
Comments