小范围无线传感器网络中最快事件检测的传感器最优睡眠-唤醒调度
Optimum Sleep-Wake Scheduling of Sensors for Quickest Event Detection in Small Extent Wireless Sensor Networks
摘要:
我们认为,在小范围的无线传感器网络中,在每个时隙,每个传感器节点在清醒状态下观察一个样本和信息的融合中心的睡眠-唤醒调度的最快事件检测的问题。处于睡眠状态的传感器节点不采样或向融合中心(FC)传送任何信息,从而节省能量。在每个时隙处,FC在已经从处于唤醒状态的传感器节点接收到样本之后,做出停止(并且因此声明事件已经发生)或继续观察的决定。如果决定继续,FC还决定选择在下一个时隙中处于唤醒状态的传感器节点的数量。我们考虑三种替代方法来选择在时隙k +1中处于唤醒状态的传感器节点的数量的问题,基于在时隙k处可用的信息,即1。M_{k+1}的最优控制,时隙k +1中处于唤醒状态的传感器节点的数量,2. q_{k+1}的最优控制,传感器节点在时隙k +1中处于唤醒状态的概率,以及3.传感器节点在任何时隙中处于唤醒状态的最优概率q。在每种情况下,我们制定的问题作为一个连续的决策过程。我们证明了一个充分的统计决策在时间k是后验概率的变化Pi_k。我们还证明了最优停止规则是Pi_k上的阈值规则。M_{k+1}的最优策略可以保持很少的传感器唤醒在pre-change阶段,然后迅速增加的传感器的数量在唤醒状态时的变化是"怀疑"。在所描述的三种睡眠-唤醒算法中,我们观察到总成本对于M_{k+1}的最优控制是最小的,并且对于q的最优控制是最大的。
英文摘要:
We consider the problem of quickest event detection with sleep-wake scheduling in small extent wireless sensor networks in which, at each time slot, each sensor node in the awake state observes a sample and communicates the information to the fusion centre. The sensor nodes in the sleep state do not sample or communicate any information to the fusion centre (FC), thereby conserving energy. At each time slot, the FC, after having received the samples from the sensor nodes in the wake state, makes a decision to stop (and thus declare that the event has occurred) or to continue observing. If it decides to continue, the FC also makes the decision of choosing the number of sensor nodes to be in the wake state in the next time slot. We consider three alternative approaches to the problem of choosing the number of sensor nodes to be in the wake state in time slot k+1, based on the information available at time slot k, namely, 1. optimal control of M_{k+1}, the number of sensor nodes to be in the awake state in time slot k+1, 2. optimal control of q_{k+1}, the probability of a sensor node to be in the awake state in time slot k+1, and 3. optimal probability q that a sensor node is in the awake state in any time slot. In each case, we formulate the problem as a sequential decision process. We show that a sufficient statistic for the decision at time k is the a posteriori probability of change Pi_k. Also, we show that the optimal stopping rule is a threshold rule on Pi_k. The optimal policy for M_{k+1} can keep very few sensors wake during the prechange phase and then quickly increase the number of sensors in the wake state when a change is "suspected". Among the three sleep-wake algorithms described, we observe that the total cost is minimum for the optimum control of M_{k+1} and is maximum for the optimum control on q.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。