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

Enhanced algorithms for deploying the minimum sensors to construct a wireless sensor network having full coverage of critical square grids

引用

WIRELESS NETWORKS 2014年第2期20卷 331-343页

作者： Liu, Bing-Hong Su, Kuo-Wen Natl Kaohsiung Univ Appl Sci Dept Elect Engn Kaohsiung 80778 Taiwan

With the rapid technological development of sensors, many applications have been designed to use wireless sensor networks to monitor a certain area and provide quality-of-service guarantees. Therefore, the coverage problem had an important issue for constructing wireless sensor networks. Recently, a coverage problem of constructing a minimum size wireless sensor network to fully cover critical squares in a sensor field, termed CRITICAL-SQUARE-GRID coverage, has received much attention. CRITICAL-SQUARE-GRID coverage is shown to be NP-Complete, and an approximation algorithm, termed Steiner-tree-based critical grid covering algorithm (STBCGCA), is proposed accordingly. In STBCGCA, a sensor is selected to cover critical squares only if at least one of the critical squares is fully covered by the sensor. However, a critical square grid can be cooperatively covered by two or more sensors;that is, one sensor covers one part of the critical square, and the other sensors cover the other part of the critical square. This motivates us to propose two efficient algorithms based on STBCGCA, termed critical-grid-partitioned (CGP-STBCGCA) and reference-point-covered (RPC-STBCGCA), that select sensors that can cooperatively cover critical squares in an attempt to minimize the size of the wireless sensor network. The theoretical analysis shows that sensors deployed by CGP-STBCGCA and RPC-STBCGCA can form a connected wireless sensor network that fully covers all critical grids. In addition, a performance guarantee for CGP-STBCGCA is provided. Simulation results show that the ratio of the average number of deployed sensors in STBCGCA to that in CGP-STBCGCA and RPC-STBCGCA in about 90 % of the cases was between 1.08 and 2.52 for CRITICAL-SQUARE-GRID coverage.

关键词： Wireless sensor network coverage problem NP-Complete Sensor deployment Approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

Placement Optimization for Advertisement Dissemination in Smart City

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2020年第1期7卷 239-252页

作者： Zheng, Huanyang Wu, Jie Temple Univ Dept Comp & Informat Sci Philadelphia PA 19121 USA

This paper studies a promising application in Vehicular Cyber-Physical Systems (VCPS) called roadside advertisement dissemination. Its application involves three elements: the drivers in the vehicles, Roadside Access Points (RAPs), and shopkeepers. The shopkeeper wants to attract as many customers as possible by using RAPs to disseminate advertisements to the passing vehicles. Upon receiving an advertisement, the driver might detour towards the shop, depending on the detour distance. Given a fixed number of RAPs and the traffic distribution, our goal is to optimize the RAP placement for the shopkeeper to maximally attract potential customers. This application is a non-trivial extension of traditional coverage problems, the difference being that RAPs are used to cover the traffic flows. RAP placement algorithms pose complex trade-offs. If we place RAPs at locations that can provide small detour distances to attract more customers, these locations may not necessarily be located in heavy traffic regions. While heavy traffic regions cover more flows, they might cause large detour distances, making shopping less attractive to customers. To balance the above trade-off, bounded RAP placement algorithms are proposed with respect to submodular and non-submodular scenarios. Since real-world traffic distributions exhibit unique patterns, here we further consider the Manhattan grid scenario and propose improved solutions. Extensive real trace-driven experiments validate the competitive performances of the proposed algorithms.

关键词： Vehicular cyber-physical systems placement problem coverage problem submodularity and optimization

来源：评论

学校读者我要写书评

暂无评论

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 (CrownCom 2008)

作者： Saran Jenjaturong Chalermek Intanagonwiwat Department of Computer Engineering Chulalongkom University 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

来源：评论

学校读者我要写书评

暂无评论

Toward efficient adaptive ad-hoc multi-robot network topologies

引用

AD HOC NETWORKS 2018年 74卷 57-70页

作者： Ghedini, Cinara Ribeiro, Carlos H. C. Sabattini, Lorenzo Aeronaut Inst Technol Comp Sci Div Silo Jose Dos Campos SP Brazil Univ Modena & Reggio Emilia Dept Sci & Methods Engn DISMI Modena Italy

The availability of robust and power-efficient robotic devices boosts their use in a wide range of applications, most of them unfeasible in the recent past due to environmental restrictions or because they are hazardous to humans. Nowadays, robots can support or perform missions of search and rescue, exploration, surveillance, and reconnaissance, or provide a communication infrastructure to clients when there is no network infrastructure available. In general, these applications require efficient and multi-objective teamwork. Hence, successful control and coordination of a group of wireless-networked robots relies on effective inter-robot communication. In this sense, this work proposes a model that aims at providing more efficient network topologies addressing the issues of connectivity maintenance, collision avoidance, robustness to failure and area coverage improvement. The model performance was experimentally validated considering fault-free and fault-prone scenarios. Results demonstrated the feasibility of having simultaneous controls acting to achieve more resilient networks able to enhancing their sensing area while avoiding collision and maintaining the network connectivity with regard to fault-free scenarios. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Self-organizing networks Fault-tolerance networks coverage problem Multi-robot networks

来源：评论

学校读者我要写书评

暂无评论

Aeronautical Data Aggregation and Field Estimation in IoT Networks: Hovering and Traveling Time Dilemma of UAVs

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2019年第10期18卷 4620-4635页

作者： Bushnaq, Osama M. Celik, Abdulkadir Elsawy, Hesham Alouini, Mohamed-Slim Al-Naffouri, Tareq Y. KAUST Comp Elect & Math Sci & Engn CEMSE Div Thuwal 23955 Saudi Arabia King Fahd Univ Petr & Minerals Dept Elect Engn Dhahran 31261 Saudi Arabia

The next era of information revolution will rely on aggregating big data from massive numbers of devices that are widely scattered in our environment. Most of these devices are expected to be of low-complexity, low-cost, and limited power supply, which imposes stringent constraints on the network operation. In this regard, this paper investigates aerial data aggregation and field estimation from a finite spatial field via an unmanned aerial vehicle (UAV). Instead of fusing, relaying, and routing the data across the wireless nodes to fixed locations access points, a UAV flies over the field and collects the required data for two prominent missions: data aggregation and field estimation. To accomplish these tasks, the field of interest is divided into several subregions, over which the UAV hovers to collect samples from the underlying nodes. To this end, we formulate and solve an optimization problem to minimize the total hovering and traveling time of each mission. While the former requires the collection of a prescribed average number of samples from the field, the latter ensures, for a given field spatial correlation model, that the average mean-squared estimation error of the field value is no more than a predetermined threshold at any point. These goals are fulfilled by optimizing the number of subregions, the area of each subregion, the hovering locations, the hovering time at each location, and the trajectory traversed between hovering locations. The proposed formulation is shown to be NP-hard mixed integer problem, and hence, a decoupled heuristic solution is proposed. The results show that there exists an optimal number of subregions that balance the tradeoff between hovering and traveling times, such that the total time for collecting the required samples is minimized.

关键词： Unmanned aerial vehicle (UAV) internet of things (IoT) stochastic geometry coverage problem aerial field estimation

来源：评论

学校读者我要写书评

暂无评论

Covering Users With QoS by a Connected Swarm of Drones: Graph Theoretical Approach and Experiments

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2023年第6期31卷 2483-2498页

作者： Danilchenko, Kiril Nutov, Zeev Segal, Michael Ben Gurion Univ Negev Sch Elect & Comp Engn IL-84105 Beer Sheva Israel Open Univ Israel Comp Sci Dept IL-4353701 Raanana Israel

In this work, we study the connected version of the covering problem motivated by the coverage of ad-hoc drones' swarm. We focus on the situation where the number of drones is given, and this number is not necessarily enough to cover all users. That is, we deal with a budget optimization problem, where the budget is the number of given drones. We assume that each ground user has different QoS requirements. Additionally, each ground user has a weight that corresponds to the importance (rank) of the user. Moreover, we consider the case when there is no third-party entity that provides connectivity to the drones. In this paper, we propose a 3D deployment scheme with the given number of drones such that the sum of the weights (ranks) of the ground users covered by drones is maximized (when the covering radii satisfy QoS of these users), and the drones form a connected graph. We present a number of approximate solutions with provable guaranteed performance evaluation that have been validated also through the simulation platform.

关键词： Drones Quality of service Wireless communication Atmospheric modeling Signal to noise ratio Approximation algorithms Three-dimensional displays Connected swarm of drones approximation algorithm coverage problem

来源：评论

学校读者我要写书评

暂无评论

Near-optimal probabilistic search via submodularity and sparse regression

引用

AUTONOMOUS ROBOTS 2017年第1期41卷 205-229页

作者： Tseng, Kuo-Shih Mettler, Berenice Univ Minnesota Coll Sci & Engn Dept Comp Sci & Engn Minneapolis MN USA Univ Minnesota Dept Aerosp Engn & Mech Coll Sci & Engn Minneapolis MN 55455 USA

The goal of search is to maximize the probability of target detection while covering most of the environment in minimum time. Existing approaches only consider one of these objectives at a time and most optimal search problems are NP-hard. In this research, a novel approach for search problems is proposed that considers three objectives: (1) coverage using the fewest sensors;(2) probabilistic search with the maximal probability of detection rate (PDR);and (3) minimum-time trajectory planning. Since two of three objective functions are submodular, the search problem is reformulated to take advantage of this property. The proposed sparse cognitive-based adaptive optimization and PDR algorithms are within () of the optimum with high probability. Experiments show that the proposed approach is able to search for targets faster than the existing approaches.

关键词： Probabilistic search coverage problem Receding horizon control Submodularity Overlapping group LASSO

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithm for Constructing Minimum Size Wireless Sensor Networks to Fully Cover Critical Square Grids

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2011年第4期10卷 1154-1164页

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

Wireless sensor networks are formed by connected sensors that each have 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 environmental monitoring, battlefield surveillance, nuclear, biological, and chemical (NBC) attack detection, and so on, critical areas and common areas must be distinguished adequately, and 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 sensor field. This provides the motivation for the problem of deploying the minimum sensors on grid points to construct a connected wireless sensor network able to fully cover critical square grids, termed CRITICAL-SQUARE-GRID coverage. In this paper, we propose an approximation algorithm for CRITICAL-SQUARE-GRID coverage. Simulations show that the proposed algorithm provides a good solution for CRITICAL-SQUARE-GRID coverage.

关键词： Wireless sensor network coverage problem NP-Complete problem sensor deployment approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

When does the union of random spherical caps become connected?

引用

ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS 2004年第2期56卷 397-402页

作者： Maehara, H Univ Ryukyus Coll Educ Okinawa 9030213 Japan

Drop N random caps all of the same angular radius theta = croot1/N log N on a unit sphere. Let U denote the part of the surface covered by these caps. We prove that if c > root2, then the probability that U is connected tends to 1 as N --> infinity, while if c < 1, then the probability that U is connected tends to 0 as N --> infinity.

关键词： coverage problem random caps asymptotic probability

来源：评论

学校读者我要写书评

暂无评论

Global Sensor Deployment and Local coverage-Aware Recovery Schemes for Smart Environments

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2015年第7期14卷 1382-1396页

作者： Lin, Ting-Yu Santoso, Hendro Agus Wu, Kun-Ru Natl Chiao Tung Univ Dept Elect & Comp Engn Hsinchu Taiwan

One critical issue, for a wireless sensor network (WSN) to operate successfully, is to provide sufficient sensing coverage. Define the smart sensing environment as a sensing system with the capability to sense the environment and respond properly in an automated manner. In this paper, we target on smart sensing environments and deal with heterogeneous sensors (here sensor heterogeneity is defined as sensors having different sensing ranges) equipped with actuation facilities to assist in the sensor self-deployment. A coverage-aware sensor automation (CASA) protocol is proposed to realize an automated smart monitoring network. Two centralized algorithms are included in the CASA protocol suite: enhanced virtual forces algorithm with boundary forces (EVFA-B) and sensor self-organizing algorithm (SSOA). Unlike most previous works that tackle the deployment problem only partially, we intend to address the problem from both global deployment (EVFA-B) and local repairing (SSOA) perspectives. The EVFA-B protocol exerts weighted attractive and repulsive forces on each sensor based on predefined distance thresholds. Resultant forces then guide the sensors to their suitable positions with the objective of enhancing the sensing coverage (after a possibly random placement of sensors). Furthermore, in the presence of sensor energy depletions and/or unexpected failures, our SSOA algorithm is activated to perform local repair by repositioning sensors around the sensing void (uncovered area). This capability of local recovery is advantageous in terms of saving the communication and moving energies. Performance of the proposed sensor deployment strategies is evaluated in terms of surveillance coverage, monitoring density, network self-healing competence, and moving energy consumption. We also implement our CASA protocol suite in a real-life monitoring network (MoNet) to demonstrate the protocol feasibility and validate the MoNet detection capability of emergency events.

关键词： Wireless sensor deployment coverage problem smart sensing environment self-healing sensor automation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：