.png){kind=icon}
返回
Scheduling for data gathering networks with data compression
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2015.05.026.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper analyzes scheduling in a data gathering network with data compression. The nodes of the network collect some data and pass them to a single base station. Each node can, at some cost, preprocess the data before sending it, in order to decrease its size. Our goal is to transfer all data to the base station in given time, at the minimum possible cost. We prove that the decision version of this scheduling problem is NP complete. Polynomial-time heuristic algorithms for solving the problem are proposed and tested in a series of computational experiments. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.
Keyword:
Scheduling
Data gathering networks
Data compression
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Diagnosing visceral leishmaniasis with the recombinant K39 strip test: experience from the Sudan
PREAI
分享收藏Influence of INGER and TORDIS Energetic Willow Clones Planted on Contaminated Soil on the Survival Rates, Yields and Calorific Value.png)
Forests
OAAI
ForestsIF0
OAAI分享收藏The solvation and ion condensation properties for sulfonated polyelectrolytes in different solvents—a computational study磺化聚电解质在不同溶剂中的溶剂化和离子缩合性能-计算研究
OAAI
OAAI分享收藏
查看更多内容