.png){kind=icon}
返回
Minimum Latency Multiple Data MULE Trajectory Planning in Wireless Sensor Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TMC.2013.69.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper investigates the problem of computing the optimal trajectories of multiple data MULEs (e. g., robots, vehicles, etc.) to minimize data collection latency in wireless sensor networks. By relying on a slightly different assumption, we define two interesting problems, the k-traveling salesperson problem with neighborhood (k-TSPN) and the k-rooted path cover problem with neighborhood (k-PCPN). Since both problems are NP-hard, we propose constant factor approximation algorithms for them along with two simpler heuristic algorithms. We also conduct simulations to compare the performance of the proposed approaches with the existing alternatives. Our simulation results indicate that the proposed algorithms outperform the competitors on average.
Keyword:
Wireless sensor network
data mules
traveling salesperson problem with neighborhood
approximation algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.2
论文数:
5.9K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容