Shortest Path Geographic Routing for Mobile Ad Hoc Networks

Abstract

Mobile Ad-hoc Network (MANET) is a Network in which contains nodes that are dynamic, which means their positions are not fixed or they are can move. Since the positions are not fixed they do not have a permanent infrastructure. So the communication between the mobile nodes should be taken cares of very well for the efficient communication between the nodes. The main challenge that is being faced in the MANET is the dynamicity of the nodes, because of which the positions are changing. The routing between the nodes in the MANET should be based on the current status of the nodes. The routing protocols should adapt in such a way that optimum route between the source and destination is being obtained. The routing task in the MANETs has become very challenging due to the mobility of nodes. The conventional routing strategies for the wired networks cannot be adopted for these highly mobile networks. Geographic routing is one of the efficient routing strategies for routing. Geographic routing has greedy forwarding and recovery forwarding. In this paper the proposal is that among the paths found, the shortest path is being selected using the distance formula.

Authors and Affiliations

Soumya Sara Zachariah , Preetha K. G

Keywords

Related Articles

Implementing Phylogenetic Distance Based Methods for Tree Construction Using Hierarchical Clustering

Bioinformatics is a data intensive field of research and development. Key problem of knowledge discovery from large and complex databases is deal problem data mining. It is used to discover relationships and patterns in...

Six Sigma Quick Switching Variables Sampling System Indexed by Six Sigma Quality Levels

Motorola corporation introduced the concept of Six Sigma is a method for improving overall quality and production. If this concept of Six Sigma adopted in an organization it can results in 3.4 or lower defects per millio...

Review of Security in Manets Using Cryptographic Techniques

Ad hoc on demand distance vector (AODV) is a routing protocol for Mobile Ad hoc networks. An ad hoc network is a collection of moveable nodes which works without the need of any centralized base station or any infrastruc...

An Implementation of Load Balancing Policy for Virtual Machines Associated With a Data Center

The main aspect of any cloud application is to provide simultaneous access to number of users by reducing the cost of maintenance. This is mainly achieved by the process of implementing virtualization effectively. Virtua...

Closed Regular Pattern Mining Using Vertical Format

Discovering interesting patterns in transactional databases is often a challenging area by the length of patterns and number of transactions in data mining, which is prohibitively expensive in both time and space. Closed...

Download PDF file
  • EP ID EP151628
  • DOI -
  • Views 136
  • Downloads 0

How To Cite

Soumya Sara Zachariah, Preetha K. G (2013). Shortest Path Geographic Routing for Mobile Ad Hoc Networks. International Journal of Computer Science & Engineering Technology, 4(8), 1177-1180. https://europub.co.uk/articles/-A-151628