Efficient Rendezvous Algorithms for Mobility-Enabled Wireless Sensor Networks
Efficient Rendezvous Algorithms for Mobility-Enabled Wireless Sensor Networks
复制标题
适用于移动性无线传感器网络的高效交会算法
DOI：
10.1109/tmc.2011.66
复制
发表时间：
2012-01-01
影响因子：
7.9
通讯作者：
Huang, Jun
中科院分区：
文献类型：
--
作者：
Xing, Guoliang;Li, Minming;Huang, Jun
最近的研究表明，显着的节能可以实现在移动性使能的无线传感器网络（WSNs），访问传感器节点，并从他们通过短距离通信收集数据。然而，这种无线传感器网络的主要性能瓶颈是由于移动的基站的低移动速度而导致的数据收集的延迟显著增加。为了解决这个问题，我们提出了一种基于重定向的数据收集方法，其中节点的子集作为会合点，缓冲和聚合数据源和传输到基站时，它到达。该方法结合了受控移动性和网络内数据缓存的优点，可以在网络节能和数据收集延迟之间实现理想的平衡。我们提出了有效的交会设计算法与可证明的性能界限移动的基站与可变和固定的轨道，分别。通过理论分析和大量的仿真验证了该方法的有效性。
Recent research shows that significant energy saving can be achieved in mobility-enabled wireless sensor networks (WSNs) that visit sensor nodes and collect data from them via short-range communications. However, a major performance bottleneck of such WSNs is the significantly increased latency in data collection due to the low movement speed of mobile base stations. To address this issue, we propose a rendezvous-based data collection approach in which a subset of nodes serve as rendezvous points that buffer and aggregate data originated from sources and transfer to the base station when it arrives. This approach combines the advantages of controlled mobility and in-network data caching and can achieve a desirable balance between network energy saving and data collection delay. We propose efficient rendezvous design algorithms with provable performance bounds for mobile base stations with variable and fixed tracks, respectively. The effectiveness of our approach is validated through both theoretical analysis and extensive simulations.