Zhang Chun, Fei Shumin
School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210023, China.
School of Automation, South and East University, Nanjing 210018, China.
Sensors (Basel). 2020 Mar 4;20(5):1398. doi: 10.3390/s20051398.
Data collection is one of the key technologies in wireless sensor networks. Due to the limited battery resources of sensors, mobile collectors are introduced to collect data instead of multi-hop data relay. However, how to decrease the data delay based on the cooperation of mobile collectors is a main problem. To solve this problem, a matching game-based data collection algorithm is proposed. First, some high-level cluster heads are elected. Second, by introducing a matching game model, the data collection problem is modeled as a one to one matching problem. Then, according to the preferences of mobile collectors and cluster heads, the benefit matrices are established. Based on the proposed matching algorithm, each mobile collector selects a cluster head to collect the data packets. Performance analysis proves that the matching result is stable, optimal, and unique. Simulation results show that the proposed algorithm is superior to other existing approach in terms of the reduction in data delay.
数据收集是无线传感器网络中的关键技术之一。由于传感器的电池资源有限，因此引入移动收集器来收集数据，而不是采用多跳数据中继。然而，如何基于移动收集器的协作来减少数据延迟是一个主要问题。为了解决这个问题，提出了一种基于匹配博弈的数据收集算法。首先，选举出一些高级簇头。其次，通过引入匹配博弈模型，将数据收集问题建模为一对一匹配问题。然后，根据移动收集器和簇头的偏好，建立收益矩阵。基于所提出的匹配算法，每个移动收集器选择一个簇头来收集数据包。性能分析证明匹配结果是稳定、最优且唯一的。仿真结果表明，所提出的算法在减少数据延迟方面优于其他现有方法。
