检索结果-内蒙古大学图书馆

Determination of k-coverage configuration for Meeting Desired Quality of Surveillance on WSNs

JOURNAL OF INTERNET TECHNOLOGY 2011年第3期12卷 449-456页

作者： Wueng, Meng-Chun Hwang, Shyh-In Hwang, I-Shyan Yuan Ze Univ Dept Comp Sci & Engn Chungli Taiwan Yuan Ze Univ Dept Comp Engn & Sci Chungli Taiwan

For monitoring critical applications by using wireless sensor networks (WSNs), users usually care about the false positive (false alarm) probability and false negative (detection miss) probability of a WSN, which are defined as quality of surveillance (QoSu) in this paper. To mask faulty sensors, the k-coverage configuration is widely exploited to ensure that each location is covered by at least k sensors. However, increasing k effectively reduces detection misses but incurs high false alarm rate. Little work evaluates the k-coverage configuration in terms of explicit metrics. In this paper, we propose a fault-tolerant model, which determines the value of k according to a desired QoSu while maximizing the system lifetime. Experimental results show that (1) the k-coverage configuration is insufficient to meet the QoSu without adopting any fusion scheme, and (2) the derived configuration minimizes power consumption while meeting the QoSu.

关键词： Quality of surveillance System false positive System false negative k-coverage configuration Data aggregation

来源：评论

学校读者我要写书评

暂无评论

Efficient k-coverage Grouping Scheduling in Wireless Sensor Networks

Efficient K-coverage Grouping Scheduling in Wireless Sensor ...

引用

11th International Conference on Advanced Communication Technology

作者： Wueng, Meng-Chun Lin, Han-Pei Hwang, Shyh-In Yuan Ze Univ Dept Comp Sci & Engn Chungli Taiwan

ISBN: (纸本)9788955191387

The k-coverage configuration guarantees that each location in an area is covered by at least k wireless sensors. To prolong the system lifetime, how to design an efficient sleep-scheduling algorithm have been attracted much attention. Many studies cannot maximize the system lifetime, while ensuring the k-coverage configuration. In this paper, we classify wireless sensors into groups, in which each group is k-covered with the minimum overlap among sensors. Different from the previous studies, our algorithm further reduces the cost of maintaining connectivity among sensors and the latency of reporting events. Experimental results demonstrate the efficiency and accuracy of our algorithm.

关键词： Wireless sensor networks k-coverage configuration Sleep Scheduling Grouping Algorithm

来源：评论

学校读者我要写书评

暂无评论

AkCE: An Efficient and Accurate k-coverage Eligibility Algorithm in Wireless Sensor Networks

AKCE: An Efficient and Accurate K-Coverage Eligibility Algor...

引用

16th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems

作者： Wueng, Meng-Chun Hwang, Shyh-In Ho, Chia-Hsuan Yuan Ze University Taiwan

ISBN: (纸本)9781424428175

For monitoring critical applications, the k-coverage configuration is extensively exploited to ensure that each location is covered by at least k active sensor nodes. The well-known k-coverage eligibility (kE) algorithm [21, 23] ensures that a monitored area is k-covered, but incurs a considerably high computation cost. Several approximate algorithms [9, 10, 22] accomplish the k-coverage configuration at low cost, but either generate redundant active nodes, or cannot retain the degree of coverage. In this paper an efficient and accurate k-coverage eligibility (AkCE) algorithm is proposed to settle all of the above critical problems. We prove that whether a sensor node is eligible to sleep or stay active can be accurately determined by tracing only small and crucial areas within the sensing range of this node, i.e., decision areas. Experimental results show that the AkCE algorithm (i) guarantees that a monitored area is completely k-covered with no redundant active nodes, (ii) has the computation cost as lost, as 0.7% and no more than 31.5% of that of the kE algorithm [21, 23], (iii) outperforms popular approximate algorithms [9, 10, 22], and (iv) is scalable in network size.

关键词： Wireless sensor networks k-coverage configuration Eligibility algorithm Decision areas

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：