Routing in Geometric Networks
Summary
This research project aims to compare a number of routing algorithms developed for geometric networks. Some of these algorithms come with theoretical guarantees, but we aim to see which performs best in practice.
Supervisor(s)
Research Location
Program Type
Masters/PHD
Synopsis
Geometric networks are networks where every node has a location associated with it. When two nodes are connected, they know each other’s location. These networks are quite well understood and a number of efficient routing algorithms have been developed for them. Some of these routing algorithms come with theoretical worst-case guarantees on the length of the routing path, but not all do. Hence, we aim to perform a comprehensive study comparing various routing algorithms in order to discover which performs best in practice and which types of geometric graphs the known routing algorithms have trouble with. The latter will also provide a starting point for the development of new routing algorithms specifically designed to handle these problematic situations.
Additional Information
• Use of research technique / methodology / technology
• Potential topics of interest for the research opportunity
• Current PHD and/or Masters topics
• Eligibility criteria / candidate profile
Want to find out more?
Contact us to find out what’s involved in applying for a PhD. Domestic students and International students
Contact Research Expert to find out more about participating in this opportunity.
Browse for other opportunities within the Computer Science .
Keywords
Geometric graph, Routing, short paths, network design, implementation
Opportunity ID
The opportunity ID for this research opportunity is: 2439
Other opportunities with Dr Andre vanRenssen