Distributed Cardinality Estimation in Anonymous Networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed size estimation in anonymous networks

The knowledge of the size of a network, i.e. of the number of nodes composing it, is important for maintenance and organization purposes. In networks where the identity of the nodes or is not unique or cannot be disclosed for privacy reasons, the size-estimation problem is particularly challenging since the exchanged messages cannot be uniquely associated with a specific node. In this work, we ...

متن کامل

Distributed estimation of diameter, radius and eccentricities in anonymous networks ?

We consider how a set of collaborating agents can distributedly infer some of the properties of the communication network that they form. We specifically focus on estimating quantities that can characterize the performance of other distributed algorithms, namely the eccentricities of the nodes, and the radius and diameter of the network. We propose a strategy that can be implemented in any netw...

متن کامل

Distributed Set Expression Cardinality Estimation

We consider the problem of estimating set-expression cardinality in a distributed streaming environment where rapid update streams originating at remote sites are continually transmitted to a central processing system. At the core of our algorithmic solutions for answering set-expression cardinality queries are two novel techniques for lowering data communication costs without sacrificing answe...

متن کامل

Improved Distributed Exploration of Anonymous Networks

The problem of constructing a labeled map of an anonymous and asynchronous network is addressed. We present an algorithm that explores and maps the network by using k identical agents that have no prior knowledge of the network topology. An algorithm of Das, Flocchini, Nayak and Santoro for mapping of the network requires that n and k are co-prime. Our improved algorithm, presented here, requir...

متن کامل

Distributed Incremental Least Mean-Square for Parameter Estimation using Heterogeneous Adaptive Networks in Unreliable Measurements

Adaptive networks include a set of nodes with adaptation and learning abilities for modeling various types of self-organized and complex activities encountered in the real world. This paper presents the effect of heterogeneously distributed incremental LMS algorithm with ideal links on the quality of unknown parameter estimation. In heterogeneous adaptive networks, a fraction of the nodes, defi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 2014

ISSN: 0018-9286,1558-2523

DOI: 10.1109/tac.2013.2287113