arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.2853cs.NI
收藏

技术报告:通过休眠传感器进行休眠路由

Technical Report: Sleep-Route - Routing through Sleeping Sensors

Chayan Sarkar, Vijay S. Rao, R. Venkatesha Prasad

摘要:

在这篇文章中,我们提出了一个节能的无线传感器网络的数据收集方案称为睡眠路由,它分为两组传感器节点-活动和休眠(低功耗睡眠)。只有活动的传感器节点集参与数据汇集。休眠的传感器节点的感知值预测的帮助下,一个活跃的传感器节点。虚拟传感框架(VSF)提供了一种利用传感器节点之间的数据相关性来预测传感值的机制。如果能够最小化活跃传感器节点的数量,可以节省大量的能量。主动节点的选择必须满足以下约束-(i)主动节点的集合足以预测休眠节点的感测值,(ii)每个主动传感器节点可以将它们的数据报告给汇聚节点(直接地或通过一些其他主动节点)。我们的目标是选择一个最小数量的活跃的传感器节点,以便可以最大限度地节省能源。主动节点选择的最优集合提出了一个组合优化问题,我们称之为睡眠路由问题。我们证明了睡眠路径问题是NP-困难的。然后,我们制定了一个整数线性规划(ILP)的最优解决问题。为了在多项式时间内解决此问题,我们也提出一个启发式演算法,其表现接近最佳。

英文摘要:

In this article, we propose an energy-efficient data gathering scheme for wireless sensor network called Sleep-Route, which splits the sensor nodes into two sets - active and dormant (low-power sleep). Only the active set of sensor nodes participate in data collection. The sensing values of the dormant sensor nodes are predicted with the help of an active sensor node. Virtual Sensing Framework (VSF) provides the mechanism to predict the sensing values by exploiting the data correlation among the sensor nodes. If the number of active sensor nodes can be minimized, a lot of energy can be saved. The active nodes' selection must fulfill the following constraints - (i) the set of active nodes are sufficient to predict the sensing values of the dormant nodes, (ii) each active sensor nodes can report their data to the sink node (directly or through some other active node(s)). The goal is to select a minimal number of active sensor nodes so that energy savings can be maximized. The optimal set of active node selection raise a combinatorial optimization problem, which we refer as Sleep-Route problem. We show that Sleep-Route problem is NP-hard. Then, we formulate an integer linear program (ILP) to solve the problem optimally. To solve the problem in polynomial time, we also propose a heuristic algorithm that performs near optimally.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑