×

Conflict-aware data aggregation scheduling in wireless sensor networks with adjustable transmission range. (English) Zbl 1253.68072

Summary: 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 \(\alpha\) 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.

MSC:

68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
68M10 Network design and communication in computer systems
68W25 Approximation algorithms
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] DOI: 10.1007/s11276-009-0207-9 · Zbl 05828649 · doi:10.1007/s11276-009-0207-9
[2] Xu X., IEEE Trans. Parallel Distrib. Syst. 22 pp 163–
[3] Wegner G., Studia Sci. Math. Hungar. 21 pp 1–
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.