We show an alternative way of represent­ ing a Bayesian belief network by sensitivities and probability distributions. This represen­ tation is equivalent to the traditional rep­ resentation by conditional probabilities, but makes dependencies between nodes apparent and intuitively easy to understand. We also propose a QR matrix representation for the sensitivities and/ or conditional probabili...

Wireless communication channels in mobile ad hoc network (MANETs) suffer from high packet-loss due to presence of noise. This paper presents a detail description of a simulation model that can be used to evaluate the performance of probabilistic broadcast for flooding in noisy environment. In this model, the noise-level is represented by a generic name, probability of reception (pc) (0≤ pc ≤1),...

Interest dissemination in constrained environments such as wireless sensor networks utilizes Bloom filters commonly. A Bloom filter is a probabilistic data structure of fixed length, which can be used to encode the set of sensor nodes to be awake. In this way an application can disseminate interest in specific sensor nodes by broadcasting the Bloom filter throughout the complete wireless sensor...

Wireless communication channels in mobile ad hoc network (MANETs) suffer from high packet-loss due to presence of noise. This paper presents a detail description of a simulation model that can be used to evaluate the performance of probabilistic broadcast for flooding in noisy environment. In this model, the noise-level is represented by a generic name, probability of reception (pc) (0≤ pc ≤1),...

Abstract We develop a protocol for entanglement generation in the quantum internet that allows repeater node to use n -qubit Greenberger-Horne-Zeilinger (GHZ) projective measurements can fuse successfully entangled links , i.e., two-qubit Bell pairs shared across network edges, incident at node. Implementing -fusion, ≥ 3, is principle not much harder than 2-fusions (Bell-basis measurements) sol...

In this paper, we present formal analysis of 2CS-WSN collision resolution protocol for wireless sensor networks using probabilistic model checking. The 2CS-WSN protocol is designed to be used during the contention phase of IEEE 802.15.4. In previous work on 2CS-WSN analysis, authors formalized protocol description at abstract level by defining counters to represent number of nodes in specific l...

In this paper, we propose some improvements to the flooding protocols that aim to efficiently broadcast a given information through the whole ad-hoc network. These improvements are based on probabilistic approach and decrease the number of emitted packets and hence, the medium occupation. Indeed, it is more interesting to privilege the retransmission by nodes that are located at the radio borde...

We use probabilistic and combinatorial tools on strings to discover the average number of 2-protected nodes in tries and in suffix trees. Our analysis covers both the uniform and non-uniform cases. For instance, in a uniform trie with n leaves, the number of 2-protected nodes is approximately 0.803n, plus small first-order fluctuations. The 2-protected nodes are an emerging way to distinguish t...

Wireless sensor network (WSN) is a collection of smart sensor nodes cooperated together for achieving the desire of the assigned application. However, these nodes suffer from different limitations, including limited energy sources and limited processing capabilities. Clustering and data aggregation are considered main solutions for prolonging the network lifetime. Clustering is either based on ...

Probabilistic XML tree is a typical probabilistic XML data model for representing uncertainty in the form of probability which can be described the nested probabilistic XML element unit. The path set in probabilistic XML unit tree can be analyzed through parsing it and drawing out the corresponding probabilistic XML unit schema tree. The node probability and the node probability threshold compu...