Mobile Ad hoc Networks (MANETs) comprised of autonomous and self-organizing mobile computing devices which do not have a fixed infrastructure but rather they use ad-hoc routing protocols for data transmission and reception. Ad hoc on demand distance vector (AODV) is an IP reactive routing protocol which is optimized for MANETs and it can also be used for other wireless ad-hoc networks. Nodes in network cannot perform route discovery or maintenance functions itself. This problem is resolved by using AODV as it computes the routing distance from sending node to receiving node at preset intervals. This research paper proposed Secure Routing Protocol (SRP) AODV for MANETs and its implementation. Performance of proposed SRP is compared to ordinary AODV. The simulation results reveal that proposed SRP is more efficient and secure than ordinary AODV. SRP AODV can be used for further research towards development of a commercial demand for the MANET routing protocol using Blowfish cryptosystem for encryption and decryption for secure routing in a given mobile ad hoc network.
[1]
J. Redi,et al.
A brief overview of ad hoc networks: challenges and directions
,
2002,
IEEE Communications Magazine.
[2]
Manel Guerrero Zapata.
Secure ad hoc on-demand distance vector routing
,
2002,
MOCO.
[3]
Charles E. Perkins,et al.
Ad hoc On-Demand Distance Vector (AODV) Routing
,
2001,
RFC.
[4]
Charles E. Perkins,et al.
Ad Hoc Networking
,
2001
.
[5]
Brad Karp,et al.
GPSR: greedy perimeter stateless routing for wireless networks
,
2000,
MobiCom '00.
[6]
Dharma P. Agrawal,et al.
Routing security in wireless ad hoc networks
,
2002,
IEEE Commun. Mag..
[7]
Charles E. Perkins,et al.
Ad-hoc on-demand distance vector routing
,
1999,
Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.
[8]
Brad Karp,et al.
Greedy Perimeter Stateless Routing for Wireless Networks
,
2000
.