In Wireless Sensor Network (WSN), data collection is an important task. How to efficiently collect sensing data from all sensor nodes is important to the performance of WSN. Sensor nodes will send the sensed data to sink for further processing. Sink node will be at root level and the Sensor nodes will act as intermediate and leaf nodes (forms a Tree). The study of data collection had done with ...

Best-first search (BFS) expands the fewest nodes among all admissible algorithms using the same cost function, but typically requires exponential space. Depth-first search needs space only linear in the maximumsearch depth, but expands more nodes than BFS. Using a random tree, we analytically show that the expected number of nodes expanded by depth-first branch-and-bound (DFBnB) is no more than...

Frederickson outlined a distributed breadth-first search (BFS) algorithm which constructs a BFS tree in levels. The description of the algorithm is short and first-in-first-out (FIFO) channels are assumed. In this paper, we present a detailed description of a modified verison of the algorithm and we show that the algorithm functions in a non-FIFO environment. To allow a programmer to implement ...

We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first able to produce any BFS-tree, and not only one specific to the model given as input, within this complexity. Moreover, it produces all the shortest paths from the root of the BFS-tree to the other vertices of the graph.

Search is a central problem in artificial intelligence, and BFS and DFS the two most fundamental ways to search. In this report we derive results for average BFS and DFS runtime: For tree search, we employ a probabilistic model of goal distribution; for graph search, the analysis depends on an additional statistic of path redundancy and average branching factor. As an application, we use the re...

We propose and experimentally demonstrate a novel scheme of bi-directional Brillouin time domain analyzer (BD-BOTDA) to extend the sensing range. By deploying two pump-probe pairs at two different wavelengths, the Brillouin frequency shift (BFS) distribution over each half of the whole fiber can be obtained with the simultaneous detection of Brillouin signals in both channels. Compared to the c...

A benchmark turbulent Backward Facing Step (BFS) airflow was studied in detail through a program of tightly coupled experimental and CFD analysis. The theoretical and experimental approaches were developed simultaneously in a “building block” approach and the results used to verify each “block”. Information from both CFD and experiment was used to develop confidence in the accuracy of each tech...

: Transcriptional regulation networks are often modeled as Boolean networks. We discuss certain properties of Boolean functions (BFs), which are considered as important in such networks, namely, membership to the classes of unate or canalizing functions. Of further interest is the average sensitivity (AS) of functions. In this article, we discuss several algorithms to test the properties of int...

Leading algorithms for Boolean satisfiability (SAT) are based on either a depth-first tree traversal of the search space (the DLL procedure [6]) or resolution (the DP procedure [7]). In this work we introduce a variant of BreadthFirst Search (BFS) based on the ability of Zero-Suppressed Binary Decision Diagrams (ZDDs) to compactly represent sparse or structured collections of subsets. While a B...