Intruder detection over sensor placement in a hexagonal lattice

The problem of intrusion detection and location identification in the presence of clutter is considered for a hexagonal sensor-node geometry. It is noted that in any practical application,for a given fixed intruder or clutter location, only a small number of neighboring sensor nodes will register a significant reading. Thus sensing may be regarded as a local phenomenon and performance is strongly dependent on the local geometry of the sensor nodes. We focus on the case when the sensor nodes form a hexagonal lattice. The optimality of the hexagonal lattice with respect to density of packing and covering and largeness of the kissing number suggest that this is the best possible arrangement from a sensor network viewpoint. The results presented here are clearly relevant when the particular sensing application permits a deterministic placement of sensors. The results also serve as a performance benchmark for the case of a random deployment of sensors. A novel feature of our analysis of the hexagonal sensor grid is a signal-space viewpoint which sheds light on achievable performance.Under this viewpoint, the problem of intruder detection is reduced to one of determining in a distributed manner, the optimal decision boundary that separates the signal spaces SI and SC associated to intruder and clutter respectively. Given the difficulty of implementing the optimal detector, we present a low-complexity distributive algorithm under which the surfaces SI and SC are separated by a wellchosen hyperplane. The algorithm is designed to be efficient in terms of communication cost by minimizing the expected number of bits transmitted by a sensor.

Source-channel coding for Gaussian sources over a Gaussian multiple access channel

We consider the problem of distributed joint source-channel coding of correlated Gaussian sources over a Gaussian Multiple Access Channel (MAC). There may be side information at the encoders and/or at the decoder. First we specialize a general result in [16] to obtain sufficient conditions for reliable transmission over a Gaussian MAC. This system does not satisfy the source channel separation. Thus, next we study and compare three joint source channel coding schemes available in literature.

Influences of the springtime northern Indian biomass burning over the central Himalayas

The influences of the springtime northern Indian biomass burning are shown for the first time over the central Himalayas by using three years (2007-2009) of surface and space based observations along with a radiative transfer model. Near-surface ozone, black carbon (BC), spectral aerosol optical depths (AODs) and the meteorological parameters are measured at a high altitude site Nainital (29.37 degrees N, 79.45 degrees E, 1958 m amsl) located in the central Himalayas. The satellite observations include the MODIS derived fire counts and AOD (0.55 mu m), and OMI derived tropospheric column NO(2), ultraviolet aerosol index and single scattering albedo. MODIS fire counts and BC observations are used to identify the fire-impacted periods (372 h during 2007-2009) and hence the induced enhancements in surface BC, AOD (0.5 mu m) and ozone are estimated to be 1802 ng m(-3) (similar to 145%), 0.3 (similar to 150%) and 19 ppbv (similar to 34%) respectively. Large enhancements (53-100%) are also seen in the satellite derived parameters over a 2 degrees x 2 degrees region around Nainital. The present analysis highlights the northern Indian biomass burning induced cooling at the surface (-27 W m(-2)) and top of the atmosphere (-8 W m(-2)) in the lesser polluted high altitude regions of the central Himalayas. This cooling leads to an additional atmospheric warming of 19 W m(-2) and increases the lower atmospheric heating rate by 0.8 K day(-1). These biomass burning induced changes over the central Himalayan atmosphere during spring may also lead to enhanced short-wave absorption above clouds and might have an impact on the monsoonal rainfall.

Fast-Group-Decodable STBCs via Codes over GF(4): Further Results

Recently in, a framework was given to construct low ML decoding complexity Space-Time Block Codes (STBCs) via codes over the finite field F4. In this paper, we construct new full-diversity STBCs with cubic shaping property and low ML decoding complexity via codes over F4 for number of transmit antennas N = 2m, m >; 1, and rates R >; 1 complex symbols per channel use. The new codes have the least ML decoding complexity among all known codes for a large set of (N, R) pairs. The new full-rate codes of this paper (R = N) are not only information-lossless and fully diverse but also have the least known ML decoding complexity in the literature. For N ≥ 4, the new full-rate codes are the first instances of full-diversity, information-lossless STBCs with low ML decoding complexity. We also give a sufficient condition for STBCs obtainable from codes over F4 to have cubic shaping property, and a sufficient condition for any design to give rise to a full-diversity STBC when the symbols are encoded using rotated square QAM constellations.

On Convergence of Differential Evolution Over a Class of Continuous Functions With Unique Global Optimum

Differential evolution (DE) is arguably one of the most powerful stochastic real-parameter optimization algorithms of current interest. Since its inception in the mid 1990s, DE has been finding many successful applications in real-world optimization problems from diverse domains of science and engineering. This paper takes a first significant step toward the convergence analysis of a canonical DE (DE/rand/1/bin) algorithm. It first deduces a time-recursive relationship for the probability density function (PDF) of the trial solutions, taking into consideration the DE-type mutation, crossover, and selection mechanisms. Then, by applying the concepts of Lyapunov stability theorems, it shows that as time approaches infinity, the PDF of the trial solutions concentrates narrowly around the global optimum of the objective function, assuming the shape of a Dirac delta distribution. Asymptotic convergence behavior of the population PDF is established by constructing a Lyapunov functional based on the PDF and showing that it monotonically decreases with time. The analysis is applicable to a class of continuous and real-valued objective functions that possesses a unique global optimum (but may have multiple local optima). Theoretical results have been substantiated with relevant computer simulations.