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

Boxiao LIU; Mengting YUAN; Haihang YOU

doi:10.1007/s11704-022-1781-6

Front. Comput. Sci. ›› 2023, Vol. 17 ›› Issue (3) : 173402 DOI: 10.1007/s11704-022-1781-6

Theoretical Computer Science

LETTER

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

Boxiao LIU ¹^,²
, Mengting YUAN ³^,^†
, Haihang YOU ¹^,^†

Author information +

History +

PDF (377KB)

Cite this article

Download citation ▾

Boxiao LIU, Mengting YUAN, Haihang YOU. A hybrid-order local search algorithm for set k-cover problem in wireless sensor networks. Front. Comput. Sci., 2023, 17(3): 173402 DOI:10.1007/s11704-022-1781-6

登录浏览全文

4963

注册一个新账户忘记密码

References

Publishing order | Descend order by publishing year | Descend order by cited within

[1]	Yetgin H, Cheung K T K, El-Hajjar M, Hanzo L H . A survey of network lifetime maximization techniques in wireless sensor networks. IEEE Communications Surveys & Tutorials, 2017, 19( 2): 828– 854

[2]	Slijepcevic S, Potkonjak M. Power efficient organization of wireless sensor networks. In: Proceedings of IEEE International Conference on Communications. 2001, 472− 476

[3]	Ting C K, Chou T M, Liao C C. Tabu search with random walk for lifetime extension in wireless sensor networks. In: Proceedings of 2012 Conference on Technologies and Applications of Artificial Intelligence. 2012, 119− 124

[4]	Liao C C, Ting C K . A novel integer-coded memetic algorithm for the set k-cover problem in wireless sensor networks. IEEE Transactions on Cybernetics, 2018, 48( 8): 2245– 2258

[5]	Dowlatshahi M B, Rafsanjani M K, Gupta B B . An energy aware grouping memetic algorithm to schedule the sensing activity in WSNs-based IoT for smart cities. Applied Soft Computing, 2021, 108: 107473

[6]	Cai S, Su K, Luo , Sattar A . NuMVC: an efficient local search algorithm for minimum vertex cover. Journal of Artificial Intelligence Research, 2013, 46( 1): 687– 716