Information dissemination in unknown radio networks with large labels

نویسندگان

چکیده

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

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

منابع مشابه

Information dissemination in unknown radio networks with large labels

We consider the problems of deterministic broadcasting and gossiping in completely unknown ad-hoc radio networks. We assume that nothing is known to the nodes about the topology or even the size of the network, n, except that n > 1. Protocols for vanilla model, when n is known, may be run for increasingly larger estimates 2 on the size of the network, but one cannot determine when such a protoc...

متن کامل

Information dissemination in large-scale wireless networks with unreliable links

We study connectivity and information dissemination in largescale wireless networks with unreliable links from a percolationbased perspective. We first examine static models, where each link of the network is functional with some probability, independently of all other links. We then examine dynamic models, where each link is active or inactive according to a Markov on-off process. We show that...

متن کامل

A : Algorithms in Complex Domains Information Dissemination in Large Networks

Session A: Algorithms in Complex Domains Information Dissemination in Large Networks Dominik Kaaser Information dissemination is a fundamental problem in parallel and distributed computing. In its simplest variant, known as the broadcasting problem, a message has to be spread among all nodes of a graph. In recent years, several efficient algorithms have been developed to solve the broadcasting ...

متن کامل

Brief Announcement: Faster Gossiping in Bidirectional Radio Networks with Large Labels

We consider unknown ad-hoc radio networks, when the underlying network is bidirectional and nodes can have polynomially large labels. For this model, we present a deterministic protocol for gossiping which takes O(n lg n lg lgn) rounds. This improves upon the previous best result for deterministic gossiping for this model by [Gasienec, Potapov, Pagourtizis, Deterministic Gossiping in Radio Netw...

متن کامل

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


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

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2014

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2013.08.009