- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Recently Accepted Articles ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

International Journal of Distributed Sensor Networks

Volume 2013 (2013), Article ID 145496, 13 pages

http://dx.doi.org/10.1155/2013/145496

## Optimal Planning of Distributed Sensor Layouts for Collaborative Surveillance

Naval Undersea Warfare Center, 1176 Howell Street, Newport, RI 02841, USA

Received 27 September 2012; Accepted 13 March 2013

Academic Editor: Nadjib Achir

Copyright © 2013 Thomas A. Wettergren and Russell Costa. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

The use of a spatially distributed set of sensors has become a cost-effective approach to achieve surveillance coverage against moving targets. As more sensors are utilized in a collaborative manner, the optimal placement of sensors becomes critical to achieve the most efficient coverage. In this paper, we develop a numerical optimization approach to place distributed sets of sensors to perform surveillance against moving targets over extended areas. In particular, we develop a genetic algorithm solution to find spatial sensor density functions that maximize effectiveness against moving targets, where the surveillance performance of individual sensors is dependent on their absolute position in the region as well as their relative position to both the expected target(s) and any asset that is being protected. The density function representation of optimal sensor locations is shown to provide a computationally efficient method for determining sensor asset location planning. We illustrate the effective performance of this method on numerical examples based on problems of general area surveillance and risk-based surveillance in protection of an asset.

#### 1. Introduction

Target surveillance in large areas is a difficult problem with many challenges; however, due to its importance for military operations it is one that has been studied extensively [1]. In the future, the importance of this problem will only grow as technical advances worldwide create more numerous and capable adversaries. This challenge has created more areas of the world where surveillance assets (sensors) must operate to achieve mission goals of varying scales. The descriptor “large area” is relative to the sensing capability of available (individual) sensors deployed in a specific region against specified targets of interest. A surveillance problem is deemed large area if the sensing capability of an individual sensor is small relative to the area to be searched (covered), in a fixed time scale. For example, problems can be defined in hours, days, weeks, and so forth, depending on tactical mission, and ultimately this will determine scale such as number of required sensors. Military surveillance problems may take the form of covering a bounded region against any intruders (the coverage problem), or may be more specific to covering a region around an asset of interest in order to protect the asset. In both of these situations, the selection of the best from a limited predefined set of surveillance configuration options is the standard practice [2].

Advances in sensor technology have made distributed sensor networks [3–5] a viable candidate technology for performing the military surveillance mission. In order for distributed sensor networks to achieve reasonable surveillance goals, some forms of collaboration must exist amongst the sensors. Historically, this collaboration has been managed in one of two ways. One method has been to partition the search region in such a way so that individual sensors are responsible for their own portion of the region of interest. This partitioning is done *a priori* using algorithms or human judgment to attempt to optimally split up the search effort among available sensors. The collaboration in this approach is limited to occasional reports (amongst sensors or to a central authority) which lead to suboptimal surveillance performance. The other common approach is to again partition the space, but with the emphasis on post processing of detection events. This approach focuses on the reactionary part of the problem (i.e., conditional on the presence and initial detection of a target) and thus, once again is suboptimal in its use of collaboration among sensors. In this work a methodology is developed to plan deployment of distributed sensors which includes a functional dependence on collaboration, as well as an explicit dependence on spatial variation in sensor performance.

With recent technological improvements in automation and communications networking capabilities, there has been an increase in the utilization of collaboration among sensors to perform target surveillance over large areas [6]. The focus of these studies for distributed sensor surveillance has been to spread out a number of sensors and use the spatial distribution of the individual sensors to cover a larger area (much larger than the coverage of any individual sensor) to monitor against intruders [7, 8]. These studies have been primarily for use in networks of sensors that are simple and autonomous in nature but have led to a fresh look at distributed surveillance particularly in the form of postdetection data fusion [9]. Other advances have used sensor repositioning after deployment to improve coverage, such as the use of virtual force algorithms [10] to move randomly deployed sensors to improve the coverage of the sensor network. While related, the problem of sensor network detection and classification algorithm design [11, 12] follows from the positioning of the sensors. We hold that the optimal placement of sensors will benefit from any further improvements gained from the detection and classification process. Similarly, the ability of the surveillance system to track any target of interest is critical to mission performance. Previous efforts in sensor network configuration have examined the positioning of sensors for target tracking applications [13], and it is well recognized that the target tracking performance of adaptively managed sensor networks is heavily dependent on the spatial deployment pattern [14]. In contrast to those efforts, the current paper is focused on the prior problem of maximizing the ability of gaining the initial detection for the surveillance application alone.

In this paper, we optimize distributed sensor configurations to achieve optimal surveillance performance. We utilize objectives based on a prescribed level of collaboration among sensors such that optimization of these objectives results in sensor placement that is optimal with respect to collaboration as well as individual sensor performance. This approach scales well with the number of sensors and, thus, is applicable to the large scale sensor network topologies down to the tactical scales more commonly found in current surveillance (search) problems. It is this latter scale that is the focus of this paper. In this distributed sensing objective, the sensors independently perform target detection and target detection decisions are made by comparing multiple non-collocated detections to check for kinematic consistency, as a form of target classification. If the individual detections are consistent (in spatiotemporal relation) with the anticipated target behavior, then the multiple detections corroborate and the collaborative sensors declare a target present.

The motivation of this work is to utilize a collaboration framework in a formal manner so that with modern computing resources, tactical decision aids can be developed to facilitate the command decisions with respect to collaborative sensors. With the formulation of a numerical objective, more target hypotheses can be considered than notional examination on which current approaches rely. To improve the performance of such a distributed sensor surveillance system, we consider the problem of determining the optimal layout of a group of sensors. Rather than optimizing all of the parameters of a system design, we focus instead on the key component of optimizing the opportunities for multiple sensor detections over time. Such opportunities are a critical first step in the many approaches to collaborative sensing. We consider this optimization of geometrical opportunities for collaboration as a fundamental goal of sensor layout planning, and secondary goals that are particular to a specific form of collaboration are beyond our scope. Our goal is the development of a computationally efficient numerical method that accounts for the geometric and environmental complexity of the problem, while maintaining enough generality to be useful in a variety of scenarios.

In the following, we refer generically to the platform that performs the sensing function as a “sensor,” with the implied interpretation that all sensors have an underlying platform that holds them, be it a large manned asset or simply the device’s housing. Thus a sensor may be as large as a manned radar or sonar platform, or as small as a simple proximity measurement device. The characterization of these devices, for our application, is given by their expected detection performance against the target of interest, which is presumed to be known from a prior model.

Given a fixed number of sensors, an expected distribution of target behavior, and a model of the sensors’ detection performance in the region of interest, we develop an optimization framework that provides a sensor layout (set of sensor positions) for optimal surveillance protection of a region of interest under varying levels of collaboration. In particular, we consider three surveillance problems: (1) the detection of targets that are transiting throughout the region (typical area surveillance), (2) the detection of targets in the region that are far enough away from a high-valued unit (HVU) to provide reaction, and (3) the detection of objects that are weighted by their relative risk to the HVU. In the next section, we provide a mathematical model that accounts for all three of these distributed sensor surveillance problems. This common model has forms for both the cases of independent and of collaborative sensing and, thus provides a framework to study the implications of collaboration in the optimal positioning of sensors. The following develops a genetic algorithm-based optimization framework for optimizing sensor placement under this model. Finally, we conclude with some examples of the optimization to provide a comparison of the sensor layout patterns for various scenarios.

#### 2. Mathematical Model of Distributed Surveillance

A crucial element in utilizing mathematical modeling to find practical solutions to problems such as optimal placement of distributed sensors (distributed assets) is in the formulation and numerical representation of the underlying objective. The formulation of the objective should be an accurate model of the problem that captures all parametric dependencies. In particular, any dependence on tactical parameters such as target behaviors and environmental characteristics requires a method that allows these parameters to be accounted for with varying levels of uncertainty. The numerical calculation of this objective should be a suitable approximation while being as efficient as possible to allow practical use in optimization approaches. The approach we follow is to model all of these dependencies in an integral formulation of expected performance over the search space. This integral form is then integrated with respect to any particular spatial distribution of sensors to arrive at probabilities representing expected surveillance field performance.

The first component in this model of distributed surveillance is the model for target motion (behavior). This model should allow varying levels of constraints on target motion to be of general use in a wide variety of problems. The model developed in this paper assumes the target motion to be Markovian in nature, such that its behavior can be decomposed into a sequence of short time behaviors. This assumption implies that the target motion path is effectively modeled by the sequence of intervals and the path on the th interval is . The union of the collection of paths gives the total target path
where each path represents a path of constant velocity target motion in direction . Furthermore, each interval has motion parameters which are sampled from known distributions, and the specific values are only dependent on the previous time step, , as opposed to depending on the entire history (this is the Markov assumption). This Markov motion model is regularly assumed in modeling nonreactive targets [15] and is the basis of many Monte Carlo simulation approaches to target modeling [16]. We utilize the model to limit our analysis to optimizing the performance over a fixed, finite time step, where the motion of the target follows constant velocity during the interval of interest and the probability distributions of the motion parameters are all known *a priori*.

For a given interval , the probability of collaborative detection is a function of the random variables that describe target motion, as well as the location of the sensing assets and their detection performance. Consider a single given target motion track over this chosen interval. Assume that all of the sensors and the entire target track are contained within the surveillance region (we assume the region is large enough that edge effects are negligible). The probability of detecting this track by individual sensor detections (the probability of successfully surveilling the track) is written as [17] where is the minimum number of assets (sensors) independently detecting the target required for a collaborative detection of the target, while is the total number of assets (sensors) in the surveillance region . The parameter is the detection probability of an individual sensor, defined as constant within a given detection radius . Note that the parameter is used to define the level of collaboration in this framework. The variable represents the likelihood of a sensor being within distance of a particular target track path to have an opportunity to detect the target (i.e., being within range of the target at some point during the track history). Explicitly, it is given by where is the distribution of sensors in the space, and the region is the two dimensional region (defined by a specific target track) comprised of the subset of that is within detection radius of the track.

The relationship between target path and the probability of successful search criteria (for ) is illustrated in Figure 1. Figure 1(a) shows a notional path through a rectangular search region in the presence of deployed passive sensors with detection circles as shown. A subset of this path is highlighted and magnified in Figure 1(b) to show a constant velocity segment of this path (from the given Markov parameters) and the subset of the sensors which detect this segment (and subsequently the given path). Note that one can view the detection process from a sensor frame of reference, that is, a detection occurs when two or more sensor circles contain the target segment, or through a target frame of reference, where the center of the sensor circles must be within the pill-shaped region (shaded area in Figure 1(b)) to detect the target. It is through this target frame of reference that we efficiently calculate given a distribution on sensor position. In particular, the expressions in (2) and (3) represent the random search [18] of a moving target “seeking” the fixed sensors when the problem is viewed from a target frame of reference. The resultant probability of successful search, , for this time interval is given by marginalizing the probability over the uncertainty description of the target track as where the functions , , and are probability density functions (PDF’s) for target motion parameters of position, speed, and course, respectively. In addition, by increasing (or decreasing) , we subsequently increase (decrease) the required level of collaboration among the distributed sensors.

In practice, a target track is successfully found by a collaborative sensor system based on sensors sharing detection information. Thus, it is not only dependent on the requisite number of sensors performing successful detections, but it also requires those sensors to communicate their results to other neighboring sensors. In the absence of full communication connectivity amongst the sensors, a graph model of the network node locations is used to assess the overall connectivity of the network in a probabilistic sense. Let represent the probability of connectivity of a sensor network of nodes of communication range that are spatially distributed according to the distribution . The probability of connectivity for the network is the probability that there exists some multihop path between any two nodes of the network, thus it is the probability that any network node can communicate with the rest of the network. The computation of for a fixed number of nodes can be performed by known methods [19, 20]. Now the operational success of a search operation is the conditional probability of successful search conditioned on network connectivity. Mathematically, this is given by the joint probability expression where is as given in (4). We note that both terms in this joint probability have a dependence on the sensor placement distribution . However, we assume that the sensors in our applications are densely spaced with respect to communications, such that every sensor can communicate reliably with all other nodes within the network. Such an assumption is common in passive detection systems, where the passive detection radius is often much smaller than the reliable communication distance. Thus, for the remainder of this paper, we consider only the case of completely connected networks (i.e., ) and, therefore, the objective corresponding to an operational success of search is given by alone. The extension of our optimization technique to problems with limited connectivity is a subject of future work.

In order to numerically calculate the objective (4) over a variety of distributions from flat (uniform within search region ) to highly nonuniform, we represent the sensor density function as a mixture of circular Gaussian functions, as with modal weights , constant modal variance , and fixed (spaced equidistant in ) positions , which has been shown to be a useful model for density approximation in many applications [21]. The number (and subsequent spacing) of the Gaussian modes required, as well as the value of the variance parameter , are chosen using a heuristic rule. The heuristic [22] is based on the flexibility of the overall density representation; that is, the relationship between the width of a Gaussian mode and the modal spacing; should be such that a wide variety of function forms of can be represented. After experimentation on many test problems, we determined an appropriate relationship to be where is the length of the search region along one dimension (assuming that is square). The variance parameter is given as for . As increases relative to , this parameter should be made smaller relative to ; however, for the scale in this paper the given heuristic is applicable.

We note that provides a measure on the ability of multiple collaborative sensors to detect the target in a manner consistent with the spatiotemporal relationship of target motion and sensor position [17]. This is commonly referred to as track-before-detect and is an effective technique for reducing false alarms in distributed detection applications through collaboration defined by the aforementioned spatiotemporal relationship. It is also a method of multisensor filtering of contacts that is commonly used within many data fusion methods. Thus is, in general, a measure of track coverage in a surveillance region. However, as the length of the time interval tends to zero, becomes the more familiar metric of area coverage, that is, coverage independent of target motion. In that context, the expression in (2) is simply the composite area coverage provided by a set of independent sensors provided that their locations are randomly sampled from a common spatial distribution function .

#### 3. Numerical Model

To optimize the placement of assets, the integrals in (3) and (4) must be evaluated with respect to changes in the sensor density function . In both cases these integrals do not have closed form solutions, and thus, must be evaluated numerically. Note first that the evaluation of the integral in (3) is significantly simplified by the representation of sensor density function defined in (5). Namely, through the fixed position and circular variance, the integral can be separated by mode (as a sum of the integrals of each mode) and in dimension (the two-dimensional integral can be separated by independence into the product of two one-dimensional integrals) independent of the modal weights. The latter property allows much of the computation to be done once, prior to entering the optimization, simplifying subsequent objective evaluations. This improvement in efficiency makes the optimization practical on standard desktop computers with no special coding requirements. Further simplification can be made by noting that for constant (sensor performance independent of position in ) the region of integration given a target trajectory is a pill-shaped region with area . This region can be well approximated by a rectangle of equal area for which allows the integral in (3) to be evaluated using standard error functions commonly used for evaluation of integrals involving Gaussian functions [22]. The implementation utilized in this paper allows for spatial variability of by including an additional step in which the equivalent rectangle is replaced by a series of rectangles (a partitioning) which approximate the track-dependent region (within which sensors have an opportunity to detect the target) by interpolation of an underlying function. The number of segments that each track is partitioned (i.e., the number of rectangles) is determined *a priori* and depends on the extent of the spatial variability of in the search region .

The mathematical detail required to evaluate (3) consists of the following. Consider an arbitrary target track of fixed length as defined above. Define an arbitrary point along this track and a set , which is the set of all points in from which an arbitrary sensor can detect a target at the specified point along the target track (with probability ). Then the general form of the “pill” shaped region of integration can be written as . Next, define an approximation to this region as where , refer to equally spaced points spanning the length of the arbitrary track and construct disjoint sets from sets by the recursion given and (the empty set). Then the integral in (3) can be approximated as where is the set indicator function of the set .

Assuming that the integral in (3) is well approximated by the above and that the function (as in (2)) changes slowly over the target track parameters in , the numerical evaluation of the integral in (4) can be done simply, provided that the PDFs of the target track parameters are continuously differentiable and slowly changing over their support. Since this is true for the examples in this paper, then in this work the integral is evaluated by gridding the track parameters (and associated weights) evenly over the track parameter space. This allows the triple integral in (4) to be well approximated by a triple sum weighted by the product of the corresponding values of the PDFs over the target parameter grid. The numerical evaluation of the sum as shown above provides a robust computation of the required integral of over the region .

#### 4. Formulation of Optimization

The problem of optimum deployment of assets for collaborative multisensor surveillance, restricted to the mathematical model in (4), is one of maximizing search effectiveness in a fixed region. From an optimal planning perspective, the problem is one of maximizing the likelihood of achieving the surveillance mission, where the mission can take on various forms. We represent this as a minimization problem of the form where is the probability of mission failure and is a function representing the sensor distribution over the region . In practice, this mission failure may take a variety of forms, but we are primarily concerned with the joint probability of not detecting a target within our surveillance region, combined with the risk associated with that target’s presence. In particular, for the small time interval of interest which determines the path interval of interest, we have where is a consequence (risk) function. The consequence function is dependent on the location of target track and is defined to measure the relative risk posed by various tracks over that of others (such as those in proximity to an HVU, if that is the intention of the surveillance region). The first integral in (9) does not depend on the choice of the sensor location density , so it does not impact the optimization leading to an effective minimization objective of The optimization problem of (8) is now given in the form for the objective functional given in (10).

If all target locations and tracks are equally important, then the consequence function is necessarily equal to unity, leading to (see (4)). In such cases, the optimization problem of (11) is equivalent to We seek the which maximizes the probability of successful search, leading to a density function from which sensors will then be placed [22]. When our goal is more specific, that is for protection of an HVU, the consequence function is used to represent the relative risk of various target tracks, and the solution of the same optimization problem ((10) and (11)) yields the solution of minimizing the expected risk to the HVU. Thus, the optimization problem of (10) and (11) is generically utilized as the asset layout optimization problem, with the understanding that a variety of specific problems are addressed by varying the form of the consequence function.

To compute the objective functional as shown in (10), the target motion distribution parameters must be known, as well as the effective sensor performance and , which are generally functions of location in the region. In this work, we adopt a notional model for the spatial dependence of sensor performance in a rectangular region of interest, depicted in Figure 2. As in the previously defined model, sensor performance is measured by a spatially dependent radius of detection which corresponds to a fixed probability of detection (note that in Figure 2 we show normalized to the size of the region , where the corresponds to a value of ). In practice, sensor performance predictions such as these can be formulated using historical information on the environment and are common in passive acoustic sensor applications, both in air [23] and undersea [24] domains. The sensor performance and number of sensors provide the necessary inputs for computation of (as in (2)) for any specified target track. When combined with the target motion distribution parameters and consequence function, they provide a complete description of the objective for any distribution of sensor locations. Figure 3 shows a functional description of the overall approach, where it becomes clear that the “inputs” to the optimization, that is *a priori* knowledge of target, environment, and asset availability, are utilized to find the optimal distribution of assets. The specific placement of the individual sensor assets from the distribution is done using a sampling procedure from the resulting distribution, leading to a placement map for the surveillance region.

#### 5. Numerical Procedure for Optimization

Recall from (5) that the modal positions representing the sensor distribution are fixed and thus the optimal distribution with respect to the surveillance objective (9) is parameterized only through the modal weights. Thus the numerical objective for optimization becomes

We implement a genetic algorithm to perform the optimization defined in (13). The genetic algorithm cannot be run to any guarantee of convergence [25] but is rather run to a prescribed number of generations (iterations). If a theoretically optimal result is desired, the result of the genetic algorithm may be used as the starting point for a nonlinear program (NLP). These stages are complementary in that the genetic algorithm is insensitive to its start and will make significant progress toward a global solution but is devoid of satisfactory stopping criteria (i.e., no guaranteed final convergence). The NLP on the other hand can be quite sensitive to its starting solution but theoretically proven to converge to a local maximum [26]. Thus one goal in the design of this approach is for the potential use of the genetic algorithm to initialize an NLP in the neighborhood of a globally optimal solution, and thus we can attain convergence to a global maximum, if desired.

Genetic algorithms operate on a discrete set of parameters in the form of a binary string. The parameters in this problem are the weights representing the sensor distribution in . In the numerical implementation, each weight parameter is represented by a four-bit binary string, with individual Gaussian modes for the representation in (5). Thus, the string length is .

A genetic algorithm starts with some random values of the parameters of interest represented in the form of a binary string as described above. A set of these strings is produced which is referred to as a *population*. This type of algorithm is an iterative search where iterations are referred to as *generations*. At each generation (iteration), the binary strings which make up the population undergo a series of operations. Thus, starting with a randomly generated population, each string is evaluated by the objective function returning a value corresponding to each string. Typically, the value of the objective is mapped into a more convenient form (to improve scaling) referred to as fitness [27]. However, in this implementation fitness is set to the evaluated objective , as this quantity is well scaled.

A standard form of genetic algorithm [27] was implemented with each generation consisting of three genetic operations defined in the evolutionary vernacular as *selection*, *mating*, and *mutation*. These operations utilize the fitness associated with each binary string in the population to pseudorandomly select the best (with respect to the objective ) parameter combinations, randomly combine the selected strings, and apply some random perturbations to the resulting strings, respectively. Specifically, the selection approach utilized, referred to as “roulette,” selects binary strings by first scaling the fitness of the population members to sum to unity. Next, the cumulative sum of the fitness is calculated, creating an interval , with subintervals proportional to the fitness of each binary string. A random uniform number is then generated and the subinterval in which the number falls determines the string that is selected. Thus, a string (population member) with high fitness, relative to other strings, will be selected with high probability while one with low fitness will be selected with low probability. In this implementation, the string with the highest fitness (at each generation) is kept as a *survivor*; that is, the best string gets passed on to the next generation unchanged. Therefore, strings are selected to pass to the next generation (where is the fixed number of strings in a population), and these strings make up what is referred to as the *mating pool*. In the next phase, strings in the mating pool are randomly (without regard to fitness) paired up and then randomly combined to create new parameter strings. This operation is called *crossover*. Crossover consists of randomly breaking two strings (at the same point) and then combining the leading part of one with the trailing part of the other. Finally, each of these newly formed strings is passed to the *mutation* operation which flips bits (i.e., change 0 to 1, or vice versa) within each string randomly at some specified (*a priori*) probability. This is essentially a random perturbation of the parameters meant to avoid premature convergence to local minima. Once these operations are complete, the new strings are grouped with the survivor string and these strings become the new population passed on to the next generation (iteration). This process is repeated for some predefined set of generations. From numerical experimentation on a variety of problems, a population size of 100 run over 200 generations was suitable for producing meaningful results for the numerical examples in this paper.

On completion of the genetic algorithm, the optimal sensor density is obtained and the sensors are then placed using a numerical sampling procedure. The procedure consists of a sequential (conditional) sampling where an asset location is selected (among a grid of possible locations) which maximizes the relative entropy between the prior form of the PDF (discretized and normalized to sum to unity, in order to convert to a probability mass function) and the posterior probability mass function (PMF) calculated by selecting the asset. The relative entropy between two PMFs is written as [28] and represents a measure of divergence of one PMF relative to the other. The conditional sampling procedure used to place sensors from treats individual sensor placement as a Bayes recursion where a unique posterior is generated by a positional-dependent likelihood update, defined as corresponding to a possible sensor location. The procedure starts with the definition of two grids (uniformly spaced points in ), written as and where represents discretely sampled points of , and represents all possible sensor locations for placement. Next, the prior is calculated from the final form (after optimization) of as where is the indicator function. The posterior probability resulting from selecting (placing) a sensor at position is defined as where , (i.e., a disjoint partitioning of with respect to sensor position ) and is a ball of spatially dependent radius (with respect to constant ) centered at point . The sensor coefficient plays the role of decreasing mass within the radius of the placed sensor, while the sensor-dependent normalizing constant is written as This normalizing constant is required so that each posterior probability is a proper PMF (i.e., sums to unity over its support). The posterior with respect to all possible sensor grid points is calculated as in (15), and a sensor is placed at a specified position, by choosing the posterior which maximizes the relative entropy with respect to the prior. This is formalized as where this process is repeated in a sequential fashion to place all sensors. Upon the placement of each sensor, the posterior with respect to the chosen location acts as the prior for placing the next sensor.

#### 6. Numerical Examples

The problem of sensor placement as defined above depends on many factors. These factors can be primarily sensor dependencies from environmental variability [29] or can be dominated by other factors such as target behavior [30]. To illustrate these dependencies, we present several numerical examples. Throughout the examples, we consider the number of available sensor assets to be fixed. The planning problem is to place these sensors optimally in a square planar region of size . For these examples, the optimality criteria are to maximize the probability of surveillance mission success, corresponding to minimization of the probability of mission failure .

As an introductory example, and to demonstrate the utility of the optimization approach, we define a nominal environment (constant detection range given by ) with target parameters for which intuitive solutions exist. We seek to optimally place sensors, such that we obtain the maximum (corresponding to minimizing ) with a requirement of at least two sensor reports during a time interval . The target is assumed to be traveling in a known fixed heading (assumed north) at constant speed over the fixed time interval (where ) with a start position randomly distributed within the search region. For this problem, the expected optimal placement is a “barrier” formation perpendicular to the target course [22]. In particular, due to random starting positions, we should observe a two-line barrier perpendicular to the target course. Figure 4(a) illustrates the optimization results from this problem, where we see that the barrier structure results, as expected. A second nominal example considers a similar problem but with target heading defined as random. In this case, the optimization result, shown in Figure 4(b), produces a sensor layout in a “box-like” structure, which may not be intuitively obvious but has been shown to be optimal [22]. These nominal examples show the dependence that the target behavior has on the optimal sensor layouts.

In a typical approach to deployment of sensors under limited knowledge of the environment, it is reasonable to consider some nominal sensor detection performance. However, given current environmental modeling capabilities, we assume that sensor detection performance can be provided to some acceptable level of fidelity. Figure 2 shows a region containing the region of interest, defined by the inner box. The underlying color map depicts sensor coverage as a function of position within the region. The sensor performance is limited by environmental factors that are beyond our control, and the optimization seeks to maximize mission performance (minimizing ) in surveillance of the given region with a limited number of sensors. In particular, for the region in Figure 2, the lower right part of the region exhibits a sharp dropoff in individual sensor coverage.

An additional input to the optimization is the characterization of target behavior. The numerical examples that follow were produced assuming that target position and heading are uniformly random within the search region . That is, all reference track positions (previously defined as ) are equally likely. Furthermore, assume that the target of interest travels at a fixed speed over time intervals of length . This defines a track length of , which is given as for these numerical examples. The track length is scalable over varying combinations of speed and time (as it is simply the product of the two) and represents *a priori* knowledge of the target of interest, which will result in increased surveillance performance over that of situations where there is very little known (and thus can be assumed) of the anticipated target behavior.

In Figure 5, we illustrate three example consequence (risk) functions of interest. The first function shown in Figure 5(a) is the nominal unity function that is equivalent to the problem of optimizing cumulative probability of detection (see (12) and the surrounding discussion). The second consequence function shown in Figure 5(b) represents a protection problem for an HVU, whereby any targets within a certain distance to the HVU are too close to provide a surveillance response, and, thus, provide zero surveillance risk, with all others providing nominal risk. This may seem counterintuitive, to have zero risk closest to the HVU, but the point here is to maximize surveillance performance, and this case illustrates the situation in which the surveillance mission is no longer operational when targets are too close to the HVU. Alternatively, if one were to weight the consequence very high near the HVU, an obviously optimal solution is to only try to detect those targets and ignore all targets that are not directly in proximity to the HVU, which is not desired if the risk is already passed. The third consequence function, shown in Figure 5(c), is perhaps the most operationally relevant, in that it incorporates the features of the second case along with degradation in risk for targets further from the HVU. In this case, the risk degradation follows a log-normal function, as described by [31]. Such a consequence is representative of scenarios in which there is a greater importance to detect targets closer to the HVU, up to a point at which they are so close that response becomes impractical. Specifically, the log-normal consequence function takes the form for an HVU at location with a minimal response distance . The parameters in (20) are shape parameters that control the slope and taper of the log-normal consequence function. These three example consequence functions illustrate various applications of the consequence function to show how seemingly different scenarios are solved using the same field optimization approach.

Figure 6 illustrates the results of the optimization process applied to the three consequence functions of Figure 5 for a scenario with sensors performing noncollaborative surveillance. By noncollaborative surveillance, we consider the sensors to behave completely autonomously ( in (2)), and extended coverage is obtained only through the effective spacing of the individual sensors with respect to the target prior information, that is, since there is no collaboration between sensors, the surveillance relies only upon individual sensors to detect a target if present. In Figure 6, along with the sensor positions, we include opaque circles corresponding to the coverage capability radius of each sensor. The circle size varies according to the local sensing capabilities attributable to the local environmental conditions, as shown in Figure 2. The effect for the first consequence function (for unity risk), as shown in Figure 6(a), is to place the sensors somewhat evenly to best cover the requirement of single sensor coverage in the field. Fewer sensors are located where there is lower detection capability (lower right corner) since the additive coverage is small. For the second consequence function, note that there are no sensors placed near the HVU (see Figure 6(b)), as expected. When compared to the first consequence function, note that the sensors are still spread evenly but now pushed slightly closer to the edges, in order to still cover as much of the area as possible. The third consequence function provides a different type of optimal configuration, as shown in Figure 6(c). In this case, the sensors tend to encircle the HVU in an annulus, as the annular region is the region of highest consequence if detections are missed. This effect appears more significant than the effect of avoiding the low coverage in the lower right corner, and more sensors are added to the lower right section of the annular region to make up for the lower individual sensor coverage. Note that each of these results were created from the same optimization procedure, with the only distinction between the three cases being the specific form of the consequence function .

In practical situations with many sensors, there is performance enhancement opportunity through the use of collaboration [32, 33]. Historically, such problems are solved using optimal processing strategies given a fixed location of sensors [34, 35]. However, the optimization framework developed herein permits the optimization of sensor placements for a given level of collaboration. For instance, the parameter in (2) may be adjusted to represent the number of sensors that must concurrently detect a target over the time interval of interest . Any detections that are spatially or temporally isolated will not count towards the probability used as the performance objective, as they are likely false positives. Recall that the requirement of multiple detections need not occur simultaneously, only over the time interval of interest. Thus, the performance objective cannot be translated into a simple geometrical overlap requirement, that is, a goal in which maximal overlap is sought. In fact, since this objective depends on target track parameters which have spatiotemporal features, there are many scenarios for which non-intuitive patterns of sensors will be optimal. In particular, as complexity (from such factors as environmental sensitivity or higher levels of collaboration) is added, results formed through intuition become less likely to approach optimal, reinforcing the need for an optimization framework which can factor in these complexities.

To illustrate the impact of multiple sensor collaboration on the optimal patterns, the examples of Figure 6 are repeated with a requirement of detections to occur over the time interval of interest. In this case the goal is to optimally deploy the same sensors in the same variable environment, but we now require two separate sensor detections () over the previously defined time interval . The resulting optimal patterns for the three consequence functions are shown in Figure 7. Comparison with Figure 6 shows that the increased detection requirement coupled with the relatively short target track length results in a more clustered approach to the deployment. For the third consequence function the deployment pattern has only subtle differences compared to Figure 6. This is attributed to the effect of having more than a suitable number of sensors for covering the annular region of primary interest.

In Table 1 we show the numerical values of the performance objectives for each of the scenarios presented in Figures 6 and 7. These objective values are also compared to the equivalent objective values obtained with uniform placement patterns of the assets for each situation. Observe that in each case the optimization approach resulted in better performance in the objective than for the uniform distribution, as expected. In these examples the sensors represent a sparse coverage with respect to the search region , particularly for general surveillance (consequence function ) and for cases requiring multiple detections. This sparsity explains some of the general trends seen in the results. For instance, for both consequence functions and there is little or no difference between the results for collaborating and independent sensors. This is because the reduction in the search space due to the presence of the HVU is not significant with respect to the level of sensor coverage sparsity. However, the coverage numbers increase significantly for consequence function , where the form of the consequence function increases the spatial dependence of the objective with respect to the position of the HVU. Overall the increased coverage due to optimization is much more significant for collaborative sensors than for independent sensors. This is due to the added sensitivity of sensor placement when using collaboration based on spatiotemporal target dependence.

An important byproduct of these numerical results is that for a number of diverse surveillance missions, a common optimization procedure can be utilized for positioning sensors to either meet specific performance criteria, or to get the best performance possible. This can be applied in two ways, the obvious one being as a predeployment tool for positioning sensors for a specific mission, the other being a guide to repositioning sensors to react to a change in mission. In either case these examples show that through proper modeling of the problem, optimal positioning of sensor assets can be achieved, without resorting to costly simulations. In fact, the results attained for these examples were produced with a per case computation time of approximately 20 minutes on a Pentium IV 3 GHz processor with code implemented in MATLAB.

#### 7. Conclusion

We have developed an optimization approach to place distributed sets of sensors to collaboratively perform surveillance against moving targets over extended areas. In particular, a genetic algorithm solution was provided to find the spatial sensor density functions that maximize effectiveness against moving targets. These density function representations provide a computationally efficient method for determining sensor locations for planning and were applied to situations with environmentally induced sensor spatial variability and varying forms of target risk. By illustrating the effective performance of our method on problems of general area surveillance and risk-based surveillance in protection of an asset, we have shown how the general technique applies to seemingly dissimilar problems. The numerical solutions that were obtained were shown to compare favorably against nominal layouts of sensors in the scenarios that were examined. Future work includes the extension of this method to problems with limited network connectivity between the sensor nodes.

#### Acknowledgments

This work has been supported by the Office of Naval Research code 321MS and by the In-house Laboratory Independent Research program of the Naval Undersea Warfare Center.

#### References

- D. H. Wagner, W. C. Mylander, and T. J. Sanders,
*Naval Operations Analysis*, Naval Institute Press, Annapolis, Md, USA, 1999. - S. Olariu and J. V. Nickerson, “Protecting with sensor networks: perimeters and axes,” in
*Proceedings of the Military Communications Conference (MILCOM '05)*, vol. 3, pp. 1780–1786, October 2005. View at Publisher · View at Google Scholar · View at Scopus - I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A survey on sensor networks,”
*IEEE Communications Magazine*, vol. 40, no. 8, pp. 102–114, 2002. View at Publisher · View at Google Scholar · View at Scopus - D. Estrin, D. Culler, K. Pister, and G. Sukhatme, “Connecting the physical world with pervasive networks,”
*IEEE Pervasive Computing*, vol. 1, no. 1, pp. 59–69, 2002. View at Publisher · View at Google Scholar · View at Scopus - H. Qi, S. S. Iyengar, and K. Chakrabarty, “Distributed sensor networks—a review of recent research,”
*Journal of the Franklin Institute*, vol. 338, no. 6, pp. 655–668, 2001. View at Publisher · View at Google Scholar · View at Scopus - T. Clouqueur, V. Phipatanasuphorn, P. Ramanathan, and K. K. Saluja, “Sensor deployment strategy for detection of targets traversing a region,”
*Mobile Networks and Applications*, vol. 8, no. 4, pp. 453–461, 2003. View at Publisher · View at Google Scholar · View at Scopus - S.S. Dhillon and K. Chakrabarty, “Sensor placement for effective coverage and surveillance in distributed sensor networks,” in
*Proceedings of the Wireless Communications and Networking Conference*, vol. 3, pp. 1609–1614, March 2003. - P. K. Biswas and S. Phoha, “Self-organizing sensor networks for integrated target surveillance,”
*IEEE Transactions on Computers*, vol. 55, no. 8, pp. 1033–1047, 2006. View at Publisher · View at Google Scholar · View at Scopus - M. F. Duarte and Y. H. Hu, “Vehicle classification in distributed sensor networks,”
*Journal of Parallel and Distributed Computing*, vol. 64, no. 7, pp. 826–838, 2004. View at Publisher · View at Google Scholar · View at Scopus - Y. Zou and K. Chakrabarty, “Sensor deployment and target localization in distributed sensor networks,”
*ACM Transactions on Embedded Computer Systems*, vol. 3, no. 1, pp. 61–91, 2004. - E. H. Aboelela and A. H. Khan, “Wireless sensors and neural networks for intruders detection and classification,” in
*Proceedings of the International Conference on Information Networking (ICOIN '12)*, pp. 138–143, 2012. - A. Arora, P. Dutta, S. Bapat et al., “A line in the sand: a wireless sensor network for target detection, classification, and tracking,”
*Computer Networks*, vol. 46, no. 5, pp. 605–634, 2004. View at Publisher · View at Google Scholar · View at Scopus - S. Martínez and F. Bullo, “Optimal sensor placement and motion coordination for target tracking,”
*Automatica*, vol. 42, no. 4, pp. 661–668, 2006. View at Publisher · View at Google Scholar · View at Scopus - K. Hadi and C. M. Krishna, “Management of target-tracking sensor networks,”
*International Journal of Sensor Networks*, vol. 8, no. 2, pp. 109–121, 2010. View at Publisher · View at Google Scholar · View at Scopus - Y. Bar-Shalom, X. R. Li, and T. Kirubarajan,
*Estimation with Applications to Tracking and Navigation: Theory, Algorithms, and Software*, Wiley-Interscience, 2001. - B. Ristic, S. Arulampalam, and N. Gordon,
*Beyond the Kalman Filter: Particle Filters for Tracking Applications*, Artech House, 2004. - T. A. Wettergren, “Performance of search via track-before-detect for distributed sensor networks,”
*IEEE Transactions on Aerospace and Electronic Systems*, vol. 44, no. 1, pp. 314–325, 2008. View at Publisher · View at Google Scholar · View at Scopus - B. O. Koopman,
*Search and Screening: General Principles with Historical Applications*, Pergamon Press, 1980. - M. Desai and D. Manjunath, “On the connectivity in finite ad hoc networks,”
*IEEE Communications Letters*, vol. 6, no. 10, pp. 437–439, 2002. - A. Ghasemi and S. Nader-Esfahani, “Exact probability of connectivity in one-dimensional ad hoc wireless networks,”
*IEEE Communications Letters*, vol. 10, no. 4, pp. 251–253, 2006. View at Publisher · View at Google Scholar · View at Scopus - G. McLachlan and D. Peel,
*Finite Mixture Models*, John Wiley & Sons, 2000. - T. A. Wettergren and R. Costa, “Optimal placement of distributed sensors against moving targets,”
*ACM Transactions on Sensor Networks*, vol. 5, no. 3, article 26, pp. 1–25, 2009. View at Publisher · View at Google Scholar · View at Scopus - R. J. Kozick, B. M. Sadler, and D. K. Wilson, “Signal processing and propagation for aeroacoustic sensor networks,” in
*Frontiers in Distributed Sensor Networks*, S. S. Iyengar and R.R. Brooks, Eds., CRC Press LLC, 2004. - C. Ferla and M. B. Porter, “Receiver depth selection for passive sonar systems,”
*IEEE Journal of Oceanic Engineering*, vol. 16, no. 3, pp. 267–278, 1991. View at Publisher · View at Google Scholar · View at Scopus - G. Rudolph, “Convergence analysis of canonical genetic algorithms,”
*IEEE Transactions on Neural Networks*, vol. 5, no. 1, pp. 96–101, 1994. View at Publisher · View at Google Scholar · View at Scopus - R. Fletcher,
*Practical Methods of Optimization*, John Wiley & Sons, 2nd edition, 1987. - D. E. Goldberg,
*Genetic Algorithms in Search, Optimization, and Machine Learning*, Addison Wesley Longman, 1989. - T. M. Cover and J. A. Thomas,
*Elements of Information Theory*, Wiley-Interscience, 1991. - R. Stolkin, L. Vickers, and J. V. Nickerson, “Using environmental models to optimize sensor placement,”
*IEEE Sensors Journal*, vol. 7, no. 3, pp. 319–320, 2007. View at Publisher · View at Google Scholar · View at Scopus - S. A. Musman, P. E. Lehner, and C. Elsaesser, “Sensor planning for elusive targets,”
*Mathematical and Computer Modelling*, vol. 25, no. 3, pp. 103–115, 1997. View at Publisher · View at Google Scholar · View at Scopus - J. S. Przemieniecki,
*Mathematical Methods in Defense Analyses*, American Institute of Aeronautics and Astronautics, Reston, Va, USA, 3rd edition, 2000. - J. F. Chamberland and V. V. Veeravalli, “Decentralized detection in sensor networks,”
*IEEE Transactions on Signal Processing*, vol. 51, no. 2, pp. 407–416, 2003. View at Publisher · View at Google Scholar · View at Scopus - S. Ferrari, “Track coverage in sensor networks,” in
*Proceedings of the American Control Conference*, pp. 2053–2059, Minneapolis, Minn, USA, June 2006. - R. Niu, P. K. Varshney, and Q. Cheng, “Distributed detection in a large wireless sensor network,”
*Information Fusion*, vol. 7, no. 4, pp. 380–394, 2006. View at Publisher · View at Google Scholar · View at Scopus - D.E. Penny, “Multi-sensor management for passive target tracking in an anti-submarine warfare scenario,” in
*IEE Colloquium on Target Tracking: Algorithms and Applications*, vol. 3, pp. 1–5, 1999.