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

barrier coverage Mechanism Using Adaptive Sensing Range for Renewable WSNs

IEEE ACCESS 2020年 8卷 86065-86080页

作者： Dong, Zaixiu Shang, Cuijuan Chang, Chih-Yung Roy, Diptendu Sinha Chuzhou Univ Sch Comp & Informat Engn Chuzhou 239000 Peoples R China Tamkang Univ Dept Comp Sci & Informat Engn New Taipei 25137 Taiwan Natl Inst Technol Meghalaya Dept Comp Sci & Engn Shillong 793003 Meghalaya India

barrier coverage aims at constructing defense barriers to detect the intruder crossing the predefined boundary in a given wireless sensor network. In literature, most studies considered the battery-powered sensors and applied the Boolean Sensing Model (BSM). The battery-powered sensors have the constraint of limited lifetime while the BSM will affect the actual surveillance quality evaluation because it cannot reflect the physical features of sensing. This paper applies the Probabilistic Sensing Model (PSM) and proposes an algorithm, called BSAS, which considers the solar-powered sensors with adjustable sensing radius to construct the defense barriers. Two main challenges should be overcome. The first one is the cooperative working between sensors to achieve the highest intruder detection probability for a given boundary curve. The BSAS identifies the bottleneck segment with the minimal surveillance quality and schedules as many as possible sensors to improve the bottleneck segment. In addition, a space-time transformation scheme which further adjusts the sensing radius of some sensors is proposed, aiming at improving the detection probability of the bottleneck segment. Consequently, the minimal surveillance quality of the barrier can be maximized. The second challenge is to maintaining the perpetual lifetime of WSNs. The BSAS takes into account the recharging and discharging ratio and time length of daytime in a day in its energy management which guarantees that the sensor energy can always satisfy the energy consumption for sensor working even in the nighttime. Experimental studies reveal that the proposed algorithm outperforms the existing studies in terms of surveillance quality and stability.

关键词： Solar-powered sensor probabilistic sensing model adjustable sensing radius barrier coverage wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

barrier coverage with wireless sensors

引用

WIRELESS NETWORKS 2007年第6期13卷 817-834页

作者： Kumar, Santosh Lai, Ten H. Arora, Anish Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

When a sensor network is deployed to detect objects penetrating a protected region, it is not necessary to have every point in the deployment region covered by a sensor. It is enough if the penetrating objects are detected at some point in their trajectory. If a sensor network guarantees that every penetrating object will be detected by at least k distinct sensors before it crosses the barrier of wireless sensors, we say the network provides k-barrier coverage. In this paper, we develop theoretical foundations for k-barrier coverage. We propose efficient algorithms using which one can quickly determine, after deploying the sensors, whether the deployment region is k-barrier covered. Next, we establish the optimal deployment pattern to achieve k-barrier coverage when deploying sensors deterministically. Finally, we consider barrier coverage with high probability when sensors are deployed randomly. The major challenge, when dealing with probabilistic barrier coverage, is to derive critical conditions using which one can compute the minimum number of sensors needed to ensure barrier coverage with high probability. Deriving critical conditions for k-barrier coverage is, however, still an open problem. We derive critical conditions for a weaker notion of barrier coverage, called weak k-barrier coverage.

关键词： wireless sensor networks barrier coverage network topology

来源：评论

学校读者我要写书评

暂无评论

barrier coverage in energy harvesting sensor networks

引用

AD HOC NETWORKS 2017年 56卷 72-83页

作者： DeWitt, Jonathan Shi, Hongchi Haverford Coll Dept Comp Sci Haverford PA 19041 USA Texas State Univ Dept Comp Sci San Marcos TX 78666 USA

Wireless Sensor Networks (WSNs) can be used effectively to form barriers that monitor strips of land for applications such as homeland security and critical infrastructure protection. When WSNs are used as barriers, they are typically deployed for extended period of time, so it is of great importance that the network has a long lifetime. Sensors are highly constrained in their energy usage, even when deploying the current energy-harvesting technology. It is necessary that the harvested energy be used effectively. The lifetime problem for WSNs with no energy harvesting has been studied extensively. In this paper, we study lifetime issues of the k-barrier coverage problem for energy harvesting WSNs. First we develop an algorithm that finds a repeating sleep/wakeup schedule that can provide the perpetual operation of the maximum number of barriers in an energy harvesting WSN. Then in the case that perpetual operation can not be achieved, we give an exact solution to the problem of achieving maximum lifetime for the application of k-barrier coverage in energy harvesting WSNs. (C) 2016 Elsevier B.V. All rights reserved.

关键词： barrier coverage Energy harvesting Wireless sensor networks Multi-route flows

来源：评论

学校读者我要写书评

暂无评论

barrier coverage in wireless sensor networks with adjustable sensing ranges

引用

INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING 2014年第1-3期15卷 121-132页

作者： Deng, Xianjun Wang, Bang Wang, Changqing Liu, Wenyu Huazhong Univ Sci & Technol Wuhan 430074 Hubei Peoples R China Univ South China Hengyang 421001 Hunan Peoples R China

In this paper, we study the barrier lifetime maximisation (BLM) and barrier gap mending (BGM) problem in a sensor network, where sensors can choose to use different sensing ranges when constructing a sensor barrier. In the BLM problem, for small-scale sensor networks, we propose a linear programming optimisation method. For large-scale sensor networks, we propose two distributed heuristics to select a next node to construct barriers. Simulation results show that compared with the randomised one, the greedy scheme can achieve longer lifetime. In the BGM problem, we study how to efficiently mend barrier gaps in a hybrid sensor network consisting of both stationary and mobile sensors. We propose two gap mending schemes: the min-max scheme to minimise the maximal energy consumption to move sensors, and the max-lifetime scheme to maximise the lifetime of barrier coverage after mending all gaps. Simulation results show that the min-max scheme can achieve a lower maximal moving distance and the max-lifetime scheme can efficiently extend the barrier lifetime.

关键词： barrier coverage BLM barrier lifetime maximisation BGM barrier gaps mending adjustable sensing ranges ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

barrier coverage in adjustable-orientation directional sensor networks: A learning automata approach

引用

COMPUTERS & ELECTRICAL ENGINEERING 2018年 72卷 859-876页

作者： Khanjary, Mohammad Sabaei, Masoud Meybodi, Mohammad Reza Islamic Azad Univ Sci & Res Branch Comp & Elect Engn Dept Tehran Iran Amirkabir Univ Technol Comp Engn & Informat Technol Dept Tehran Iran

barrier coverage is one of the main applications of wireless sensor networks. There are two kinds of barrier coverage: weak and strong. While weak barrier coverage can only guarantee detecting intruders moving along predetermined or congruent paths, strong barrier coverage guarantees detecting all intruders regardless of their crossing paths. In this paper, we first present a centralized algorithm based on distributed learning automata to find strong barrier lines in adjustable-orientation directional sensor networks in which nodes can adjust their orientation in a non-overlapping form such as camera sensor networks. Then, we will present the distributed version of the proposed algorithm to be used in practical sensor networks. Moreover, the results of extensive simulations will be presented to compare the performance of proposed algorithms against the optimal algorithm, a greedy algorithm and a previously-proposed algorithm. The results confirm that the proposed algorithms achieve near-optimal results and outcome other algorithms completely. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： barrier coverage Percolation Learning automata Directional sensor networks Camera sensor networks

来源：评论

学校读者我要写书评

暂无评论

barrier coverage Quality Improvement for AI-Based Passive Bistatic Radar Networks

引用

IEEE SENSORS JOURNAL 2021年第22期21卷 25379-25390页

作者： Chen, Jiaoyan Yang, Laurence T. Deng, Xianjun Wang, Yuhao Zhao, Zhixin Wuhan Univ Sci & Technol Sch Informat Sci & Engn Wuhan 430081 Peoples R China St Francis Xavier Univ Dept Comp Sci Antigonish NS B2G 2W5 Canada Huazhong Univ Sci & Technol Sch Cyber Sci & Engn Wuhan 430074 Peoples R China Nanchang Univ Sch Informat Engn Nanchang 330031 Jiangxi Peoples R China

Artificial Intelligent based smart Internet of Things (AI-based IoTs) refers to a network that has sensing data analysis function and network automatic management functions such as self-diagnosis and self-healing function. Among them, self-healing function is a critical problem in an AI-based Passive Bistatic Radar Sensor Network (PBRSN). Much different from active bistatic radar, transmitters in PBRSN are not deployed by network designer and may be out of work due to some irresistible reasons, then the coverage quality of a protected region cannot be satisfied. Therefore, how to localize barrier gap accurately and mend barrier gap quickly are the most important issues in a PBRSN. In this paper, we study the problem of how to automatically localize barrier gap and compute the locations of new receivers for coverage quality improvement in a PBRSN with an AI-based smart node, where the network was providing K barriers coverage for a protected region by adopting receivers optimal deployment strategy. First, we design an algorithm to localize all barrier gaps, and then an algorithm called Deployment Line between Sub-barriers Algorithm (DLSA) is designed to compute the locations of new receivers inside gap region with the objective of minimizing the total number of new receivers. Finally, extensive simulations are conducted to validate the correctness and effectiveness of our proposed algorithms. The simulation results show that our gap finding algorithm can localize all barrier gaps accurately. While the DLSA can mend a barrier gap with fewer receivers if there is at least one working transmitter in this barrier.

关键词： AI-based smart IoTs barrier coverage AI-based passive bistatic radar sensor network gap localization gap mending

来源：评论

学校读者我要写书评

暂无评论

barrier coverage of WSNs with the imperialist competitive algorithm

引用

JOURNAL OF SUPERCOMPUTING 2017年第11期73卷 4957-4980页

作者： Mostafaei, Habib Shojafar, Mohammad Zaher, Bahman Singhal, Mukesh Roma Tre Univ Dept Engn Via Vasca Navale 79 I-00146 Rome Italy Sapienza Univ Rome Dept Informat Engn Elect & Telecommun Rome Italy Univ Roma Tor Vergata Dept Elect Engn CNIT Ctr Natl Consortium Interuniv Telecommun Via Politecn 1 I-00133 Rome Italy Islamic Azad Univ Shabestar Branch Dept Comp Engn Shabestar Iran Univ Calif Merced Comp Sci & Engn Merced CA USA

barrier coverage in wireless sensor networks has been used in many applications such as intrusion detection and border surveillance. barrier coverage is used to monitor the network borders to prevent intruders from penetrating the network. In these applications, it is critical to find optimal number of sensor nodes to prolong the network lifetime. Also, increasing the network lifetime is one of the important challenges in these networks. Various algorithms have been proposed to extend the network lifetime while guaranteeing barrier coverage requirements. In this paper, we use the imperialist competitive algorithm (ICA) for selecting sensor nodes to do barrier coverage monitoring operations called ICABC. The main objective of this work is to improve the network lifetime in a deployed network. To investigate the performance of ICABC, several simulations were conducted and the results of the experiments show that the ICABC significantly improves the performance than other state-of-art methods.

关键词： barrier coverage Imperialist competitive algorithm (IC A) Wireless sensor networks (WSNs) Border surveillance

来源：评论

学校读者我要写书评

暂无评论

Double barrier coverage in Dense Sensor Networks

引用

Journal of Computer Science & Technology 2008年第1期23卷 154-164,F0003页

作者：蒋承东陈国良 Department of Computer Science and Technology University of Science and Technology of China

When a sensor network is deployed to detect objects penetrating a protected region, it is not necessary to have every point in the deployment region covered by a sensor. It is enough if the penetrating objects are detected at some point in their trajectory. If a sensor network guarantees that every penetrating object will be detected by two distinct sensors at the same time somewhere in this area, we say that the network provides double barrier coverage （DBC）. In this paper, we propose a new planar structure of Sparse Delaunay Triangulation （SparseDT）, and prove some elaborate attributes of it. We develop theoretical foundations for double barrier coverage, and propose efficient algorithms with NS2 simulator using which one can activate the necessary sensors to guarantee double barrier coverage while the other sensors go to sleep. The upper and lower bounds of number of active nodes are determined, and we show that high-speed target will be detected efficiently with this configuration.

关键词： wireless sensor network barrier coverage Delaunay triangulation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

barrier coverage with wireless sensors 05

Barrier coverage with wireless sensors

引用

11th Annual ACM International Conference on Mobile Computing and Networking

作者： Kumar, Santosh Lai, Ten H. Arora, Anish Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

ISBN: (纸本)9781595930200

关键词： wireless sensor networks barrier coverage network topology

来源：评论

学校读者我要写书评

暂无评论

barrier coverage Deployment Algorithms for Mobile Sensor Networks

Barrier Coverage Deployment Algorithms for Mobile Sensor Net...

引用

13th International Joint Conference on Computer Science and Software Engineering (JCSSE)

作者： Tri Gia Nguyen So-In, Chakchai Nhu Gia Nguyen Duy Tan Univ Fac Informat Technol Da Nang Vietnam Khon Kaen Univ Dept Comp Sci Khon Kaen Thailand Duy Tan Univ Grad Sch Da Nang Vietnam

barrier coverage is one of the most important issues in wireless sensor networks (WSNs), and it has been a popular area of WSN research in recent years. Maximizing the number of barrier paths is one of the key factors in the design of barrier coverage algorithms for WSNs. This study proposes a novel concept to optimize the number of barrier paths by minimizing the total moving distance and the number of moving sensor nodes or sensors using two algorithms. After an initial random placement of the sensors, the first approach applies a heuristic method to move all sensors close to the optimal location to maximize the total number of barrier paths. The second approach is used to determine the barrier paths based on a coverage graph and then fill up the barrier gaps by moving the other sensors that do not belong to any available barrier path. The simulation results show that our two proposed algorithms exhibit improved barrier coverage. The results also demonstrate the effectiveness of our algorithms when compared with other competitive approaches, such as Cbarrier and BCLD. The first approach is more suitable for a high degree of fault-tolerant coverage, while the second approach can achieve the optimal number of moving sensors and total moving distance.

关键词： barrier coverage coverage graph Heuristic Sensor deployment Wireless sensor networks (WSNs)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：