.png){kind=icon}
返回
The Minimum k-Storage Problem: Complexity, Approximation, and Experimental Analysis
.png){kind=icon}
PRE
AI
DOI：10.1109/TMC.2015.2475765.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In a sensor network, data might be stored in so-called storage nodes, which receive raw data from other nodes, compress them, and send them toward a sink. We consider the problem of locating k storage nodes in order to minimize the energy consumed for converging the raw data to the storage nodes as well as to converge the compressed data to the sink. This is known as the minimum k-storage problem. In general, the problem is NP-hard. However, we are able to devise a polynomial-time algorithm that optimally solves the problem in bounded-tree width graphs. We then characterize the minimum k-storage problem from the approximation viewpoint. We first prove that it is NP-hard to be approximated within a factor smaller than 1 + 1/e. We then propose a local search algorithm that guarantees a constant approximation factor. We conducted extended experiments to show that the algorithm performs very well, exhibiting very small deviation from the optimum and computational time. It is worth to note that our problem is a generalization to the well-known metric k-median problem and then the obtained results also hold for this case.
Keyword:
Wireless sensor networks
storage placement
exact and approximation algorithms
experimental analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.2
论文数:
5.8K
被引数:
1.8W
机构
引用论文
分享收藏Age and education adjusted normative data and discriminative validity for Rey’s Auditory Verbal Learning Test in the elderly Greek population年龄和教育程度调整了Rey在希腊老年人群中听觉言语学习测试的规范数据和判别效度
PREAI
分享收藏A comparison of first and repeat (four years later) prostate cancer screening in a randomized cohort of a symptomatic men aged 55–75 years using a biopsy indication of 3.0 ng/ml (results of ERSPC, Rotterdam).png)
The Prostate
The ProstateIF0
PREAI
分享收藏
查看更多内容