International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 4, Issue 4, April 2014)

Routing Protocols and Security Issues in MANET: A Survey

Shesh Kumar Sharma1, Ramendra Kumar2, Anshul Gangwar3, Kamaljeet Pakhre4
1,2,3,4
M. Tech. Research Scholar (CSE), Galgotias University, Greater Noida, India.
Abstract— A Mobile Ad-hoc Network (MANET) is a A MANET routing protocol is a convention or we can
collection of mobile devices which are dynamic in nature and say that it is a standard that controls flow of data packets in
they communicate with each other without any help of a pre- the network and also decide that which path should be
installed infrastructure, access point or centralized followed by the packets to the reach the particular
administration. One of the major challenges in a MANET, is
destination.
to design the robust routing algorithms. Routing is an
essential and major concern for effective and reliable In a MANET, topology of the network is not fixed due
communication between mobile nodes in a MANET. We to its dynamic nature. Because of it, we do not have a fixed
present a survey of the main types of routing protocols and path from one node to another node in the network, they
some security related issues of MANETs. In MANETs mobile have to discover by the announcement of its presence.
devices, configure themselves with each other in the network Every node in the network and should also listen to
without fixed infrastructure. Topology changes frequently due announcements broadcasted by its neighbors.
to dynamic nature of mobile nodes. Mobility management, MANET routing protocols can be categorized into three
bandwidth efficiency, battery power limitation and various major groups based on the routing strategy. These are: (1)
security issues take the center of the scene while designing
Proactive or Table driven, (2) Reactive or On-demand and
routing algorithms for the MANETs. Every mobile node acts
as a router for routing the packets in the network. MANET (3) Hybrid. In proactive routing protocols routes to a
can be used in any area where there is no need to have a fixed destination are determined when a node joins the network
infrastructure. Here we have made a brief introduction of the or changes its location, and are maintained by periodic
most popular protocols that follow the table-driven approach route updates. In reactive routing protocols routes are
and the source initiated on-demand approach and we have discovered when needed and expire after a certain period of
also mentioned some security related issues. time. Hybrid routing protocols combine the features of both
proactive and reactive routing protocols to scale well with
Keywords— MANET, Routing Protocols, Security attacks, network size and node density in the network.
Security issues.
MANET is described as a self-configurable and rapidly
deployable wireless network. The absence of centralized
I. INTRODUCTION
management makes each wireless node in the MANET to
A Mobile Ad-hoc Network is a collection of wireless perform routing to its neighbors in order to maintain the
mobile hosts forming a temporary network without [1] any connectivity and the network stability. Therefore, the
help of predefined infrastructure or centralized routing protocol must ensure both connectivity and security
administration. Mobile Ad-hoc Networks (MANETs) are to achieve the network stability. Unfortunately, the widely
collections of self-organizing [2] and self-configuring used routing protocols perform their algorithms over
multihop wireless networks, where the structure of the MANET routing protocols assume that all the nodes are
network changes dynamically. This is mainly due to the trusted. If the routing information has been fabricated and
mobile nature of the nodes. The node in the network acts as the direction of the route has been modified, then the
a router that route data to and from other nodes in the attacker or intruder would perform different types of
network. All devices in a MANET are free to move in any attacks such as Black Hole Attack (BHA) [3].
direction independently, and because of this change its Active research work for MANET is carrying on mainly
links to other devices frequently. Designing a routing for in the fields of medium access control, routing, resource
MANET has been a challenging task due to dynamic management, power control and security related issues.
topology of the network. The major reason for this, is the Because of the importance of routing protocols in MANET,
frequent change in network topology because of the high a lot of routing protocols have been proposed in the last
degree of node mobility. A variety of protocols have been few years. There are some challenges that make the design
developed for the achievement of this task. of Mobile Ad-hoc Network routing protocols a tough task.
Routing is the process of selecting paths in a network [1] Firstly, in MANET, node mobility causes frequent
to transmit data packets from one node to another node in topology changes and network partitions. Secondly,
the network. because of the variable and unpredictable capacity of
wireless links, packet losses may happen frequently.

918
 International Journal of Emerging Technology and Advanced Engineering
Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 4, Issue 4, April 2014)
Moreover, the broadcast nature of the wireless medium DSDV compensates for mobility using sequence
introduces the hidden terminal and exposed terminal numbers and routing table updates, if a route update with a
problems. Additionally, mobile nodes have restricted higher sequence number is received, it will replace the
battery power, computing and bandwidth resources, various existing route, thereby reducing the chance of routing
security issues and require effective routing schemes. loops, when a major topology change is detected a full
routing table dump will be performed, this can add
II. C LASSIFICATION O F ROUTING P ROTOCOLS significant overhead to the network in dynamic scenarios
[9].
B. Wireless Routing Protocol (WRP)
WRP (Murthy & Garcia-Luna-Aceves, 1995) is a
distance vector routing protocol that aims to reduce the
possibility of forming temporary routing loops in mobile
ad-hoc networks. It is a proactive, destination-based
protocol. WRP belongs to the class of path finding
algorithms. The typical feature for these algorithms is that
they utilize information about distance and second-to-last
hop (predecessor) along the path to each destination. Path-
1. Proactive routing protocols finding algorithms eliminate the counting-to-infinity
These protocols require each node to maintain one or problem of distributed Bellman- Ford-algorithms by using
more tables to store, update routing information and to that predecessor information, which can be used to infer an
propagate updates throughout the network. These protocols implicit path to a destination and thus detect routing loops.
try and maintain valid routes to all communication mobile In WRP there is a quite complicated table structure.
nodes all the time, which means before a route is really Each node maintains four different tables as in many other
needed. Periodic route updates are swapped in order to table-driven protocols only two tables are needed. These
synchronize the tables [4]. Table driven protocols maintain four tables are:
consistent and up to date routing information about each  Distance table,
node in the network. These protocols require each node to  Routing table,
store their routing information and when there is a change  Link- cost table and
in network topology [5]. Some of the existing  Message Retransmission List (MRL) table.
proactive/table driven routing protocols are: In WRP [10] nodes learn of the existence of their
 Destination Sequenced Distance Vector routing neighbors form the receipt of acknowledgements and other
(DSDV) messages. If there are no such messages to be sent, a node
 Wireless Routing Protocol (WRP) must send a HELLO message within a specified time
 Cluster Gateway Switch Routing protocol (CGSR) period to ensure connectivity.
 Fisheye State Routing (FSR) C. Clusterhead Gateway Switch Routing protocol (CGSR)
 The logical Hypercube-based Virtual Dynamic
CGSR (Chiang, Wu, Liu, & Gerla, 1997) is a typical
Backbone protocol (HVDB)
cluster based hierarchical routing. A stable clustering
A. Destination Sequenced Distance Vector routing algorithm Least Clusterhead Change (LCC) is used to
(DSDV) partition the whole network into clusters and a Clusterhead
DSDV (Perkins & Bhagwat, 1994) is a distance vector is elected in each cluster. A mobile node that belongs to
routing protocol that ensures a loop-free routing by tagging two or more clusters is a gateway connecting the clusters.
each route table entry with a sequence number and is based Data packets are routed through paths having a format of
upon the Bellman-Ford algorithm to calculate the shortest Clusterhead Gateway between any source and destination
number of hops to the destination. Each DSDV node pairs.
maintains a routing table which stores; destinations, next The major advantage of CGSR is that it can greatly
hop addresses and number of hops as well as sequence reduce the routing table size comparing to DV protocols.
numbers; routing table updates are sent periodically as Only one entry is needed for all nodes in the same cluster.
incremental dumps limited to a size of 1 packet containing Thus the broadcast packet size of the routing table is
only new information. reduced.

919
 International Journal of Emerging Technology and Advanced Engineering
Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 4, Issue 4, April 2014)
These features make a DV routing scale to large network HVDB supports QoS-aware multicast and is derived
size. Although an additional cluster member table is from n-dimensional hypercube in large-scale MANETs,
required at each node, its size only decided by the number which have many desirable properties, such as high fault
of clusters in the network. The drawback of CGSR is the tolerance, small diameter, regularity, and symmetry. It uses
difficulty to maintain the cluster structure in a mobile the location information of MNs and meets the new QoS
environment. The LCC clustering algorithm introduces requirements: high availability and good load balancing
additional overhead and complexity in the formation and [13].
maintenance of clusters [11].
2. Reactive routing protocols
D. Fisheye State Routing (FSR) Every node in this routing protocol maintains
FSR (Pei, Gerla & Chen, 2000) is an improvement of information of only active paths to the destination nodes. A
GSR. GSR requires the entire topology table to be route search is needed for every new destination therefore
exchanged among neighbors. the communication overhead is reduced at the expense of
The Fisheye State Routing (FSR) is a proactive unicast delay to search the route. Rapidly changing wireless
routing protocol based on Link State routing algorithm with network topology may break active route and cause
effectively reduced overhead to maintain network topology subsequent route search. References [6] gives a very good
information. As indicated in its name, FSR utilizes a explanation on this topic. Routes in reactive algorithms are
function similar to a fish eye. The eyes of fishes catch the established when they are needed, in order to minimize the
pixels near the focal with high detail, and the detail communication overhead. They are adaptive to “sleep
decreases as the distance from the focal point increases. periods [7]” operation, since inactive nodes simply do not
Similar to fish eyes, FSR maintains the accurate distance participate at the time the route is established. Some of the
and path quality information about the immediate existing proactive/table driven routing protocols are:
neighboring nodes, and progressively reduces detail as the  Ad-hoc On-demand Distance Vector routing
distance increases. In Link State routing algorithm used for (AODV)
wired networks, link state updates are generated and  Dynamic Source Routing (DSR)
flooded through the network whenever a node detects a
 Light-weight Mobile Routing (LMR)
topology change. In FSR, however, nodes exchange link
 Associativity Based Routing (ABR)
state information only with the neighboring nodes to
maintain up-to-date topology information. Link state  The Enhanced On Demand Multicast Routing
updates are exchanged periodically in FSR, and each node Protocol (EODMRP)
keeps a full topology map of the network. To reduce the A. Ad-hoc On-demand Distance Vector routing (AODV)
size of link state update messages, the key improvement in The Ad-hoc On-demand Distance Vector (AODV)
the FSR is to use different update periods for different routing is an improvement on DSDV because it typically
entries in the routing table. Link state updates minimizes the number of required broadcasts by creating
corresponding to the nodes within a smaller scope are routes on a demand basis, as opposed to maintaining a
propagated with higher frequency [12]. complete list of routes as in the DSDV algorithm. The
E. The logical Hypercube-based Virtual Dynamic authors of AODV classify it as a pure on-demand route
Backbone protocol (HVDB) acquisition system, since nodes that are not on a selected
The logical Hypercube-based Virtual Dynamic path do not maintain routing information or participate in
Backbone (HVDB) is a proactive, QoS-aware and hybrid routing table exchanges [14].
multicast routing protocol for large scale MANETs. It AODV utilizes sequence numbers and routing beacons
includes proactive logical route maintenance, summary- from DSDV but performs route discovery using on-demand
based membership update and logical location-based route requests (RREQ); the same process as the DSR
multicast routing. Due to the regularity and symmetry protocol. AODV is different to DSR in that it uses distance
properties of hypercube, no leader is needed in a logical vector routing; this requires every node in the route to
hypercube, and every node plays almost the same role maintain a temporary routing table for the duration of the
except for the slightly different roles of border cluster communication. AODV has improved upon the DSR route
heads and inner cluster heads. Thus, no single node is more request process using an expanding ring search mechanism
loaded than any other nodes, and no problem of bottlenecks based upon incrementing time-to-live (TTL) to prevent
exists, which is likely to occur in tree-based architectures. excessive RREQ flooding.

920
 International Journal of Emerging Technology and Advanced Engineering
Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 4, Issue 4, April 2014)
Nodes within an active route record the senders address, A higher level protocol could use redundant routes in a
sequence numbers and source / destination IP address round-robin fashion to economically use local bandwidth.
within their routing tables, this information is used by route The limitation of this protocol is that in a rapidly changing
reply (RREP) to construct reverse paths. AODV deals with network there may be many false RPY (reply) packets
node mobility using sequence numbers to identify and producing message overhead [17].
discard outdated routes, this is combined with route error
D. Associativity Based Routing (ABR)
(RERR) messages which are sent when broken links are
detected, RERR packets travel upstream to the source ABR protocol defines a new type of routing metric‚
informing nodes to delete the broken links and trigger new degree of association stability for mobile ad hoc networks.
route discovery if alternative routes are not available [9]. In this routing protocol, a route is selected based on the
degree of association stability of mobile nodes. Each node
B. Dynamic Source Routing (DSR) periodically generates beacon to announce its existence.
DSR allows nodes in the MANET to dynamically Upon receiving the beacon message, a neighbor node
discover a source route across multiple network hops to any updates its own associativity table. For each beacon
destination. In this protocol, the mobile nodes are required received, the associativity tick of the receiving node with
to maintain route caches or the known routes. The route the beaconing node is increased. A high value of
cache is updated when any new route is known for a associativity tick for any particular beaconing node means
particular entry in the route cache. Routing in DSR is done that the node is relatively static. Associativity tick is reset
using two phases: route discovery and route maintenance. when any neighboring node moves out of the neighborhood
When a source node wants to send a packet to a of any other node [18].
destination, it first consults its route cache to determine
E. The Enhanced On Demand Multicast Routing Protocol
whether it already knows about any route to the destination
(EODMRP)
or not. If already there is an entry for that destination, the
source uses that to send the packet. If not, it initiates a route The Enhanced On Demand Multicast Routing Protocol
request broadcast. This request includes the destination (EODMRP) is an enhancement of ODMRP, which is a
address, source address, and a unique identification reactive mesh-based multicast routing protocol. It is an
number. Each intermediate node checks whether it knows enhanced version of ODMRP with adaptive refresh.
about the destination or not. If the intermediate node does Adaptation is driven by receivers’ reports. The second
not know about the destination, it again forwards the packet enhancement is the “unified” local recovery and receiver
and eventually this reaches the destination. A node joining scheme. As the time between refresh episodes can
processes the route request packet only if it has not be quite long, a new node or a momentarily detached node
previously processed the packet and its address is not might loose some data while waiting for the routing to it to
present in the route record of the packet. A route reply is be refreshed and reconstructed. Upon joining or upon
generated by the destination or by any of the intermediate detection of broken route, a node performs an expanding
nodes when it knows about how to reach the destination ring search to proactively attach itself to forwarding mesh
[16]. or to requests a global route refresh from the source.
Compared to ODMRP, a slightly lower packet delivery
C. Light-weight Mobile Routing (LMR) ratio might be expected in EODMRP in light load since the
The LMR protocol is based on the concept of link new scheme uses packet loss as indicator of a broken link.
reversal algorithm. LMR addresses the issue of partitioned The major advantage is reduced overhead, which translates
network by providing a link erasure mechanism. LMR into a better delivery rate at high loads, yet keeping the
requires two passes to re-establish and converge to an same packet delivery ratio as the original ODMRP [13].
alternate route, if one exists. LMR can erase invalid routes
3. Hybrid routing protocols
and detect partition in a single pass. It is designed to reduce
the control message propagation in highly dynamic mobile Hybrid routing protocols are a new generation of
networking environment. Due to this shortest hop paths are protocols, where both proactive and reactive in nature.
given only secondary importance and this protocol fits These protocols are designed to increase scalability by
under the stability criteria. The benefit of this protocol is allowing nodes with close proximity to work together to
that routes will be found rather quickly and broken links form some sort of a backbone to reduce the route discovery
will have only local affect. It has good performance if the overheads. This is mostly achieved by proactively
network connectivity is high, i.e., in the case of dense maintaining routes to nearby nodes and determining the
network. Routes may be redundant. route to faraway nodes using a route discovery strategy [8].
Some of the existing hybrid routing protocols are:
921
 International Journal of Emerging Technology and Advanced Engineering
Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 4, Issue 4, April 2014)
 Temporally Ordered Routing Algorithm (TORA) In a Mobile Ad-hoc Network, it can be assumed that
 Zone Routing Protocol (ZRP) most of the communication takes place between nodes
 Zone-based Hierarchical Link State (ZHLS) close to each other. The ZRP divides the entire network
 Sharp Hybrid Adaptive Routing Protocol into overlapping zones of variable size. Each node may
(SHARP) belong to multiple overlapping zones. The zone size is
 Optimized Polymorphic Hybrid Multicast Routing defined by a radius which is evaluated in number of hops.
Protocol (OPHMR) Each zone contains two type of node: peripheral nodes and
interior node. Peripheral nodes are nodes that located at the
A. Temporally Ordered Routing Algorithm (TORA) boundary of zone and interior nodes are located within the
Temporally Ordered Routing Algorithm (TORA) is a zone radius except boundary node. ZRP consists of several
reactive routing algorithm based on the concept of link components such as IARP, IERP and BRP, which only
reversal. TORA improves the partial link reversal method together provide the full routing benefit to ZRP [20].
by detecting partitions and stopping non-productive link C. Zone-based Hierarchical Link State (ZHLS)
reversals. It can be used for highly dynamic mobile ad hoc
networks. The Zone-based Hierarchical Link State routing (ZHLS)
TORA is a distributed highly adaptive routing protocol is a hybrid routing protocol. In ZHLS, mobile nodes are
designed to operate in a dynamic multihop network. TORA assumed to know their physical locations with assistance
uses an arbitrary height parameter to determine the from a locating system like GPS. The network is divided
direction of link between any two nodes for a given into non-overlapping zones based on geographical
destination. Consequently, multiple routes often exist for a information.
given destination but none of them are necessarily the In ZHLS protocol, the network is divided into non-
shortest route. To initiate a route, the node broadcasts a overlapping zones as in cellular networks. Each node
QUERY packet to its neighbors. This QUERY is knows the node connectivity within its own zone and the
rebroadcasted through the network until it reaches the zone connectivity information of the entire network. The
destination or an intermediate node that has a route to the link state routing is performed by employing two levels:
destination. The recipient of the QUERY packet then node level and global zone level. ZHLS does not have any
broadcasts the UPDATE packet which lists its height with cluster head in the network like other hierarchical routing
respect to the destination. When this packet propagates in protocols. The zone level topological information is
the network, each node that receives the UPDATE packet distributed to all nodes. Since only zone ID and node ID of
sets its height to a value greater than the height of the a destination are needed for routing, the route from a source
neighbor from which the UPDATE was received. This has to a destination is adaptable to changing topology. The
the effect of creating a series of directed links from the zone ID of the destination is found by sending one location
original sender of the QUERY packet to the node that request to every zone [21].
initially generated the UPDATE packet. When it was D. Sharp Hybrid Adaptive Routing Protocol (SHARP)
discovered by a node that the route to a destination is no
SHARP adapts between reactive and proactive routing
longer valid, it will adjust its height so that it will be a local
by dynamically varying the amount of routing information
maximum with respect to its neighbors and then transmits
shared proactively. This protocol defines the proactive
an UPDATE packet. If the node has no neighbors of finite
zones around some nodes. The number of nodes in a
height with respect to the destination, then the node will
particular proactive zone is determined by the node-specific
attempt to discover a new route as described above. When a
zone radius. All nodes within the zone radius of a particular
node detects a network partition, it will generate a CLEAR
node become the member of that particular proactive zone
packet that results in reset of routing over the ad hoc
for that node. If for a given destination a node is not present
network [19].
within a particular proactive zone, reactive routing
B. Zone Routing Protocol (ZRP) mechanism (query-reply) is used to establish the route to
ZRP (Haas, 1997; Haas & Pearlman, 1998) utilizes both that node. Proactive routing mechanism is used within the
proactive and reactive routing strategies in order to gain proactive zone. Nodes within the proactive zone maintain
benefits from the advantages of both types. routes proactively only with respect to the central node. In
It is a hybrid routing protocol which combines the this protocol, proactive zones are created automatically if
advantages of both proactive and reactive approaches. It some destinations are frequently addressed or sought within
takes advantage of proactive protocol to find node’s local the network.
neighborhood as well as reactive protocol for routing
between these neighborhoods.
922
 International Journal of Emerging Technology and Advanced Engineering
Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 4, Issue 4, April 2014)
The proactive zones act as collectors of packets, which There are various types of attacks that affect MANET
forward the packets efficiently to the destination, once the communication and its security. These attacks can be
packets reach any node at the zone vicinity [21]. classified into two types:
E. The Optimized Polymorphic Hybrid Multicast Routing  Passive attacks
Protocol (OPHMR)  Active attacks
The Optimized Polymorphic Hybrid Multicast Routing 1. Passive attacks
protocol (OPHMR) is a proactive, polymorphic energy In Passive attacks, attacker don’t harm any data in the
efficient and hybrid multicast routing protocol. It attempts network instead of it he analyze network traffic like
to benefit from the high efficiency of proactive behavior identify communicating nodes, monitor data which is
and the limited network traffic overhead of the reactive exchanged between them and steal valuable information. A
behavior, while being power, mobility, and vicinity-density passive attack attempts to learn or make use of information
aware. The protocol is based on the principle of from the network. In reference [22], in passive attacks,
adaptability and multi-behavioral modes of operations. It is attackers don’t disrupt the operation of routing protocol,
able to change behavior in different situations in order to but only attempt to discover valuable information by
improve certain metrics like maximizing battery life, listening to the routing traffic. The attacker only looks and
reducing communication delays, improving deliverability, watches the transmission and does not try to modify or
etc. OPHMR defines four different behavioral modes of change the data packets. Detection of these attacks is
operation, two power level thresholds, one mobility level difficult since the operation of network itself does not get
threshold and one vicinity density thresholds. Under the affected. Passive attacks are performed the eavesdropping,
four different modes, the lifetime of its corresponding entry traffic analysis and monitoring operations. Some passive
is also different. Power threshold determines the node’s attacks are:
behavior in order to extend its battery life. Speed threshold
is required to maintain better connectivity and awareness of  Traffic analysis
the topology changes. Density threshold is considered  Eavesdropping
when the mobility speed is high [13].  Traffic monitoring
 Release of message contents
III. SECURITY C HALLENGES IN MANET  Snooping
Security is a very challenging issue for designing an 2. Active attacks
efficient and secure routing protocol for MANETs. The On the other hand active attacks actively alter the data
infrastructure less and the dynamic nature of MANET such as message modifications, message replays and
demands new set of networking strategies to be message fabrications. It disrupts normal functionality of the
implemented in order to provide efficient and secure end- network. Active attacks consist in perturbing the algorithm
to-end communication. process to obtain an abnormal behavior and/or an erroneous
Due to the lack of a predefined centralized computation result that can be exploited to recover entirely
administration for route discovery process which leaving or partially the secrets [23]. Some active attacks are:
MANETs vulnerable to attacks, that results in degradation
in the performance of the network. Security attacks disturb  Network Jamming
routing operations which create many problems like Denial  Denial of service
of Service, Jamming the network or other types of serious  Impersonating
attacks in the network.  Modification
 Message reply
IV. T YPES OF SECURITY ATTACKS  Spoofing
Security is one of the highly challenging issues for  Masquerade
Mobile Ad-hoc Networks. Understanding possible form of
attacks is always the primary step towards the development V. CONCLUSION
of good security solutions for routing algorithms as well as A Mobile Ad-hoc Network (MANET) contains self-
secure communication. Security of communication in configuring, self-organizing and self-operating nodes, each
MANET is important for secure transmission of the data in of them communicates with other nodes directly, without
MANET. Absence of any central administration any help of centralized administration or fixed
mechanism and shared wireless mode makes MANET infrastructure, within transmission range of nodes.
more vulnerable to digital attacks than wired networks.
923
 International Journal of Emerging Technology and Advanced Engineering
Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 4, Issue 4, April 2014)
Due to the quickly installation behavior, dynamic [10] S. Murphy and J.J. Garcia-Luna-Aceves, “An Efficient Routing
Protocol for Wireless Networks”, ACM Mobile Networks and
configuration, various advantages and different application
Applications Journal, November 1996.
areas, the field of MANETs is rapidly growing and
[11] Xiaoyan Hong, Kaixin Xu and Mario Gerla, “Scalable Routing
changing. Although there are still many challenges and Protocols for Mobile Ad Hoc Networks”, IEEE Network, Vol. 16,
issues that need to be faced by the Mobile Ad-hoc Issue 4, 2002.
Network. In order to secure and effective communication [12] Ipsita Panda, “A Survey on Routing Protocols of MANETs by Using
within a MANET, an efficient routing protocol is required QoS Metrics”, International Journal of Advanced Research in
to discover routes between mobile nodes. The common Computer Science and Software Engineering, Vol. 2, Issue 10,
October 2012.
objective of routing protocol is to provide better efficient
[13] Luo Junhai, Ye Danxia, Xue Liu and Fan Mingyu, “A Survey of
energy aware and secure routing schemes to MANET. We Multicast Routing Protocols for Mobile Ad-Hoc Networks”, IEEE
have focused on the several routing protocols that can be Communications Surveys & Tutorials, Vol. 11, No. 1, 2009.
well-suited for certain conditions. Therefore, more research [14] Elizabeth M. Royer and Chai-Keong Toh, “A Review of Current
is needed to combine and integrate some of the protocols Routing Protocols for Ad Hoc Mobile Wireless Networks”, IEEE
presented in this paper to keep MANETs functioning for a Personal Communications, April 1999.
longer duration. Developing efficient and secure routing [15] Chethan Chandra S Basavaraddi and Geetha N.B., “Current Project
Work on Routing Protocols for MANET: A Literature Survey”,
protocols for MANET appears to be a promising direction International Journal of Scientific & Engineering Research, Vol. 3,
of future research works. Issue 5, May 2012.
[16] Shiv Prakash, Rajeev Kumar, Brijesh Nayak and Manindar Kumar
REFERENCES Yadav, “A Survey on Reactive Protocols for Mobile Ad Hoc
[1] Kapang Lego, P. K. Singh and D. sutradhar, “Comparative Study of Networks (MANET)”, Proceedings of the 5th National Conference;
Adhoc Routing Protocol AODV, DSR and DSDV in Mobile Adhoc Computing For Nation Development, March 2011.
NETwork”, Indian Journal of Computer Science and Engineering, [17] V. G. Muralishankar and Dr. E. George Dharma Prakash Raj,
Vol. 1, No. 4, 2011. “Routing Protocols for MANET: A Literature Survey”, International
[2] Amara korba Abdelaziz, Mehdi Nafaa and Ghanemi Salim, “Survey Journal of Computer Science and Mobile Applications, Vol. 2, Issue
of Routing Attacks and Countermeasures in Mobile Ad Hoc 3, March 2014.
Networks”, IEEE 15th International Conference on Computer [18] Sunil Taneja and Ashwani Kush, “A Survey of Routing Protocols in
Modelling and Simulation (UKSim), 2013. Mobile Ad Hoc Networks”, International Journal of Innovation,
[3] Maha Abdelhaq, Sami Serhan, Raed Alsaqour and Rosilah Hassan, Management and Technology, Vol. 1, No. 3, August 2010.
“A Local Intrusion Detection Routing Security over MANET [19] Dinesh Singh, Ashish K. Maurya and Anil K. Sarje, “Comparative
Network”, IEEE International Conference on Electrical Engineering Performance Analysis of LANMAR, LAR1, DYMO and ZRP
and Informatics (ICEEI), 2011. Routing Protocols in MANET using Random Waypoint Mobility
[4] P. Shrivastava, S. Kumar and M. Shrivastava, “Study of Mobile Ad Model”, 3rd International Conference on Electronics Computer
hoc Networks”, International Journal of Computer Applications, Technology (ICECT), Vol. 6, April 2011.
Vol. 86, No 3, January 2014. [20] G. Vijaya Kumar, Y. Vasudeva Reddyr and Dr. M. Nagendra,
[5] Geetha Jayakumar and Gopinath Ganapathy, “Performance “Current Research Work on Routing Protocols for MANET: A
Comparison of Mobile Ad-hoc Network Routing Protocol”, IJCSNS Literature Survey”, International Journal on Computer Science and
International Journal of Computer Science and Network Security, Engineering (IJCSE), Vol. 2, No. 3, 2010.
Vol. 7, No. 11, November 2007. [21] Priyanka Goyal, S. Batra and A. Singh, “A Literature Review of
[6] Fan Bai, N. Sadagopan, B. Krishnamachari and A. Helmy, Security Attack in Mobile Ad-hoc Networks”, International Journal
“Modeling Path Duration Distributions in MANETs and Their of Computer Applications, Vo. 9, No. 12, November 2010.
Impact on Reactive Routing Protocols”, IEEE journal on selected [22] Ashwani Garg and Vikas Beniwal, “A Review on Security Issues of
areas in communications, Vol. 22, No. 7, September 2004. Routing Protocols in Mobile Ad-Hoc Networks”, International
[7] Ivan Stojmenovic, “Position-Based Routing in Ad Hoc Networks”, Journal of Advanced Research in Computer Science and Software
IEEE Communications Magazine, July 2002. Engineering”, Vol. 2, Issue 9, September 2012.
[8] Mehran Abolhasan, Tadeusz Wysocki and Eryk Dutkiewicz, “A [23] Frederic Amiel, et al., “Passive and Active Combined Attacks:
review of routing protocols for mobile ad hoc networks”, Ad Hoc Combining Fault Attacks and Side Channel Analysis”, Workshop on
Networks, Vol. 2, Issue 1, January 2004. Fault Diagnosis and Tolerance in Cryptography (FDTC), September
[9] Alex Hinds, Michael Ngulube, Shaoying Zhu and Hussain Al- 2007.
Aqrabi, “A Review of Routing Protocols for Mobile Ad-Hoc
NETworks (MANET)”, International Journal of Information and
Education Technology, Vol. 3, No. 1, February 2013.

924