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 49 for “"Node Selection"”.

  1. Node Selection in Cooperative Wireless Networks

    In this thesis, we argue for node selection in cooperative decode-and-forward networks. In a single-hop network with multiple relays, we show that selecting a single node to aid in the transmission between a source and a destination outperforms both traditional orthogonal transmissions and …

    toronto-retro Repository record for Node Selection in Cooperative Wireless Networks (opens in a new tab)

  2. Reputation-based Miner Node Selection in Blockchain-based Vehicular Networks

    … where the malicious actor/s control most miner nodes' mining power. To prevent the malicious actor/s from controlling the blockchain, we need a mechanism to identify and remove the malicious node from the consensus process. Such attacks can be countered if we can select the nodes allowed to take …

    unr Repository record for Reputation-based Miner Node Selection in Blockchain-based Vehicular Networks (opens in a new tab)

  3. Node Selection, Synchronization and Power Allocation in Cooperative Wireless Networks

    … as a new communication paradigm in which network nodes share their antennas and transmission resources for distributed data exchange and processing. Recent studies have shown that cooperative communications can achieve significant performance gains in terms of signal reliability, coverage area, …

    vt Repository record for Node Selection, Synchronization and Power Allocation in Cooperative Wireless Networks (opens in a new tab)

  4. \A Ro- bust Node Selection Strategy for Lifetime Extension in Wireless Sensor Networks

    … (WSNs) consist of energy-constrained sensor nodes that may be deployed in large numbers in order to monitor a given area, track military targets, detect civilian targets or for other purposes. In such densely deployed environments, multiple transmissions can lead to collisions resulting in …

    ut-knoxville Repository record for \A Ro- bust Node Selection Strategy for Lifetime Extension in Wireless Sensor Networks (opens in a new tab)

  5. Combining Node and Variable Selection Heuristics for Faster MIP Solutions

    The Node selection (NS) and variable and direction selection (VDS) heuristics significantly affect the time to find the MIP integer-optimal solution when using branch and bound method. In this thesis, various variable and direction selection methods are tested coupled with the node selection …

    carleton Repository record for Combining Node and Variable Selection Heuristics for Faster MIP Solutions (opens in a new tab)

  6. Engineering AI-enhanced edge computing with predictive intelligence

    … The constrained processing capabilities of edge nodes and the fluctuating nature of service requests pose considerable challenges in the management and orchestration of distributed services. This thesis investigates intelligent strategies for optimising decision-making in edge computing (EC) …

    glasgow Repository record for Engineering AI-enhanced edge computing with predictive intelligence (opens in a new tab) Download PDF for Engineering AI-enhanced edge computing with predictive intelligence (opens in a new tab)

  7. Resource Allocation in Virtualized Sensor Networks for Highly-Deployed IoT Services

    … in sensing and routing resources. IoT sensor nodes face challenges such as limited resources, high heterogeneity, interoperability issues, intermittent communication, and installation time and cost. Current IoT resource management techniques do not fully meet the requirements of current and …

    carleton Repository record for Resource Allocation in Virtualized Sensor Networks for Highly-Deployed IoT Services (opens in a new tab)

  8. Ant-Colony Optimization Based In-Network Data Aggregation in Wireless Sensor Networks

    … the heuristic function and the aggregation node selection method to maximize energy efficiency and extend network lifetime.

    texas-state Repository record for Ant-Colony Optimization Based In-Network Data Aggregation in Wireless Sensor Networks (opens in a new tab)

  9. Semantic summaries using machine learning

    … single(or just a few) centrality measure(s) for node selection, learning using machine learning techniqueshow to optimally combine multiple centrality measures for node selection. Combining multiplecentrality measures provides a complementary view of the node’s importance, significantly …

    greece Repository record for Semantic summaries using machine learning (opens in a new tab)

  10. An implementation of an iterative global flow analysis algorithm

    … upon the flow graph of a program, where the nodes correspond to basic blocks and the edges represent possible program control flows. In order to test the effectiveness of this algorithm, a general purpose optimizing module was written in XPL which analyzes ALGOL-E programs for constant …

    nps Repository record for An implementation of an iterative global flow analysis algorithm (opens in a new tab)

  11. Generating Diverse Sets of Near-Optimal Solutions to Mixed-Integer Optimization Problems

    … approach for incorporating diversity into node selection within a branch-and-bound framework. Experimental results indicate that our method surpasses conventional node selection rules, such as best-first search, achieving diversity improvements ranging from 12\% to 190\%. This portion of …

    utk-theses Repository record for Generating Diverse Sets of Near-Optimal Solutions to Mixed-Integer Optimization Problems (opens in a new tab)

  12. Data Clustering and Graph-Based Image Matching Methods

    … based on Delaunay graph characterization and node selection. A normalized Euclidean distance on Delaunay graphs is found useful to estimate pairwise distances.

    whiterose Download PDF for Data Clustering and Graph-Based Image Matching Methods (opens in a new tab)

  13. Peer-to-peer wireless ultrawide-band localization of fast-moving entities

    … techniques such that a group of mobile nodes can continuously track its topology, without relying on external infrastructure. Ultrawide-band (UWB) radios worn by each node (humans in our case) perform time-of-flight (TOF) measurements between different node pairs, ultimately determining …

    uiuc Repository record for Peer-to-peer wireless ultrawide-band localization of fast-moving entities (opens in a new tab)

  14. A Multiple-frequency Transmission Scheduling Scheme for Mesh Networks that Employ Spectrum Sharing

    … To combat these issues, we introduce bridge nodes into the network - dedicated traffic-forwarding nodes that help ease the connectivity issues and bottlenecking caused by legacy node protection protocols. In this thesis, we present the augmented connected dominating set (ACDS) algorithm for …

    clemson Repository record for A Multiple-frequency Transmission Scheduling Scheme for Mesh Networks that Employ Spectrum Sharing (opens in a new tab)

  15. LE-Stream : a latency and energy-aware framework for data stream processing in the Internet of Things

    … without compromising data accuracy. An active node selection schema improves the workload distribution among devices, also tackling the energy dimension by promoting a graceful degradation of devices resources.

    brazil-uerj Repository record for LE-Stream : a latency and energy-aware framework for data stream processing in the Internet of Things (opens in a new tab)

  16. Μεγιστοποίηση επιρροής σε δυναμικά κοινωνικά δίκτυα και γράφους, πλήρως και μερικώς παρατηρούμενα

    … techniques to improve the performance of seed node selection algorithms. This research introduces novel methodologies that combine knowledge from both static and dynamic networks, leveraging community-based information to enhance influence propagation. Additionally, approaches that rely on …

    greece Repository record for Μεγιστοποίηση επιρροής σε δυναμικά κοινωνικά δίκτυα και γράφους, πλήρως και μερικώς παρατηρούμενα (opens in a new tab)

  17. Practicality of Sub-Linear Algorithms for Distributed Shortest Paths

    … communication occurs in rounds in which each node can send O(log n) information to each of its neighbors, where n is the size of the network. We focus on Elkin’s algorithm, notable for being the first algorithm to achieve sub-linear round complexity for the problem. This work makes several …

    concordia Download PDF for Practicality of Sub-Linear Algorithms for Distributed Shortest Paths (opens in a new tab)

  18. Space-time spectral methods and adaptive regularization for ill-posed and mixed-type partial differential equations

    … study is the systematic investigation of optimal node selection in space-time collocation methods. The V-shaped error behavior reveals a delicate trade-off between resolution and conditioning, leading to the existence of an optimal number of nodes that minimizes total error. The spectral methods …

    manitoba Repository record for Space-time spectral methods and adaptive regularization for ill-posed and mixed-type partial differential equations (opens in a new tab)

  19. Consistent Bayesian learning for neural network models : theory and computation

    … they have primarily focused on the edge selection.In Chapter 3, we propose a sparse Bayesian technique using spike-and-slab Gaussian prior to allow for automatic node selection. The spike-and-slab prior alleviates the need of an ad-hoc thresholding rule for pruning. In addition, we adopt …

    msu Repository record for Consistent Bayesian learning for neural network models : theory and computation (opens in a new tab)

Page 1 of 3