Energy-optimal algorithms for computing aggregative functions in random networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2016

Energy-optimal algorithms for computing aggregative functions in random networks

Abstract

We investigate a family of algorithms minimizing energetic effort in random networks computing aggregative functions. In contrast to previously considered models, our results minimize maximal energetic effort over all stations instead of the average usage of energy. Such approach seems to be much more suitable for some kinds of networks, in particular ad hoc radio networks, wherein we need all stations functioning and replacing batteries after the deployment is not feasible. We analyze also the latency of proposed energy-optimal algorithms. We model a network by placing randomly and independently $n$ points in a $d$-dimensional cube of side-length $n^{1/d}$. We place an edge between vertices that interact with each other. We analyze properties of the resulting graphs in order to obtain estimates on energetic effort and latency of proposed algorithms.
Fichier principal
Vignette du fichier
2716-9973-1-PB.pdf (546.35 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission
Loading...

Dates and versions

hal-01352854 , version 1 (16-08-2016)

Identifiers

Cite

Marek Klonowski, Małgorzata Sulkowska. Energy-optimal algorithms for computing aggregative functions in random networks. Discrete Mathematics and Theoretical Computer Science, 2016, Vol. 17 no. 3 (3), pp.285-306. ⟨10.46298/dmtcs.2160⟩. ⟨hal-01352854⟩

Collections

TDS-MACS
42 View
616 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More