Loading...
Search for: tree-construction
0.006 seconds

    Fast aggregation scheduling in wireless sensor networks

    , Article IEEE Transactions on Wireless Communications ; Volume 14, Issue 6 , 2015 , Pages 3402-3414 ; 15361276 (ISSN) Yousefi, H ; Malekimajd, M ; Ashouri, M ; Movaghar, A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2015
    Abstract
    Data aggregation is a key, yet time-consuming functionality introduced to conserve energy in wireless sensor networks (WSNs). In this paper, to minimize time latency, we focus on aggregation scheduling problem and propose an efficient distributed algorithm that generates a collision-free schedule with the least number of time slots. In contrast to others, our approach named FAST mainly contributes to both tree construction, where the former studies employ Connected 2-hop Dominating Sets, and aggregation scheduling that was previously addressed through the Competitor Sets computation. We prove that the latency of FAST under the protocol interference model is upper-bounded by 12R+Δ-2, where R... 

    Some properties of WK-recursive and swapped networks

    , Article 5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007, Niagara Falls, 29 August 2007 through 31 August 2007 ; Volume 4742 LNCS , 2007 , Pages 856-867 ; 03029743 (ISSN); 3540747419 (ISBN); 9783540747413 (ISBN) Imani, N ; Sarbazi Azad, H ; Zomaya, A. Y ; Sharif University of Technology
    Springer Verlag  2007
    Abstract
    The surface area which is defined as the number of vertices at a given distance from a base vertex of a graph is considered to be as one of the most useful yet abstract combinatorial properties of a graph. The applicability of surface area spans many problem spaces such as those in parallel and distributed computing. These problems normally involve combinatorial analysis of underlying graph structures (e.g., spanning tree construction, minimum broadcast algorithms, efficient VLSI layout, performance modeling). In this paper, we focus on the problem of finding the surface area of a class of popular graphs, namely the family of WK-recursive and swapped networks. These are attractive networks... 

    Relay logic for islanding detection in active distribution systems

    , Article IET Generation, Transmission and Distribution ; Volume 9, Issue 12 , August , 2015 , Pages 1254-1263 ; 17518687 (ISSN) Vatani, M ; Amraee, T ; Ranjbar, A. M ; Mozafari, B ; Sharif University of Technology
    Institution of Engineering and Technology  2015
    Abstract
    This study presents a passive model to detect islanding conditions of synchronous distributed generation resources in a distribution network or a microgrid. The proposed approach uses the classification and regression tree algorithm for distinguishing between islanding and non-islanding situations. It utilises the rate of change of frequency (ROCOF) and harmonic content of the equivalent reactance seen at the location of distributed generation as input features for decision tree construction. Indeed the thresholds of the proposed input features are extracted by the decision tree algorithm. The output if-then rules of the decision tree algorithm are then utilised to make a new relay logic for...