Delay Tolerant Event Collection in Sensor Networks with Mobile Sink
Delay Tolerant Event Collection in Sensor Networks with Mobile Sink
复制标题
DOI：
10.1109/infcom.2010.5462075
复制
发表时间：
2010-03
期刊：
影响因子：
--
通讯作者：
Xing Xu;Ji Luo;Qian Zhang
中科院分区：
文献类型：
--
作者：
Xing Xu;Ji Luo;Qian Zhang
我们感兴趣的事件收集在一个二维区域，传感器被部署到检测和收集感兴趣的事件。在无线传感器网络中，采用传统的多跳路由向汇聚节点或基站报告事件，会导致静态传感器能量消耗严重不均衡。此外，在某些情况下，所有静态传感器之间的完全连接可能是不可能的，因为通常传感器被随机部署在目标区域中。在本文中，我们利用一个移动的传感器作为汇聚节点，通过控制移动的汇聚节点的运动来收集静态传感器读数，以协助事件收集。我们的工作的一个关键观察是，一个事件具有时空相关性。具体地，同一事件可以在一段时间内被多个附近的传感器检测到。因此，如果移动的宿可以选择性地仅与静态传感器的一部分通信，同时仍然收集所有感兴趣的事件，则能量效率更高。在本文中，我们讨论的事件收集问题，利用汇聚节点的移动性和事件的时空相关性，有利于最大限度地提高网络的生命周期与保证事件收集率。我们首先建模的问题传感器选择问题，并表明它可以在多项式时间内解决，如果事件的全局知识是可用的，并有没有速度限制移动的汇。我们还分析了一个可行的运动路线的设计移动的汇，以最大限度地减少实际系统的速度要求。然后提出了一个在线方案，放松了关于事件全局知识的假设，我们证明了预期的事件收集率可以在理论上得到保证。通过对真实的跟踪数据的综合仿真，我们证明了与其他一些方案相比，该方案可以显著延长网络的生命周期。
We are interested in event collection in a 2D region where sensors are deployed to detect and collect interested events. Using traditional multi-hop routing in wireless sensor networks to report events to a sink node or base station, will result in severe imbalanced energy consumption of static sensors. In addition, full connectivity among all the static sensors may not be possible in some cases since generally the sensors are randomly deployed in the target region. In this paper, we exploit a mobile sensor as the sink node to assist the event collection by controlling the movement of the mobile sink to collect static sensor readings. A key observation of our work is that an event has spatialtemporal correlation. Specifically, the same event can be detected by multiple nearby sensors within a period of time. Thus, it is more energy-efficient if the mobile sink can selectively communicate with only a portion of static sensors, while still collecting all the interested events. In this paper, we discuss the event collection problem by leveraging the mobility of the sink node and the spatial-temporal correlation of the event, in favor of maximizing the network lifetime with a guaranteed event collection rate. We first model the problem as sensor selection problem and show that it could be solved in polynomial time, if global knowledge of events is available and there is no velocity constraints on mobile sink. We also analyze the design of a feasible movement route for mobile sink to minimize the velocity requirements for a practical system. An online scheme is then proposed to relax the assumption about global knowledge of events and we prove that the expected event collection rate can be guaranteed in theory. Through comprehensive simulation on real trace data, we demonstrate that the network lifetime can be significantly extended, comparing to some other schemes.