Mobility

A Subproblem-Dependent Heuristic in MOEA/D for the Deployment and Power Assignment Problem in Wireless Sensor Networks

Free registration required

Executive Summary

In this paper, the authors propose a Sub-problem-dependent Heuristic (SH) for MOEA/D to deal with the Deployment and Power Assignment Problem (DPAP) in Wireless Sensor Networks (WSNs). The goal of the DPAP is to assign locations and transmit power levels to sensor nodes for maximizing the network coverage and lifetime objectives. In their method, the DPAP is decomposed into a number of scalar sub-problems. The sub-problems are optimized in parallel, by using neighborhood information and problem-specific knowledge. The proposed SH probabilistically alternates between two DPAP-specific strategies based on the sub-problems objective preferences. Simulation results have shown that MOEA/D performs better than NSGA-II in several WSN instances.

  • Format: PDF
  • Size: 533.5 KB