-
Distributed Computing in Sensor Systems, 6th IEEE International Conference, DCOSS 2010, Santa Barbara, CA, USA, June 21-23, 2010. Proceedings; 01/2010
-
TOSN. 01/2010; 6.
-
[show abstract]
[hide abstract]
ABSTRACT: We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are
used to cover a region or set of points in the plane. The first class of problems involve assigning radii to already-positioned
sensors (being cheap). The second class of problems are motivated by the fact that the sensors may, because of practical difficulties, be positioned
with only approximate accuracy (being flexible). This changes the character of some coverage problems that solve for optimal disk positions or disk sizes, ordinarily assuming
the disks can be placed precisely in their chosen positions, and motivates new problems. Given a set of disk sensor locations,
we show for most settings how to assign either (near-)optimal radius values or allowable amounts of placement error. Our primary
results are 1) in the 1-d setting we give a faster dynamic programming algorithm for the (linear) sensor radius problem; and 2) we find a max-min fair set of radii for the 2-d continuous problems in polynomial time. We also give results for other settings, including fast approximation algorithms
for the 1-d continuous case.
06/2009: pages 245-258;
-
International Symposium on Circuits and Systems (ISCAS 2009), 24-17 May 2009, Taipei, Taiwan; 01/2009
-
INFOCOM 2009. 28th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 19-25 April 2009, Rio de Janeiro, Brazil; 01/2009
-
[show abstract]
[hide abstract]
ABSTRACT: The "base zone" in combat operations refers to an area that is secured against intrusion and attacks from insurgents. During any type of military operation, the number of sensor assets that are available for detecting intrusions are limited. Thus, the size of a base zone is limited by the number of available sensors, and how those sensors are deployed. Depending on the assumptions made in modeling the coverage properties and the terrain of area being covered, the size and shape of the base zone can vary widely. The base zone protection problem is the task of determining the largest area that can be protected given a limited number of sensors. The base zone protection problem is related to the problem of determining sensor coverage. In this paper, we look at the various variations of the base zone protection problem, with a range of difficulty in their solution.
11/2008;
-
IEEE 5th International Conference on Mobile Adhoc and Sensor Systems, MASS 2008, 29 September - 2 October 2008, Atlanta, Georgia, USA; 01/2008
-
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November - 4 December 2008; 01/2008
-
Algorithmic Aspects of Wireless Sensor Networks, Third International Workshop, ALGOSENSORS 2007, Wroclaw, Poland, July 14, 2007, Revised Selected Papers; 01/2007
