Distributed intrusion detection in the presence of correlated sensor readings: Signal-space and communication-complexity view-point

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space view-point is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces f(s) and f(g) and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating f(s) and f(g) is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication-complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. Extensions to the multi-party case is straightforward and is briefly discussed. The average case CC of the relevant greaterthan (CT) function is characterized within two bits. Under the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm. 2010 Elsevier B.V. All rights reserved.

The complexity of certain incremental code generation problems

This paper looks at the complexity of four different incremental problems. The following are the problems considered: (1) Interval partitioning of a flow graph (2) Breadth first search (BFS) of a directed graph (3) Lexicographic depth first search (DFS) of a directed graph (4) Constructing the postorder listing of the nodes of a binary tree. The last problem arises out of the need for incrementally computing the Sethi-Ullman (SU) ordering [1] of the subtrees of a tree after it has undergone changes of a given type. These problems are among those that claimed our attention in the process of our designing algorithmic techniques for incremental code generation. BFS and DFS have certainly numerous other applications, but as far as our work is concerned, incremental code generation is the common thread linking these problems. The study of the complexity of these problems is done from two different perspectives. In [2] is given the theory of incremental relative lower bounds (IRLB). We use this theory to derive the IRLBs of the first three problems. Then we use the notion of a bounded incremental algorithm [4] to prove the unboundedness of the fourth problem with respect to the locally persistent model of computation. Possibly, the lower bound result for lexicographic DFS is the most interesting. In [5] the author considers lexicographic DFS to be a problem for which the incremental version may require the recomputation of the entire solution from scratch. In that sense, our IRLB result provides further evidence for this possibility with the proviso that the incremental DFS algorithms considered be ones that do not require too much of preprocessing.

A New Full-diversity Criterion and Low-complexity STBCs with Partial Interference Cancellation Decoding

Recently, Guo and Xia gave sufficient conditions for an STBC to achieve full diversity when a PIC (Partial Interference Cancellation) or a PIC-SIC (PIC with Successive Interference Cancellation) decoder is used at the receiver. In this paper, we give alternative conditions for an STBC to achieve full diversity with PIC and PIC-SIC decoders, which are equivalent to Guo and Xia's conditions, but are much easier to check. Using these conditions, we construct a new class of full diversity PIC-SIC decodable codes, which contain the Toeplitz codes and a family of codes recently proposed by Zhang, Xu et. al. as proper subclasses. With the help of the new criteria, we also show that a class of PIC-SIC decodable codes recently proposed by Zhang, Shi et. al. can be decoded with much lower complexity than what is reported, without compromising on full diversity.

On the diversity and complexity of Zero Forcing receivers for MIMO Zero Padded systems

Zero padded systems with linear receivers are shown to be robust and amenable to fast implementations in single antenna scenarios. In this paper, properties of such systems are investigated when multiple antennas are present at both ends of the communication link. In particular, their diversity and complexity are evaluated for precoded transmissions. The linear receivers are shown to exploit multipath and receive diversities, even in the absence of any coding at the transmitter. Use of additional redundancy to improve performance is considered and the effect of transmission rate on diversity order is analyzed. Low complexity implementations of Zero Forcing receivers are devised to further enhance their applicability.

X-Codes: A Low Complexity Full-Rate High-Diversity Achieving Precoder for TDD MIMO Systems

We consider a time division duplex multiple-input multiple-output (nt × nr MIMO). Using channel state information (CSI) at the transmitter, singular value decomposition (SVD) of the channel matrix is performed. This transforms the MIMO channel into parallel subchannels, but has a low overall diversity order. Hence, we propose X-Codes which achieve a higher diversity order by pairing the subchannels, prior to SVD preceding. In particular, each pair of information symbols is encoded by a fixed 2 × 2 real rotation matrix. X-Codes can be decoded using nr very low complexity two-dimensional real sphere decoders. Error probability analysis for X-Codes enables us to choose the optimal pairing and the optimal rotation angle for each pair. Finally, we show that our new scheme outperforms other low complexity precoding schemes.

Simultaneous MultiStreaming for complexity-effective VLIW architectures

Very Long Instruction Word (VLIW) architectures exploit instruction level parallelism (ILP) with the help of the compiler to achieve higher instruction throughput with minimal hardware. However, control and data dependencies between operations limit the available ILP, which not only hinders the scalability of VLIW architectures, but also result in code size expansion. Although speculation and predicated execution mitigate ILP limitations due to control dependencies to a certain extent, they increase hardware cost and exacerbate code size expansion. Simultaneous multistreaming (SMS) can significantly improve operation throughput by allowing interleaved execution of operations from multiple instruction streams. In this paper we study SMS for VLIW architectures and quantify the benefits associated with it using a case study of the MPEG-2 video decoder. We also propose the notion of virtual resources for VLIW architectures, which decouple architectural resources (resources exposed to the compiler) from the microarchitectural resources, to limit code size expansion. Our results for a VLIW architecture demonstrate that: (1) SMS delivers much higher throughput than that achieved by speculation and predicated execution, (2) the increase in performance due to the addition of speculation and predicated execution support over SMS averages around 12%. The minor increase in performance might not warrant the additional hardware complexity involved, and (3) the notion of virtual resources is very effective in reducing no-operations (NOPs) and consequently reduce code size with little or no impact on performance.

A Low-Complexity, Full-Rate, Full-Diversity 2x2 STBC with Golden Code's Coding Gain

This paper presents a low-ML-decoding-complexity, full-rate, full-diversity space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna multiple-input multipleoutput (MIMO) system, with coding gain equal to that of the best and well known Golden code for any QAM constellation.Recently, two codes have been proposed (by Paredes, Gershman and Alkhansari and by Sezginer and Sari), which enjoy a lower decoding complexity relative to the Golden code, but have lesser coding gain. The 2 × 2 STBC presented in this paper has lesser decoding complexity for non-square QAM constellations,compared with that of the Golden code, while having the same decoding complexity for square QAM constellations. Compared with the Paredes-Gershman-Alkhansari and Sezginer-Sari codes, the proposed code has the same decoding complexity for nonrectangular QAM constellations. Simulation results, which compare the codeword error rate (CER) performance, are presented.

Low Complexity Wideband LSFQuantization Using GMM of Uncorrelated Gaussian Mixtures

We develop a Gaussian mixture model (GMM) based vector quantization (VQ) method for coding wideband speech line spectrum frequency (LSF) parameters at low complexity. The PDF of LSF source vector is modeled using the Gaussian mixture (GM) density with higher number of uncorrelated Gaussian mixtures and an optimum scalar quantizer (SQ) is designed for each Gaussian mixture. The reduction of quantization complexity is achieved using the relevant subset of available optimum SQs. For an input vector, the subset of quantizers is chosen using nearest neighbor criteria. The developed method is compared with the recent VQ methods and shown to provide high quality rate-distortion (R/D) performance at lower complexity. In addition, the developed method also provides the advantages of bitrate scalability and rate-independent complexity.

Low complexity Bit allocation algorithms for AAC encoding

We have developed two reduced complexity bit-allocation algorithms for MP3/AAC based audio encoding, which can be useful at low bit-rates. One algorithm derives optimum bit-allocation using constrained optimization of weighted noise-to-mask ratio and the second algorithm uses decoupled iterations for distortion control and rate control, with convergence criteria. MUSHRA based evaluation indicated that the new algorithm would be comparable to AAC but requiring only about 1/10 th the complexity.

Nature's Swiss Army Knives: Ovipositor Structure Mirrors Ecology in a Multitrophic Fig Wasp Community

Background: Resource partitioning is facilitated by adaptations along niche dimensions that range from morphology to behaviour. The exploitation of hidden resources may require specially adapted morphological or sensory tools for resource location and utilisation. Differences in tool diversity and complexity can determine not only how many species can utilize these hidden resources but also how they do so. Methodology and Principal Findings: The sclerotisation, gross morphology and ultrastructure of the ovipositors of a seven-member community of parasitic wasps comprising of gallers and parasitoids developing within the globular syconia (closed inflorescences) of Ficus racemosa (Moraceae) was investigated. These wasps also differ in their parasitism mode (external versus internal oviposition) and their timing of oviposition into the expanding syconium during its development. The number and diversity of sensilla, as well as ovipositor teeth, increased from internally ovipositing to externally ovipositing species and from gallers to parasitoids. The extent of sclerotisation of the ovipositor tip matched the force required to penetrate the syconium at the time of oviposition of each species. The internally ovipositing pollinator had only one type of sensillum and a single notch on the ovipositor tip. Externally ovipositing species had multiple sensilla types and teeth on their ovipositors. Chemosensilla were most concentrated at ovipositor tips while mechanoreceptors were more widely distributed, facilitating the precise location of hidden hosts in these wasps which lack larval host-seeking behaviour. Ovipositor traits of one parasitoid differed from those of its syntopic galler congeners and clustered with those of parasitoids within a different wasp subfamily. Thus ovipositor tools can show lability based on adaptive necessity, and are not constrained by phylogeny. Conclusions/Significance: Ovipositor structure mirrored the increasingly complex trophic ecology and requirements for host accessibility in this parasite community. Ovipositor structure could be a useful surrogate for predicting the biology of parasites in other communities.

Ecological Assessment of Lentic Water Bodies of Bangalore

The restoration, conservation and management of water resources require a thorough understanding of what constitutes a healthy ecosystem. Monitoring and assessment provides the basic information on the condition of our waterbodies. The present work details the study carried out at two waterbodies, namely, the Chamarajasagar reservoir and the Madiwala Lake. The waterbodies were selected on the basis of their current use and locations. Chamarajasagar reservoir serves the purpose of supplying drinking water to Bangalore city and is located on the outskirts of the city surrounded by agricultural and forest land. On the other hand, Madiwala lake is situated in the heart of Bangalore city receiving an influx of pollutants from domestic and industrial sewage. Comparative assessment of the surface water quality of both were carried out by instituting the various physico–chemical and biological parameters. The physico-chemical analyses included temperature, transparency, pH, electrical conductivity, dissolved oxygen, alkalinity, total hardness, calcium hardness, magnesium hardness, nitrates, phosphates, sodium, potassium and COD measurements of the given waterbody. The analysis was done based on the standard methods prescribed (or recommended) by (APHA) and NEERI. The biological parameter included phytoplankton analysis. The detailed investigations of the parameters, which are well within the tolerance limits in Chamarajasagar reservoir, indicate that it is fairly unpolluted, except for the pH values, which indicate greater alkalinity. This may be attributed to the natural causes and the agricultural runoff from the catchment. On the contrary, the limnology of Madiwala lake is greatly influenced by the inflow of sewage that contributes significantly to the dissolved solids of the lake water, total hardness, alkalinity and a low DO level. Although, the two study areas differ in age, physiography, chemistry and type of inflows, they still maintain a phytoplankton distribution overwhelmingly dominated by Cyanophyceae members,specifically Microcystis aeruginosa. These blue green algae apparently enter the waterbodies from soil, which are known to harbour a rich diversity of blue green flora with several species common to limnoplankton, a feature reported to be unique to the south Indian lakes.Chamarajasagar water samples revealed five classes of phytoplankton, of which Cyanophyceae (92.15 percent) that dominated other algal forms comprised of one single species of Microcystis aeruginosa. The next major class of algae was Chlorophyceae (3.752 percent) followed by Dinophyceae (3.51 percent), Bacillariophyceae (0.47 percent) and a sparsely available and unidentified class (0.12 percent).Madiwala Lake phytoplankton, in addition to Cyanophyceae (26.20 percent), revealed a high density of Chlorophyceae members (73.44 percent) dominated by Scenedesmus sp.,Pediastrum sp., and Euglena sp.,which are considered to be indicators of organic pollution. The domestic and industrial sewage, which finds its way into the lake, is a factor causing organic pollution. As compared to the other classes, Euglenophyceae and Bacillariophyceae members were the lowest in number. Thus, the analysis of various parameters indicates that Chamarajasagar reservoir is relatively unpolluted except for the high percentage of Microcystis aeruginosa, and a slightly alkaline nature of water. Madiwala lake samples revealed eutrophication and high levels of pollution, which is clarified by the physico–chemical analysis, whose values are way above the tolerance limits. Also, the phytoplankton analysis in Madiwala lake reveals the dominance of Chlorophyceae members, which indicate organic pollution (sewage being the causative factor).

A Low ML-Decoding Complexity, Full-Diversity, Full-Rate MIMO Precoder

Precoding for multiple-input multiple-output (MIMO) antenna systems is considered with perfect channel knowledge available at both the transmitter and the receiver. For two transmit antennas and QAM constellations, a real-valued precoder which is approximately optimal (with respect to the minimum Euclidean distance between points in the received signal space) among real-valued precoders based on the singular value decomposition (SVD) of the channel is proposed. The proposed precoder is obtainable easily for arbitrary QAM constellations, unlike the known complex-valued optimal precoder by Collin et al. for two transmit antennas which is in existence for 4-QAM alone and is extremely hard to obtain for larger QAM constellations. The proposed precoding scheme is extended to higher number of transmit antennas on the lines of the E - d(min) precoder for 4-QAM by Vrigneau et al. which is an extension of the complex-valued optimal precoder for 4-QAM. The proposed precoder's ML-decoding complexity as a function of the constellation size M is only O(root M)while that of the E - d(min) precoder is O(M root M)(M = 4). Compared to the recently proposed X- and Y-precoders, the error performance of the proposed precoder is significantly better while being only marginally worse than that of the E - d(min) precoder for 4-QAM. It is argued that the proposed precoder provides full-diversity for QAM constellations and this is supported by simulation plots of the word error probability for 2 x 2, 4 x 4 and 8 x 8 systems.