Greedy Geographic Routing in Mobile Ad-Hoc Networks

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

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 → …

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

  • Cite this

    Cadger, F., Curran, K., Santos, JA., & Moffett, S. (2011). Greedy Geographic Routing in Mobile Ad-Hoc Networks. In Unknown Host Publication (pp. 201-201). Irish Software Innovation Network.