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

Citation

Saqour, Raed and Ismail, Mahamod and Shanuldin, Mohamad (2007) Prediction schemes to enhance the routing process in geographical GPSR ad hoc protocol. Computer Science, Information Technology, Networking and Security and Software Development, 3 (3-4). pp. 203-220. ISSN 1574-017x (Print) 1875-905X (Online)

Full text not available from this repository.

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.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA71-90 Instruments and machines > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Computing and Informatics (FCI)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 27 Nov 2013 04:31
Last Modified: 27 Nov 2013 04:31
URII: http://shdl.mmu.edu.my/id/eprint/4495

Downloads

Downloads per month over past year

View ItemEdit (login required)