English
Related papers

Related papers: Optimally Approximating the Coverage Lifetime of W…

200 papers

This paper considers three related mobile robot multi-target sensory coverage and inspection planning problems in 2-D environments. In the first problem, a mobile robot must find the shortest path to observe multiple targets with a limited…

Robotics · Computer Science 2024-05-27 E. Fourney , J. W. Burdick , E. D. Rimon

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

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

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

A critical metric of the coverage quality in Wireless Sensor Networks (WSNs) is the Minimal Exposure Path (MEP), a path through the environment that least exposes an intruder to the sensor detecting nodes. Many approaches have been proposed…

Robotics · Computer Science 2021-08-13 Armando Alves Neto , Víctor C. da Silva Campos , Douglas G. Macharet

We study a mobile wireless sensor network (MWSN) consisting of multiple mobile sensors or robots. Three key factors in MWSNs, sensing quality, energy consumption, and connectivity, have attracted plenty of attention, but the interaction of…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-06-20 Jun Guo , Hamid Jafarkhani

Wireless sensor networks (WSNs) are emerging as an effective means for environment monitoring. This paper investigates a strategy for energy efficient monitoring in WSNs that partitions the sensors into covers, and then activates the covers…

Data Structures and Algorithms · Computer Science 2007-05-23 Zoe Abrams , Ashish Goel , Serge Plotkin

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

Since we are not able to replace the battery in a wireless sensor networks (WSNs), the issues of energy and lifetime are the most important parameters. In asymmetrical networks, different sensors with various abilities are used. Super…

Networking and Internet Architecture · Computer Science 2013-05-15 Mostafa Azami , Manij Ranjbar , Ali Shokouhi rostami , Amir Jahani Amiri

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

We propose an algorithm which produces a randomized strategy reaching optimal data propagation in wireless sensor networks (WSN).In [6] and [8], an energy balanced solution is sought using an approximation algorithm. Our algorithm improves…

Distributed, Parallel, and Cluster Computing · Computer Science 2007-05-23 Pierre Leone , Olivier Powell , Jose Rolim

The coverage problem in wireless sensor networks deals with the problem of covering a region or parts of it with sensors. In this paper, we address the problem of covering a set of line segments in sensor networks. A line segment ` is said…

Computational Geometry · Computer Science 2017-11-16 Dinesh Dash , Arijit Bishnu , Arobinda Gupta , Subhas C. Nandy

First, we study geometric variants of the standard set cover motivated by assignment of directional antenna and shipping with deadlines, providing the first known polynomial-time exact solutions. Next, we consider the following general…

Computational Complexity · Computer Science 2009-09-30 Piotr Berman , Marek Karpinski , Andrzej Lingas

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

A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set L. We investigate how well L-cycle covers of minimum weight…

Data Structures and Algorithms · Computer Science 2009-09-29 Bodo Manthey

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 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

Traditional Wireless Sensor Networks (WSNs) typically rely on pre-analysis of the target area, network size, and sensor coverage to determine initial deployment. This often results in significant overlap to ensure continued network…

Networking and Internet Architecture · Computer Science 2025-08-21 Parham Soltani , Mehrshad Eskandarpour , Sina Heidari , Farnaz Alizadeh , Hossein Soleimani

Coverage is one of the fundamental issues in wireless multimedia sensor networks (WMSNs). It reflects the ability of WMSNs to detect the fields. Motivated by the existing-enhancing algorithm of traditional 2D WMSNs, a new 3D WMSNs sensing…

Networking and Internet Architecture · Computer Science 2015-09-17 Shasha Xu , Weijie Lyu , Huilin Li

Sweep coverage is to realize the periodic coverage of targets by planning the periodic sweeping paths of mobile sensors. It is difficult for sensors to reduce energy consumption by reducing the moving distances. Therefore, charging…

Computational Complexity · Computer Science 2021-05-14 Dieyan Liang , Hong Shen
‹ Prev 1 2 3 10 Next ›