A genetic simulated annealing hybrid algorithm for relay nodes deployment optimization in industrial wireless sensor networks

With the development of wireless sensor networks, low-cost and high-reliability industrial wireless sensor networks become feasible. The industrial wireless sensor networks should be designed to resist the failure of some nodes in harsh environments. In order to minimize the installation cost of relay nodes for fault tolerant hierarchical networks planning, we proposed a genetic simulated annealing hybrid algorithm. The algorithm determines the number of relay nodes, along with their locations, so that each sensor node can be covered by at least two relay nodes, and the network of relay nodes is 2-connected. The result produced by the presented algorithm within limited number of iterations is reasonable and the algorithm leads to improvements compared with genetic algorithm and integer linear program (ILP).