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

A Survey on Under Water Images Enhancement Techniques 

The Major causes for the underwater images are light scattering and color change. One of the methods of improving quality of the image is image enhancement. This paper presents a comparative study of various image enhanc...

Enhanced Double Layer Security using RSA over DNA based Data Encryption System

In this paper we propose an enhanced algorithm to communicate data securely for communication and information security. The DNA cryptography is a new and promising area in cryptography. Here we propose techniques that us...

Evaluating Recommender Strategies 

Recommender systems are a subclass of information filtering systems that seek to generate meaningful recommendations to users for products or items that might interest them. In recent times, it has become common to colle...

MAT-V: A strong cryptography algorithm for stream cipher techniques

To improve and increase greater security, efficiency, confidentiality for end user in stream cipher algorithms and also increases complexity for all types of attackers such as correlation attack and linear syndrome attac...

Comparative Study of Different Clustering Algorithms for Association Rule Mining

In data mining, association rule mining is an important research area in today’s scenario. Various association rule mining can find interesting associations and correlation relationship among a large set of data items[1]...

Download PDF file
  • EP ID EP151628
  • DOI -
  • Views 138
  • 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