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.

Vitellins and vitellogenins of Dysdercus koenigii (Heteroptera : Pyrrhocoridae) - identification, purification and temporal pattern

Two vitellins, VtA and VtB, were purified from the eggs of Dysdercus koenigii by gel filtration and ion exchange chromatography. VtA and VtB have molecular weights of 290 and 260 kDa, respectively. Both Vts are glycolipoproteinaceous in nature. VtA is composed of three polypeptides of M-r 116, 92 and 62 kDa while VtB contained an additional subunit of M-r 40 kDa. All subunits except the 116-kDa subunit are glycolipopolypeptides. Polyclonal antibody raised against VtA (anti-VtA antibody) cross-reacted with VtB and also with vitellogenic haemolymph and ovaries and pre-vitellogenic fat bodies, but not with haemolymph from either adult male, fifth instar female, or pre-vitellogenic females demonstrating sex and stage specificity of the Vts. Immunoblots in the presence of anti-VtA revealed two proteins (of 290 and 260 kDa) in both vitellogenic haemolymph and pre-vitellogenic fat bodies that are recognised as D. koenigii Vgs. In newly emerged females, Vgs appeared on day 1 in fat bodies and on day 3 in haemolymph and ovaries. Vg concentration was maximum on day 2 in fat body, day 4 in haemolymph and day 7 in ovary. Although the biochemical and temporal characteristics of these proteins show similarity to some hemipterans, they are strikingly dissimilar with those of a very closely related species. (C) 1999 Elsevier Science Inc. All rights reserved.

Molecular cloning and expression pattern of a Cubitus interruptus homologue from the mulberry silkworm Bombyx mori

A homologue of the segment polarity gene Cubitus interruptus from Bombyx Mori, (BmCi) has been cloned and characterized. This region harbouring Zn2+ finger motif is highly conserved across species. In B. Mori, BmCi RNA expression was first detected at stage 6 of embryogenesis, which reached maximum levels at stage 21C and was maintained until larval hatching. The segmentally reiterated striped pattern of transcript distribution in stage 21C embryos was in conformity with its predicted segment polarity nature. BmCi was expressed in the fore- and hind-wing discs, ovaries, testes and gut during fifth larval intermolt, reminiscent of its expression domains in Drosophila. Besides, BmCi expression was seen in the. anterior part of the middle silkglands in late embryonic stages, and this pattern was maintained during larval development. The transition from third to fourth and fifth larval intermolts was accompanied by an increase in the transcript levels in the middle silkglands. Our results demonstrate the presence of a novel expression domain for Ci in Bombyx. (C) 2002 Elsevier Science Ireland Ltd. All rights reserved.

Neural network based optimal routing algorithm for communication networks

This paper presents the capability of the neural networks as a computational tool for solving constrained optimization problem, arising in routing algorithms for the present day communication networks. The application of neural networks in the optimum routing problem, in case of packet switched computer networks, where the goal is to minimize the average delays in the communication have been addressed. The effectiveness of neural network is shown by the results of simulation of a neural design to solve the shortest path problem. Simulation model of neural network is shown to be utilized in an optimum routing algorithm known as flow deviation algorithm. It is also shown that the model will enable the routing algorithm to be implemented in real time and also to be adaptive to changes in link costs and network topology. (C) 2002 Elsevier Science Ltd. All rights reserved.

Expression pattern of Cubitus interruptus from the mulberry silkworm Bombyx mori in late developmental stages

A partial genomic clone of Bombyx mori homologue of the segment polarity gene Cubitus interruptus (BmCi), encoding the conserved zinc finger domain and harbouring two introns, has been characterized. BmCi was expressed in the silkglands of B. mori from embryonic to the late larval stages(3rd, 4th and 5th intermoults). The expression was confined to the anterior region of the middle silkglands, overlapping with the domain of sericin-2 expression and excluding the domains of Bm invected expression, namely the middle and posterior regions of the middle silkglands. In the wing discs, the expression was restricted to the anterior compartment, which increased from 4th to 5th larval intermoults and declined later in the pupal wing buds. In gonadal tissues (both ovaries and testes) BmCi was expressed from the larval to pupal stages. The transcripts were localized to the sperm tubes containing spermatogonia in the testis of Bombyx larvae. BmCi expression, however, was not detected in any of these tissues during the moulting stages. Expression of Ci in the wing discs and gonads is evolutionarily conserved, while the silkgland represents a novel domain. Our results imply that BmCi is involved in the specification and maintenance of micro-compartment identity within the middle silkglands.

Pruned Universal Symbol Sequences for LZW based Language identification

We present a improved language modeling technique for Lempel-Ziv-Welch (LZW) based LID scheme. The previous approach to LID using LZW algorithm prepares the language pattern table using LZW algorithm. Because of the sequential nature of the LZW algorithm, several language specific patterns of the language were missing in the pattern table. To overcome this, we build a universal pattern table, which contains all patterns of different length. For each language it's corresponding language specific pattern table is constructed by retaining the patterns of the universal table whose frequency of appearance in the training data is above the threshold.This approach reduces the classification score (Compression Ratio [LZW-CR] or the weighted discriminant score[LZW-WDS]) for non native languages and increases the LID performance considerably.

Wetlands of Greater Bangalore, India: Automatic Delineation through Pattern Classifiers

Wetlands are the most productive and biologically diverse but very fragile ecosystems. They are vulnerable to even small changes in their biotic and abiotic factors. In recent years, there has been concern over the continuous degradation of wetlands due to unplanned developmental activities. This necessitates inventorying, mapping, and monitoring of wetlands to implement sustainable management approaches. The principal objective of this work is to evolve a strategy to identify and monitor wetlands using temporal remote sensing (RS) data. Pattern classifiers were used to extract wetlands automatically from NIR bands of MODIS, Landsat MSS and Landsat TM remote sensing data. MODIS provided data for 2002 to 2007, while for 1973 and 1992 IR Bands of Landsat MSS and TM (79m and 30m spatial resolution) data were used. Principal components of IR bands of MODIS (250 m) were fused with IRS LISS-3 NIR (23.5 m). To extract wetlands, statistical unsupervised learning of IR bands for the respective temporal data was performed using Bayesian approach based on prior probability, mean and covariance. Temporal analysis of wetlands indicates a sharp decline of 58% in Greater Bangalore attributing to intense urbanization processes, evident from a 466% increase in built-up area from 1973 to 2007.

On the Limits of Spatial Reuse and Cooperative Communication for Dense Wireless Networks

We consider a dense ad hoc wireless network comprising n nodes confined to a given two dimensional region of fixed area. For the Gupta-Kumar random traffic model and a realistic interference and path loss model (i.e., the channel power gains are bounded above, and are bounded below by a strictly positive number), we study the scaling of the aggregate end-to-end throughput with respect to the network average power constraint, P macr, and the number of nodes, n. The network power constraint P macr is related to the per node power constraint, P macr, as P macr = np. For large P, we show that the throughput saturates as Theta(log(P macr)), irrespective of the number of nodes in the network. For moderate P, which can accommodate spatial reuse to improve end-to-end throughput, we observe that the amount of spatial reuse feasible in the network is limited by the diameter of the network. In fact, we observe that the end-to-end path loss in the network and the amount of spatial reuse feasible in the network are inversely proportional. This puts a restriction on the gains achievable using the cooperative communication techniques studied in and, as these rely on direct long distance communication over the network.

D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols

Cooperative relay communication in a fading channel environment under the orthogonal amplify-and-forward (OAF), non-orthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols is considered here. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time code constructions are provided. The codes constructed are sphere decodable and in some instances incur minimum possible delay. Included in our results is the perhaps surprising finding that the OAF and NAF protocols have identical DMT when the time durations of the broadcast and cooperative phases are optimally chosen to suit the respective protocol. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time occupied by the broadcast phase is allowed to vary with multiplexing gain. In the two-relay case, the variable-NSDF protocol is shown to improve on the DMT of the best previously-known static protocol for higher values of multiplexing gain. Our results also establish that the fixed-NSDF protocol has a better DMT than the NAF protocol for any number of relays.

On four-group ML decodable distributed space time codes for cooperative communication

A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase based cooperative diversity protocols of Jing-Hassibi and the recently proposed Generalized Non-orthogonal Amplify and Forward (GNAF) protocol of Rajan et al. The salient feature of the proposed DSTCs is that they satisfy the extra constraints imposed by the protocols and are also four-group ML decodable which leads to significant reduction in ML decoding complexity compared to all existing DSTC constructions. Moreover these codes have uniform distribution of power among the relays as well as in time. Also, simulations results indicate that these codes perform better in comparison with the only known DSTC with the same rate and decoding complexity, namely the Coordinate Interleaved Orthogonal Design (CIOD). Furthermore, they perform very close to DSTCs from field extensions which have same rate but higher decoding complexity.

Access Control in Communication Systems

Access control is an important component in the security of communication systems. While cryptography has rightfully been a significant component in the design of large scale communication systems, its relation to access control, especially its complementarity, has not often been brought out in full. With the wide availability of SELinux, a comprehensive model of access control has all the more become important. In many large scale systems, access control and trust management have become important components in the design. In survivable systems, models of group communication systems may have to be integrated with access control models. In this paper, we discuss the problem of integrating various formalisms often encountered in large scale communication systems, especially in connection with dynamic access control policies as well as trust management