Jump to content

Unit disk graph

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Tales Heimfarth (talk | contribs) at 16:18, 10 January 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In computer science, the unit disk graph (UDG) is a geometrical graph used to model the topology of ad hoc networks where nodes are connected through a direct wireless connection without a base station.

It is assumed that the nodes are represented by points in the Euclidean Space. The connection between the nodes are based in the Euclidean distance. If the distance between two vertices is at most 1 (normalized transmission radio), there is an edge linking those nodes. As the transmission radio of each node is modeled as a perfect circle, the signal attenuation is considered uniform.

The UDG considers that all nodes are homogeneous and equiped with omnidirational antennas.