scispace - formally typeset
Journal ArticleDOI

GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks

Reads0
Chats0
TLDR
A new routing protocol called GRID is proposed, which tries to exploit location information in route discovery, packet relay, and route maintenance, and can reduce the probability of route breakage, reduce the number of route discovery packets used, and lengthen routes' lifetime.
Abstract
A mobile ad hoc network (MANET) is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. One prospective direction to assist routing in such an environment is to use location information provided by positioning devices such as global positioning systems (GPS). In this paper, we propose a new routing protocol called GRID, which tries to exploit location information in route discovery, packet relay, and route maintenance. Existing protocols, as compared to ours, are either not location-aware or partially location-aware in that location knowledge is not fully exploited in all these three aspects. One attractive feature of our protocol is its strong route maintenance capability --- the intermediate hosts of a route can perform a "handoff" operation similar to that in cellular systems when it roams away to keep a route alive. This makes routes in the MANET more stable and insensitive to host mobility. Simulation results show that our GRID routing protocol can reduce the probability of route breakage, reduce the number of route discovery packets used, and lengthen routes' lifetime.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Mobile ad hoc networking: imperatives and challenges

TL;DR: The important role that mobile ad hoc networks play in the evolution of future wireless technologies is explained and the latest research activities in these areas are reviewed, including a summary of MANETs characteristics, capabilities, applications, and design constraints.
Journal ArticleDOI

Cooperative Localization in Wireless Networks

TL;DR: This paper describes several cooperative localization algorithms and quantify their performance, based on realistic UWB ranging models developed through an extensive measurement campaign using FCC-compliant UWB radios, and presents a powerful localization algorithm that is fully distributed, can cope with a wide variety of scenarios, and requires little communication overhead.
Proceedings ArticleDOI

Geographic routing without location information

TL;DR: This paper defines a scalable coordinate-based routing algorithm that does not rely on location information, and thus can be used in a wide variety of ad hoc and sensornet environments.
Proceedings ArticleDOI

A new multi-channel MAC protocol with on-demand channel assignment for multi-hop mobile ad hoc networks

TL;DR: A new multi-channel MAC protocol is proposed, which follows an "on-demand" style to assign channels to mobile hosts and flexibly adapts to host mobility and only exchanges few control messages to achieve channel assignment and medium access.
Journal ArticleDOI

Survey Paper: Routing protocols in ad hoc networks: A survey

TL;DR: A taxonomy of the ad hoc routing protocols is created to uncover the requirements considered by the different protocols, the resource limitations under which they operate, and the design decisions made by the authors.
References
More filters

Ad hoc On-Demand Distance Vector (AODV) Routing

TL;DR: A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.

Dynamic Source Routing in Ad Hoc Wireless Networks.

TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Book ChapterDOI

Dynamic Source Routing in Ad Hoc Wireless Networks

TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Proceedings ArticleDOI

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Proceedings ArticleDOI

A performance comparison of multi-hop wireless ad hoc network routing protocols

TL;DR: The results of a derailed packet-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocols, which cover a range of designchoices: DSDV,TORA, DSR and AODV are presented.