#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2012

2017

- This year (1)
- Last 5 years (8)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Marcin Kardas, Marek Klonowski, Dominik Pajak
- 2013 42nd International Conference on Parallel…
- 2013

In this paper we investigate leader election protocols for single-hop radio networks from the perspective of energetic complexity. We discuss different models of energy consumption and their impact on time complexity. We also present some results about energy consumption in classic protocols optimal with respect to time complexity - we show that some very… (More)

- Philipp Brandes, Marcin Kardas, Marek Klonowski, Dominik Pajak, Roger Wattenhofer
- SIROCCO
- 2016

In a single-hop radio network, nodes can communicate with each other by broadcasting to a shared wireless channel. In each time slot, all nodes receive feedback from the channel depending on the number of transmitters. In the Beeping Model, each node learns whether zero or at least one node have transmitted. In such a model, a procedure estimating the size… (More)

- Marcin Kardas, Marek Klonowski, Piotr Syga, Szymon Wilczek
- 2012 IEEE 18th International Conference on…
- 2012

In this paper we consider the problem of listing all active stations in a single hop radio network in such a way that the outer adversary observing communication could not gain any significant information about the real number of stations. We also consider a counterpart of this problem such that only a good approximation of the number of activated stations… (More)

- Jacek Cichon, Zbigniew Golebiewski, Marcin Kardas, Marek Klonowski
- ANALCO
- 2013

- Marcin Kardas, Marek Klonowski, Kamil Wolny, Dominik Pajak
- 2013 IEEE International Symposium on Parallel…
- 2013

In this paper we discuss energetic complexity aspects of k-Selection protocols for the single-hop radio network (that is equivalent to Multiple Access Channel model). The aim is to grant each of k activated stations exclusive access to the communication channel. We consider both deterministic as well as randomized model. Our main goal is to investigate… (More)

In this paper we consider a model of spreading information in heterogeneous systems wherein we have two kinds of objects. Some of them are active and others are passive. Active objects can, if they possess information, share it with an encountered passive object. We focus on a particular case such that active objects communicate independently with randomly… (More)

- Marcin Kardas, Miroslaw Kutylowski, Jakub Lemiesz
- ANALCO
- 2015

Motivation Algorithm Analysis Distributed Counting Wireless network of simple devices (e.g. sensors, mobiles), the number of devices is unknown and can change dynamically Some knowledge of the network size is crucial for establishing a productive communication (e.g. to set back-o times) Most of the size estimation algorithms are distributed versions of… (More)

- Zbigniew Golebiewski, Marcin Kardas, Jakub Lemiesz, Krzysztof Majcher
- 2017 IEEE International Symposium on Information…
- 2017

Recently, the need for efficient representations of data conveyed by graphical structures has emerged in many different contexts. While compressing such data one must consider two types of information. The first type is the information carried by the labels embedded in the structure. The second type is the information conveyed by the structure itself. In… (More)

- ‹
- 1
- ›