Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Tuesday, August 16, 2016 - 3:22:08 PM
Last modification on : Thursday, September 7, 2017 - 1:03:49 AM
Long-term archiving on: : Thursday, November 17, 2016 - 10:25:05 AM


Explicit agreement for this submission




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



Record views


Files downloads