A simple local search algorithm for minimizing interference in wireless sensor networks

Abstract

As one of fundamental issues in energy limited wireless sensor networks, the problem of minimizing the receiver interference of a wireless sensor network has been proved to be NP-hard, and effective algorithms need to be developed for practical applications. In this paper, a simple local search algorithm is proposed to tackle the problem. Beginning with a feasible solution generated randomly or yielded by a greedy method, the algorithm attempts to improve the initial solution by removing every node with maximum interference based on two simple strategies. Experimental results show that on random instances the algorithm effectively improves the solutions yielded by an existing greedy algorithm with time slightly longer than that of the greedy algorithm.