GRD Journals- Global Research and Development Journal for Engineering | Volume 4 | Issue 11 | October 2019

ISSN: 2455-5703

A Comprehensive Review on Location Aided

Routing Protocols in Computer Networks
Dr. N. Revathy
Professor
PG and Research Department of Computer Applications
Hindusthan College of Arts and Science, Coimbatore, India
Dr. T. Guhan
Assistant Professor (Sr.Grade)
Department of Computer Science and Engineering
Sri Ramakrishna Engineering College, Coimbatore, India

C. T. Arunima Megha Manoj

II MCA II MCA
PG and Research Department of Computer Applications PG and Research Department of Computer Applications
Hindusthan College of Arts and Science, Coimbatore, India Hindusthan College of Arts and Science, Coimbatore, India

Abstract
This work uses location information which is obtained using the global positioning system which consists of route request, expected
zone and request zone to improve the accuracy and the performance of the networks. An algorithm is used to encrypt and decrypt
the content. This system is designed for the routing the data from a server to the requesting mobile devices such that the data is
promptly delivered. The system will be designed with the security algorithm RSA.
Keywords- Location-Aided Routing (LAR) protocols, RSA, Encryption, Decryption, Route Request, Expected zone,
Request Zone

I. INTRODUCTION
This project suggests an approach to utilize location information (for instance, obtained using the global positioning system) to
improve performance of routing protocols for ad hoc networks. By using location information, the proposed Location-Aided
Routing (LAR) protocols limit the search for a new route to a smaller “request zone” of the ad hoc network. This results in a
significant reduction in the number of routing messages. We present two algorithms to determine the request zone, and also suggest
potential optimizations to our algorithms. To provide a secure routing and data transfer between the nodes using location aided
routing protocol. Source sends the encrypted data packet to the destination through the route discovered. Destination decrypts the
data packet received from the source and sends the acknowledgement.

II. EXISTING SYSTEM

The existing system implements the routing algorithm and sends the data through the captured route. It provides connection
oriented service for the organization to send and receive the data on network. The data is sent without providing any security
options with them. It is easy for the intruders to break the data. Simple encryption algorithms are used which are easy for the
intruders to break.

A. Drawbacks
 The receiver may never know if the document he received has been tampered with.
 The user may not know if he received the document from the person who claims to have sent it.
 In existing system no security measures have been incorporated. So it is possible for the intruders to hack the data being sent.
 No route maintenance in the existing system. Each time the data to be sent the route is to be discovered.

B. Proposed System
The proposed system is designed for the routing the data from a server to the requesting mobile devices such that the data is
promptly delivered. The system will be designed with the security algorithm RSA. The route is discovered and the route is
maintained for the future transfer of data. The shortest path is maintained and the data in the future is sent through the same path.

C. Advantages of Proposed System

 The proposed system, “Location aided routing for mobile ad hoc network” is designed such a way that it provides the security
options for the data to be sent.
 The system uses RSA algorithm. This algorithm is based on very large prime numbers which is very hard to break by the
intruders.

All rights reserved by www.grdjournals.com 18

 A Comprehensive Review on Location Aided Routing Protocols in Computer Networks
(GRDJE/ Volume 4 / Issue 11 / 003)

 This system provides an efficient routing algorithm for the mobile devices.
 The system also provides route maintenance options. This module maintains the route that is captured during route
establishment phase. The same route can be used for the successive data to be sent.
 The system is to be developed using java swings for the GUI interface. Hence the interface to be used will be a user friendly.
 The system will be handling the data such a way that if the loop forms in the route the data is discarded. Hence provides an
efficient way of routing data and a prompt delivery of the data to the recipient.

III. MODULES

A. Route Discovery
Location Aided Routing (LAR) protocol is one which utilizes the location information of a mobile host to limit the search to a
smaller region. It involves mainly two mechanisms:
 Route Discovery
 Route Maintenance
Two concepts of Route Discovery.
 Request zone
 Expected zone

1) Data Security
 Source sends the encrypted data packet to the destination through the route discovered.
 Destination decrypts the data packet received from the source and sends the acknowledgement. It involves two steps:
 Message Encryption
 Message Decryption

2) Data Transfer
Broadcast the Route Request to its neighbors.

B. Route Maintenance
 Maintaining Routes
 Data Transfer

1) Route Disconnection
If the user wants to send data:
 Get the Destination identifier and the encrypted data to be transferred.
 Initialize the buffer with the encrypted data to be transferred.
 Setup a Request Zone.
 Build a Route Request packet having the information about the source and the Destination identifiers, and the Request Zone
information.
 Broadcast the Route Request to its neighbors.
Setup a timer for receiving Route Reply
If the node receives a packet
1) Find the type of the packet received.
2) Depending on the type of packet received do one of the following processes.
 Process Route Request
 Process Route Reply
 Process Data Packet
 Process Acknowledgement
 Process Route Disconnect
 Process Route Disconnect reply

All rights reserved by www.grdjournals.com 19

 A Comprehensive Review on Location Aided Routing Protocols in Computer Networks
(GRDJE/ Volume 4 / Issue 11 / 003)

IV. SYSTEM FLOW DIAGRAM

V. EXPERIMENTAL RESULTS
Input design is a process of connecting the user-originated inputs into a computer used format. The goal of the input design is to
make the data entry logical and free from errors. Errors in the input database controlled by input design. This application is being
developed in a user-friendly manner.
The output from the system is either by screen or by hard copies. Output design aims at communicating the results of the
processing to the users. The reports are generated to suit the needs of the users. The reports have to be generated with appropriate
levels.

Fig. 1: Status Display

All rights reserved by www.grdjournals.com 20

 A Comprehensive Review on Location Aided Routing Protocols in Computer Networks
(GRDJE/ Volume 4 / Issue 11 / 003)

Fig. 2: Command Window

Fig. 3: Login Form

Fig. 4: Selection of File

Fig. 5: Calculation Using Prime Number

All rights reserved by www.grdjournals.com 21

 A Comprehensive Review on Location Aided Routing Protocols in Computer Networks
(GRDJE/ Volume 4 / Issue 11 / 003)

Fig. 6: Command Executor

VI. CONCLUSION
The results of the location aided routing indicate that the usage information reduces the overhead as compared to other algorithm.
In addition it provides a secure data transmission over a network. The software is programmed to transmit file through LAN to a
single computer at a time. The software can be enhanced to transmit file to more than one computer at a time, that is, multipoint
communication. Our system when extended could be used by business transactions. In future, militaries personal and banks may
extend our project for secure transmission of messages and electronic banking.

REFERENCES
[1] I.F. Akyildiz, S.M. Joseph and Yi-Bing Lin, Movement-based location update and selective paging for PCS networks, IEEE/ACM Transactions on
Networking 4 (1996) 94–104.
[2] C. Alaettinoglu, K. Dussa-Zieger, I. Matta and A.U. Shankar, MaRS user’s manual – version 1.0, Technical Report TR 91-80, The University of Maryland
(June 1991).
[3] S. Basagni, I. Chlamtac, V.R. Syrotiuk and B.A. Woodward, A distance routing effect algorithm for mobility (DREAM), in: Proc. Of ACM/IEEE MOBICOM
’98 (1998).
[4] J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu and J. Jetcheva, A performance comparison of multi-hop wireless ad hoc network routing protocols, in: Proc.
of MOBICOM ’98 (1998).
[5] S. Corson, S. Batsell and J. Macker, Architectural considerations for mobile mesh networking (Internet draft RFC, version 2), in: Mobile Ad-hoc Network
(MANET) Working Group, IETF (1996).
[6] S. Corson and A. Ephremides, A distributed routing algorithm for mobile wireless networks, Wireless Networks (1995) 61–81.
[7] S. Corson and J. Macker, Mobile ad hoc networking (MANET): Routing protocol performance issues and evaluation considerations (Internet-draft), in:
Mobile Ad-hoc Network (MANET) Working Group, IETF (1998).
[8] S.R. Das, R. Castaneda, J. Yan and R. Sengupta, Comparative performance evaluation of routing protocols

All rights reserved by www.grdjournals.com 22