Energy-optimal algorithms for computing aggregative functions in random networks

MaRDI QIDQ2816512zbMATH OpenFDO

Authors Marek Klonowski, Małgorzata Sulkowska

Publication date 23 August 2016

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2716/0.html

zbMATH Keywords

\(k\)-NNGenergy efficiencyrandom network

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Energy efficient randomised communication in unknown AdHoc networks
• Fast distributed algorithm for convergecast in ad hoc geometric radio networks
• scientific article; zbMATH DE number 2089983
• Efficient algorithms for leader election in radio networks
• Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks

Cited in

(2)

• scientific article; zbMATH DE number 7403972 (Why is no real title available?)
• Time and Energy Complexity of Function Computation Over Networks

This page was built for publication: Energy-optimal algorithms for computing aggregative functions in random networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2816512)