Coalition Formation With Communication Ranges and Moving Targets

A team of unmanned aerial vehicles (UAVs) with limited communication ranges and limited resources are deployed in a region to search and destroy stationary and moving targets. When a UAV detects a target, depending on the target resource requirement, it is tasked to form a coalition over the dynamic network formed by the UAVs. In this paper, we develop a mechanism to find potential coalition members over the network using principles from internet protocol and introduce an algorithm using Particle Swarm Optimization to generate a coalition that destroys the target is minimum time. Monte-Carlo simulations are carried out to study how coalition are formed and the effects of coalition process delays.

Generation of novel materials for nonlinear optics: Analysis of hydrogen-bonded networks in haloaromatic and aliphatic amine-tartrate complexes

Five tartrate-amine complexes have been studied in terms of crystal packing and hydrogen bonding frameworks. The salts are 3-bromoanilinium-L-monohydrogen tartrate 1, 3-fluoroanilinium-D-dibenzoylmonohydrogen tartrate 2, 1-nonylium-D-dibenzoylmonohydrogen tartrate 3, 1 -decylium-D-dibenzoylmonohydrogen tartrate 4, and 1,4-diaminobutanium-D-dibenzoyl tartrate trihydrate 5. The results indicate that there are no halogen-halogen interactions in the haloaromatic-tartrate complexes. The anionic framework allows accomodation of ammonium ions that bear alkyl chain residues of variable lengths. The long chain amines in these structures remain disordered while the short chain amines form multidirectional hydrogen bonds on either side.

Systematic crystallographic investigation of hydrogen-bonded networks involving monohydrogen tartrate-amine complexes: Potential materials for nonlinear optics

Crystal structures of six binary salts involving aromatic amines as cations and hydrogen tartrates as anions are presented. The materials are 2,6-xylidinium-L-monohydrogen tartrate monohydrate, C12H18O6.5N, P22(1)2(1), a = 7.283(2) Angstrom, b = 17.030(2) Angstrom, c = 22.196(2) Angstrom, Z = 8; 2,6-xylidinium-D-dibenzoyl monohydrogen tartrate, C26H25O8N, P2(1), a = 7.906(1) Angstrom, b = 24.757(1) Angstrom, c = 13.166(1) Angstrom, beta = 105.01(1)degrees, Z = 4; 2,3-xylidinium-D-dibenzoyl monohydrogen tartrate monohydrate, C26H26O8.5N, P2(1), a = 7.837(1) Angstrom, b = 24.488(1) Angstrom, c = 13.763(1) Angstrom, beta = 105.69(1)degrees, Z = 4; 2-toluidinium-D-dibenzoyl monohydrogen tartrate, C25H23O8N, P2(1)2(1)2(1), a = 13.553(2) Angstrom, b = 15.869(3) Angstrom, c = 22.123(2) Angstrom, Z = 8; 3-toluidinium-D-dibenzoyl monohydrogen tartrate (1:1), C25H23O8N, P1, a = 7.916(3) Angstrom, b = 11.467(6) Angstrom, c = 14.203(8) Angstrom, alpha = 96.44(4)degrees, beta = 98.20(5)degrees, = 110.55(5)degrees, Z = 2; 3-toluidinium-D-dibenzoyl tartrate dihydrate (1:2), C32H36O10N, P1, a = 7.828(3) Angstrom, b = 8.233(1) Angstrom, c = 24.888(8) Angstrom, alpha = 93.98 degrees, beta = 94.58(3)degrees, = 89.99(2)degrees, Z = 2. An analysis of the hydrogen-bonding schemes in terms of crystal packing, stoichiometric variations, and substitutional variations in these materials provides insights to design hydrogen-bonded networks directed toward the engineering of crystalline nonlinear optical materials.

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.

A new class of three dimensional D-pi-A trigonal cryptand derivatives for second-order nonlinear optics

Synthesis, crystal structures, linear and nonlinear optical properties of tris D-pi-A cryptand derivatives with C-3 symmetry are reported. Three fold symmetry inherent in the cryptand molecules has been utilized for designing these molecules. Molecular nonlinearities have been measured by hyper-Rayleigh scattering (HRS) experiments. Among the compounds studied, L-1 adopts non-centrosymmetric crystal structure. Compounds L-1, L-2, L-3 and L-4 show a measurable SHG powder signal. These molecules are more isotropic and have significantly higher melting points than the classical p-nitroaniline based dipolar NLO compounds, making them useful for further device applications. Besides, different acceptor groups can be attached to the cryptand molecules to modulate their NLO properties.

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.

Synthesis and characterization of mono- and bis-D-pi-A cryptand derivatives for second-order nonlinear optics and its modulation with different metal ion inputs

Two new classes of mono- and bis-D-pi-A cryptand derivatives with a flexible and a rigid cryptand core have been synthesized. The linear and nonlinear optical properties of these molecules are probed. The three dimensional cavity of the cryptand moiety has been utilized to modulate the SHG intensity to different extents in solution with metal ion inputs such as Ni-II,Cu-II,Zn-II, and Cd-II. We also report that decomplexation events can be used to reversibly modulate their NLO responses.

Unsymmetrical aryl disulfides with excellent transparency in the visible region for second order nonlinear optics

Several unsymmetrically substituted aromatic donor acceptor disulfides have been synthesized and analysed for their second order nonlinear optical properties. These molecules exhibit moderately high first hyperpolarizability (beta) with excellent transparency in the visible region. Most of the unsymmetrical disulfides have a cut-off wavelength below 420 nm. Calculations show that the molecules have an asymmetric charge distribution around the disulfide bond which is responsible for their high beta values. These results provide motivation for the design and synthesis of nonlinear optical chromophores with multiple disulfide bonds for large second order nonlinearity and excellent visible transparency.

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

An algorithm for dynamic optimal bandwidth allocation in communication networks

We study the problem of optimal bandwidth allocation in communication networks. We consider a queueing model with two queues to which traffic from different competing flows arrive. The queue length at the buffers is observed every T instants of time, on the basis of which a decision on the amount of bandwidth to be allocated to each buffer for the next T instants is made. We consider a class of closed-loop feedback policies for the system and use a twotimescale simultaneous perturbation stochastic approximation(SPSA) algorithm to find an optimal policy within the prescribed class. We study the performance of the proposed algorithm on a numerical setting. Our algorithm is found to exhibit good performance.