A non-cooperative game-theoretic approach to channel assignment in multi-channel multi-radio wireless networks

Channel assignment in multi-channel multi-radio wireless networks poses a significant challenge due to scarcity of number of channels available in the wireless spectrum. Further, additional care has to be taken to consider the interference characteristics of the nodes in the network especially when nodes are in different collision domains. This work views the problem of channel assignment in multi-channel multi-radio networks with multiple collision domains as a non-cooperative game where the objective of the players is to maximize their individual utility by minimizing its interference. Necessary and sufficient conditions are derived for the channel assignment to be a Nash Equilibrium (NE) and efficiency of the NE is analyzed by deriving the lower bound of the price of anarchy of this game. A new fairness measure in multiple collision domain context is proposed and necessary and sufficient conditions for NE outcomes to be fair are derived. The equilibrium conditions are then applied to solve the channel assignment problem by proposing three algorithms, based on perfect/imperfect information, which rely on explicit communication between the players for arriving at an NE. A no-regret learning algorithm known as Freund and Schapire Informed algorithm, which has an additional advantage of low overhead in terms of information exchange, is proposed and its convergence to the stabilizing outcomes is studied. New performance metrics are proposed and extensive simulations are done using Matlab to obtain a thorough understanding of the performance of these algorithms on various topologies with respect to these metrics. It was observed that the algorithms proposed were able to achieve good convergence to NE resulting in efficient channel assignment strategies.

Composition Driven Monolayer to Bilayer Transformation in a Surfactant Intercalated Mg-Al Layered Double Hydroxide

The structure and organization of dodecyl sulfate (DDS) surfactant chains intercalated in an Mg-Al layered double hydroxide (LDH), Mg(1-x)Alx(OH)(2), with differing Al/Mg ratios has been investigated. The Mg-Al LDHs can be prepared over a range of compositions with x varying from 0.167 to 0.37 and therefore provides a simple system to study how the organization of the alkyl chains of the intercalated DDS anions change with packing density; the Al/Mg ratio or x providing a convenient handle to do so. Powder X-ray diffraction measurements showed that at high packing densities (x >= 0.3) the alkyl chains of the intercalated dodecyl sulfate ions are anchored on opposing LDH sheets and arranged as bilayers with an interlayer spacing of similar to 27 angstrom. At lower packing densities (x < 0.2) the surfactant chains form a monolayer with the alkyl chains oriented flat in the galleries with an interlayer spacing of similar to 8 angstrom. For the in between compositions, 0.2 <= x < 0.3, the material is biphasic. MD simulations were performed to understand how the anchoring density of the intercalated surfactant chains in the Mg-Al LDH-DDS affects the organization of the chains and the interlayer spacing. The simulations are able to reproduce the composition driven monolayer to bilayer transformation in the arrangement of the intercalated surfactant chains and in addition provide insights into the factors that decide the arrangement of the surfactant chains in the two situations. In the bilayer arrangement, it is the dispersive van der Waals interactions between chains in opposing layers of the anchored bilayer that is responsible for the cohesive energy of the solid whereas at lower packing densities, where a monolayer arrangement is favored, Coulomb interactions between the positively charged Mg-Al LDH sheets and the negatively charged headgroup of the DDS anion dominate.

Past Queue Length Based Low-Overhead Link Scheduling in Multi-beam Wireless Mesh Networks

Wireless mesh networks with multi-beam capability at each node through the use of multi-antenna beamforming are becoming practical and attracting increased research attention. Increased capacity due to spatial reuse and increased transmission range are potential benefits in using multiple directional beams in each node. In this paper, we are interested in low-complexity scheduling algorithms in such multi-beam wireless networks. In particular, we present a scheduling algorithm based on queue length information of the past slots in multi-beam networks, and prove its stability. We present a distributed implementation of this proposed algorithm. Numerical results show that significant improvement in delay performance is achieved using the proposed multi-beam scheduling compared to omni-beam scheduling. In addition, the proposed algorithm is shown to achieve a significant reduction in the signaling overhead compared to a current slot queue length approach.

Matrix method for eigenstructure assignment - The multi-input case with application

The eigenvalue and eigenstructure assignment procedure has found application in a wide variety of control problems. In this paper a method for assigning eigenstructure to a linear time invariant multi-input system is proposed. The algorithm determines a matrix that has eigenvalues and eigenvectors at the desired locations. It is obtained from the knowledge of the open-loop system and the desired eigenstructure. Solution of the matrix equation, involving unknown controller gams, open-loop system matrices, and desired eigenvalues and eigenvectors, results hi the state feedback controller. The proposed algorithm requires the closed-loop eigenvalues to be different from those of the open-loop case. This apparent constraint can easily be overcome by a negligible shift in the values. Application of the procedure is illustrated through the offset control of a satellite supported, from an orbiting platform, by a flexible tether.

Multi-Agent Rendezvous Algorithm with Rectilinear Decision Domain

The aim of this paper is to develop a computationally efficient decentralized rendezvous algorithm for a group of autonomous agents. The algorithm generalizes the notion of sensor domain and decision domain of agents to enable implementation of simple computational algorithms. Specifically, the algorithm proposed in this paper uses a rectilinear decision domain (RDD) as against the circular decision domain assumed in earlier work. Because of this, the computational complexity of the algorithm reduces considerably and, when compared to the standard Ando's algorithm available in the literature, the RDD algorithm shows very significant improvement in convergence time performance. Analytical results to prove convergence and supporting simulation results are presented in the paper.

Positional Consensus of Multi-Agent Systems Using Linear Programming Based Decentralized Control with Rectilinear Decision Domain

In this paper we develop a Linear Programming (LP) based decentralized algorithm for a group of multiple autonomous agents to achieve positional consensus. Each agent is capable of exchanging information about its position and orientation with other agents within their sensing region. The method is computationally feasible and easy to implement. Analytical results are presented. The effectiveness of the approach is illustrated with simulation results.

Layered Tabu Search Algorithm for Large-MIMO Detection and a Lower Bound on ML Performance

In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions in this paper are two-fold. First, we propose a low-complexity algorithm for large-MIMO detection based on a layered low-complexity local neighborhood search. Second, we obtain a lower bound on the maximum-likelihood (ML) bit error performance using the local neighborhood search. The advantages of the proposed ML lower bound are i) it is easily obtained for MIMO systems with large number of antennas because of the inherent low complexity of the search algorithm, ii) it is tight at moderate-to-high SNRs, and iii) it can be tightened at low SNRs by increasing the number of symbols in the neighborhood definition. Interestingly, the proposed detection algorithm based on the layered local search achieves bit error performances which are quite close to this lower bound for large number of antennas and higher-order QAM. For e. g., in a 32 x 32 V-BLAST MIMO system, the proposed detection algorithm performs close to within 1.7 dB of the proposed ML lower bound at 10(-3) BER for 16-QAM (128 bps/Hz), and close to within 4.5 dB of the bound for 64-QAM (192 bps/Hz).

Matrix method for eigenstructure assignment - The multi-input case with application

The eigenvalue and eigenstructure assignment procedure has found application in a wide variety of control problems. In this paper a method for assigning eigenstructure to a Linear time invariant multi-input system is proposed. The algorithm determines a matrix that has eigenvalues and eigenvectors at the desired locations. It is obtained from the knowledge of the open-loop system and the desired eigenstructure. solution of the matrix equation, involving unknown controller gains, open-loop system matrices, and desired eigenvalues and eigenvectors, results in the state feedback controller. The proposed algorithm requires the closed-loop eigenvalues to be different from those of the open-loop case. This apparent constraint can easily be overcome by a negligible shift in the values. Application of the procedure is illustrated through the offset control of a satellite supported, from an orbiting platform, by a flexible tether,

Diffusion path during internal displacement reactions in multi-component oxides: Reaction between Fe and (Co,Mg)TiO3 solid solution at 1273 K

The reaction between Fe foil and a disc of ilmenite solid solution (Co-0.48 Ni-0.52) TiO3 was studied at 1273 K. At the metal/oxide interface, the displacement reaction, Fe + (Co,Mg)TiO3 = Co + (Fe,Mg)TiO3 occurs, resulting in an ilmenite solid solution containing three divalent cations. Ferrous ions diffuse into the oxide solid solution and cause the precipitation of Co-Fe alloy as discrete particles inside the oxide matrix. The morphology of the product layer was characterized by SEM. Only two phases, alloy and ilmenite, were detected in the reaction zone. This suggests that the local flux condition imposed by ilmenite stoichiometry (Co + Fe + Mg):Ti = 1:1] was satisfied during the reactive diffusion: (J(Co) + J(Fe) + J(Mg)) = J(Ti). The composition of the alloy and the oxide was determined using EPMA as a function of distance in the direction of diffusion. Although Mg does not participate in the displacement reaction, its composition in the ilmenite phase was found to be position dependent inside the reaction zone. The up-hill diffusion of inert Mg is caused by the development of chemical potential gradients as a result of displacement reaction. The evolution of composition gradients inside the reaction zone and the diffusion path in a ternary composition diagram of the system CoTiO3-FeTiO3-MgTiO3 are discussed. (C) 2010 Elsevier B.V. All rights reserved.

Low-Complexity Detection and Performance in Multi-Gigabit High Spectral Efficiency Wireless Systems

Recently, we reported a low-complexity likelihood ascent search (LAS) detection algorithm for large MIMO systems with several tens of antennas that can achieve high spectral efficiencies of the order of tens to hundreds of bps/Hz. Through simulations, we showed that this algorithm achieves increasingly near SISO AWGN performance for increasing number of antennas in Lid. Rayleigh fading. However, no bit error performance analysis of the algorithm was reported. In this paper, we extend our work on this low-complexity large MIMO detector in two directions: i) We report an asymptotic bit error probability analysis of the LAS algorithm in the large system limit, where N-t, N-r -> infinity keeping N-t = N-r, where N-t and N-r are the number of transmit and receive antennas, respectively. Specifically, we prove that the error performance of the LAS detector for V-BLAST with 4-QAM in i.i.d. Rayleigh fading converges to that of the maximum-likelihood (ML) detector as N-t, N-r -> infinity keeping N-t = N-r ii) We present simulated BER and nearness to capacity results for V-BLAST as well as high-rate non-orthogonal STBC from Division Algebras (DA), in a more realistic spatially correlated MIMO channel model. Our simulation results show that a) at an uncoded BER of 10(-3), the performance of the LAS detector in decoding 16 x 16 STBC from DA with N-t = = 16 and 16-QAM degrades in spatially correlated fading by about 7 dB compared to that in i.i.d. fading, and 19) with a rate-3/4 outer turbo code and 48 bps/Hz spectral efficiency, the performance degrades by about 6 dB at a coded BER of 10(-4). Our results further show that providing asymmetry in number of antennas such that N-r > N-t keeping the total receiver array length same as that for N-r = N-t, the detector is able to pick up the extra receive diversity thereby significantly improving the BER performance.

Reactivity and catalytic activity of layered YBA2CU3O7-delta (123) type defect perovskites

The chemical modifications of structure, reactivity and catalytic properties of layered triple perovskite oxides, related to the YBa2Cu3O7-delta (123) system, have been briefly reviewed. These oxides form a versatile family of materials with wide-ranging chemical and physical properties. The multiple sites available for chemical doping, and the ability to reversibly intercalate oxygen at the defect sites have rendered these oxides important model systems in the area of oxide catalysis. An attempt has been made to comprehend the hitherto known catalytic reactions and correlate them to various factors like structure, oxygen diffusional limitations, different geometries adopted by various substituents, oxidative non-stoichiometry and activation energy for oxygen desorption. In particular, results on the enhanced catalytic activity of cobalt-substituted 123 oxide systems towards the selective catalytic oxidation of ammonia to nitric oxide and carbon monoxide to carbon dioxide are presented.

Soft chemical synthesis of new layered and three-dimensional oxide hydrates, hxVxW1-xO3×yH2O, related to WO3×2 H2O and WO3. times.1/3 H2O

Two new vanadium-tungsten oxide hydrates of the formulas, H0.125V0.125W0.875O3.1.5H2O (I) and Ho.33V0.33W0.67O3.1/3H2O (II), have been synthesized by acid-leaching of LiVWO6 with aqueous HNO3/HCl. While phase I obtained by treatment of LiVWO6 with dilute HNO3/HCl possesses an orthorhombic structure (a = 7.77(3), b = 13.87(6), c = 7.44(3) angstrom) related to WO3.2H2O, phase II, prepared by refluxing LiVWO6 with concentrated HNO3, is isostructural with WO3.1/3H2O. Dehydration of II around 330-degrees-C yields a hexagonal phase (III, a = 7.25(4), c = 7.74(3) angstrom) isotypic with hexagonal WO3. Both land III exhibit redox and acid-base intercalation reactivity characteristic of layered and tunnel structures.

ChemInform Abstract: Synthesis of Anion-Deficient Layered Perovskites, ACa2Nb3-xMxO10-x (A: Rb, Cs; M: Al, Fe), Exhibiting Ion-Exchange and Intercalation. Evidence for the Formation of Layered Brownmillerites, ACa2Nb2AlO9 (A: Cs, H)

Anion-deficient layered perovskite oxides of the formula, ACa2Nb3-xMxO10-x (A = Rb, Cs; M = Al, Fe) for 0 < x less-than-or-equal-to 1.0, possessing tetragonal structures similar to the parent ACa2Nb3O10, have been synthesized. The interlayer A cations in these materials are readily exchanged with protons in aqueous HNO3 to give the protonated derivatives, HCa2Nb3-xMxO10-x; the latter are solid Bronsted acids intercalating a number of organic amines including aniline (pK(a) = 4.63). The distribution of acid sites in the interlayer region of HCa2Nb2MO9 inferred from n-alkylamine intercalation suggests that oxygen vacancies and Nb/M atoms are disordered in the ACa2Nb2MO9 samples prepared at 1100-1200-degrees-C. Annealing a disordered sample of CsCa2Nb2AlO9 for a long time at lower temperatures tends to order the Nb/Al atoms and oxygen vacancies to produce octahedral (NbO6/2)-tetrahedral (AlO4/2)-octahedral (NbO6/2) layer sequence reminiscent of the brownmillerite structure.

An experimental investigation into pile group-layered soil interaction

An interaction analysis of an axially loaded single pile and pile group with and without a pile cap in a layered soil medium has been investigated using the two-dimensional photoelastic method. A study of the pile or pile group behaviour has been made, varying the pile cap thickness as well as the embedded length of the pile in the hard stratum. The shear stress distribution along the pile-soil interface, non-dimensionalized settlement values of the single pile and the interaction factor for the pile group have been presented. Wherever possible, the results of the present analysis have been compared with available numerical solutions.

Automated Multi-Agent Search Using Centroidal Voronoi Configuration

This paper addresses the problem of automated multiagent search in an unknown environment. Autonomous agents equipped with sensors carry out a search operation in a search space, where the uncertainty, or lack of information about the environment, is known a priori as an uncertainty density distribution function. The agents are deployed in the search space to maximize single step search effectiveness. The centroidal Voronoi configuration, which achieves a locally optimal deployment, forms the basis for the proposed sequential deploy and search strategy. It is shown that with the proposed control law the agent trajectories converge in a globally asymptotic manner to the centroidal Voronoi configuration. Simulation experiments are provided to validate the strategy. Note to Practitioners-In this paper, searching an unknown region to gather information about it is modeled as a problem of using search as a means of reducing information uncertainty about the region. Moreover, multiple automated searchers or agents are used to carry out this operation optimally. This problem has many applications in search and surveillance operations using several autonomous UAVs or mobile robots. The concept of agents converging to the centroid of their Voronoi cells, weighted with the uncertainty density, is used to design a search strategy named as sequential deploy and search. Finally, the performance of the strategy is validated using simulations.