An Analysis of the Effects of Intelligent Location Prediction Algorithms on Greedy Geographic Routing in Mobile Ad-Hoc Networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Geographic routing uses the physical locations of devices for routing purposes instead of the conventional routing protocols which make use of logical addressing schemes representing an abstract hierarchy. Greedy geographic routing is a popular method favoured for its efficiency and its simplicity that considers only one hop neighbours. Greedy routing needs only minimal network information and as such is resilient to change and dynamic behaviour. Recent advances have seen the development of location prediction algorithms that use a variety of methods to determine a node’s future location based on their previous movements. Such prediction schemes can potentially benefit greedy geographic routing by allowing nodes to make routing decisions based on where a node will go rather than where it was according to the last update. The use of location prediction algorithms therefore allows geographic routing protocols to make decisions that are more intelligent, thus not only improving routing performance but providing a crucial step towards fully autonomous computer communications. The main contribution of this paper is the implementation and analysis of two existing location prediction schemes on top of the existing Greedy Perimeter Stateless Routing (GPSR) protocol ran in greedy mode.
LanguageEnglish
Title of host publicationUnknown Host Publication
Place of PublicationUniversity of Ulster, UK
Pages324-333
Number of pages10
Publication statusPublished - 31 Aug 2011
EventIn Proceedings of 22nd Irish Conference on Artificial Intelligence and Cognitive Science - University of Ulster, Magee Campus
Duration: 31 Aug 2011 → …

Conference

ConferenceIn Proceedings of 22nd Irish Conference on Artificial Intelligence and Cognitive Science
Period31/08/11 → …

Fingerprint

Mobile ad hoc networks
Routing protocols
Communication

Cite this

@inproceedings{01775b1dba86417caf45fddb09558e7f,
title = "An Analysis of the Effects of Intelligent Location Prediction Algorithms on Greedy Geographic Routing in Mobile Ad-Hoc Networks",
abstract = "Geographic routing uses the physical locations of devices for routing purposes instead of the conventional routing protocols which make use of logical addressing schemes representing an abstract hierarchy. Greedy geographic routing is a popular method favoured for its efficiency and its simplicity that considers only one hop neighbours. Greedy routing needs only minimal network information and as such is resilient to change and dynamic behaviour. Recent advances have seen the development of location prediction algorithms that use a variety of methods to determine a node’s future location based on their previous movements. Such prediction schemes can potentially benefit greedy geographic routing by allowing nodes to make routing decisions based on where a node will go rather than where it was according to the last update. The use of location prediction algorithms therefore allows geographic routing protocols to make decisions that are more intelligent, thus not only improving routing performance but providing a crucial step towards fully autonomous computer communications. The main contribution of this paper is the implementation and analysis of two existing location prediction schemes on top of the existing Greedy Perimeter Stateless Routing (GPSR) protocol ran in greedy mode.",
author = "Fraser Cadger and K Curran and JA Santos and Sandra Moffett",
year = "2011",
month = "8",
day = "31",
language = "English",
pages = "324--333",
booktitle = "Unknown Host Publication",

}

Cadger, F, Curran, K, Santos, JA & Moffett, S 2011, An Analysis of the Effects of Intelligent Location Prediction Algorithms on Greedy Geographic Routing in Mobile Ad-Hoc Networks. in Unknown Host Publication. University of Ulster, UK, pp. 324-333, In Proceedings of 22nd Irish Conference on Artificial Intelligence and Cognitive Science, 31/08/11.

An Analysis of the Effects of Intelligent Location Prediction Algorithms on Greedy Geographic Routing in Mobile Ad-Hoc Networks. / Cadger, Fraser; Curran, K; Santos, JA; Moffett, Sandra.

Unknown Host Publication. University of Ulster, UK, 2011. p. 324-333.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - An Analysis of the Effects of Intelligent Location Prediction Algorithms on Greedy Geographic Routing in Mobile Ad-Hoc Networks

AU - Cadger, Fraser

AU - Curran, K

AU - Santos, JA

AU - Moffett, Sandra

PY - 2011/8/31

Y1 - 2011/8/31

N2 - Geographic routing uses the physical locations of devices for routing purposes instead of the conventional routing protocols which make use of logical addressing schemes representing an abstract hierarchy. Greedy geographic routing is a popular method favoured for its efficiency and its simplicity that considers only one hop neighbours. Greedy routing needs only minimal network information and as such is resilient to change and dynamic behaviour. Recent advances have seen the development of location prediction algorithms that use a variety of methods to determine a node’s future location based on their previous movements. Such prediction schemes can potentially benefit greedy geographic routing by allowing nodes to make routing decisions based on where a node will go rather than where it was according to the last update. The use of location prediction algorithms therefore allows geographic routing protocols to make decisions that are more intelligent, thus not only improving routing performance but providing a crucial step towards fully autonomous computer communications. The main contribution of this paper is the implementation and analysis of two existing location prediction schemes on top of the existing Greedy Perimeter Stateless Routing (GPSR) protocol ran in greedy mode.

AB - Geographic routing uses the physical locations of devices for routing purposes instead of the conventional routing protocols which make use of logical addressing schemes representing an abstract hierarchy. Greedy geographic routing is a popular method favoured for its efficiency and its simplicity that considers only one hop neighbours. Greedy routing needs only minimal network information and as such is resilient to change and dynamic behaviour. Recent advances have seen the development of location prediction algorithms that use a variety of methods to determine a node’s future location based on their previous movements. Such prediction schemes can potentially benefit greedy geographic routing by allowing nodes to make routing decisions based on where a node will go rather than where it was according to the last update. The use of location prediction algorithms therefore allows geographic routing protocols to make decisions that are more intelligent, thus not only improving routing performance but providing a crucial step towards fully autonomous computer communications. The main contribution of this paper is the implementation and analysis of two existing location prediction schemes on top of the existing Greedy Perimeter Stateless Routing (GPSR) protocol ran in greedy mode.

M3 - Conference contribution

SP - 324

EP - 333

BT - Unknown Host Publication

CY - University of Ulster, UK

ER -