On message complexity of extrema propagation techniques

Authors:
Jacek Cichoń;Jakub Lemiesz;Marcin Zawada
Affiliations:
Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland;Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland;Institute of Mathematics and Computer Science, Wrocław University of Technology, Poland
Venue:
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Year:
2012

Citing 5
Cited 2

Applications of the theory of records in the study of random trees

Acta Informatica
The Bohnenblust---Spitzer algorithm and its applications

Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
Computing separable functions via gossip

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Fast Estimation of Aggregates in Unstructured Networks

ICAS '09 Proceedings of the 2009 Fifth International Conference on Autonomic and Autonomous Systems
On cardinality estimation protocols for wireless sensor networks

ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks

Extreme propagation in an ad-hoc radio network - revisited

ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
On Flooding in the Presence of Random Faults

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss the message complexity of some variants of the Extrema Propagation techniques in wireless networks. We show that the average message complexity, counted as the number of messages sent by each given node, is $\mathrm{O}\left(\log n\right)$, where n denotes the size of the network. We indicate the connection between our problem and the well known and deeply studied problem of the number of records in a random permutation. We generalize this problem onto an arbitrary simple and locally finite graphs, prove some basic theorems and find message complexity for some classical graphs such us lines, circles, grids and trees.