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 67 for “"all-nodes"”.
-
Age of information for broadcast and collection in spatially distributed wireless networks
… collecting timesensitive data to and from spatially distributed nodes in the presence of wireless interference. The Age of Information (AoI) is the time that has elapsed since the mostrecently delivered packet was generated, and captures the freshness of information. In the context of broadcast …
-
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 …
-
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 …
-
Efficient flooding for wireless mesh networks
… some data from one node to rest of the nodes in the network. This dissertation proposes UFlood, a flooding protocol for wireless mesh networks that targets large file transfers, such as software updates, where achieving high throughput (minimizing the time to complete the flood to all …
-
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 …
-
A cooperative communication protocol for wireless ad-hoc networks
… protocol that utilizes local cooperation among nodes to efficiently transfer data. Multi-hop routing in ad-hoc wireless networks realizes some scalability benefits over direct transmission by utilizing cooperation in the network layer, where all nodes act as routers to relay messages. …
-
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 …
-
Partial Delaunay triangulations based routing, address configuration and date-centric storage in ad hock network
… 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 extracting a planar sub …
-
Enabling dense spatial reuse in millimeter-wave networks
… reuse, however, requires aligning the beams of all nodes in a network. Aligning the beams is a difficult process which is complicated by indoor multipath, which can create interference, as well as by the inefficiency of carrier sense at detecting interference in directional links. This thesis …
-
Tight estimation of bichromatic farthest pair in graphs and related problems
… shortest paths distance and the radius is the smallest distance for which a "center" node can reach all other nodes. The natural and important ST-variant considers two subsets S and T of the vertex set and lets the ST-diameter be the maximum distance between a node in S and a node in T, and the …
-
Differential power processing for series-stacked processors
… computers with maintained voltage regulation at all nodes. A peak stack power delivery of 99.8% is demonstrated, and DPP switching frequencies from 250 kHz to 2 MHz. Finally, the reliability of a series-stacked system is compared to an electrically parallel system.
-
Computing network coordinates in the presence of Byzantine faults
Network coordinate systems allow for efficient construction of large-scale distributed systems on the Internet. Coordinates provide locality information in a compact way, without requiring each node to contact every potential neighbor; distances between two nodes' coordinates represent estimates of …
-
Robust network computation
… many known results. We give a new, universally optimal, edge-biconnectivity algorithm for the classical model. We also give a near-optimal sub-linear algorithm for identifying bridges, when all nodes are activated simultaneously. After discussing some ways in which the classical model is …
-
Load balancing the GRID ad-hoc routing protocol
… in networks with a uniform distribution of nodes. It achieves scalability by building a distributed location database in which memory requirements are apportioned fairly to all nodes in the network. In networks of spatially non-uniform node distribution, however, a small fraction of the …
-
Probabilistic graphical models : distributed inference and learning models with small feedback vertex sets
… variables are jointly Gaussian, the models are called Gaussian graphical models (GGMs) or Gauss Markov random fields. In this thesis, we address several important problems in the study of GGMs. The first problem is to perform inference or sampling when the graph structure and model parameters are …
-
Development of a Constellation Simulator for a 5G/IoT Mission Planning System
… technologies has presented new challenges for telecommunications providers. One of the challenges is integrating these technologies with present networks. A solution has been found in low-Earth orbit satellite constellations. On one hand, this method increases coverage and reduces …
-
Distributed optimization on a wireless sensor network testbed
… at each node. Therefore the objective is for all nodes to achieve consensus on the global optimum given only local information and communication with neighbors. Algorithms from the literature that address this problem in different set- tings are introduced, focusing on an incremental …
-
Consensus and collision detectors in wireless ad hoc networks
… in wireless ad hoc networks with crashprone nodes. Specifically, we develop lower bounds and matching upper bounds for this problem in single-hop wireless networks, where all nodes are located within broadcast range of each other. In a novel break from existing work, we introduce a highly …
-
Multipartite Quantum Clock Synchronization Via Collective Symmetric States
… (QCS) tasks using a class of quantum states, called collective symmetric (CS) states, which generalize Dicke and N00N states. Employment of CS states in previous QCS procedures is shown to improve synchronization performance in various network scenarios. The focus of the paper is on QCS …
-
Moving-baseline localization for mobile wireless sensor networks
… (MBL) problem arises when a group of nodes moves through an environment in which no external coordinate reference is available. When group members cannot see or hear one another directly, each node must employ local sensing and inter-device communication to infer the spatial …
Page 1 of 4