Mobile Ad hoc Networks routing algorithms & Protocol in MANET
TALHA RIAZ1, Muhammad Mumtaz2 , Umar Hassan3 , Engr. UZMA MAJEED[4]
Hamdard University Islamabad Campus (Department of Electrical Engineering)
trpj07@gmail.com , m.mkanwal15@gmail.com , umarraaj2020@gmail.com , uzmamajeed14@gmail.com
Abstract: Mobile Ad hoc Networks (MANET) is a technology
where multiple nodes are connected with wireless connection and
independent to form network topology. The devices can self
configure them self and they can move independently. In MANET
each device is able change their link frequently all devices act both
as a host and as a router, because due to limited range of energy
transmission. The existing routing algorithms & protocols are
insufficient for batter communication from source to destination.
In this paper we discuss about the exciting techniques and
improvement in these techniques, to form a better network
topology for effective communication between source and
destination.
Introduction
MANET is a mobile network in which each node
communicate each other without using any predefine
infrastructure or central administration. These networks are
mainly uses in temporary networks or to form a small
networking topology. Generally these network topologies
are used for civilian purposes. This is a valid field of
research in this topology there are devices in network which
are mobile devices, there are existing algorithms which are
not sufficient for communication. Many researchers have
research on it by both quantitative and qualitative research
methods. By new emerging technologies like Wi-Fi
(wireless lane), Bluetooth make mobile ad-hoc networking
more realistic. By using these technologies it can be easy to
established mobile ad-hoc network. Now a day’s mobile
spot multi-media applications on mobile phones can make
MANET easier.
Proactive Protocols: In this type of routing protocol, each
node in a network maintains one or more routing tables
which are updated regularly. Each node sends a broadcast
message to the entire network if there is a change in the
network topology. However, it incurs additional overhead
cost due to maintaining up-to-date information and as a
result; throughput of the network may be affected but it
provides the actual information to the availability of the
network. Distance vector (DV) protocol, Destination
Sequenced Distance vector (DSDV) protocol, Wireless
Routing protocol Fisheye State Routing (FSR) protocol are
the examples of Proactive protocols.
Reactive Protocols: In this 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 rote is discovered then
bandwidth is used for data transmission. The main
advantage is that this protocol needs less touting
information but the disadvantages are that it produces huge
control packets due to route discovery during topology
changes which occur frequently in MANETs and it incurs
higher latency. The examples of this type of protocol are
Dynamic Source Routing (DSR), Ad-hoc On Demand
Routing (AODV) and Associatively Based Routing (ABR)
protocols.
Hybrid Protocols: It is a combination of proactive and
reactive protocols taking the best features from both worlds.
Four Routing Protocols: In this report, the following four
routing protocols have been discussed but only
implementation and analysis for AODV and DSR are
shown.
Distance Vector (DV) Protocol: It is a proactive protocol
that works on the principles of distance vector where each
node in a network maintains a distance table that contains
the shortest distance and the address of the next hop router.
Initially, each node knows only the distance with the nodes
that are directly connected and a distance vector is
initialized with that distance. Initially, distance to all others
nodes that are not directly connected are initialized the
infinity. When a change occurs in the network, each node
updates its directly connected neighbors to the least cost
distance vector. This process continues until convergence.
The advantages of distant vector protocol are
1) No need for global broadcasting.
2) Short route acquisition delay all information for each
node is available in the routing table.
3) Long convergence time which may cause counting to
infinity problem for large Networks.
4) Non-availability of alternative paths.
Wireless Routing Protocol (WRP): It is an improved
version of the distant vector protocol that eliminates the
count-to-infinity problems and thereby decreasing the
convergence time. It has some disadvantages also. It
requires larger memory and greater processing. It is also not
suitable large networks with mobility. However, in WRP,
each node in a network maintains the following four tables:
1) Link Cost Table: Each node contains cost and other
information like identifier to the directly connected
nodes. The cost of a broken link is identified by
infinity.
2) Distance Table: In this table, each node contains
information to the nodes that are not directly
connected.
3) Routing Table: It contains the shortest distance and
the up-to-date information of all destinations.
4) Message Retransmission List (MRL): Each node in
a network sends a hello message to its neighbors
and informs them that he is alive and waits for the
acknowledgement (ACK) from its neighbors. If it
does get any ACK from any neighbors within a
certain time, then keeps this information to MRL
list. Next time it will send update message to nodes
only that did not reply to the hello message.
Dynamic Source Routing (DSR) Protocol: It is a reactive
protocol that creates a route on demand using source routing
protocol i.e. it requires a full series of paths to be established
between source and destination nodes to transmit packets
and each packet follows the same path. The major
motivations of this protocol are to limit the bandwidth by
avoiding the periodic table updates and long convergence
time. The underline fact to this protocol is that it floods a
route request message in the network to establish a route
and it consists of two procedures: Route Discovery and
Route Maintenance.
Route Discovery: As it is on-demand routing protocol, so it
looks up the routing during transmission of a packet. At the
first phase, the transmitting node search its route cache to
see whether there is a valid destination exists and if so, then
the node starts transmitting to the destination node and the
route discovery process end here. If there is no destination
address then the node broadcasts the route request packet to
reach the destination. When the destination node gets this
packet, it returns the learned path to the source node.
ATTACKS ON MANET
There are different types of attacks that effect the manet.
Some of them are describe below
LOCATION DISCLOSURE: Location disclosure is a type
of attack that directly attacks the privacy terms of an ad-hoc
network by using different techniques like probing and
monitoring approaches an attacker have the ability to detect
the whole network
BLACK HOLE: A black hole problem means that one
malicious node utilizes the routing protocol to claim itself of
being the shortest path to the destination node, but drops the
routing packets but does not forward packets to its
neighbors
REPLAY: This attack can degrade the performance of the
MANET. By the phenomenon of interception and
retransmission a reply attacker does this attack
Wormhole: Wormhole node fakes a route that is shorter
than the original one within the network this can confuse
routing mechanism. it has one or more malicious node and
a tunnel between them
Blackmail: This type of attack is related to the routing
protocols which mainly uses the mechanism for the
identification of malicious nodes and propagates messages
and try to isolate valid node from the network.
Denial of service: This attack can completely disturbs the
routing function which effects the whole ad-hoc network. A
denial service attack is an attempt to make a network
resource unavailable to its intended users and disrupt the
establishment of legal route.
Routing: This attack can maintain the routing table that
contains the information about the route of the network.
In this attack a malicious node is generated that sends the
fabricated signals from the other nodes to enter the false
entries in the tables of the participating nodes.
Breaking the neighbor relationship: An intelligent filter is
placed in between two ISS (information system) that could
change information in the routing update.
Masquerading: By masquerading as another node,
malicious nodes can run many attacks in a network.
Attacker modifies either the MAC or the IP address in
outgoing packets in order to adopt another identity in the
network and appear as a good natured
node. By this technique he is then able to operate as a
trustworthy node and can for example advertise incorrect
routing information to other participants of the network.
Impersonation: Impersonation is a severe threat for the
network that can capture some of the nodes from thr
network and look like friendly nodes thus, the compromised
nodes can join the network as the normal nodes
Eavesdropping: Eavesdropping means to obtain some
confidential information that should be kept secret during
the communication. The confidential information consists of
public key, private key, location and passwords of the
nodes. Such type of data is very confidential to the nodes
that should be kept secret so that no unauthorized can access
this confidential information.
Applications of MANET:
Military Tactical Operations: For fast and possibly short
term establishment of military communications and troop
deployments in hostile and/or unknown environments.
Search and Rescue Operations: For communication in
areas with little or no wireless infrastructure support.
Disaster Relief Operations: For communication in
environments where the existing infrastructure is destroyed
or left inoperable.
Law Enforcement: For secure and fast communication
during law enforcement operations.
Commercial Use: For enabling communications in
exhibitions, conferences and large gatherings. For some
business scenarios, the need for collaborative computing
might be more important outside office environments than
inside a building. After all, it is often the case where people
do need to have outside meetings to cooperate and exchange
information on a given project.
Proposed Methodology: It’s also mention that we can
make an Ad-hoc network by using the modern technology
like as Wi-Fi and blue-tooth we can connect our smart
phones through these technology. By creating these
networking it helps us to communicate into a short range
area it is helpful inside a institute for communication same
like as in industry we have to communicate with other
workers they can any where inside an industry if we use
mobile phone as ad-hoc networks.

It should be helpful in above case. Other then we use this
technology in smart house living system. By providing a
better protocol we have to use this technology in many
means. There is main challenge in these technology is
protocol as above mention that our wireless protocols are
not good and not efficient in communication. If we use two
step hybrid protocols then we have a better communication
network.
By two step hybrid protocol means in MANET we use two
protocols which is not easy to hack and we also avoid from
black hole. In this we use one as proactive and other as
reactive protocols Ad-hoc network. With the help of two
routing protocol we can save from MANET from different
attacks like bloke hole and whom node if such a attack come
in our network. We have to update the routing table of
proactive protocol or nodes are assembling with proactive
routing protocol.
Conclusion: In this paper we study about the routing
protocols in MANET and the attacks on MANET. We also
study about the vectors or how a node behaves in MANET.
We study about the AODV, DSR, TORA, ZRP and also
about the table driven routing protocols. Drawbacks of
above mention protocols. We also discuss the attacks on
MANET which attacks generally destroy our network.
There are some applications also discuss in the paper to
make it more familiar for use. And we also have a method to
improve MANET but the methodology is not clear to
implement.
References:
[1] KU Khan, RU Zaman and A. Venugopal Reddy,
“Performance Comparison of On-Demand and Table Driven
Ad HocRouting Protocols using NCTUns”, Tenth
International Conference on Computer Modeling and
Simulation, 2008.
[2] Arun Kumar B.R., Lokanatha C.Reddy,
Prakash.S.Hiremath, “Performance Comparison of Wireless
Mobile Ad hoc Network Routing Protocols” IJCSNS
International Journal of Computer Science and Network
Security VOL.8 No.6, June 2008.
[3] Srdjan Krco and Marina Dupcinov, “Improved Neighbor
Detection Algorithm for AODV Routing Protocol”,
IEEE Communications Letters, vol. 7, No. 12, december
2003.
[4] A Arafatur Rahman Md. , Farhat Anwar, Saiful Azad
Md. , “Integrated Metric-Ad Hoc On-Demand Distance
Vector:A Routing Protocol over Wireless Mesh
Networks” Journal of Computer Science 5 (7): 511-518,
2009, ISSN 1549-3636
[5] Hua Qu Peng Zhang Ji- hong Zhao, “A New Local
Repair Scheme Based on Link Breaks for Mobile Ad
Hoc Networks”, Seventh Annual Communication
Networks and Networks and Services Research
Conference -2009.
[6] Jasmine Jeni P.R., Vimala Juliet A, Shaji B, SRM
university Chennai,“MDSR (Modified Dynamic Source
Routing) and AODV (Ad hoc On Demand Distance
Vector) in MANET”, European Journal of Scientific
Research ISSN 1450-216X Vol.39 No.4 (2010), pp.606-
612, EuroJournals Publishing, Inc. 2010
[7] Abdul Hadi Abd Rahman and Zuriati Ahmad Zukarnain,
“Performance Comparison of AODV, DSDV and I-DSDV
Routing Protocols in Mobile Ad Hoc networks”,
European Journal of Scientific Research, Vol.31 No.4
(2009), pp.566-576.
[8] Anders Fongen, Morten Gjellerud, Eli Winjum “A
MILITARY MOBILITY MODEL FOR MANET
RESEARCH”
[9] Vishal Sharma et al“Performance evaluation of reactive
routing protocols in MANET networks using GSM based
voice traffic applications” Optik - Int. J. Light Electron Opt.,
Elsevier pp 201-204.JUNE 2012.
[10] Perkins, C., Belding, E., Das, S., Ad hoc On-Demand
Distance Vector (AODV) Routing - RFC 3561, 2003.