A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model

doi:10.1016/j.tcs.2014.11.034

Theoretical Computer Science

Volume 569, 2 March 2015, Pages 70-73

https://doi.org/10.1016/j.tcs.2014.11.034 Get rights and content

Under an Elsevier user license

open archive

Abstract

In this paper we prove that the Minimum Latency Aggregation Scheduling (MLAS) problem in the Signal-to-Interference-Noise-Ratio (SINR) model is APX-hard in the uniform power model.

Keywords

Wireless sensor network

Algorithm

Complexity

APX-hardness

Theoretical Computer Science

NoteA note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model

Abstract

Keywords

Note
A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model