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

USER REQUIREMENTS WEIGHT BASED APPROACH TO IDS SELECTION FOR WLAN

A variety of featured packed Wireless Intrusion Detection System (WIDS) products are available in the market. They include commercial as well as open source products. It is for user to decide which will be the best WIDS...

Classification of Image Steganography Techniques in Spatial Domain: A Study

Steganography is a method of secret communication wherein the very existence of communication is hidden. During the last few decades there have been a tremendous development in digital image steganography and a large num...

Secure Authentication Protocol to Detect Sybil Attacks in MANETs

Mobile ad-hoc networks (MANETs) are well known to be susceptible to various attacks, due to features such as lack of centralized control, dynamic topology, limited physical security and energy constrained operations. In...

Compact Wide Band Microstrip Line Feed Microstrip Patch Antenna for Wireless Application

This paper presents the increase in bandwidth of a Microstrip Antenna using a simple slotted structure fed by Microstrip line. The main aim of proposed work is to obtain a large bandwidth antenna with reduced size. The p...

A Scenario of Brain Computer Interaction with Different types of Face Recognition Techniques

Brain computer interaction technology has been developed to record the brain signal activity through various methods like Digital Electroencephalography, EMG , FMRI and face recognition. These are the advanced technology...

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