基于GLS和VNS的启发式算法在WSN中实现无故障最小延迟聚合调度
GLS and VNS Based Heuristics for Conflict-Free Minimum-Latency Aggregation Scheduling in WSN
摘要：
我们考虑一个无冲突的最小延迟数据聚合问题，发生在不同的无线网络。给定一个无向图中的一个选定的顶点（汇）的网络，目标是找到一个生成聚合树植根于汇，并定义一个无冲突的聚合最小长度的时间表沿弧的树指向汇。因此，在同一时隙，网络的每个单元可以发送或接收至多一个消息。在整个聚合会话期间，每个网元只发送一条消息，并应排除信号干扰引起的冲突。这个问题是NP-难的，即使在给定聚合树的情况下也是NP-难的。因此，开发有效的近似算法是非常必要的。在本文中，我们提出了新的启发式算法的基础上的遗传局部搜索和可变邻域搜索元算法。我们进行了广泛的模拟，证明了我们的算法的优越性相比，最好的以前的方法。
英文摘要：
We consider a conflict-free minimum latency data aggregation problem that occurs in different wireless networks. Given a network that is presented as an undirected graph with one selected vertex (a sink), the goal is to find a spanning aggregation tree rooted in the sink and to define a conflict-free aggregation minimum length schedule along the arcs of the tree directed to the sink. Herewith, at the same time slot, each element of the network can either send or receive at most one message. Only one message should be sent by each network element during the whole aggregation session, and the conflicts caused by signal interference should be excluded. This problem is NP-hard and remains NP-hard even in the case when the aggregation tree is given. Therefore, the development of efficient approximate algorithms is very essential for this problem. In this paper, we present new heuristic algorithms based on the genetic local search and the variable neighborhood search metaheuristics. We conducted an extensive simulation that demonstrates the superiority of our algorithms compared with the best of the previous approaches.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
