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

k-barrier coverage reliability evaluation for wireless sensor networks using two-dimensional k-within-consecutive-r x s-out-of-m x n:F system

引用

PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART O-JOURNAL OF RISk AND RELIABILITY 2019年第6期233卷 1029-1039页

作者： Liu, Qiang Shandong Univ Finance & Econ Sch Management Sci & Engn 7366 Er Huan East Rd Jinan 250014 Shandong Peoples R China

The reliability of k-barrier coverage for wireless sensor networks is evaluated in this article. We construct a two-dimensional k-within-consecutive-r x s-out-of-m x n:F system to describe the k-barrier coverage problem and propose the definition of the k-barrier coverage reliability. If the sensing radius r of each sensor is equal to half of the horizontal distance d between two adjacent sensors, then the formula for calculating the k-barrier coverage reliability can be derived directly. If r is a positive integer multiple of d, then a recursive algorithm is applied to calculate the coverage reliability. The effects of the probability that sensors are active, the number of rows of deployed sensors and the number of sensors in each row on the coverage reliability are also analyzed using some illustrative examples. The results show that, if r = d/2, the reliability of a barrier decreases with an increase in the length of the barrier;if r = t x d (t is a positive integer), the reliability of a barrier hardly decreases with an increase in the length of the barrier.

关键词： Wireless sensor network k-barrier coverage two-dimensional k-within-consecutive-r x s-out-of-m x n F system k-coverage barrier coverage intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Optimal Receiver Placement for k-barrier coverage in Passive Bistatic Radar Sensor Networks

引用

ACM TRANSACTIONS ON INTERNET TECHNOLOGY 2020年第3期20卷 1–23页

作者： Chen, Jiaoyan Yang, Laurence T. Deng, Xianjun Hong, Xianggong Yi, Lingzhi Nanchang Univ Sch Informat & Engn Nanchang 330031 Jiangxi Peoples R China St Francis Xavier Univ Dept Comp Sci Antigonish NS B2G 2W5 Canada Univ South China Sch Elect Engn Hengyang 421001 Hunan Peoples R China Univ South China Sch Civil Engn Hengyang 421001 Hunan Peoples R China

The improvement of coverage quality in the construction of multiple-barrier coverage is a critical problem in a wireless sensor network. In this article, we investigate the k-barrier coverage construction problem in passive bistatic radar sensor networks. In contrast to traditional bistatic radar networks, the transmitters in a passive bistatic radar network are predeployed and noncooperative. To construct k barriers, we need to deploy receivers that couple with predeployed transmitters to build continuous barriers. In this work, we focus on the minimum number of receivers problem of constructing k-barrier coverage, where the minimum number of receivers is based on the predeployed transmitters. To handle this problem, we first investigate the optimal placement of receivers between adjacent transmitters for a sub-barrier formation and then determine the optimal placement of receivers for the one-barrier construction. For multiple-barrier coverage construction, we introduce a weighted transmitter graph (WTG) to describe the relation among different transmitters, where the weight in the graph is the minimum number of receivers needed for these two transmitters for a sub-barrier formation. Based on WTG, the minimum receivers problem changes to a problem of how to find k-disjoint paths with the minimum total weight in the graph. For large-scale networks, we also propose two efficient heuristic algorithms to solve the corresponding problem. Finally, we conduct extensive experiments to validate the correctness and the efficiency of the proposed algorithms.

关键词： Passive bistatic radar network k-barrier coverage minimum receiver problem

来源：评论

学校读者我要写书评

暂无评论

Energy efficient k-barrier coverage in limited mobile wireless sensor networks

引用

COMPUTER COMMUNICATIONS 2012年第14期35卷 1749-1758页

作者： Ma, Huan Li, Deying Chen, Wenping Zhu, Qinghua Yang, Huiqiang Renmin Univ China Sch Informat Beijing 100872 Peoples R China

Energy cost and reliability are two main concerns in barrier coverage for wireless sensor networks. In this paper, we take the energy cost and reliability as objectives respectively to study two problems of k-barrier coverage: the minimum energy cost k-barrier coverage problem in static wireless sensor networks and the maximum k-barrier coverage problem in limited mobile wireless sensor networks. For the minimum energy cost k-barrier coverage problem, all sensors are stationary, and each sensor has l + 1 sensing power levels in the network, the objective of the problem is to find a sensing level assignment to form k-barrier coverage such that the total power consumed by the k-barrier is minimized. We firstly transform it into a minimum cost flow problem with side constraints and use Lagrangian relaxation technique to solve the minimum cost flow problem. Then, we also propose a heuristic algorithm. For the maximum k-barrier coverage problem, each sensor can move within the limited range, the objective of the problem is to form more barriers while some sensors can move within limited range. We formulate the problem into an integer linear programming (ILP), then propose two heuristic algorithms based on the linear programming (LP) relaxation. The simulation results demonstrate our algorithms are efficient. (C) 2012 Elsevier B.V. All rights reserved.

关键词： k-barrier coverage Sensing power level Energy efficient Mobility Wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

Investigating physical security in stealthy lattice wireless sensor networks using k-barrier coverage

引用

AD HOC NETWORkS 2019年 89卷 142-160页

作者： Ammari, Habib M. Fordham Univ Dept Comp & Informat Sci WiSeMAN ACE Res Lab Wireless Sensor & Mobile Ad Hoc Network Appl Cryp Bronx NY 10458 USA

Any unauthorized access to a critical space is a physical breach in our society that can be viewed as a physical security problem. It is essential to build a barrier that prevents any intruder's attempt to cross it and access a critical area. In this paper, we address the problem of physical security in stealthy lattice wireless sensor networks using a belt of sensors around a critical area. Precisely, we propose a theoretical framework to analyze the k-barrier coverage problem, where any path that crosses this belt intersects with the sensing range of at least k sensors, k >= 1. Precisely, we analyze the k-barrier coverage problem from a tiling perspective, where the sensors' sensing disks are tangential to each other. We study two deterministic sensor deployment strategies, which yield square lattice and hexagonal lattice wireless sensor networks, respectively. First, we introduce the concept of intruder's abstract paths along a k-barrier covered sensor belt region, and compute their number. Second, we propose a polynomial representation of all abstract paths. Third, we compute the number of sensors deployed over a k-barrier covered sensor belt region for both lattices. Fourth, we define the concept of weakly k-barrier covered path crossing a k-barrier covered sensor belt region, and compute its length for both lattices. Also, we define the observability of intruder's abstract path, and compute its value for both lattices. Fifth, we generalize our results for random intruder's moves across a k-barrier covered sensor belt region. Sixth, we corroborate our analysis with simulation results. (C) 2018 Published by Elsevier B.V.

关键词： Wireless sensor networks Physical security k-barrier coverage Square lattice Hexagonal lattice

来源：评论

学校读者我要写书评

暂无评论

A k-barrier coverage Enhancing Scheme Based on Gaps Repairing in Visual Sensor Network

引用

IEEE SENSORS JOURNAL 2023年第3期23卷 2865-2877页

作者： Chen, Gong Xiong, Yonghua She, Jinhua China Univ Geosci Sch Automat Wuhan Peoples R China China Univ Geosci Hubei Key Lab Adv Control & Intelligent Automat Co Wuhan 430074 Peoples R China Tokyo Univ Technol Sch Engn Tokyo 1920982 Japan

This article explains how to efficiently use the rotation ability of stationary sensors and relocation ability of mobile sensors to achieve k-barrier coverage in a randomly deployed hybrid visual sensor network. Based on such a network, three problems are studied for k-barrier coverage. The first problem is to minimize the number of required mobile sensors and the second is to minimize the total moving distance, with deployed stationary sensors and the requirement value of k. The last problem focuses on solving the maximum number of strong barriers with deployed stationary and mobile sensors. To address these problems, we introduce a virtual barrier curve model and design a strong k-barrier coverage enhancing scheme (kCES) to transfer the k-barrier construction problems into barrier gaps repairing problem in kturns. Both analytical and experimental studies demonstrate the effectiveness of the proposed approach.

关键词： Sensors Visualization Costs Cameras Sensor phenomena and characterization Belts Three-dimensional displays Gaps repairing k-barrier coverage relocation rotation visual sensor network (VSN)

来源：评论

学校读者我要写书评

暂无评论

Scheduling algorithms for k-barrier coverage to improve transmission efficiency in WSNs

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2020年第15-16期79卷 10505-10518页

作者： Zhu, Yujun Mei, Meng Zheng, Zetian Anhui Normal Univ Sch Comp & Informat Wuhu 241002 Peoples R China Tongji Univ Sch Elect & Informat Engn Shanghai 201804 Peoples R China

k-barrier coverage optimization problem is concentrating on how to select sensor nodes from the monitoring area of the wireless sensor networks (WSNs) to form the highest quality of k-barrier coverage. Sink-connected barrier coverage optimization problem (SCBCOP) focuses on how to choose the minimum number of forwarding nodes to make each detecting node sink-connected for the security requirements of the belt monitoring region. However, the existing algorithm, such as optimal node selection algorithm(ONSA), can find the optimized k-barrier coverage of sink-connected, but it may form a large number of data packets interference (or collisions) and cannot transfer the information to sink nodes in time because the different detecting nodes can transmit invasive information at the same time. The purpose of this paper is to discuss how to reduce interference among the nodes and select routing path to optimize k-barrier coverage and satisfy sink-connected. In this paper a scheduling algorithm is proposed to build the routing path and maintain sink-connected. The algorithms is present in detail through forwarding routing tree and multi-channel scheduling to further reduce the interference of packet transmission among sensor nodes. Moreover, the comparison between other approaches and our proposal is mentioned through the simulation to show the potential efficiency and better performance of interference of packet transmission among sensor nodes with the lower packet loss rate, the shorter packet delay and the larger network average throughput.

关键词： Wireless sensor networks k-barrier coverage Sink-connected Forwarding routing tree Multi-channel scheduling

来源：评论

学校读者我要写书评

暂无评论

On-Supporting Energy Balanced k-barrier coverage in Wireless Sensor Networks

引用

IEEE ACCESS 2018年 6卷 13261-13274页

作者： Weng, Chien-I Chang, Chih-Yung Hsiao, Chih-Yao Chang, Chao-Tsun Chen, Haibao Natl Taiwan Univ Sci & Technol Dept Informat Management Taipei 10607 Taiwan Tamkang Univ Dept Comp Sci & Informat Engn Taipei 25137 Taiwan Hsiuping Univ Sci & Technol Dept Informat Management Taichung 41280 Taiwan Chuzhou Univ Sch Comp & Informat Engn Chuzhou 239000 Peoples R China

barrier coverage in the area of wireless sensor networks (WSNs) has received much attention in the past few years. To guarantee the competent monitoring quality of intruder detection, it is necessary that the barrier satisfies the k-barrier coverage. However, the efficient construction of the k-barrier whilst maximizing the network lifetime of a given WSN remains an issue. In this paper, an Efficient k-barrier Construction Mechanism (EBCM) is proposed. Three phases are presented in EBCM. First, the Cover Adjacent Net (CA-Net) phase is developed, aiming to simplify the k-barrier coverage problem while reducing the complexity of computation. Second, based on the CA-Net, the construction of defense k-barrier phase is further introduced, aiming to construct a maximum number of distinct k-barriers. Each of the barriers is composed of a minimum number of sensors. Finally, a barrier Energy Scheduling is proposed, aiming to schedule the sleep-wake time of all the constructed barriers for achieving its energy balance purpose. Simulation results show the effectiveness of the proposed mechanisms in terms of control overhead, number of barrier constructed and sensors required, sensor utilization, efficiency and success ratio of barrier construction, and network lifetime.

关键词： k-barrier coverage energy balance wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

k-barrier coverage in wireless sensor networks based on immune particle swarm optimisation

引用

INTERNATIONAL JOURNAL OF SENSOR NETWORkS 2018年第4期27卷 250-258页

作者： Zhang, Yanhua Sun, Xingming Yu, Zhanke Nanjing Univ Informat Sci & Technol Nanjing 210044 Jiangsu Peoples R China Jiangsu Lightning Protect Ctr Nanjing 210007 Jiangsu Peoples R China PLA Univ Sci & Technol Coll Commun Engn Nanjing 210009 Jiangsu Peoples R China

barrier coverage of wireless sensor networks (WSNs) has been an interesting research issue for security applications. In order to increase the robustness of barriers coverage, k-barrier coverage is proposed to address this issue. In this paper, the k-barrier coverage problem is formulated as a global optimisation problem solved by particle swarm optimisation (PSO). However, the performance of PSO greatly depends on its parameters and it often suffers from being trapped in local optima. A novel particle swarm optimisation program named AI-PSO (artificial immune-particle swarm optimisation) is designed and the model of k-barrier coverage problem is proposed to solve this problem. AI-PSO integrates the ability to exploit in PSO with the ability diversity maintenance mechanism of AI (artificial immune) to synthesise both algorithms' strength. Simulation results show that the proposed algorithm is effective for the k-barrier coverage problems.

关键词： k-barrier coverage particle swarm optimisation artificial immune WSNs wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

The k-barrier coverage Mechanism in Wireless Visual Sensor Networks

The <i>k</i>-Barrier Coverage Mechanism in Wireless Visual S...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Chang, Chih-Yung Hsiao, Chih-Yao Chang, Chao-Tsun Tamkang Univ Dept Comp Informat Sci Engn Taipei Taiwan

ISBN: (纸本)9781467304375;9781467304368

Wireless Visual Sensor Networks (WVSNs) consist of a set of camera sensor nodes each of which equips with a camera and is capable of communicating with the other camera sensors within a specific distance range. As an extension of wireless sensor networks (WSNs), the WVSNs can provide richer information such as image and picture during executing targets monitoring and tracking tasks. Since the sensing area of each camera sensor is fan-shaped, existing barrier-coverage algorithms developed for WSNs cannot be applied to the WVSNs. This paper is considering to address the k-barrier coverage problems in WVSNs and to propose a barrier-coverage approach aiming at finding a maximal number of distinct defense curves with each of which consists of as few camera sensors as possible but still guarantees k-barrier coverage. Compared with the related work, experimental study reveals that the proposed k-barrier coverage mechanism constructs more defense curves than the k-barrier coverage and the number of camera sensors participating in each defense curve is smaller.

关键词： k-barrier coverage visual sensor networks wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Minimum Energy Cost k-barrier coverage in Wireless Sensor Networks

Minimum Energy Cost <i>k</i>-barrier Coverage in Wireless Se...

引用

5th International Conference, WASA 2010

作者： Yang, Huiqiang Li, Deying Zhu, Qinghua Chen, Wenping Hong, Yi Renmin Univ China Key Lab Data Engn & Knowledge Engn MOE Sch Informat Beijing Peoples R China

ISBN: (纸本)9783642146534

barrier coverage problem is one of important issues in wireless sensor networks. In this paper we study the minimum energy cost k-barrier coverage problem in wireless sensor network in which each sensor has l + 1 sensing power levels. First, we transform the minimum energy cost k-barrier coverage problem into a minimum cost flow problem with side constraints. Then we use Lagrangian relaxation technique to solve this minimum cost flow problem. Moreover, we propose two efficient heuristics for the minimum energy cost k-barrier coverage problem. Simulations evaluate that our algorithms are efficient.

关键词： k-barrier coverage sensing power level minimum energy cost sensor networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：