作者: Chuan-Kang Ting , Chien-Chih Liao
DOI: 10.1016/J.INS.2010.08.021
关键词:
摘要: Extending the lifetime during which a wireless sensor network (WSN) can cover all targets is key issue in WSN applications such as surveillance. One effective method to partition collection of sensors into several covers, each must include targets, and then activate these covers one by one. Therefore, more enable longer lifetime. The problem finding maximum number has been modeled SET K-COVER problem, proven be NP-complete. This study proposes memetic algorithm solve this problem. utilizes Darwinian evolutionary scheme Lamarckian local enhancement search for optima given considerations global exploration exploitation. Additionally, proposed does not require an upper bound or any assumption about covers. simulation results on numerous instances confirm that significantly outperforms heuristic algorithms terms solution quality, demonstrate effectiveness extending