Greedy Geographic Routing in Mobile Ad-Hoc Networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Recent advances have seen the development of location prediction that use a variety of methods to determine a node’s future location based on their previous movements. Such geographical location routing 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. We present a location prediction scheme on top of the existing Greedy Perimeter Stateless Routing (GPSR) protocol run in greedy mode.
Original languageEnglish
Title of host publicationUnknown Host Publication
PublisherIrish Software Innovation Network
Pages201-201
Number of pages1
Publication statusPublished - 12 Oct 2011
EventIntel European Research & Innovation Conference 2011 - Leixlip, Co. Kildare, Ireland
Duration: 12 Oct 2011 → …

Conference

ConferenceIntel European Research & Innovation Conference 2011
Period12/10/11 → …

Bibliographical note

Reference text: Cadger, F., Curran, K., Santos, J. and Moffett, S. (2011) An Analysis of the Effects of Intelligent Location Prediction Algorithms on Greedy Geographic Routing in Mobile AdHoc Networks. AICS 2011 - The 22nd Irish Conference on Artificial Intelligence and Cognitive Science, University of Ulster, 31 Aug - 2 Sept 2011

Kuhn, F. (2003). Geometric Ad-Hoc Routing : Of Theory and Practice *. In PODC ’03 Proceedings of the twentysecond annual symposium on Principles of distributed -
computing. pp. 63-72

Fingerprint

Dive into the research topics of 'Greedy Geographic Routing in Mobile Ad-Hoc Networks'. Together they form a unique fingerprint.

Cite this