Skip to main content
SpringerLink
Log in

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

  • Letter
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  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

    Article  Google Scholar 

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

    Google Scholar 

  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

    Chapter  Google Scholar 

  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

    Article  MathSciNet  Google Scholar 

  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

    Article  Google Scholar 

  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

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was partially supported by the National Natural Science Foundation of China (Grant Nos. 41930110, 61872272 and 61640221).

Author information

Authors and Affiliations

  1. State Key Lab of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, 100190, China

    Boxiao Liu & Haihang You

  2. University of Chinese Academy of Sciences, Beijing, 100049, China

    Boxiao Liu

  3. School of Comptuer Science, Wuhan University, Wuhan, 430072, China

    Mengting Yuan

Authors
  1. Boxiao Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mengting Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Haihang You
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Mengting Yuan or Haihang You.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, B., Yuan, M. & You, H. A hybrid-order local search algorithm for set k-cover problem in wireless sensor networks. Front. Comput. Sci. 17, 173402 (2023). https://doi.org/10.1007/s11704-022-1781-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11704-022-1781-6

Search

Navigation