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

The Target-Barrier coverage problem in Wireless Sensor Networks

IEEE TRANSACTIONS ON MOBILE COMPUTING 2018年第5期17卷 1216-1232页

作者： Cheng, Chien-Fu Wang, Chen-Wei Tamkang Univ Dept Comp Sci & Informat Engn New Taipei 251 Taiwan Tamkang Univ Grad Inst Networking & Multimedia New Taipei 251 Taiwan Inst Informat Ind Taipei 106 Taiwan

In this paper, we define a new type of coverage problem named target-barrier coverage problem in wireless sensor networks. A target-barrier is a continuous circular barrier formed around the target. The target-barrier has a d(bound) constraint that is set depending on applications and needs, where d(bound) is the minimum distance of the constructed barrier from the target. Target-barrier coverage is very suited for application in defense surveillance, including detection of intrusion from outside and prevention of barrier breaching from inside. For instance, in a jail scenario, sensors can be deployed to enclose a jail with the constraint of d(bound) to detect the escape of prisoners or unauthorized entry into the jail for rescuing prisoners. We focus on how to minimize the number of members required to construct target-barriers in a distributed manner while satisfying the d(bound) constraint and minimizing the amount of message exchange required. In performance evaluation, we compare our solution with the solution of related work and the Brute-Force algorithm which can find the minimum number of target-barrier members required. Our experimental results show that the proposed algorithm delivers satisfactory results in terms of the number of target-barrier members required and the amount of message exchange required.

关键词： Wireless sensor networks coverage problem target-barrier coverage

来源：评论

学校读者我要写书评

暂无评论

Solving the constrained coverage problem

引用

APPLIED SOFT COMPUTING 2011年第1期11卷 963-969页

作者： Davoodi, Mansoor Mohades, Ali Amirkabir Univ Technol Dept Math & Comp Sci Lab Algorithms & Computat Geometry Tehran Iran

coverage problem which is one of the challenging problems in facility location studies, is NP-hard. In this paper, we focus on a constrained version of coverage problem in which a set of demand points and some constrained regions are given and the goal is to find a minimum number of sensors which covers all demand points. A heuristic approach is presented to solve this problem by using the Voronoi diagram and p-center problem's solution. The proposed algorithm is relatively time-saving and is compared with alternative solutions. The results are discussed, and concluding remarks and future work are given. (c) 2010 Elsevier B. V. All rights reserved.

关键词： coverage problem p-Center problem Voronoi diagram Heuristic algorithms Sensor networks

来源：评论

学校读者我要写书评

暂无评论

A leader-follower game for the point coverage problem in wireless sensor networks

引用

EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING 2013年第5期7卷 635-656页

作者： Basdere, Mehmet Aras, Necati Altinel, I. Kuban Afsar, Sezin Bogazici Univ Fac Engn Dept Ind Engn TR-34342 Istanbul Turkey Inria Lille Nord Europe F-59650 Villeneuve Dascq France

Sensors form an effective wireless network for the surveillance of a region. Ensuring coverage is an important issue in wireless sensor network design. This paper focuses on an application where sensors are used to detect intruders. The defender wants to determine the best locations of the sensors to maximise the point coverage in the area with the anticipation that an intruder will attack and destroy some of the sensors to reduce the coverage. This sequential game between the defender and the intruder is modelled using bilevel programming. Two models are formulated: a bilevel pure integer linear programme (BPILP) where an attacked sensor is destroyed completely and a bilevel mixed integer linear programme (BMILP) where a damaged sensor continues to operate at a reduced capacity. Since BPILP and BMILP models are difficult to solve exactly, solution methods based on local search and tabu search are proposed, which are hybridised with an exact method.

关键词： sensor networks coverage problem bilevel programming matheuristics tabu search

来源：评论

学校读者我要写书评

暂无评论

k-Angle Object coverage problem in a Wireless Sensor Network

引用

IEEE SENSORS JOURNAL 2012年第12期12卷 3408-3416页

作者： Tseng, Yu-Chee Chen, Po-Yu Chen, Wen-Tsuen Natl Chiao Tung Univ Dept Comp Sci Hsinchu 300 Taiwan Acad Sinica Inst Informat Sci Taipei 115 Taiwan

One of the fundamental issues in sensor networks is the coverage problem, which reflects how well a field is monitored or tracked by sensors. Various versions of this problem have been studied, such as object, area, barrier, and hole coverage problems. In this paper, we define a new k-angle object coverage problem in a wireless sensor network. Each sensor can only cover a limited angle and range, but can freely rotate to any direction to cover a particular angle. Given a set of sensors and a set of objects at known locations, the goal is to use the least number of sensors to k-angle-cover the largest number of objects such that each object is monitored by at least k sensors satisfying some angle constraint. We propose centralized and distributed polynomial-time algorithms to solve this problem. Simulation results show that our algorithms can be effective in maximizing coverage of objects. A prototype system is developed to demonstrate the usefulness of angle coverage.

关键词： coverage problem pervasive computing sensor network video surveillance wireless network

来源：评论

学校读者我要写书评

暂无评论

Exact Biobjective Optimization Methods for Camera coverage problem in Three-Dimensional Areas

引用

IEEE SENSORS JOURNAL 2016年第9期16卷 3323-3331页

作者： Rebai, Maher le Berre, Matthieu Hnaien, Faicel Snoussi, Hichem Univ Haute Alsace Math Informat & Applicat Lab F-68093 Mulhouse France Univ Technol Troyes Inst Charles Delaunay F-10004 Troyes France

This paper deals with the problem of deploying necessary camera sensors ensuring the maximum sum of weighted target points in 3-D areas while minimizing the total sensor network camera cost. The problem is NP-complete as it can be considered as a total grid coverage problem, which is an NP-complete problem when the sensing field is a 2-D area. We solve the problem optimally by three exact biobjective methods: 1) weighted sum scalarization approach;2) a two-phase method;and 3) an epsilon-constraint method. The simulation results show that each adopted resolution approach dominates the other approaches in at least one criterium when the problem size increases and the resolution process is stopped after a predefined computation time limit.

关键词： coverage problem sensor camera deployment exact bi-objective optimization methods

来源：评论

学校读者我要写书评

暂无评论

The critical-square-grid coverage problem in wireless sensor networks is NP-Complete

引用

COMPUTER NETWORKS 2011年第9期55卷 2209-2220页

作者： Ke, Wei-Chieh Liu, Bing-Hong Tsai, Ming-Jer Natl Kaohsiung Univ Appl Sci Dept Elect Engn Kaohsiung 80778 Taiwan Natl Tsing Hua Univ Dept Comp Sci Hsinchu 30013 Taiwan

Wireless sensor networks are formed by connected sensors, each of which has the ability to collect, process, and store environmental information as well as communicate with others via inter-sensor wireless communication. These characteristics allow wireless sensor networks to be used in a wide range of applications. In many applications, such as smart home, fire fighting system, nuclear, biological, and chemical (NBC) attack detection, and so on, critical areas and common areas must be distinguished adequately. It is more practical and efficient to monitor critical areas rather than common areas if the sensor field is large, or the available budget cannot provide enough sensors to fully cover the entire field. In most available state-of-the-art sensor deployment algorithms, the sensor field is divided into square grid cells and sensors are deployed on constrained locations such as grid points. To study the computational complexity of sensor deployment, the problem of deploying the minimum number of sensors on grid points to construct a wireless sensor network fully covering critical square grid cells, termed critical-square-grid coverage, is introduced and shown to be NP-Complete in this paper. (C) 2011 Elsevier B.V. All rights reserved.

关键词： coverage problem NP-Complete problem Sensor deployment Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Novel Grid Point Approach for Efficiently Solving the Constellation-to-Ground Regional coverage problem

引用

IEEE ACCESS 2018年 6卷 44445-44458页

作者： Song, Zhiming Dai, Guangming Wang, Maocai Chen, Xiaoyu China Univ Geosci Sch Comp Wuhan 430074 Hubei Peoples R China China Univ Geosci Hubei Key Lab Intelligent Geoinformat Proc Wuhan 430074 Hubei Peoples R China

The constellation-to-ground coverage problem is a basic and important problem in satellite applications. The grid-point approach (GPA) is one of the most commonly used approaches to solving this problem. However, this approach also has some serious drawbacks. A group of strategies that can improve or overcome the drawbacks of this approach are proposed. The spatial and temporal characteristics of the GPA were analyzed, and a strategy that can compute the upper and lower bounds of the result was given. This strategy can not only acquire the result but can also yield the error range of the result. In addition, a strategy that uses low-precision results to compute a high-precision result is proposed. Simulation experiments of different types of coverage problems were conducted, and the results show that these strategies are effective.

关键词： Satellite Constellation coverage problem Grid Point Approach Solution Algorithm

来源：评论

学校读者我要写书评

暂无评论

Cellular automata rules solving the wireless sensor network coverage problem

引用

NATURAL COMPUTING 2022年第3期21卷 417-447页

作者： Hoffmann, Rolf Deserable, Dominique Seredynski, Franciszek Tech Univ Darmstadt Darmstadt Germany Inst Natl Sci Appl Rennes France Cardinal Stefan Wyszynski Univ Dept Math & Nat Sci Warsaw Poland

The problem of an optimal coverage of a wireless sensor network area is considered. To solve this problem, a Cellular Automata (CA) approach is proposed. More specifically, the objective is to find CA rules which are able to cover the 2D space by a minimum number of so-called "Sensor Tiles". A sensor tile consists of a von Neumann neighborhood of range 2 centered at sensor "point" and surrounded by 12 sensing "pixels". Two probabilistic CA rules were designed that can perform this task. Results of an experimental study show that the first rule evolves very fast stable sub-optimal coverings, starting from a random configuration. The second rule finds optimal coverings, however it needs much more time for their evolution. The results are supported by a theoretical study on von Neumann neighborhoods and borrowing either from heuristics or from the spectral theory of circulant graphs.

关键词： coverage problem Wireless sensor network Probabilistic cellular automata Asynchronous updating Matching templates Von Neumann neighborhoods Circulant graphs

来源：评论

学校读者我要写书评

暂无评论

Using Artificial Plant Optimization Algorithm to Solve coverage problem in WSN

引用

SENSOR LETTERS 2012年第8期10卷 1666-1675页

作者： Cui, Zhihua Yang, Hongjuan Shi, Zhongzhi Taiyuan Univ Sci & Technol Complex Syst & Computat Intelligence Lab Taiyuan 030024 Shanxi Peoples R China Chinese Acad Sci Inst Comp Technol Key Lab Intelligent Informat Proc Beijing 100190 Peoples R China

Recently, a new stochastic optimization algorithm which is called artificial photosynthesis and phototropism mechanism (APPM) is proposed containing two operators to mimic photosynthesis and phototropism mechanisms. In this paper, a new variant of APPM is proposed by adding additional new apical dominance operator;and the phototropism operators is re-designed, to avoid the confusion, we call it as artificial plant optimization algorithm (APOA). To testify the performance, five famous benchmarks are selected, simulation results show APOA is better than APPM. Furthermore, APOA is used to solve coverage optimization problem which is one crucial problem in wireless sensor networks. Simulation results show APOA achieves better node distribution than other two algorithms.

关键词： APOA Apical Dominance Operator Photosynthesis Operator Phototropism Operator coverage problem

来源：评论

学校读者我要写书评

暂无评论

Hybrid algorithm optimization for coverage problem in wireless sensor networks

引用

TELECOMMUNICATION SYSTEMS 2022年第1期80卷 105-121页

作者： Jia, Han-Dong Chu, Shu-Chuan Hu, Pei Kong, LingPing Wang, XiaoPeng Snasel, Vaclav Jiang, Tong-Bang Pan, Jeng-Shyang Shandong Univ Sci & Technol Coll Comp Sci & Engn Qingdao 266590 Peoples R China Nanyang Inst Technol Sch Software Nanyang 473004 Peoples R China VSB Tech Univ Ostrava Fac Elect Engn & Comp Sci Ostrava 70800 Czech Republic Dalian Maritime Univ Dept Intelligence Sci & Technol Dalian 116026 Peoples R China Chaoyang Univ Technol Dept Informat Management Taichung Taiwan

With the continuous development of evolutionary computing, many excellent algorithms have emerged, which are applied in all walks of life to solve various practical problems. In this paper, two hybrid fish, bird and insect algorithms based on different architectures are proposed to solve the optimal coverage problem in wireless sensor networks. The algorithm combines the characteristics of three algorithms, namely, particle swarm optimization algorithm, Phasmatodea population evolution algorithm and fish migration optimization algorithm. The new algorithm has the advantages of the three algorithms. In order to prove the effectiveness of the algorithm, we first test it on 28 benchmark functions. The results show that the two hybrid fish, bird and insect algorithms with different architectures have significant advantages. Then we apply the proposed algorithm to solve the coverage problem of wireless sensor networks through experimental simulation. The experimental results show the advantages of our proposed algorithm and prove that our proposed hybrid fish, bird and insect algorithm is suitable for solving the coverage problem of wireless sensor networks.

关键词： Evolutionary computation Phasmatodea population evolution algorithm Fish migration optimization coverage problem Wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：