WSEAS Transactions on Communications
Print ISSN: 1109-2742, E-ISSN: 2224-2864
Volume 16, 2017
Conflict-Free Data Aggregation in WSN with Unbounded Number of Channels
Authors: , ,
Abstract: We consider a problem of minimum length scheduling for 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, 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.
Search Articles
Keywords: wireless sensor networks, convergecast, minimum latency, genetic local search, telephone broadcasting, simulation
Pages: 192-202
WSEAS Transactions on Communications, ISSN / E-ISSN: 1109-2742 / 2224-2864, Volume 16, 2017, Art. #23