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

Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications

作者： Chi-Fu Huang Yu-Chee Tseng National Chiao-Tung University Hsin-Chu Taiwan

ISBN: (纸本)9781581137644

One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this problem as a decision problem, whose goal is to determine whether every point in the service area of the sensor network is covered by at least k sensors, where k is a predefined value. The sensing ranges of sensors can be unit disks or non-unit disks. We present polynomial-time algorithms, in terms of the number of sensors, that can be easily translated to distributed protocols. The result is a generalization of some earlier results where only k=1 is assumed. Applications of the result include: (i) positioning applications, (ii) situations which require stronger environmental monitoring capability, and (iii) scenarios which impose more stringent fault-tolerant capability.

关键词： computer geometry ubiquitous computing wireless network coverage problem sensor network ad hoc network

来源：评论

学校读者我要写书评

暂无评论

Wireless Sensor Network coverage problem Using Modified Fireworks Algorithm

Wireless Sensor Network Coverage Problem Using Modified Fire...

引用

International Wireless Communications and Mobile Computing Conference

作者： Eva Tuba Milan Tuba Dana Simian Faculty of Mathematics University of Belgrade Serbia Faculty of Computer Science John Naisbitt University Belgrade Serbia Faculty of Science Lucian Blaga University Sibiu Romania

ISBN: (纸本)9781509003051

Wireless sensor networks are emerging technology with increasing number of applications, and consequently an active research area. One of the problems pertinent to wireless sensor networks is the coverage problem with number of definitions, depending on the assumed conditions. In this paper we consider hard optimization area coverage problem with the goal of finding optimal sensor nodes positions that maximize probabilistic coverage of the area of interest. For such type of optimization problem swarm intelligence stochastic metaheuristics have been successfully used. In this paper we propose a modified enhanced fireworks algorithm for wireless sensor network coverage problem and compare it with other approaches from literature, where our algorithm proved to be very robust and better, considering all conducted tests.

关键词： Wireless sensor networks coverage problem Fireworks algorithm Swarm intelligence Metaheuristic optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

A Power Saving Scheme taking into account coverage and Connection problem in WSNs 10

A Power Saving Scheme taking into account Coverage and Conne...

引用

10th International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)

作者： Pai, Shu-Wei Cho, Hsin-Hung Chao, Han-Chieh Shih, Timothy K. Natl Dong Hwa Univ Dept EE Hualien Taiwan Natl Cent Univ Dept CSIE Taoyuan Taiwan Natl Ilan Univ Dept CSIE Yilan Taiwan

ISBN: (纸本)9781479953905

coverage and connection problem have been the question which worth exploring in wireless sensor networks (WSNs). How to use connected sensors to cover the designate area is the major goal. Currently, some peoples have studied this problem, but their proposed methods focused on 2D ideal plane or 3D full space. However, the actual terrain is rugged and uneven. Therefore, the exist solutions cannot obtain the fairest information, so we use Spline function to shape the FoI(Field of Interest) from the undulate terrain. Furthermore, we use the feature of convex hull of Spline function to ensure the full coverage for FoI. And we propose a shorter transmission path algorithm to reduce network latency and energy consumption between sensors. In evaluation results, our proposed algorithm provides more efficient connection and a guarantee of high coverage in the same time.

关键词： Wireless Sensor Network coverage problem Spline Function Path planning

来源：评论

学校读者我要写书评

暂无评论

An Optimal Trade-off Power Saving Scheme between coverage and Connection problem for WSNs

引用

电脑学刊 2017年第4期28卷 13-22页

作者： Hsin-Hung Cho Shu-Wei Pai Timothy K. Shih Han-Chieh Chao

It is well known that connectivity and coverage are the important elements in the Wireless sensor networks (WSNs). In order to make a complete WSNs, scholars have begun to study how to use connected sensors to cover the designate area, but their proposed methods focused on 2D ideal plane or 3D full space, however, the actual terrain is rugged and uneven. It means that their proposed method may not suitable for a real environment. In addition, most of studies only consider single target that many researchers separated the connectivity problem and coverage problem. However, those two problems have very close relationship, so they must be considered in a same time, otherwise, the results may fall into a local optimum. For instance, several researches presented that use of transmission range adjustment to reduce redundant coverage so that they miss many chance to pass the message by shortest path since the many neighbors cannot be covered when coverage is decreased. Therefore, we use Spline function to shape the irregular FoI (Field of Interest) as well as use feature of convex hull of Spline function to ensure the full coverage and then design a shorter transmission path algorithm according to the coverage pattern to reduce network latency and energy consumption. The simulation results show that the proposed method indeed taking into account coverage and connection problem so that it certainty suitable for real WSNs environment.

关键词： coverage problem path planning Spline function wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

A set cover-based density control algorithm for sensing coverage problems in wireless sensor networks

A set cover-based density control algorithm for sensing cove...

引用

3rd International Conference on Cognitive Radio Oriented Wireless Networks and Communications

作者： Jenjaturong, Saran Intanagonwiwat, Chalermek Chulalongkorn Univ Dept Comp Engn Bangkok Thailand

ISBN: (纸本)9781424423019

Wireless sensor networks consist of a large number of sensor nodes with limited power and resource. To prolong network lifetime, the energy consumption must be somehow reduced In this paper, we propose a localized density control algorithm for energy savings. The goals are to maintain a minimal number of active sensor nodes and to reduce radio-traffic intensity while conserving the sensing coverage of the network. Our localized algorithm is based on a greedy solution of a weighted set-cover problem. Each node locally computes whether to sleep or to stay active. Given that the local decision might worsen the sensing coverage, we also introduce a voting scheme for selecting active nodes to assure that a node can sleep if and only if its, sensing area is completely covered by its active neighbors. We have implemented our localized algorithm and voting scheme on Tiny OS and evaluated on TOSSIM. The result indicates that our algorithm is efficient and viable for practical use.

关键词： wireless sensor networks coverage problem density control algorithm set cover problem redundancy node scheduling

来源：评论

学校读者我要写书评

暂无评论

Distributed energy-efficient solutions for area coverage problems in wireless sensor networks

Distributed energy-efficient solutions for area coverage pro...

引用

作者： Vu, Chinh Trung Georgia State University

学位级别：Ph.D.

Wireless sensor networks (WSNs) have recently attracted a great deal of attention due to their numerous attractive applications in many different fields. Sensors and WSNs possess a number of special characteristics that make them very promising in a wide range of applications, but they also put on them lots of constraints that make issues in sensor network particularly challenging. These issues may include topology control, routing, coverage, security, data management and many others. Among them, coverage problem is one of the most fundamental ones for which a WSN has to watch over the environment such as a forest (area coverage) or set of subjects such as collection of precious renaissance paintings (target of point coverage) in order for the network to be able to collect environment parameters, and maybe further monitor the environment. In this dissertation, we highly focus on the area coverage problem. With no assumption of sensors’ locations (i.e., the sensor network is randomly deployed), we only consider distributed and parallel scheduling methods with the ultimate objective of maximizing network lifetime. Additionally, the proposed solutions (including algorithms, a scheme, and a framework) have to be energy-efficient. Generally, we investigate numerous generalizations and variants of the basic coverage problem. Those problems of interest include k-coverage, composite event detection, partial coverage, and coverage for adjustable sensing range network. Various proposed algorithms. In addition, a scheme and a framework are also suggested to solve those problems. The scheme, which is designed for emergency alarming applications, specifies the guidelines for data and communication patterns that significantly reduce the energy consumption and guarantee very low notification delay. For partial coverage problem, we propose a universal framework (consisting of four strategies) which can take almost any complete-coverage algorithm as an input to generate an algorithm

关键词： k-coverage Energy-efficiency Wireless Sensor Network Adjustable Sensing Range WSN coverage problem Localized and Distributed Algorithm Connectivity Parallel Algorithm Fault-Tolerance Partial coverage Composite Event Detection Robustness

来源：评论

学校读者我要写书评

暂无评论

Distributed clustering approach for UAV integrated wireless sensor networks

引用

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

作者： Okcu, Huseyin Soyturk, Mujdat Naval Sci & Engn Inst TR-93942 Istanbul Turkey Marmara Univ Dept Comp Engn TR-34722 Istanbul Turkey

Wireless sensor networks (WSNs) consist of battery-limited sensor nodes which have the ability of sensing the environment, communicating with other nodes and processing the data. Large number of sensor node deployment over a geographical area imposes some constraints on the retrieval of the data. The use of mobile sinks (e. g., unmanned aerial vehicle, UAV) is an effective solution method for such large-scale networks. However, depending on the path and altitude of the UAV, and the type of radios in use, coverage problem arises where some nodes cannot get connected to the UAV. In this paper, the coverage problem is examined where UAV is used as mobile sink node. On the basis of our analysis, a dynamic and distributed clustering approach is proposed. Evaluations are performed with a realistic simulation environment. Performance results show that proposed approach reduces the energy-consumption and construct more stable and well balanced clusters that connect the uncovered nodes to the UAV.

关键词： WSNs wireless sensor networks energy efficiency network lifetime clustering UAV unmanned aerial vehicle RSS received signal strength RSSI received signal strength indicator coverage problem

来源：评论

学校读者我要写书评

暂无评论

Coordinate-free quantification of coverage in dynamic sensor networks

引用

SIGNAL PROCESSING 2015年 114卷 1-18页

作者： Gamble, Jennifer Chintakunta, Harish Krim, Hamid N Carolina State Univ Elect & Comp Engn Raleigh NC 27695 USA Univ Illinois Coordinated Sci Lab Champaign IL USA

We present a methodology for analyzing coverage properties in dynamic sensor networks. The dynamic sensor network under consideration is studied through a series of snapshots, and is represented by a sequence of simplicial complexes, built from the communication graph at each time point. A method from computational topology called zigzag persistent homology takes this sequence of simplicial complexes as input, and returns a 'barcode' containing the birth and death times of homological features in this sequence. We derive useful statistics from this output for analyzing time-varying coverage properties. In addition, we propose a method which returns specific representative cycles for these homological features, at each point along the birth-death intervals. These representative cycles are then used to track coverage holes in the network, and obtain size estimates for individual holes at each time point. A weighted barcode, incorporating the size information, is then used as a visual and quantitative descriptor of the dynamic network coverage. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Dynamic sensor network coverage problem Homology Coordinate-free

来源：评论

学校读者我要写书评

暂无评论

Multi-objective optimization for coverage control in wireless sensor network with adjustable sensing radius

引用

COMPUTERS & MATHEMATICS WITH APPLICATIONS 2009年第11-12期57卷 1767-1775页

作者： Jia, Jie Chen, Jian Chang, Guiran Wen, Yingyou Song, Jingping Northeastern Univ Coll Informat Sci & Engn 402 Sch Informat Sci & Engn Shenyang 110004 Liaoning Prov Peoples R China Northeastern Univ Ctr Comp Shenyang 110004 Peoples R China Northeastern Univ Sch Software Shenyang 110004 Peoples R China

In this paper, the problem of maintaining sensing coverage by keeping a small number of active sensor nodes and a small amount of energy consumption in a wireless sensor network is studied. As opposed to the uniform sensing model previously, we consider a large number of sensors with adjustable sensing radius that are randomly deployed to monitor a target area. A novel coverage control scheme based on elitist non-dominated sorting genetic algorithm (NSGA-II) is proposed in a heterogeneous sensor network. By devising a cluster-based architecture, the algorithm is applied in a distributed way. Furthermore, an ameliorated binary coding is addressed to represent both sensing radius adjustment and sensor selection. Numerical and simulation results validate that the procedure to find the optimal balance point among the maximum coverage rate, the least energy consumption, as well as the minimum number of active nodes is fast and effective. (C) 2008 Elsevier Ltd. All rights reserved.

关键词： Adjustable sensing radius coverage problem Multi-objective optimization Wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

Multilevel coverage location model of earthquake relief material storage repository considering distribution time sequence characteristics

引用

Journal of Traffic and Transportation Engineering(English Edition) 2021年第2期8卷 209-224页

作者： Xianjun Guan Han Zhou Mengxin Li Ligang Zhou Huayou Chen School of Economics and Management Tongji UniversityShanghai 200092China School of Mathematical Sciences Anhui UniversityHefei 230601China

The scientific location of earthquake emergency supply warehouses is conducive to the effective distribution of emergency relief resources and improved rescue efficiency in earthquake hazard. Comprehensively considering the regional population as well as coverage quality at the demand points, this paper aims to divide the coverage thresholds of earthquake emergency rescue and logistic supplies according to their time-series features,and to build a location model for supply warehouses according to the variety and amount of stored supplies considering their time-series features, in hope of optimizing the set covering issue of earthquake relief supply warehouses. The solution is approached with two methods: the target deviation rate minimization model and NSGA-Ⅱ algorithm. The results obtained by solving the target deviation rate minimization model can balance every target. The branch and bound algorithm can find the global optimal solution at a certain calculation scale with high calculation efficiency, but its efficiency decreases significantly when the operation scale increases. The NSGA-Ⅱ algorithm is more suitable for large-scale solution calculations with high calculation efficiency, and it can output a set of non-inferior solutions for decision makers to select from according to different preference. Taking Aba Prefecture in Sichuan Province as illustration, the feasibility of the model is validated;meanwhile, the effectiveness and benefits of the two approaches in solving the problem of multi-objective set covering of the warehouses are compared and analyzed.

关键词： Earthquake Emergency supplies repository Location coverage problem Multi-objective optimization NSGA-Ⅱ

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：