Finding best and worst-case coverage paths in camera sensor networks for complex regions

详细信息    查看全文

• 作者：Yi Hong ; ^a ; ^{hongyi@bipt.edu.cn}Author Vitae ; Ruidong Yan^bAuthor Vitae ; Yuqing Zhu^cAuthor Vitae ; Deying Li^bAuthor Vitae ; Wenping Chen^bAuthor Vitae
• 关键词：Camera sensor networks ; Non-convex polygon ; Maximal support/breach path
• 刊名：Ad Hoc Networks
• 出版年：2017
• 出版时间：1 March 2017
• 年：2017
• 卷：56
• 期：Complete
• 页码：202-213
• 全文大小：3072 K
• 卷排序：56

文摘

With the growing popularity of multimedia applications of WSNs, camera sensor networks (CSNs) arise in response to the proper time and conditions and are gaining more spotlight, which could improve the richness and precision of the sensed information. Among the coverage applications of CSNs, there exists a particular kind in which the monitored region has complex boundary. Such applications pose new challenges such as deployment complexity, network vulnerability. Thus we investigate the best and worst-case coverage problem of CSNs in a complex region, which is to find a maximal support/breach path in the region. Based on the polygon sensing model, we propose an efficient algorithm with low time complexity for each problem and prove the algorithms can get an optimal solution when the complex region has a known convex partition. We finally study the characteristic behavior and evaluate the performance of the algorithms via experimental simulations, whose results indicate our algorithms outperform the existing alternatives on the support/breach improvement.