Secluded Path via Shortest Path

We provide several new algorithmic results for the secluded path problem, specifically approximation and optimality results for the static algorithm of [3,5], and an extension (h-Memory) of it based on de Bruijn graphs, when applied to bounded degree graphs and some other special graph classes which can model wireless communication and line-of-sight settings. Our primary result is that h-Memory is a PTAS for degree-Δ unweighted, undirected graphs, providing a \(\lceil{\sqrt{{\Delta+1}\over{h+1}}}\rceil\)-approximation in time O(n logn); in particular, 0-Memory (i.e., static) provides a \(\sqrt{\Delta+1}\) -approximation (i.e., \(\epsilon=\sqrt{\Delta+1}-1\)), tightening the previous analysis of this algorithm, and Δ-Memory is optimal (i.e., e = 0), and is faster than the known optimal algorithm for this setting [3].

[1]  David Peleg,et al.  Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems , 2000, J. Discrete Algorithms.

[2]  Darrah Chavey,et al.  Tilings by regular polygons—II: A catalog of tilings , 1989 .

[3]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  Ananthram Swami,et al.  The thinnest path problem for secure communications: A directed hypergraph approach , 2012, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[5]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[6]  David Peleg,et al.  Secluded Connectivity Problems , 2013, ESA.

[7]  Miodrag Potkonjak,et al.  Exposure in wireless Ad-Hoc sensor networks , 2001, MobiCom '01.

[8]  G. C. Shephard,et al.  Tilings and Patterns , 1990 .

[9]  Pierangelo Dell'Acqua,et al.  Knowledge-Based Probability Maps for Covert Pathfinding , 2010, MIG.

[10]  Jie Wang,et al.  Strong barrier coverage of wireless sensor networks , 2008, MobiHoc '08.

[11]  Giuseppe F. Italiano,et al.  Algorithms – ESA 2013 , 2013, Lecture Notes in Computer Science.

[12]  Ray A. Jarvis,et al.  Robotic covert path planning: A survey , 2011, 2011 IEEE 5th International Conference on Robotics, Automation and Mechatronics (RAM).

[13]  Robert D. Carr,et al.  On the red-blue set cover problem , 2000, SODA '00.

[14]  Ray A. Jarvis,et al.  New visibility-based path-planning approach for covert robotic navigation , 2006, Robotica.