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

International Conference on Wireless Networks, Communications and Mobile Computing

作者： Aly, M Pruhs, K Znati, T Hunsaker, B Univ Pittsburgh Dept Comp Sci Pittsburgh PA 15260 USA Univ Pittsburgh Dept Ind Engn Pittsburgh PA 15260 USA

ISBN: (纸本)0780393058

The objective of the coverage problem is to organize the monitoring of targets by sensors in an energy efficient manner so as to maximize the lifetime of coverage. We consider the coverage problem in a network of myopic sensors, such as video sensors and acoustic sensors, which are only able to cover one target at any one time. We show how to formulate the problem of finding the lifetime as a linear program. We show that the actual coverage schedule can be found by iteratively finding maximum cardinality matchings in the underlying weighted bipartite graph, where the weights are derived front the solution of the linear program. We show experimentally that this algorithm is practical for moderate sized instances, depending on various properties of the instance.

关键词： iterative methods linear programming wireless sensor networks coverage problem myopic sensors weighted bipartite graph

来源：评论

学校读者我要写书评

暂无评论

Self-Deployment Algorithms for coverage problem in a Network of Mobile Sensors with Unidentical Sensing Ranges

Self-Deployment Algorithms for Coverage Problem in a Network...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Mahboubi, Hamid Moezzi, Kaveh Aghdam, Amir G. Sayrafian-Pour, Kamran Marbukh, Vladimir Concordia Univ Dept Elect & Comp Engn 1455 Maisonneuve Blvd WEV005-139 Montreal PQ H3G 1M8 Canada Natl Inst Stand & Technol Gaithersburg MD 20899 USA

ISBN: (纸本)9781424456383

In this paper, efficient sensor deployment algorithms are proposed to improve the coverage area in the target field. The proposed algorithms calculate the position of the sensors iteratively, based on the existing coverage holes in the target field. The multiplicatively weighted Voronoi (MW-Voronoi) diagram is used to discover the coverage holes corresponding to different sensors with different sensing ranges. Under the proposed procedures, the sensors move in such a way that the coverage holes in the target field are reduced. Simulation results are provided to demonstrate the effectiveness of the deployment schemes proposed in this paper.

关键词： Voronoi diagram computational geometry coverage problem mobile sensors network self-deployment algorithms sensor placement unidentical sensing ranges wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Solving heterogeneous coverage problem in Wireless Multimedia Sensor Networks in a dynamic environment using Evolutionary Strategies

Solving heterogeneous coverage problem in Wireless Multimedi...

引用

1st International eConference on Computer and Knowledge Engineering (ICCKE)

作者： Fayyazi, Hossein Sabokrou, Mohammad Hosseini, Mojtaba Sabokrou, Ali Malek Ashtar Univ Technol Dept ICT Tehran Iran Amirkabir Univ Technol Dept Comp Tehran Iran Islamic Azad Univ Dept Control Engn Gonabad Iran

ISBN: (纸本)9781467357135;9781467357128

Wireless sensor networks have become a rapidly developing research area that offers some ways of monitoring the environment and bridging the gap between the physical and virtual world. Visual Sensor Networks consist of a large number of low-power camera nodes to monitor a general environment with some targets in it. One of the most important problems in this context is energy conservation and covering the entire targets. This paper uses Evolutionary Strategy as a method based on population gradual adjustment by environmental conditions to solve the heterogeneous coverage problem in Wireless Multimedia Sensor Networks (WMSNs) in a dynamic environment by mobile targets with minimum energy consumption.

关键词： Evolutionary Strategy Wireless Sensor Networks coverage problem mobile targets energy consumption

来源：评论

学校读者我要写书评

暂无评论

Solving 3D coverage problem using Genetic Algorithms in Wireless Camera-Based Sensor Network Modelling 11

Solving 3D Coverage Problem using Genetic Algorithms in Wire...

引用

11th IEEE International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment, and Management ( HNICEM )

作者： Velasco, Neil Oliver M. del Rosario, Jay Robert B. Bandala, Argel A. De La Salle Univ Elect & Commun Engn Dept Manila Philippines

ISBN: (纸本)9781728130446

Wireless camera sensor networks are used mostly in research today. However, the camera location in a space of study is a problem in maximizing the coverage of the camera. Instead of being a 2D computation, this computation is modeled in 3D projected to 2D walls. This research makes use of Genetic Algorithms - a search optimization algorithm to find the best placement of camera which will yield to a maximum coverage ratio. The results of the experiment show the length of time the algorithm computed, and the obtained the least number of cameras needed for the most coverage.

关键词： wireless camera network Genetic Algorithms coverage problem

来源：评论

学校读者我要写书评

暂无评论

O(log n)-localized algorithms on the coverage problem in heterogeneous sensor networks

<i>O</i>(<i>log n</i>)-localized algorithms on the coverage ...

引用

IEEE International Performance Computing and Communications Conference

作者： Thai, My T. Li, Yingshu Wang, Feng Du, Ding-Zhu Univ Florida CISE Dept Gainesville FL 32611 USA Georgia State Univ CS Dept Atlanta GA 30303 USA Univ Minnesota CSE Dept Minneapolis MN 55455 USA Univ Texas Dallas CSE Dept Richardson TX 75083 USA

ISBN: (纸本)9781424411375

In this paper, we study the Maximum lifetime Target coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. Many centralized algorithms have been proposed to solve this problem. A very few distributed versions have also been presented but none of them obtains a good approximation ratio. In this paper, we propose two O(log n) localized algorithms. In particular, we first reduce the MTC problem to the domatic number problem in directed graphs. This relation shows that a feasible solution to the domatic number problem is also a feasible solution to the MTC problem. We next prove the lower and upper bounds of this domatic number, Based on this proof, we present two O(log n)-localized algorithms to solve the MTC problem.

关键词： energy efficiency coverage problem dominating set partition domatic number

来源：评论

学校读者我要写书评

暂无评论

A Game-theoretic Implementation of the Aerial coverage problem

A Game-theoretic Implementation of the Aerial Coverage Probl...

引用

作者： Alghamdi, Anwaar King Abdullah University of Science and Technology

学位级别：硕士

Game theory can work as a coordination mechanism in multi-agent robotic systems by representing each robot as a player in a game. In ideal scenarios, game theory algorithms guarantee convergence to optimal configurations and have been widely studied for many applications. However, most of the studies focus on theoretical analysis and lack the details of complete demonstrations. In this regard, we implemented a real-time multi-robot system in order to investigate how game-theoretic methods perform in non-idealized settings. An aerial coverage problem was modeled as a potential game, where each aerial vehicle is an independent decision-making player. These players take actions under limited communication, and each is equipped with onboard vision capabilities. Three game-theoretic methods have been modified and implemented to solve this problem. All computations are performed using onboard devices, independent of any ground entity. The performance of the system is analyzed and compared with different tests and configurations.

关键词： Game Theory multi-robot coordination coverage problem sensor networks

来源：评论

学校读者我要写书评

暂无评论

coverage problem of sensor network in Continuous Region

Coverage Problem of sensor network in Continuous Region

引用

Ubiquitous and Emerging Concepts on Sensors and Transducers (UEMCOS), International Conference on

作者： Mrinal Nandi Santanu Sarkar West Bengal State University Barasat India Indian Institute of Technology Madras Chennai India

ISBN: (数字)9781728113494

ISBN: (纸本)9781728113500

In this paper, we consider well known `coverage problem' in Wireless Sensor Networks (WSNs) in continuous domain. Here, we discuss optimal placement of sensors and coverage criteria in R n with special emphasis on R2. coverage is essential in WSNs, which are two- or three-dimensional systems. When sensors are deployed from air on some previously fixed points (vertices) in the Region of Interest (ROI), they may not fall on the target vertices. So, some part of the ROI may be uncovered by the sensors. In this paper, we consider the problem, how one reduced the uncovered area? To reduce the uncovered area, extra sensors are usually deployed on some randomly chosen vertices. We develop a new strategy for deployment of extra sensors and compare the uncovered areas for these two strategies and for different number of extra sensors, using simulation.

关键词： coverage problem Wireless sensor networks Random deployment Wireless sensor networks Sensors Sensor networks coverage vertex head

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient mechanism based on ACO for the coverage problem in sensor networks

引用

Journal of Southeast University(English Edition) 2007年第2期23卷 255-260页

作者：黄如朱杰徐光辉上海交通大学电子工程系上海200240 解放军理工大学通信工程学院南京210016

An energy-efficient heuristic mechanism is presented to obtain the optimal solution for the coverage problem in sensor networks. The mechanism can ensure that all targets are fully covered corresponding to their levels of importance at minimum cost, and the ant colony optimization algorithm （ACO） is adopted to achieve the above metrics. Based on the novel design of heuristic factors, artificial ants can adaptively detect the energy status and coverage ability of sensor networks via local information. By introducing the evaluation function to global pheromone updating rule, the pheromone trail on the best solution is greatly enhanced, so that the convergence process of the algorithm is speed up. Finally, the optimal solution with a higher coverage- efficiency and a longer lifetime is obtained.

关键词： sensor networks coverage problem ant colony optimization (ACO) energy-efficiency

来源：评论

学校读者我要写书评

暂无评论

THE coverage problem IN THREE-DIMENSIONAL WIRELESS SENSOR NETWORKS

引用

Journal of Interconnection Networks 2007年第3期8卷 209-227页

作者： CHI-FU HUANG YU-CHEE TSENG LI-CHU LO Department of Computer Science National Chiao-Tung University 1001 Ta Hsueh Road Hsin-Chu 30050 Taiwan

One of the fundamental issues in sensor networks is the coverage problem, which reflect-show 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 servicearea of the sensor network is covered by at least α sensors, where ff is a given parameter andthe sensing regions of sensors are modeled by balls (not necessarily of the same radius). This problem in a 2D space is solved in [10] with an efficient polynomial-time algorithm (in termsof the number of sensors). In this paper, we show that tackling this problem in a 3D space is still feasible within polynomial time. Further, the proposed solution can be easily translated intoan efficient polynomial-time distributed protocol. We demonstrate an application of the derived result by proposing an energy-conserving scheduling protocol.

关键词： ad hoc network computational geometry coverage problem sensor network wireless network

来源：评论

学校读者我要写书评

暂无评论

Voronoi based decentralized coverage problem: from optimal control to Model Predictive Control

Voronoi based decentralized coverage problem: from optimal c...

引用

Mediterranean Conference on Control and Automation

作者： Minh Tri Nguyen Cristina Stoica Maniu Laboratoire des Signaux et Systèmes CentraleSupelec-CNRS-Univ. ParisSud Université Paris Saclay 3 rue Joliot Curie F-91192 Gif-sur-Yvette cedex France

ISBN: (纸本)9781467383479

This paper presents a novel decentralized frame-work for the Multi-Agent dynamical coverage problem subject to anti-collision constraints. The control objective is to authorize each agent operating strictly in its safety zone and then enhance the coverage. These zones are the result of a spatial Voronoi partition of the common working space of the Multi-Agent system based on the current positions of the agents. Each zone provides the local information to design the control policies that make each agent converging to a fixed point inside its Voronoi cell. The performance/effectiveness of the proposed techniques will be demonstrated via numerical examples.

关键词： Multi-agent dynamical systems Set-theoretic tools Decentralized control Voronoi partition coverage problem Optimal control Model Predictive Control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：