English
Related papers

Related papers: Changeable Sweep Coverage Problem

200 papers

Wireless rechargeable sensor networks, consisting of sensor nodes with rechargeable batteries and mobile chargers to replenish their batteries, have gradually become a promising solution to the bottleneck of energy limitation that hinders…

Networking and Internet Architecture · Computer Science 2019-05-14 Xuan Li , Miao Jin

Time-varying coverage, namely sweep coverage is a recent development in the area of wireless sensor networks, where a small number of mobile sensors sweep or monitor comparatively large number of locations periodically. In this article we…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-04-11 Barun Gorain , Partha Sarathi Mandal

In this paper, we present the first constant-approximation algorithm for {\em budgeted sweep coverage problem} (BSC). The BSC involves designing routes for a number of mobile sensors (a.k.a. robots) to periodically collect information as…

Discrete Mathematics · Computer Science 2024-08-23 Wei Liang , Shaojie Tang , Zhao Zhang

An important application of wireless sensor networks is the deployment of mobile sensors to periodically monitor (cover) a set of points of interest (PoIs). The problem of Point Sweep Coverage is to deploy fewest sensors to periodically…

Data Structures and Algorithms · Computer Science 2017-06-28 Dieyan Liang , Hong Shen

We study the minimum connected sensor cover problem (MIN-CSC) and the budgeted connected sensor cover (Budgeted-CSC) problem, both motivated by important applications (e.g., reduce the communication cost among sensors) in wireless sensor…

Data Structures and Algorithms · Computer Science 2020-01-23 Lingxiao Huang , Jian Li , Qicai Shi

Given a set of objects with durations (jobs) that cover a base region, can we schedule the jobs to maximize the duration the original region remains covered? We call this problem the sensor cover problem. This problem arises in the context…

Data Structures and Algorithms · Computer Science 2007-05-23 Adam L. Buchsbaum , Alon Efrat , Shaili Jain , Suresh Venkatasubramanian , Ke Yi

We study a mobile wireless sensor network (MWSN) consisting of multiple mobile sensors or robots. Two key issues in MWSNs - energy consumption, which is dominated by sensor movement, and sensing coverage - have attracted plenty of…

Information Theory · Computer Science 2017-10-26 Jun Guo , Hamid Jafarkhani

Coverage problem in wireless sensor networks measures how well a region or parts of it is sensed by the deployed sensors. Definition of coverage metric depends on its applications for which sensors are deployed. In this paper, we introduce…

Computational Geometry · Computer Science 2020-01-16 Dinesh Dash

This paper presents a general framework to tackle a diverse range of NP-hard charger scheduling problems, optimizing the trajectory of mobile chargers to prolong the life of Wireless Rechargeable Sensor Network (WRSN), a system consisting…

Networking and Internet Architecture · Computer Science 2020-10-01 Xuan Li , Miao Jin

Target coverage problem in wireless sensor networks is concerned with maximizing the lifetime of the network while continuously monitoring a set of targets. A sensor covers targets which are within the sensing range. For a set of sensors…

Networking and Internet Architecture · Computer Science 2011-03-25 Manju , Arun K. Pujari

The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result,…

Networking and Internet Architecture · Computer Science 2019-01-04 Riham Elhabyan , Wei Shi , Marc St-Hilaire

The problem of constrained coverage path planning involves a robot trying to cover maximum area of an environment under some constraints that appear as obstacles in the map. Out of the several coverage path planning methods, we consider…

Robotics · Computer Science 2017-08-11 Ankit Manerikar , Debasmit Das , Pranay Banerjee

Sensor networks are ubiquitously used for detection and tracking and as a result covering is one of the main tasks of such networks. We study the problem of maximizing the coverage lifetime of a barrier by mobile sensors with limited…

Data Structures and Algorithms · Computer Science 2013-04-24 Amotz Bar-Noy , Dror Rawitz , Peter Terlecky

In mobile wireless sensor networks (MWSNs), each sensor has the ability not only to sense and transmit data but also to move to some specific location. Because the movement of sensors consumes much more power than that in sensing and…

Data Structures and Algorithms · Computer Science 2018-11-02 Ngoc-Tu Nguyen , Bing-Hong Liu , Shih-Yuan Wang

The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the Disc Covering Problem on a Line. The cost of each sensor includes a fixed…

Discrete Mathematics · Computer Science 2007-07-20 Alessandro Agnetis , Enrico Grande , Pitu B. Mirchandani , Andrea Pacifici

Wireless sensor networks consisting of great number of cheap and tiny sensor nodes which are used for military environment controlling, natural events recording, traffic monitoring, robot navigation, and etc. Such a networks encounter with…

Networking and Internet Architecture · Computer Science 2011-11-23 Marida Dossena

In Wireless Sensor Networks, sensors are used for tracking objects, monitoring health and observing a region/territory for different environmental parameters. Coverage problem in sensor network ensures quality of monitoring a given region.…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-11-16 Dinesh Dash , Anurag Dasgupta

Unmanned aerial vehicles (UAVs) can be used to provide wireless network and remote surveillance coverage for disaster-affected areas. During such a situation, the UAVs need to return periodically to a charging station for recharging, due to…

Information Theory · Computer Science 2017-05-30 Hazim Shakhatreh , Abdallah Khreishah , Jacob Chakareski , Haythem Bany Salameh , Issa Khalil

Sensor networks are particularly applicable to the tracking of objects in motion. For such applications, it may not necessary that the whole region be covered by sensors as long as the uncovered region is not too large. This notion has been…

Networking and Internet Architecture · Computer Science 2010-02-26 Swaminathan Sankararaman , Alon Efrat , Srinivasan Ramasubramanian , Javad Taheri

This paper focuses on the optimal sensor placement problem for the identification of pipe failure locations in large-scale urban water systems. The problem involves selecting the minimum number of sensors such that every pipe failure can be…

Systems and Control · Computer Science 2016-03-23 Lina Sela Perelman , Waseem Abbas , Xenofon Koutsoukos , Saurabh Amin
‹ Prev 1 2 3 10 Next ›