Routing properties of the localized delaunay triangulation over heterogeneous ad-hoc wireless networks

Authors:
Mark D. Watson;J. Mark Keil
Affiliations:
Department of Computer Science, University of Saskatchewan, Canada;Department of Computer Science, University of Saskatchewan, Canada
Venue:
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Year:
2006

Citing 6
Cited 0

There is a planar graph almost as good as the complete graph

SCG '86 Proceedings of the second annual symposium on Computational geometry
Classes of graphs which approximate the complete Euclidean graph

Discrete & Computational Geometry
Routing with guaranteed delivery in ad hoc wireless networks

Wireless Networks
Geometric ad-hoc routing: of theory and practice

Proceedings of the twenty-second annual symposium on Principles of distributed computing
On locally Delaunay geometric graphs

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Efficient topology control for ad-hoc wireless networks with non-uniform transmission ranges

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We explore the extremal properties of the Localized Delaunay Triangulation over networks with heterogeneous ranges. We find theoretical bounds on these properties and compare them with those found via experimentation.