您当前的位置:
首页 >
文章列表页 >
Polynomial time algorithm for solving k-coverage problem in wireless sensor networks
research and development | 更新时间:2024-06-05
    • Polynomial time algorithm for solving k-coverage problem in wireless sensor networks

    • Telecommunications Science   Vol. 33, Issue 12, Pages: 91-98(2017)
    • DOI:10.11959/j.issn.1000-0801.2017287    

      CLC: TN918.91
    • Published Online:2017-12,

      Published:20 December 2017

    移动端阅览

  • Qi WANG, Zheng’an XIAO, Huaixing WANG. Polynomial time algorithm for solving k-coverage problem in wireless sensor networks[J]. Telecommunications science, 2017, 33(12): 91-98. DOI: 10.11959/j.issn.1000-0801.2017287.

  •  
  •  

0

Views

600

下载量

0

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

Quality of service based hierarchical resource allocation algorithm
Wireless sensor node localization based on IPSO-MC
Communication performance analysis of wireless sensor network for railway environmental monitoring
Energy-efficient data gathering scheme based on Kalman prediction and compressed sensing
Game theory-based malware propagation model for wireless sensor network

Related Author

Yi WANG
Xiaodong CAO
Jinrong CHEN
Cheng DING
Jianping WU
Yongyan LI
Hao HU
Ruifeng CHEN

Related Institution

Zhejiang University
University of Shaoxing at Shang Yu
Institute of Computing Technology, China Academy of Railway Sciences Co., Ltd.
China Railway Harbin Group Co.,Ltd.
College of Mathematics Physics and Information Engineering, Jiaxing University
0