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 15 of 15 for “"Node clustering"”.

  1. An Approach to Defend Against Black hole Attacks in Ad Hoc Networks: Node Clustering AODV Protocol (CAODV)

    … attention. In the Black Hole attack, a malicious node uses the routing protocol to declare itself as having the shortest path to the node whose packets it wants to intercept. It is needed to understand this risk with a view to extract preventive and corrective protections against it. We introduce …

    uvic Repository record for An Approach to Defend Against Black hole Attacks in Ad Hoc Networks: Node Clustering AODV Protocol (CAODV) (opens in a new tab)

  2. Graph neural networks for network analysis

    … report, we propose two spatial GNN methods for node clustering in signed and directed networks, a spectral GNN method for signed directed networks on both node clustering and link prediction, and two GNN methods for specific applications in ranking as well as angular synchronization. The methods …

    oxford Repository record for Graph neural networks for network analysis (opens in a new tab)

  3. Radio Resource Management for Wireless Mesh Networks Supporting Heterogeneous Traffic

    … outlined as follows: Firstly, we propose a novel node clustering algorithm with effective subcarrier allocation for WMNs. The proposed node clustering algorithm is QoS-aware, and the subcarrier allocation is optimality-driven and can be performed in a decentralized manner. Simulation results show …

    waterloo Repository record for Radio Resource Management for Wireless Mesh Networks Supporting Heterogeneous Traffic (opens in a new tab)

  4. Achieving sink node anonymity under energy constraints in Wireless Sensor Networks

    … is aggregated at a central point known as a sink node. Two challenges in the deployment of WSNs are limited battery power of each sensor node and sink node privacy/anonymity. The role played by the sink node raises its profile as a high value target for attack, thus its anonymity is crucial to the …

    nps Repository record for Achieving sink node anonymity under energy constraints in Wireless Sensor Networks (opens in a new tab)

  5. Application of clustering algorithms for online ridesharing and infrastructure placement in transportation networks

    … be placed. This research proposes the use of clustering algorithms to abstract transportation networks as a solution to both problems. A ridesharing algorithm is proposed that uses a cluster adjacency index to quickly identify efficient ridesharing opportunities. The effectiveness of the …

    texas Repository record for Application of clustering algorithms for online ridesharing and infrastructure placement in transportation networks (opens in a new tab)

  6. Protocol design for dynamic Delaunay triangulation

    … failure, and maintenance protocols for a set of nodes in d-dimension (d > 1) to construct and maintain a distributed DT in a dynamic environment. The join, leave, and failure protocols in the suite are proved to be correct for a single join, leave, and failure, respectively. For a system under …

    texas Repository record for Protocol design for dynamic Delaunay triangulation (opens in a new tab)

  7. Επεξεργασία ερωτημάτων ομοιότητας και κυριαρχίας σε πολυδιάστατους χώρους

    … efficient and progressive algorithm for graph node clustering via transitive node similarity, (iv) new efficient and progressive algorithms for processing of subspace top-k dominating queries in multidimensional datasets, which can be applied also in distributed environments, (v) new efficient …

    greece Repository record for Επεξεργασία ερωτημάτων ομοιότητας και κυριαρχίας σε πολυδιάστατους χώρους (opens in a new tab)

  8. Channel Access Management for Massive Cellular IoT Applications

    … an energy efficient and resource preserving clustering and data aggregation solution. The proposed solution is tailored to the needs of future IoT applications. First, we recognize that for many anticipated cellular IoT applications, providing energy efficient and delay-aware access is …

    waterloo Repository record for Channel Access Management for Massive Cellular IoT Applications (opens in a new tab)

  9. Τεχνικές συγκέντρωσης σε ασύρματα δίκτυα επικοινωνιών

    … is given to the existing literature related to node clustering and data aggregation.Chapter 3 provides an introduction to game theory and its variants of interest. First, coalitional and coalition formation game theory basics are overviewed, to support the theoretical analysis of Chapter 4; …

    greece Repository record for Τεχνικές συγκέντρωσης σε ασύρματα δίκτυα επικοινωνιών (opens in a new tab)

  10. Node Cluster Stability in Vehicular Ad hoc Networks

    … scalable to support such large sized networks. Node clustering (i.e., organizing the network into smaller groups of nodes) is a potential approach to improve the scalability of networking protocols for VANETs. However, high relative vehicle mobility and frequent network topology changes inflict …

    waterloo Repository record for Node Cluster Stability in Vehicular Ad hoc Networks (opens in a new tab)

  11. COOPERATIVE COMMUNICATION WITH WIRELESS NETWORK CODING

    … as a cluster for data transmission, and such clustering could greatly improve the transmission quality due to cooperative diversity. For conventional cooperation protocols, each cooperating device uses orthogonal channels to relay different messages for mitigating co-channel interference and …

    maryland Repository record for COOPERATIVE COMMUNICATION WITH WIRELESS NETWORK CODING (opens in a new tab)

  12. Clustering, coverage and aggregation methods for large networks

    The work in this thesis presents methods for clustering and aggregation of large dynamic networked systems, typically consisting of numerous units/subsystems with complex interactions. Networked system models are used in many scientific and real world applications, for example to describe …

    uiuc Repository record for Clustering, coverage and aggregation methods for large networks (opens in a new tab)

  13. Exploring Graph Neural Networks for Clustering and Classification

    … many state-of-the-art techniques to solve node classification, link prediction, and graph classification tasks. GNNs can learn meaningful representations of graphs incorporating topological structure, node attributes, and neighborhood aggregation to solve supervised, semi-supervised, and …

    iupui Repository record for Exploring Graph Neural Networks for Clustering and Classification (opens in a new tab)

  14. Nalezení pozice stanic v Internetu pomocí umělých souřadnicových systémů

    Tato práce se zabývá problematikou určování zpoždění mezi dvěma síťovými uzly, např. dvěma stanicemi, dvěma servery či stanicí a serverem. Hlavním důvodem zavedení metod efektivního určování zpoždění je především eliminace zátěže sítě opakovanými přenosy dat či režií přímého měření zpoždění. Z …

    brno-tech Repository record for Nalezení pozice stanic v Internetu pomocí umělých souřadnicových systémů (opens in a new tab)

  15. Αρχιτεκτονικές και πρωτόκολλα οπτικών δικτύων με έμφαση στα δίκτυα WDM μεταγωγής ριπών

    … already available electronic buffers at the edge nodes of the optical network and the acceptance of a controlled increaser of delay. Using the concept of slotting, pipelined two-way reservations and a clever scheduling mechanism, this system eliminates loss (except from the loss due to buffer …

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