Conflict-Aware Data Aggregation Scheduling in Wireless Sensor Networks with Adjustable Transmission Range
Conflict-Aware Data Aggregation Scheduling in Wireless Sensor Networks with Adjustable Transmission Range
复制标题
DOI：
10.1142/s1793830912500139
复制
发表时间：
2012-08
期刊：
影响因子：
--
通讯作者：
Yi Hong;Hongwei Du;Deying Li;Wenping Chen
中科院分区：
文献类型：
--
作者：
Yi Hong;Hongwei Du;Deying Li;Wenping Chen
最小时延数据汇聚调度是无线传感器网络的基本问题之一。已有的工作大多假设传感器节点的传输范围不能调整。然而，传输范围可调的传感器在节能、减少传输干扰和延迟方面具有优势。本文研究了传输半径可调的最小延迟冲突感知数据聚合调度问题：给定传感器和基站的位置，所有传感器可以调整其传输半径，每个传感器的干扰半径是其传输半径的α倍，我们试图找到一个数据聚合调度，使得所有传感器的数据可以无冲突地传输到基站，从而使延迟最小。我们首先将所有节点的集合划分为两个部分：主集和次集。然后，我们分别为这两个集合设计了不同的调度策略。最后，我们给出了该问题的一个近似算法，并证明了该算法的性能比是一个近乎恒定的界。实验结果验证了该算法的有效性。
The minimum latency data aggregation schedule is one of the fundamental problems in wireless sensor networks. Most existing works assumed that the transmission ranges of sensor nodes cannot be adjusted. However, sensors with adjustable transmission ranges have advantages in energy saving, reducing transmission interference and latency. In this paper, we study the minimum latency conflict-aware data aggregation scheduling problem with adjustable transmission radii: given locations of sensors along with a base station, all sensors could adjust their transmission radii and each sensor's interference radius is α times of its transmission radius, we try to find a data aggregation schedule in which the data from all sensors can be transmitted to the base station without conflicts, such that the latency is minimized. We first partition the set of all nodes into two parts: the major set and the minor set. Then, we design different scheduling strategies for the two sets, respectively. Finally, we propose an approximation algorithm for the problem and prove the performance ratio of the algorithm is bounded by a nearly constant. Our experimental results evaluate the efficiency of the proposed algorithm.