Practical Compact Routing on Random Unit Disk Graphs

View Full Paper

Ask AI

Bookmark

Algorithm delivers effective routing in a connected random unit disk graph, enhancing efficiency.
Constructs routing tables averaging O(log² n) entries per vertex during preprocessing.
Routing is based on handshaking with a DNS-like lookup process to ensure delivery.
Method reduces reliance on modifiable headers, leading to lower routing stretch and greater practicality.

Discussion

No takes yet. Share an insight, caveat, or question.

Algorithm supports efficient routing with moderate stretch in random unit disk graphs, implying improvements for network design.

A 2025 study studied this question.

View Full Paper

Ask AI

Bookmark