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

1st International Conference on Computer, Communications, and Control Technology (I4CT)

作者： Diop, Babacar Diongue, Dame Thiare, Ousmane Gaston Berger Univ BP 234 St Louis Senegal

ISBN: (纸本)9781479945559

Recent improvements in affordable and efficient integrated electronic devices have enabled a wide range of applications in the estate of wireless sensor networks. An important issue addressed in wireless sensor networks is the coverage problem. This latter is centered on a fundamental question: how well do the sensors observe the physical space? A major challenge in coverage problem is how to maximize the lifetime of the network while ensuring coverage of a set of targets. To achieve this, the usual process, consists on scheduling sensors activity, which enables energy dissipation control. Scheduling process goes by activating sensors by round such that in each round, only one subset of sensors that satisfies the coverage requirement is activated, while all other sensors are in a low energy mode and will be activated later. In this paper, we propose a weight-based greedy algorithm (WGA) which organizes sensors in multiple subsets. Our objective is to partition an initial set of sensors into a maximum possible number of sensors set covers (SSCs), which can completely monitor targets in a region of interest. Performance evaluation of WGA have proven its efficiency over some well-known algorithms proposed in the literature, in term of computed set covers.

关键词： Wireless Sensor Network target coverage Sensor Set Cover Greedy Algorithm

来源：评论

学校读者我要写书评

暂无评论

The target coverage Problem in Directional Sensor Networks with Rotatable Angles

The Target Coverage Problem in Directional Sensor Networks w...

引用

6th International Conference on Grid and Pervasive Computing (GPC)/International Workshop on Health and Well-Being Technologies and Services for Elderly (HWTS)/International Workshop on Self-Managing Solutions for Smart Environments (S3E)

作者： Liang, Chiu-Kuo Chen, Yen-Ting Chung Hua Univ Dept Comp Sci & Informat Engn Hsinchu 30012 Taiwan

ISBN: (纸本)9783642207549

Directional sensor network is composed of many directional sensor nodes. Unlike conventional omni-directional sensors that always have an omni-angle of sensing range, directional sensors may have a limited angle of sensing range due to technical constraints or cost considerations. Therefore, it is possible that when directional sensor nodes are randomly scattered in the environment, some interested targets cannot be covered due to the limited angle of sensing direction even if the targets are located in the sensing range of sensors. We propose a Maximum coverage with Rotatable Angles (MCRA) problem in which coverage in terms of the number of targets to be covered is maximized whereas the degree of angles to be rotated is minimized. We present two centralized greedy algorithm solutions for the MCRA problem. Simulation results are presented to apply angle adjustment algorithm to enhance the coverage of the directional sensor network.

关键词： Directional sensor networks target coverage rotatable angles

来源：评论

学校读者我要写书评

暂无评论

Review on target coverage and Network Connectivity in Mobile Sensor Networks 2

Review on Target Coverage and Network Connectivity in Mobile...

引用

2nd International Conference on Electronics and Communication Systems (ICECS)

作者： Karegaonkar, Sonali M. Raut, Archana R. GH Raisoni Coll Engn Dept Comp Sci & Engn Nagpur Maharashtra India

ISBN: (纸本)9781479972258

target coverage and network connectivity are two main challenging and practically important issues of Mobile Sensor Networks (MSNs). target coverage covers a set of specified points of interest in the deployment region of a WSN. target coverage guarantees that every location in the sensing field is covered by at least one sensor and Network Connectivity guarantees that there are sufficient routing paths between sensors. Connectivity is necessary for sensors to collect data and report data to the sink node. target coverage and Network Connectivity may also affect the quality of network. Many studies have been introduced to improve the quality of coverage and network connectivity. In this paper, the study of different approaches which improves quality of both target coverage and Network connectivity, are presented with their features and drawbacks. Improving both target coverage and Network Connectivity by minimizing the number of sensors used and sensor's movement distance is the important issue in mobile sensor network.

关键词： Wireless sensor networks target coverage Network connectivity mobile sensors Energy consumption Network life-time

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Probabilistic target coverage in Wireless Sensor Networks

Energy-Efficient Probabilistic Target Coverage in Wireless S...

引用

17th IEEE International Conference on Networks (ICON)

作者： Huang, Jau-Wu Hung, Chia-Mao Yang, Kai-Chao Wang, Jia-Shung Natl Tsing Hua Univ Dept Comp Sci Taipei Taiwan

ISBN: (纸本)9781457718250

The coverage problems have been studied in the recent years, most of them with limited detection capability therefore some pivotal sensors consume energy rapidly and there exist a large amount of partially unused sensors when the network lifetime terminated. We introduce an M-M (multiple sensors to multiple targets) probabilistic target coverage problem and its service solution for the wireless sensor networks (WSNs) in this paper to improve the utilization of randomly deployed sensors and to maximize the network lifetime as well. The intention of the M-M probabilistic target coverage problem is to detect/cover multiple targets by multiple sensors cooperatively and simultaneously, where each target is given a realistic detection probability threshold. We designed a heuristic algorithm to solve this problem. Simulation results show that the resulting network lifetime of our algorithm are longer than the target coverage approach, and our algorithm is more appropriate for the demand of the different observed target importance.

关键词： target coverage wireless sensor network detection probability sensor scheduling network lifetime

来源：评论

学校读者我要写书评

暂无评论

Efficient target coverage in WSNs with bidirectional communication

Efficient target coverage in WSNs with bidirectional communi...

引用

2010 15th IEEE International Workshop on Computer Aided Modeling, Analysis and Design of Communication Links and Networks, CAMAD 2010

作者： Zorbas, Dimitrios Douligeris, Christos Department of Informatics University of Piraeus 80 Karaoli and Dimitriou Str. 18534 Greece

ISBN: (纸本)9781424476350

Several applications in wireless sensor networks require a bidirectional communication between the sensing nodes and the sink. A number of relay nodes is used to achieve this bidirectional communication. The relay nodes adjust their communication range in order to consume less energy, constructing an asymmetric network with unidirectional links. In this paper, we examine the case where a bidirectional path must be established between the sensing nodes and the sink, focusing on the extension of the network lifetime. We propose an efficient heuristic that establishes two unidirectional paths in order to distribute the communication cost among the nodes. Our evaluation shows an over 20% improvement in some cases compared to the commonly used approach where a single bidirectional path is used. © 2010 IEEE.

关键词： WSN asymmetric network bidirectional communication relay nodes target coverage telecommunication network routing unidirectional link wireless sensor network wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

target coverage in Wireless Sensor Networks with Probabilistic Sensors

引用

SENSORS 2016年第9期16卷 1372-1372页

作者： Shan, Anxing Xu, Xianghua Cheng, Zongmao Hangzhou Dianzi Univ Sch Comp Sci Hangzhou 310018 Zhejiang Peoples R China Hangzhou Dianzi Univ Sch Sci Hangzhou 310018 Zhejiang Peoples R China

Sensing coverage is a fundamental problem in wireless sensor networks (WSNs), which has attracted considerable attention. Conventional research on this topic focuses on the 0/1 coverage model, which is only a coarse approximation to the practical sensing model. In this paper, we study the target coverage problem, where the objective is to find the least number of sensor nodes in randomly-deployed WSNs based on the probabilistic sensing model. We analyze the joint detection probability of target with multiple sensors. Based on the theoretical analysis of the detection probability, we formulate the minimum E-detection coverage problem. We prove that the minimum E-detection coverage problem is NP-hard and present an approximation algorithm called the Probabilistic Sensor coverage Algorithm (PSCA) with provable approximation ratios. To evaluate our design, we analyze the performance of PSCA theoretically and also perform extensive simulations to demonstrate the effectiveness of our proposed algorithm.

关键词： wireless sensor networks target coverage probabilistic sensor

来源：评论

学校读者我要写书评

暂无评论

target coverage using a Collaborative Platform for Sensor Cloud

Target Coverage using a Collaborative Platform for Sensor Cl...

引用

IEEE International Conference on Advanced Networks and Telecommuncations Systems

作者： Biplab K. Sen Sunirmal Khatua Rajib K. Das Department of Computer Science and Engineering University of Calcutta

ISBN: (纸本)9781509002948

Nowadays Sensor-cloud has received a lot of interests among researchers in the field of Wireless Sensor Networks (WSN) as well as Cloud Computing. An integral part of the Sensor Cloud platform is the Collaboration of WSN providers which improves the utilization of sensor resources. The physical sensors in such a collaborative environment are shared among multiple applications from different administrative domains. In this paper, we propose a Sensor Cloud Architecture which allows the users to deploy their sensor applications on-demand within the collaborative platform. The sensor resources used by the application are provided as a service to the user. The cost for offering such service depends on the number of physical sensors selected for covering the targets (locations of interest) for that application as well as connecting the selected physical sensors to the base station. In this paper, we proposed a two phase algorithm for this problem. In the first phase (coverage), an Integer Programming Problem (IPP) is used to find a minimum set of sensors to cover the targets. In the next phase (Connectivity) a heuristic is used to extend the set such that connectivity of all the selected sensors is ensured. The performance of the proposed approach is validated through simulation which shows significant improvement of using collaboration over multiple non-collaborative WSNs. We also establish the superiority of the heuristic for ensuring connectivity over one such algorithm in the literature.

关键词： Virtual sensor Collaborative network Sensor cloud target coverage

来源：评论

学校读者我要写书评

暂无评论

An enhanced genetic algorithm for path planning of autonomous UAV in target coverage problems

引用

APPLIED SOFT COMPUTING 2021年 112卷 107796-107796页

作者： Pehlivanoglu, Y. Volkan Pehlivanoglu, Perihan Biruni Univ Protokol Yolu 4510 Yil Cd TR-34010 Istanbul Turkey

Unmanned aerial vehicles (UAV) have become an important and integral part of military and civilian operations in recent years. In many UAV missions, the main purpose is to visit some predetermined checkpoints in operational space. If the number of checkpoints and constraints increases, finding a feasible solution may take up too much time. In this paper;the path planning problem of autonomous UAV in target coverage problems is solved by using artificial intelligent methods including genetic algorithm (GA), ant colony optimizer (ACO), Voronoi diagram, and clustering methods. The main contribution of this article is to propose initial population enhancement methods in GA, and thus accelerate convergence process. The first common enhancement to basic GA structure is to generate a sub-optimal path by implementing ACO. A sub-optimal path can be used to generate initial individuals. However, sub-optimal paths may have the problem that is collision with terrain. To avoid a UAV from any crash three approaches are integrated into an initial population phase of genetic algorithm. The first approach includes Voronoi vertices as additional waypoints to keep clear of trouble. The second approach consists of cluster centers which forms Voronoi vertices as supplemental waypoints. The final proposal comprises again cluster centers but based on a set of collision points. The proposed methods are tested in different three dimensional (3D) environments and the results are compared. Performance results show that collision with terrain surface is a local phenomenon and solving this issue by using the cluster center of collision points provides the best result including at least 70% or much more decrease in the required number of objective function evaluations. (C) 2021 Elsevier B.V. All rights reserved.

关键词： Autonomous UAV Path planning target coverage Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Combined Barrier-target coverage for Directional Sensor Network

引用

SENSORS 2024年第24期24卷 8093页

作者： Kosa, Balazs Bukovinszki, Mark Michaletzky, Tamas V. Tihanyi, Viktor TECHTRA Technol Transfer Inst H-1113 Budapest Hungary Szecheny Istvan Univ H-9026 Gyor Hungary

Over the past twenty years, camera networks have become increasingly popular. In response to various demands imposed on these networks, several coverage models have been developed in the scientific literature, such as area, trap, barrier, and target coverage. In this paper, a new type of coverage task, the Maximum target coverage with k-Barrier coverage (MTCBC-k) problem, is defined. Here, the goal is to cover as many moving targets as possible from time step to time step while continuously maintaining k-barrier coverage over the region of interest (ROI). This approach is different from independently solving the two tasks and then merging the results. An Integer Linear Programming (ILP) formulation for the MTCBC-k problem is presented. Additionally, two types of camera clustering methods have been developed. This approach allows for solving smaller ILPs within clusters, and combining their solutions. Furthermore, a polynomial-time greedy algorithm has been introduced as an alternative to solve the MTCBC-k problem. An example was also provided of how the aforementioned methods can be modified to handle a more realistic scenario, where only the targets detected by the cameras are known, rather than all the targets within the ROI. The simulations were run with both dense and sparse camera placements, convincingly supporting the usefulness of the clustering and greedy methods.

关键词： barrier coverage target coverage directional sensors

来源：评论

学校读者我要写书评

暂无评论

Sensor scheduling for target coverage in directional sensor networks

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2017年第6期13卷 1-1页

作者： Jia, Jinglan Dong, Cailin He, Xinggang Li, Deying Yu, Ying Cent China Normal Univ Sch Math & Stat Wuhan Peoples R China Renmin Univ China Sch Informat Beijing Peoples R China Cent China Normal Univ Sch Comp Wuhan 430079 Peoples R China

Directional sensor networks have a lot of practical applications, and target coverage is one of the most important issues. In this article, we study the target coverage problem in directional sensor network, where directional sensors can rotate freely around their centers and targets are attached with differentiated coverage quality requirements. Our goal is to maximize the lifetime of sensor network, satisfying the coverage quality requirements of all targets. We model it as the maximum cover sets problem and address it by organizing the directions of sensors into a group of non-disjoint cover sets, which can cover all targets, satisfying their coverage quality requirements, and then schedule them alternately to extend the network lifetime. It consists of two parts. First, since directional sensor has infinite directions by rotating continuously, we propose sensing direction partition algorithm to find all non-redundancy directions for each sensor according to the targets deployed within the sensing region of the sensor. Then, based on the result of the sensing direction partition algorithm, we propose an efficient heuristic algorithm for the maximum cover sets problem to organize the directions of sensors into a number of non-disjoint cover sets and allocate work time for each cover set. Besides, we get an upper bound of the optimal solution for the problem. Finally, simulation results are presented to demonstrate the performance of our algorithm.

关键词： coverage quality directional sensor network network lifetime sensor scheduling target coverage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：