论文部分内容阅读
针对存在汇聚节点和移动sink场景下的数据收集问题,提出了一种联合考虑汇聚节点选取、普通节点到汇聚节点路由以及移动sink路径的启发式数据收集算法.应用图论对网络进行建模,采用最小连通支配集作为初始种子汇聚节点集,通过迭代确定最终的汇聚节点集、对汇聚节点集的最短遍历路径和普通节点到汇聚节点的最短路由.该算法在保证数据时延要求的条件下,减少了传感器节点到汇聚节点的数据传输,从而节省能耗.
Aiming at the problem of data collection in the scenario of sink nodes and mobile sinks, a heuristic algorithm for data collection considering joint node selection, normal node to sink node routing and mobile sink path is proposed.Application of graph theory to network modeling, The minimum connected dominating set is used as the initial seed sink node set to determine the final sink node set by iteration, the shortest traversal path to the sink node set and the shortest route from the ordinary node to the sink node. The algorithm, under the condition of guaranteeing data delay , Reducing the sensor node to the sink node data transmission, thereby saving energy consumption.