English
Related papers

Related papers: Approximation Algorithm for Line Segment Coverage …

200 papers

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

Barrier coverage is a critical issue in wireless sensor networks for many practical applications,e.g., national border monitoring, security surveillance and intruder detection, etc. Its aim is to detect intruders that attempt to cross the…

Networking and Internet Architecture · Computer Science 2015-03-19 Xiao-Lan Liu , Bin Yang , Gui-Lin Chen

Cognitive Radio Networks (CRNs) are considered as a promising solution to the spectrum shortage problem in wireless communication. In this paper, we initiate the first systematic study on the algorithmic complexity of the connectivity…

Data Structures and Algorithms · Computer Science 2013-01-08 Hongyu Liang , Tiancheng Lou , Haisheng Tan , Yuexuan Wang , Dongxiao Yu

Sensor placement optimization methods have been studied extensively. They can be applied to a wide range of applications, including surveillance of known environments, optimal locations for 5G towers, and placement of missile defense…

Machine Learning · Computer Science 2024-05-22 Lukas Taus , Yen-Hsi Richard Tsai

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

We consider the Travelling Salesman Problem with Neighbourhoods (TSPN) on the Euclidean plane ($\mathbb{R}^2$) and present a Polynomial-Time Approximation Scheme (PTAS) when the neighbourhoods are parallel line segments with lengths between…

Data Structures and Algorithms · Computer Science 2025-04-17 Benyamin Ghaseminia , Mohammad R. Salavatipour

We initiate the study of the following natural geometric optimization problem. The input is a set of axis-aligned rectangles in the plane. The objective is to find a set of horizontal line segments of minimum total length so that every…

Computational Geometry · Computer Science 2018-06-11 Timothy M. Chan , Thomas C. van Dijk , Krzysztof Fleszar , Joachim Spoerhase , Alexander Wolff

This paper addresses the deployment of sensors for a 2-D barrier coverage system. The challenge is to compute near-optimal sensor placements for detecting targets whose trajectories follow a log-Gaussian Cox line process. We explore sensor…

Robotics · Computer Science 2025-05-13 Mingyu Kim , Daniel J. Stilwell , Harun Yetkin , Jorge Jimenez

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

In two-tiered Wireless Sensor Networks (WSNs) relay node placement is one of the key factors impacting the network energy consumption and the system overhead. In this paper, a novel connectivity-aware approximation algorithm for relay node…

Networking and Internet Architecture · Computer Science 2015-07-10 Chaofan Ma , Wei Liang , Meng Zheng

In the relay placement problem the input is a set of sensors and a number $r \ge 1$, the communication range of a relay. In the one-tier version of the problem the objective is to place a minimum number of relays so that between every pair…

Data Structures and Algorithms · Computer Science 2015-11-10 Alon Efrat , Sándor P. Fekete , Joseph S. B. Mitchell , Valentin Polishchuk , Jukka Suomela

Gathering data in an energy efficient manner in wireless sensor networks is an important design challenge. In wireless sensor networks, the readings of sensors always exhibit intra-temporal and inter-spatial correlations. Therefore, in this…

Networking and Internet Architecture · Computer Science 2013-02-12 Jiping Xiong , Jian Zhao , Lei Chen

An NP-hard problem is considered of intersecting a given set of $n$ straight line segments on the plane with the smallest cardinality set of disks of fixed radii $r>0,$ where the set of segments forms a straight line drawing $G=(V,E)$ of a…

Computational Geometry · Computer Science 2020-10-05 Konstantin Kobylkin

In this paper, we study a class of set cover problems that satisfy a special property which we call the {\em small neighborhood cover} property. This class encompasses several well-studied problems including vertex cover, interval cover,…

Data Structures and Algorithms · Computer Science 2013-12-30 Archita Agarwal , Venkatesan T. Chakaravarthy , Anamitra R. Choudhury , Sambuddha Roy , Yogish Sabharwal

Wireless Sensor Network (WSN) is pertinent to many applications with varied network parameters. Sensor node placement in the application region whether it is indoor or outdoor is a major task as well as plays very remarkable role in the…

Networking and Internet Architecture · Computer Science 2016-04-27 R. Malathi , Alagarsamy , V. Veeramani , RD. Balaji

Given a set of directional visual sensors, the $k$-coverage problem determines the orientation of minimal directional sensors so that each target is covered at least $k$ times. As the problem is NP-complete, a number of heuristics have been…

Networking and Internet Architecture · Computer Science 2015-12-24 Md. Muntakim Sadik , Sakib Md. Bin Malek , Ashikur Rahman

Wireless Sensor networks (WSN) is an emerging technology and have great potential to be employed in critical situations like battlefields and commercial applications such as building, traffic surveillance, habitat monitoring and smart homes…

Cryptography and Security · Computer Science 2009-09-04 Dr. G. Padmavathi , Mrs. D. Shanmugapriya

Studying network robustness for wireless sensor networks(WSNs) is an exciting topic of research as sensor nodes often fail due to hardware degradation, resource constraints, and environmental changes. The application of spectral graph…

Systems and Control · Computer Science 2021-04-02 Sateeshkrishna Dhuli , Chakravarthy Gopi , Yatindra Nath Singh

Edge-Geodetic Sets play a crucial role in network monitoring and optimization, wherein the goal is to strategically place monitoring stations on vertices of a network, represented as a graph, to ensure complete coverage of edges and…

Computational Complexity · Computer Science 2025-06-17 Giordano Colli

Many WSN protocols require the location coordinates of the sensor nodes, as it is useful to consider the data collected by the sensors in the context of the location from which they were collected. Thus, one of the major challenges in WSNs…

Networking and Internet Architecture · Computer Science 2018-05-02 Ashanie Gunathillake
‹ Prev 1 4 5 6 7 8 10 Next ›