Local Maximum Lifetime Algorithms For Strong A-Barrier Coverage With Cooridnated Sensors
Barrier coverage is known to be an appropriate model of coverage for movement detection and boundary guard, which is achieved by barriers of sensors. This paper focuses on local algorithms for strong k- barrier coverage based on detection coverage model. We first formalize a coordinated detection coverage model, where the data fusion rule is described by a general function. Then, we analyze the influencing factors of barrier coverage lifetime, and tranfer it to a multiobjective optimization problem. Moreover, we propose a new Divide-and-Conquer scheme. Based on it , we design a new local maximal lifetime algorithm and following protocol for strong k- barrier with coordinated sensors. Simulations that the new algorithm provides effective enhancement in network lifetime, it outperforms RIS by up to 4.34 times and surpasses LBCP by 5 time units.
wireless sensor network barrier coverage local algorithm datafusion detection coverage model
Yingying Cao Liusheng Huang Kai Xing Hao Yang
School of Information Science and Technology Yancheng Teachers University Yancheng, China Suzhou Institute for Advanced Study University of Science and Technology of China Suzhou, China
国际会议
西安
英文
71-76
2011-05-27（万方平台首次上网日期，不代表论文的发表时间）