An optimization algorithm for the minimum k-connected m-dominating set problem in wireless sensor networks

标题
An optimization algorithm for the minimum k-connected m-dominating set problem in wireless sensor networks
作者
关键词
Wireless sensor network, Robust connected dominating set, Integer programming, Optimal algorithm
出版物
WIRELESS NETWORKS
Volume 21, Issue 3, Pages 783-792
出版商
Springer Nature
发表日期
2014-09-24
DOI
10.1007/s11276-014-0819-6

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started