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 9 of 9 for “"K-connectivity"”.

  1. Localized criteria for detection of critical nodes and links and k-connectivity in ad hoc networks

    Ad hoc network normally has critical connectivity properties before partitioning. The timely recognition is important in order to perform some data or service replication. Several existing centralized or globalized algorithms declare an edge or a node as critical if their removal will separate the …

    ottawa-retro Repository record for Localized criteria for detection of critical nodes and links and k-connectivity in ad hoc networks (opens in a new tab)

  2. Parameter assignment for improved connectivity and security in randomly deployed wireless sensor networks via hybrid omni/uni-directional antennas

    … of system parameterson crucial metrics like connectivity and resilience to network attacks. Traditionally,omni-directional antennas have been used for communication in wireless sensor net-works. In this thesis, a hybrid communication model is presented where-in, nodes ina network are capable …

    tamu Repository record for Parameter assignment for improved connectivity and security in randomly deployed wireless sensor networks via hybrid omni/uni-directional antennas (opens in a new tab)

  3. Extremal Problems in Matroid Connectivity

    Matroid k-connectivity is typically defined in terms of a connectivity function. We can also say that a matroid is 2-connected if and only if for each pair of elements, there is a circuit containing both elements. Equivalently, a matroid is 2-connected if and only if each pair of elements is in a …

    lsu-thes Repository record for Extremal Problems in Matroid Connectivity (opens in a new tab)

  4. The Design and Analysis of Reliable Communication Networks

    … of the reliability of the graph than the connectivity alone, at least where the probability of failure of a vertex is close to 0. The determination of the number of minimum size vertex cut sets of such a graph is therefore of interest and we describe a construction of infinite families of …

    southwales Repository record for The Design and Analysis of Reliable Communication Networks (opens in a new tab) Download PDF for The Design and Analysis of Reliable Communication Networks (opens in a new tab)

  5. Edge-Valued Graph Mining: Uncertain Communities, Dynamic Connectivity, and Private Degree Analytics

    … systems. Cohesive subgraph discovery and connectivity maintenance are two cornerstone tasks in graph mining with many real-world applications. In this thesis, we address several important problems in these areas, focusing on edge-valued graphs where edges carry existence probabilities, …

    unsw Repository record for Edge-Valued Graph Mining: Uncertain Communities, Dynamic Connectivity, and Private Degree Analytics (opens in a new tab) Embargoed

  6. Minimizing the maximum Interference in k-connected wireless networks

    Given a set P of n points in R^d, we consider the k-connected interference minimization problem, in which the objective is to assign a transmission radius to each node in P such that the resulting network is k-connected and the maximum interference is minimized. We show for any n and any 1 <= k < …

    manitoba Repository record for Minimizing the maximum Interference in k-connected wireless networks (opens in a new tab)

  7. Reinforcement Learning in Self Organizing Cellular Networks

    … a self-organizing solution to achieve k-connectivity via reinforcement learning in the topology management of wireless networks.

    boise Repository record for Reinforcement Learning in Self Organizing Cellular Networks (opens in a new tab)

  8. Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication

    … In this thesis, methods to compute the k-connectivity property of several representative key predistribution schemes are developed. A security model for MPKE and efficient and secure MPKE schemes are proposed. Scalable, privacy-preserving, and efficient authentication protocols are …

    waterloo Repository record for Cryptographic Protocols, Sensor Network Key Management, and RFID Authentication (opens in a new tab)

  9. Συνδεσιμότητα ασύρματων οπτικών δικτών

    … and receiver. To improve their reliability connectivity issues need to be investigated. Connectivity has been investigated in RF ad hoc networks (either one or two dimension) in contrast with OWC networks. The present dissertation aims to examine this research area by connecting the minimum …

    greece Repository record for Συνδεσιμότητα ασύρματων οπτικών δικτών (opens in a new tab)