Prediction schemes to enhance the routing process in geographical GPSR ad hoc protocol

15Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Geographical routing protocols have received a serious attention due to more advantages they have in comparison to the conventional routing protocols. They require information about the physical position of nodes needed to be available. Commonly, each node determines its own position through the use of Global Positioning System (GPS) or some other type of positioning service. Greedy Perimeter Stateless Routing (GPSR) protocol, which is one of geographical routing protocols, limits the forwarding decision of the packet based on the node’s own position, the destination’s position and the position of the forwarding node’s neighbors. Location information has some inaccuracy depending on the localization system and the environment exists in. This paper aims to study the impact of mobility metrics (beacon interval, and node speed) on introducing location information error in GPSR protocol using different mobility models. The effect of these metrics is identified in GPSR as Neighbor Break Link (NBL) problem. Based on simulation analysis, mobility prediction schemes are proposed to migrate the observed problem. © 2007 - IOS Press and the authors.

Cite

CITATION STYLE

APA

Saqour, R., Shanuldin, M., & Ismail, M. (2007). Prediction schemes to enhance the routing process in geographical GPSR ad hoc protocol. Mobile Information Systems, 3(3–4), 203–220. https://doi.org/10.1155/2007/364101

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free