A Trajectory Algorithm to Solve the Relay Node Placement Problem in Wireless Sensor Networks

摘要

Nowadays, wireless sensor networks are widely used in many fields of application. This promotes that many authors try to overcome the most important shortcomings of this type of network. This paper focuses on how to add relay nodes to previously established static wireless sensors networks in order to optimize two important factors: average energy consumption and average coverage. Since this is an NP-hard optimization problem, three different multiobjective metaheuristics are used; two of them are well-known genetic algorithms (NSGA-Ⅱ and SPEA2) and the third is a multiobjective version of the trajectory algorithm VNS. All the results obtained are analyzed by means of a widespread statistical methodology, using both set coverage and hypervolume as multiobjective quality metrics. We conclude that MO-VNS provides better performance on average than standards NSGA-Ⅱ and SPEA2.