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 20 of 254 for “"all-nodes"”.

  1. A Method for Systematically Generating Tests from Object-Oriented Class Interfaces

    … criteria, which apply white-box analogues of all-DU-pairs and all-nodes to a flow graph generated from the black-box specification. The approach described herein generates tests from a matrix representation of a class interface based on the flow graph concept. In this process, separate …

    vt Repository record for A Method for Systematically Generating Tests from Object-Oriented Class Interfaces (opens in a new tab)

  2. Session Management Algorithms for Solving K-Token Dissemination Using Network Coding

    … of propagating a total number of k tokens to all nodes in the network. The tokens are distributed between one or more nodes before the algorithm is executed, and the final goal is that all nodes must eventually have the same set of k-tokens. Network coding is a recent technique that, …

    chalmers Repository record for Session Management Algorithms for Solving K-Token Dissemination Using Network Coding (opens in a new tab)

  3. Simulating underwater sensor networks and routing algorithms in MATLAB

    … from discovery to advanced routing are all well established. Due to the unique constraints of operating in an underwater environment, many of these tried-and-true approaches need modification if they function at all. Peer discovery and lowlevel networking have been dealt with by previous …

    u-pacific Repository record for Simulating underwater sensor networks and routing algorithms in MATLAB (opens in a new tab)

  4. Mechanism design-based leader election scheme for intrusion detection in MANET

    … the leader election in the presence of selfish nodes for intrusion detection systems (IDS) in a mobile ad hoc network (MANET). To balance the resource consumption among all nodes and prolong the lifetime of a MANET, nodes with the most remaining resources should be elected as the leaders. …

    concordia Download PDF for Mechanism design-based leader election scheme for intrusion detection in MANET (opens in a new tab)

  5. Performance analysis of automated attack graph generation software

    … By defining our model to include sets of nodes, which allow connectivity from all nodes to all nodes in the set; the number of nodes present in each set, the number of connections between sets; and the number of vulnerabilities per node as our variables, we are able to observe the …

    nps Repository record for Performance analysis of automated attack graph generation software (opens in a new tab)

  6. Topology Discovery in Autonomic Networks

    … influence as much as possible and make the nodes dependent on themselves and the communications with their neighbors. Therefore, autonomic nodes will act as a network management entity that depends on the information they receive/send from/to their surroundings and their knowledge about …

    concordia Download PDF for Topology Discovery in Autonomic Networks (opens in a new tab)

  7. Overlay Network Design for Publish/Subscribe Systems

    … a topic-based publish/subscribe system, i.e., all nodes interested in the same topic are organized in a directly connected dissemination sub-overlay, referred to as TCO.There are two kinds of approaches that aim to construct TCOs while minimizing the node fan-out: (a) centralized algorithms and …

    toronto-retro Repository record for Overlay Network Design for Publish/Subscribe Systems (opens in a new tab)

  8. On wireless sensor networks

    … world and significant flexibility of installation and manipulation. The major challenges of WSNs design come from the requirements of energy constraint, distributed control and scalability. In this thesis we studied three topics on WSNs. The first one was energy-efficient medium access …

    uvic Repository record for On wireless sensor networks (opens in a new tab)

  9. A directional MAC protocol for MANET

    In a typical mobile ad hoc network (MANET), all nodes contend for a single channel access using carrier sense multiple access with collision avoidance (CSMA/CA). Thus, a fundamental limitation of MANET is that, as the number of nodes increases, the performance of the system will dramatically …

    concordia Download PDF for A directional MAC protocol for MANET (opens in a new tab)

  10. A Survey of Network Coding and Applications

    … networks with source, internal, and destination nodes put data packets in queues for forwarding.Network coding aims to improve network throughput and energy consumption by combining received data packets before forwarding. In this survey, we will explore various network coding schemes, along with …

    unlv Repository record for A Survey of Network Coding and Applications (opens in a new tab) Download PDF for A Survey of Network Coding and Applications (opens in a new tab)

  11. An Implementation of Consensus Through Bluetooth Communication

    … and computer science. The consensus requests all nodes of a network reach an agreement over a certain measurement. An algorithm of convergent consensus problem is implemented through a small network of Bluetooth communication in the thesis. The connections of the Bluetooth devices are …

    unt Repository record for An Implementation of Consensus Through Bluetooth Communication (opens in a new tab)

  12. Network Growth and Efficiency

    … growth algorithm for empty networks because it allows all nodes to connect to each other through a short path. This model is not consistently efficient across all network densities, meaning the extant network will affect marginal efficiency. Countries in the international system, therefore, can …

    creighton Repository record for Network Growth and Efficiency (opens in a new tab)

  13. Adaptivity For Meshfree Point Collocation Methods In Linear Elastic Solid Mechanics

    … the problem. If the change in gradient between 2 nodes exceed this limit, a node is added at the mid-point between the two nodes. This process applies to all nodes in the model. Once the refinement is complete, the model is processed again and this procedure is repeated until the program reaches a …

    south-carolina Repository record for Adaptivity For Meshfree Point Collocation Methods In Linear Elastic Solid Mechanics (opens in a new tab)

  14. Best effort decontamination of networks

    … to decontaminate the maximum possible number of nodes in a contaminated network with a fixed number of agents. We are given a team of mobile agents located on a node in a contaminated network and the number of agents is not enough to decontaminate the whole network to reach a state in which all …

    ottawa-retro Repository record for Best effort decontamination of networks (opens in a new tab)

  15. Using PageRank Algorithm in Analyzing Dictionary Graphs and PageRank in Dynamic Graphs

    … correlation between the degree and PageRank of all nodes for a graph obtained from Merriam-Webster dictionary, a French dictionary and WordNet hypernym and synonym dictionaries. Our conclusion was that PageRank can be a good tool to compare the quality of dictionaries. We studied some artificial …

    brock Repository record for Using PageRank Algorithm in Analyzing Dictionary Graphs and PageRank in Dynamic Graphs (opens in a new tab)

  16. Locating Facilities in Humanitarian Networks subject to Road Disruptions

    … algorithm, with capable of connecting as many nodes as possible by avoiding the unreliable road segments. In this manner, positioning of warehouse locations and roads vulnerability issues are brought together within the context of humanitarian logistics. The research delivers a method of …

    ttu Repository record for Locating Facilities in Humanitarian Networks subject to Road Disruptions (opens in a new tab)

  17. Analysis, Control, and Optimization of Networked Dynamical Systems under Uncertainty

    … including attaining global agreement among all nodes, maintaining a formation, reducing the overall network operating cost, etc. However, the propagation of uncertainty (e.g., noise) inside the network can deteriorate the system's ability to achieve its goals. In the first part of this …

    jhu Repository record for Analysis, Control, and Optimization of Networked Dynamical Systems under Uncertainty (opens in a new tab)

  18. Cross-layer resource allocation for video transmission over wireless multi-access networks

    … over wireless multi-access networks is a challenging problem, where the demand for the best possible video quality and the considerate management of the limited network resources needs to be addressed. In this thesis, we present a multi-node cross-layer management framework that operates …

    greece Repository record for Cross-layer resource allocation for video transmission over wireless multi-access networks (opens in a new tab)

  19. Optimization and Heuristic Facility Location Algorithms for the Smart Grid

    … constant observation. Therefore, it is economically feasible to place these PMUs at optimal locations, depending on the demand of each node. Our current research attempts to resolve the issue of positioning PMUs in a dynamic network at optimal locations which is accomplished by using two …

    ndsu Repository record for Optimization and Heuristic Facility Location Algorithms for the Smart Grid (opens in a new tab)

  20. Reduction of model dimension in nonlinear finite element approximations of electromechanical systems

    … variable. This preliminary reduction eliminates all nodes that are located outside of iron core regions (i.e. only regions in which eddy current exist are preserved). Finally, using the technique proposed, a full FE model (with the preliminary reduction applied) is transformed into a user …

    must-thes Repository record for Reduction of model dimension in nonlinear finite element approximations of electromechanical systems (opens in a new tab)

Page 1 of 13