Convergecast with Unbounded Number of Channels

Abstract

Abstract. We consider a problem of minimum length scheduling for the conflict-free aggregation convergecast in wireless networks in a case when each element of a network uses its own frequency channel. This problem is equivalent to the well-known NP-hard problem of telephone broadcasting since only the conflicts between the children of the same parent are taken into account. We propose a new integer programming formulation and compare it with the known one by running the CPLEX software package. Based on the results of a numerical experiment, we concluded that our formulation is more preferable in practice to solve the considered problem by CPLEX than the known one. We also propose a novel heuristic algorithm, which is based on a genetic algorithm and a local search metaheuristic. The simulation results demonstrate the high quality of the proposed algorithm compared to the best known approaches.

GLS and VNS based heuristics for conflict-free minimum-latency aggregation scheduling in WSN

“…They use two variants of local search procedure. The first one, BranchReattaching, is already proposed in [24], and the second, ArcInversing, is new. During the numerical experiment, we established the best combinations of parameters of our algorithms and then compared them with other known approaches.…”

“…In [23] a GA based framework was presented for the custom performance metric optimization of WSN. In [24] a GA based algorithm was proposed to solve the convergecast scheduling problem with an unbounded number of channels, where only conflicts between the transmitters to the same addressee were taken into account.…”

“…We suggest two different local search procedures. The first one, BranchReattaching algorithm, is already proposed in [24]. The pseudocode of this local search procedure is presented in Algorithm 4.…”