A hybrid-order local search algorithm for set k-cover problem in wireless sensor networks

查看全文 作　　者：Boxiao [1,2]LIU;Mengting [3]YUAN;Haihang [1]YOU

机构地区：[1]State Key Lab of Processors,Institute of Computing Technology,Chinese Academy of Sciences,Beijing 100190,China;[2]University of Chinese Academy of Sciences,Beijing 100049,China;[3]School of Comptuer Science,Wuhan University,Wuhan 430072,China

出　　处：《Frontiers of Computer Science》索引2023年第17卷第3期,共3页

基　　金：This work was partially supported by the National Natural Science Foundation of China(Grant Nos.41930110,61872272 and 61640221)。 摘　　要：1 Introduction The lifetime of wireless sensor networks(WSNs)is restricted by the limited energy of battery-powered sensor devices,making the lifetime extension a critical problem in real applications[1].Several aspects have been examined in previous works to extend the lifetime of WSNs,such as the deployment position,the network routing strategy and the sensing range adjustment.Given the fact that there are often many redundant sensors,a practical way to extend the lifetime of a WSN is to partition the sensors into subsets,each of which can cover all the targets[2].Then the sets are activated one by one,extending the lifetime of a WSN to times of the battery lifetime of a sensor.The problem of finding the maximal is abstracted as the set k-cover problem. 关键词：NETWORKS LIFETIME BATTERY

相关文献

参考文献（6）
引证文献（1）
耦合文献（0）

参考文献(6)

引证文献(1)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

A hybrid-order local search algorithm for set k-cover problem in wireless sensor networks

参考文献(6)

引证文献(1)

用户提示