期刊名称:International Journal of Computer Science and Network Security
印刷版ISSN:1738-7906
出版年度:2015
卷号:15
期号:11
页码:45-48
出版社:International Journal of Computer Science and Network Security
摘要:Data Aggregation is a fundamental problem in wireless sensor networks (WSNs). From both economic and applicable concerns, designers always would like to provide guaranteed QoS of coverage of WSNs. In this paper, we address two path-coverage problems in WSNs, maximum k-support path coverage (a.k.a. best case coverage) and minimum k-breach path coverage (a.k.a. worst case coverage), in which every point on the desired resultant path is covered by at least k sensors simultaneously while optimizing certain objectives. We present an approaches to find optimal solutions for both maximum k-support coverage problem and minimum k-breach coverage problem.