Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 3 of 3 for “"unit disk graph"”.
-
Partial Delaunay triangulations based routing, address configuration and date-centric storage in ad hock network
… algorithm that guarantees delivery in connected unit disk graphs (where two nodes are connected if and only if their distance is no more than the transmission radius, which is equal for all nodes). The FACE mode is a recovery mode used when no neighbor closer to destination exists. FACE mode …
-
A clustered back-bone for routing in ad-hoc networks
… clusters. The ultimate aim of forming a routing graph over which power-efficient routing can be implemented in a simple and effective manner is realized by partitioning the network into disjoint clusters and thereafter joining them through gateways to form a connected, planar back-bone which is …
-
Network Modeling and Interference Analysis in Pervasive Technology
… networks are easily modeled by a family of graphs called unit disk graph (UDG). The degree distribution of a unit disk graph is an important aspect for investigating the behavior of a wireless network. In the literature, several studies was focused on the degree distribution of unit disk …