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 17 of 17 for “"Node Selection"”.
-
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 …
-
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, …
-
The effect of topology control for wireless multi-hop networks
… using low cost, resource-constrained network nodes. Topology control algorithms have not yet catered for low cost, resource-constrained network nodes resulting in a need for algorithms that do cater for these types of wireless multi-hop network nodes. An algorithm entitled "Token-based …
-
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 …
-
Nonparametric modeling of dependencies for spatial interpolation
… technique. A nev,· technique for variogram model selection using the derivative of the empirical variogram and non-negative least squares is discussed. The eigenstructure of the spatial design matrix, the key matrix in Matheron's variogram estimator is determined. Then a nonparametric estimator of …
-
Robust randomized trajectory planning for satellite attitude tracking control
… the configuration- x-time space using a node selection metric based on the maneuvering capability of the vehicle. The guidance strategy and the new randomized trajectory planning algorithm are applied to a challenging satellite attitude guidance problem in simulation.
-
Improving Approximate and Exact Approaches Based on Decision Diagrams and Dynamic Programming for Combinatorial Optimization
… the ordering of decision variables and the selection of nodes during compilation. Dynamic Programming provides a general framework for solving a wide range of CO problems by breaking them down into overlapping subproblems. In certain cases, the DP formulations allow for design of Fully …
-
Exact And Representative Algorithms For Multi Objective Optimization
… optimization context such as fathoming, node selection, heuristics, as well as some multi objective optimization specific concepts like filtering, non-domination probability, running in parallel. Potential of this approach for being used both as a full Pareto generation or an …
-
CAGE - Consensus Algorithm Genetically Encouraged
… is the consensus algorithms used to i) select a node in the network responsible for providing a block added to the blockchain; and, ii) verify that block and ensure trust between the nodes within the system. This research proposes a newly developed consensus algorithm for Blockchain Technology. …
-
Cooperation in Wireless Networks
… and reliability. However, equipping a wireless node with multiple antennas may not be practical, as the footprint of multiple antennas may not fit on a wireless node (particularly on handheld wireless devices). In order to achieve spatial diversity without requiring multiple antennas on the same …
-
SOLVING PROCESS PLANNING AND SCHEDULING PROBLEMS USING THE CONCEPT OF MAXIMUM WEIGHTED INDEPENDENT SET
… an undirected weighted conflicting graph, where nodes represent operations and their resources; edges represent constraints, and weight factors are guidelines for the node selection at each time slot. Then, the Maximum Weighted Independent Set (MWIS) problem, which considers a graph with weights …
-
BEYOND LOCAL NEIGHBORHOODS: LEVERAGING INFORMATIVE NODES FOR IMPROVED GRAPH NEURAL NETWORKS PERFORMANCE
… as graphs, where entities are depicted as nodes and their relationships as edges. To analyze the properties of individual entities (node classification) or the community as a whole (graph classification), graph neural networks (GNNs) serve as a powerful tool. Most GNNs utilize a …
-
Wireless Information and Power Transfer in Communication Networks: Performance Analysis and Optimal Resource Allocation
… for low-power consuming devices and sensor nodes. This approach relinquishes the requirements of wired connections and regular battery replacements. This thesis analyzes the performance of energy harvesting communication networks under various operation protocols and multiple access schemes. …
-
Techniques For Alleviating the Inconveniences Caused by Mobility In Wireless Environments
… challenges to wireless network designers. Node mobility causes frequent changes in topology, which means the topology of network changes dynamically. In order to support the mobility for the mobile clients, it is necessary to incorporate special designs in the wireless network protocols …
-
On Interference Management for Wireless Networks
… allocation is achieved through neighboring node coordination and local information exchange. Based on a well-established degree-of-freedom (DoF) MIMO model, we develop a distributed DoF scheduling algorithm with the objective of maximizing network-level throughput while guaranteeing solution …
-
Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem
… It relies on the information available at a node of the underlying branch-and-bound tree. We have shown that this procedure obtains an initial feasible solution, if it exists at that node. We designate this method as BNPDSTKP-SGAP. We have also developed a BNC method to solve the SGAP using …
-
Discrete Two-Stage Stochastic Mixed-Integer Programs with Applications to Airline Fleet Assignment and Workforce Planning Problems
… We prove that, when using the least-lower-bound node-selection rule, this algorithm converges to a global optimal solution. We also show that the derived RLT cuts are not only reusable in subsequent Benders iterations at the same node, but are also inheritable by the subproblems of the children …