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 5 of 5 for “"Disk graph"”.

  1. Capacity Characterization of Multi-Hop Wireless Networks- A Cross Layer Approach

    … radio interference are based on geometric disk-graphs. The simplicity of these models facilitate the development of provable and often conceptually simple methods for estimating the capacity of wireless networks. A potential weakness of this class of models is that they oversimplify the …

    vt Repository record for Capacity Characterization of Multi-Hop Wireless Networks- A Cross Layer Approach (opens in a new tab)

  2. Partial Delaunay triangulations based routing, address configuration and date-centric storage in ad hock network

    … 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 requires …

    ottawa-retro Repository record for Partial Delaunay triangulations based routing, address configuration and date-centric storage in ad hock network (opens in a new tab)

  3. 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 …

    njit Repository record for A clustered back-bone for routing in ad-hoc networks (opens in a new tab)

  4. 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

    poli-torino Repository record for Network Modeling and Interference Analysis in Pervasive Technology (opens in a new tab)

  5. Maximum Clique in Geometric Intersection Graphs

    An intersection graph is a graph that represents some geometric objects as vertices, and joins edges between the nodes corresponding to the items that intersect. The maximum clique in a geometric intersec- tion graph is the largest mutually intersecting set of objects. In this thesis, the primary …

    sask Repository record for Maximum Clique in Geometric Intersection Graphs (opens in a new tab)