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 6 of 6 for “"Probabilistic flooding"”.

  1. On the performance of probabilistic flooding in wireless mobile ad hoc networks

    … in MANET’s has traditionally been based on flooding, but this can induce broadcast storms that severely degrade network performance due to redundant retransmission, collision and contention. Probabilistic flooding, where a node rebroadcasts a newly arrived one-to-all packet with some …

    glasgow Download PDF for On the performance of probabilistic flooding in wireless mobile ad hoc networks (opens in a new tab)

  2. Enhanced Probabilistic Broadcasting Scheme for Routing in MANETs. An investigation in the design analysis and performance evaluation of an enhanced probabilistic broadcasting scheme for on-demand routing protocols in mobile ad-hoc networks.

    … Broadcasting has traditionally been based on the flooding protocol, which simply overflows the network with a high number of rebroadcast messages until these reach all the network nodes. A good probabilistic broadcast protocol can achieve high saved rebroadcast (SRB), low collision and a lower …

    bradford Repository record for Enhanced Probabilistic Broadcasting Scheme for Routing in MANETs. An investigation in the design analysis and performance evaluation of an enhanced probabilistic broadcasting scheme for on-demand routing protocols in mobile ad-hoc networks. (opens in a new tab)

  3. Σχεδιασμός και μελέτη αλγορίθμων για διάδοση πληροφορίας σε μη δομημένα δικτυακά περιβάλλοντα

    … One of the techniques studied here is the probabilistic flooding approach, especially its application on a random graph topology. Especially, by using two different, carefully selected random graphs it is possible to find the asymmetric bounds for the forwarding probability (pf) for an …

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

  4. Performance Evaluation of Connectivity and Capacity of Dynamic Spectrum Access Networks

    … maximization. We also show how traditional flooding techniques are not applicable under the SINR model and analyze the underlying causes for that. Moreover, we propose a modified version of probabilistic flooding that uses lower message overhead while accounting for the node outreach and in- …

    ucf Repository record for Performance Evaluation of Connectivity and Capacity of Dynamic Spectrum Access Networks (opens in a new tab)

  5. Analysis of probabilistic information dissemination in wireless networks employing algebraic graph theory elements

    … of this process. Approaches like traditional flooding, are not suitable in modern networks due to the large number of transmitted information messages that waste valuable resources. In order to increase network’s lifetime, it is necessary to disseminate information in a way that minimizes …

    greece Repository record for Analysis of probabilistic information dissemination in wireless networks employing algebraic graph theory elements (opens in a new tab)

  6. Ανάλυση, μοντελοποίηση και προσομοίωση αναζήτησης σε σύνθετα δυναμικά δίκτυα

    … random rules, and on search mechanisms based on flooding. We start by studying and analyzing the behavior of flooding with respect to unnecessarily produced traffic (duplicate messages) and provide simple bounds and approximate models to assess the associated overheads and network coverage. Our …

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