Greedy Geographic Routing in Mobile Ad-Hoc Networks

Fraser Cadger; Kevin Curran; JA Santos; Sandra Moffett

Greedy Geographic Routing in Mobile Ad-Hoc Networks

Fraser Cadger, Kevin Curran, JA Santos, Sandra Moffett

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Unknown Host Publication
Publisher	Irish Software Innovation Network
Pages	201-201
Number of pages	1
Publication status	Published - 12 Oct 2011
Event	Intel European Research & Innovation Conference 2011 - Leixlip, Co. Kildare, Ireland Duration: 12 Oct 2011 → …

Conference

Conference	Intel European Research & Innovation Conference 2011
Period	12/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

@inproceedings{7111c4aa84ee473f9c8fcb8a1fbc435f,

title = "Greedy Geographic Routing in Mobile Ad-Hoc Networks",

abstract = "Recent advances have seen the development of location prediction that use a variety of methods to determine a node{\textquoteright}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.",

author = "Fraser Cadger and Kevin Curran and JA Santos and Sandra Moffett",

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 {\textquoteright}03 Proceedings of the twentysecond annual symposium on Principles of distributed - computing. pp. 63-72; Intel European Research & Innovation Conference 2011 ; Conference date: 12-10-2011",

year = "2011",

month = oct,

day = "12",

language = "English",

pages = "201--201",

booktitle = "Unknown Host Publication",

publisher = "Irish Software Innovation Network",

address = "Ireland",

}

TY - GEN

T1 - Greedy Geographic Routing in Mobile Ad-Hoc Networks

AU - Cadger, Fraser

AU - Curran, Kevin

AU - Santos, JA

AU - Moffett, Sandra

N1 - 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

PY - 2011/10/12

Y1 - 2011/10/12

N2 - 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.

AB - 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.

M3 - Conference contribution

SP - 201

EP - 201

BT - Unknown Host Publication

PB - Irish Software Innovation Network

T2 - Intel European Research & Innovation Conference 2011

Y2 - 12 October 2011

ER -