Node locations are modelled as Euclidean points, and the area within which a signal from one node can be received by another node is modelled as a circle. It is assumed that all nodes are homogeneous and equipped with omnidirectional antennas. In this application, nodes are connected through a direct wireless connection without a base station. Applicationsīeginning with the work of, unit disk graphs have been used in computer science to model the topology of ad hoc wireless communication networks. This rapid growth implies that unit disk graphs do not have bounded twin-width. Unit disk graphs may be formed in a different way from a collection of equal-radius circles, by connecting two circles with an edge whenever one circle contains the center of the other circle. These graphs have a vertex for each circle or disk, and an edge connecting each pair of circles or disks that have a nonempty intersection. Unit disk graphs are the intersection graphs of equal-radius circles, or of equal-radius disks.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |