TIGHT ANALYSIS OF SHORTEST PATH CONVERGECAST IN WIRELESS SENSOR NETWORKS
From MaRDI portal
Publication:2841984
DOI10.1142/S0129054113400030zbMath1268.68037OpenAlexW2175205326MaRDI QIDQ2841984
Philip Loden, Qi Han, Sachin Lodha, Sasanka Roy, John E. Augustine
Publication date: 30 July 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054113400030
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Cites Work
This page was built for publication: TIGHT ANALYSIS OF SHORTEST PATH CONVERGECAST IN WIRELESS SENSOR NETWORKS