Channel quantization for physical layer network-coded two-way relaying

The design of modulation schemes for the physical layer network-coded two way relaying scenario is considered with the protocol which employs two phases: Multiple access (MA) Phase and Broadcast (BC) phase. It was observed by Koike-Akino et al. that adaptively changing the network coding map used at the relay according to the channel conditions greatly reduces the impact of multiple access interference which occurs at the relay during the MA phase. In other words, the set of all possible channel realizations (the complex plane) is quantized into a finite number of regions, with a specific network coding map giving the best performance in a particular region. We obtain such a quantization analytically for the case when M-PSK (for M any power of 2) is the signal set used during the MA phase. We show that the complex plane can be classified into two regions: a region in which any network coding map which satisfies the so called exclusive law gives the same best performance and a region in which the choice of the network coding map affects the performance, which is further quantized based on the choice of the network coding map which optimizes the performance. The quantization thus obtained analytically, leads to the same as the one obtained using computer search for 4-PSK signal set by Koike-Akino et al., for the specific value of M = 4.

Measurement Based Impromptu Deployment of a Multi-Hop Wireless Relay Network

We study the problem of optimal sequential (''as-you-go'') deployment of wireless relay nodes, as a person walks along a line of random length (with a known distribution). The objective is to create an impromptu multihop wireless network for connecting a packet source to be placed at the end of the line with a sink node located at the starting point, to operate in the light traffic regime. In walking from the sink towards the source, at every step, measurements yield the transmit powers required to establish links to one or more previously placed nodes. Based on these measurements, at every step, a decision is made to place a relay node, the overall system objective being to minimize a linear combination of the expected sum power (or the expected maximum power) required to deliver a packet from the source to the sink node and the expected number of relay nodes deployed. For each of these two objectives, two different relay selection strategies are considered: (i) each relay communicates with the sink via its immediate previous relay, (ii) the communication path can skip some of the deployed relays. With appropriate modeling assumptions, we formulate each of these problems as a Markov decision process (MDP). We provide the optimal policy structures for all these cases, and provide illustrations of the policies and their performance, via numerical results, for some typical parameters.

Network, nodes and nexus: systems approach to multitarget therapeutics

Systems biology is revealing multiple layers of regulatory networks that manifest spatiotemporal variations. Since genes and environment also influence the emergent property of a cell, the biological output requires dynamic understanding of various molecular circuitries. The metabolic networks continually adapt and evolve to cope with the changing milieu of the system, which could also include infection by another organism. Such perturbations of the functional networks can result in disease phenotypes, for instance tuberculosis and cancer. In order to develop effective therapeutics, it is important to determine the disease progression profiles of complex disorders that can reveal dynamic aspects and to develop mutitarget systemic therapies that can help overcome pathway adaptations and redundancy.

6PANview: Application performance conscious network monitoring for 6LoWPAN based WSNs

6PANview[1] is a Wireless Sensor Network(WSN) monitoring system for 6LoWPAN/RPL networks which we developed as an overlay network for a WSN application. A monitoring system, while performing its operations for maintaining the health of the monitored network, must also be conscious of its impact on the application performance, and must strive to minimize this impact. To this end, we propose a centralized scheduling algorithm within 6PANview which non-intrusively analyzes application traffic arrival patterns at the base station, identifies network idle periods and schedules monitoring activities. The proposed algorithm finds those periodic sequences which are likely to have given rise to the pattern of arrivals seen at the base station. Parts of those sequences are then extended to coarsely predict future traffic and find epochs where low traffic is predicted, in order to schedule monitoring traffic or other activities at these times. We present simulation results for the proposed prediction and scheduling algorithm and its implementation as part of 6PANview. As an enhancement, we briefly talk about using 6PANview's overlay network architecture for distributed scheduling.

Providing QoS in a cognitive radio network

We consider the problem of wireless channel allocation (whenever the channels are free) to multiple cognitive radio users in a Cognitive Radio Network (CRN) so as to satisfy their Quality of Service (QoS) requirements efficiently. The CRN base station may not know the channel states of all the users. The multiple channels are available at random times. In this setup Opportunistic Splitting can be an attractive solution. A disadvantage of this algorithm is that it requires the metrics of all users to be an independent, identically distributed sequence. However we use a recently generalized version of this algorithm in which the optimal parameters are learnt on-line through stochastic approximation and metrics can be Markov. We provide scheduling algorithms which maximize weighted-sum system throughput or are throughput or delay optimal. We also consider the scenario when some traffic streams are delay sensitive.

Flow resistance network analysis of the back-pressure of automotive mufflers

Complexity of mufflers generally introduces considerable pressure drop, which affects the engine performance adversely. Not much literature is available for pressure drop across perforates. In this paper, the stagnation pressure drop across perforated muffler elements has been measured experimentally and generalized expressions have been developed for the pressure loss across cross-flow expansion and cross-flow contraction elements. A flow resistance model available in the literature has been made use of to analytically determine the flow distribution and thereby the pressure drop of mufflers. A generalized expression has been derived here for evaluation of the equivalent flow resistance for parallel flow paths. Expressions for flow resistance across perforated elements, derived by means of flow experiments, have been implemented in the flow resistance network. The results have been validated with experimental data. Thus, the newly developed integrated flow resistance networks would enable us to determine the normalized stagnation pressure drop of commercial automotive mufflers, thus enabling an efficient flow-acoustic design of silencing systems.

Effect of choice of basis functions in neural network for capturing unknown function for dynamic inversion control

The basic requirement for an autopilot is fast response and minimum steady state error for better guidance performance. The highly nonlinear nature of the missile dynamics due to the severe kinematic and inertial coupling of the missile airframe as well as the aerodynamics has been a challenge for an autopilot that is required to have satisfactory performance for all flight conditions in probable engagements. Dynamic inversion is very popular nonlinear controller for this kind of scenario. But the drawback of this controller is that it is sensitive to parameter perturbation. To overcome this problem, neural network has been used to capture the parameter uncertainty on line. The choice of basis function plays the major role in capturing the unknown dynamics. Here in this paper, many basis function has been studied for approximation of unknown dynamics. Cosine basis function has yield the best response compared to any other basis function for capturing the unknown dynamics. Neural network with Cosine basis function has improved the autopilot performance as well as robustness compared to Dynamic inversion without Neural network.

Raman signatures of intermediate phase in quaternary Ge15Te80 (-) xIn5Agx glasses

Micro-Raman studies are conducted on as-quenched and annealed Ge15Te80 -_xIn5Agx glasses to probe the structural network and its evolution with composition. These studies reveal the presence of tetrahedral GeTe4 structural units in as-quenched samples. Specific signatures of the intermediate phase (IP) are observed in the composition dependence of Raman frequencies and corresponding intensities of different modes in the composition range, 8 <= x <= 16. In addition, the Raman peak positions are found to shift with silver doping. Apart from the Raman results, the compositional dependence of density, molar volume and thermal diffusivity, observed in the present study, confirms the presence of the intermediate phase. In thermally annealed samples, a unique variation of Raman wave-numbers in the intermediate region is observed due to the retention of some of the local structure even after the sample is crystallized. The observed Raman peaks are attributed to crystalline tellurium and silver lattice vibrational modes. Based on our present and earlier studies, we propose the occurrence of three thresholds in Ge15Te80 - xIn5Agx glasses, namely percolation of rigidity, percolation of stress and the onset of chemical phase separation on a nanoscale at 8%, 16% and 20% of silver concentration respectively. (C) 2014 Elsevier B.V. All rights reserved.

Emergent properties of the interferon-signalling network may underlie the success of hepatitis C treatment

Current interferon alpha-based treatment of hepatitis C virus (HCV) infection fails to cure a sizeable fraction of patients treated. The cause of this treatment failure remains unknown. Here using mathematical modelling, we predict treatment failure to be a consequence of the emergent properties of the interferon-signalling network. HCV induces bistability in the network, creating a new steady state where it can persist. Cells that admit the new steady state alone are refractory to interferon. Using a model of viral kinetics, we show that when the fraction of cells refractory to interferon in a patient exceeds a critical value, treatment fails. Direct-acting antivirals that suppress HCV replication can eliminate the new steady state, restoring interferon sensitivity and improving treatment response. Our study thus presents a new conceptual basis of HCV persistence and treatment response, elucidates the origin of the synergy between interferon and direct-acting antivirals, and facilitates rational treatment optimization.

Dense network of O-H ... O and C-H ... O interactions in the solid state structure of n-pentyl-2-chloro-2-deoxy-alpha-D-manno-sept 3-uloside

Single crystal X-ray structural analysis of a septanoside, namely, n-pentyl-2-chloro-2-deoxy sept-3-uloside (1) provides many finer details of the molecular structure, in addition to its preferred twist-chair conformation, namely, (TC3,4)-T-5,6 conformation. Structural analysis reveals a dense network of O-H...O, C-H...O and van der Waals interactions that stabilize interdigitized, planar bi-layer structure of the crystal lattice. (C) 2014 Elsevier Ltd. All rights reserved.

Ising model on a random network with annealed or quenched disorder

We study the equilibrium properties of an Ising model on a disordered random network where the disorder can be quenched or annealed. The network consists of fourfold coordinated sites connected via variable length one-dimensional chains. Our emphasis is on nonuniversal properties and we consider the transition temperature and other equilibrium thermodynamic properties, including those associated with one-dimensional fluctuations arising from the chains. We use analytic methods in the annealed case, and a Monte Carlo simulation for the quenched disorder. Our objective is to study the difference between quenched and annealed results with a broad random distribution of interaction parameters. The former represents a situation where the time scale associated with the randomness is very long and the corresponding degrees of freedom can be viewed as frozen, while the annealed case models the situation where this is not so. We find that the transition temperature and the entropy associated with one-dimensional fluctuations are always higher for quenched disorder than in the annealed case. These differences increase with the strength of the disorder up to a saturating value. We discuss our results in connection to physical systems where a broad distribution of interaction strengths is present.

Single network adaptive critic aided dynamic inversion for optimal regulation and command tracking with online adaptation for enhanced robustness

To combine the advantages of both stability and optimality-based designs, a single network adaptive critic (SNAC) aided nonlinear dynamic inversion approach is presented in this paper. Here, the gains of a dynamic inversion controller are selected in such a way that the resulting controller behaves very close to a pre-synthesized SNAC controller in the output regulation sense. Because SNAC is based on optimal control theory, it makes the dynamic inversion controller operate nearly optimal. More important, it retains the two major benefits of dynamic inversion, namely (i) a closed-form expression of the controller and (ii) easy scalability to command tracking applications without knowing the reference commands a priori. An extended architecture is also presented in this paper that adapts online to system modeling and inversion errors, as well as reduced control effectiveness, thereby leading to enhanced robustness. The strengths of this hybrid method of applying SNAC to optimize an nonlinear dynamic inversion controller is demonstrated by considering a benchmark problem in robotics, that is, a two-link robotic manipulator system. Copyright (C) 2013 John Wiley & Sons, Ltd.

A shortest path tree based algorithm for relay placement in a wireless sensor network and its performance analysis

In this paper, we study a problem of designing a multi-hop wireless network for interconnecting sensors (hereafter called source nodes) to a Base Station (BS), by deploying a minimum number of relay nodes at a subset of given potential locations, while meeting a quality of service (QoS) objective specified as a hop count bound for paths from the sources to the BS. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard. For this problem, we propose a polynomial time approximation algorithm based on iteratively constructing shortest path trees and heuristically pruning away the relay nodes used until the hop count bound is violated. Results show that the algorithm performs efficiently in various randomly generated network scenarios; in over 90% of the tested scenarios, it gave solutions that were either optimal or were worse than optimal by just one relay. We then use random graph techniques to obtain, under a certain stochastic setting, an upper bound on the average case approximation ratio of a class of algorithms (including the proposed algorithm) for this problem as a function of the number of source nodes, and the hop count bound. To the best of our knowledge, the average case analysis is the first of its kind in the relay placement literature. Since the design is based on a light traffic model, we also provide simulation results (using models for the IEEE 802.15.4 physical layer and medium access control) to assess the traffic levels up to which the QoS objectives continue to be met. (C) 2014 Elsevier B.V. All rights reserved.

POLAR NETWORK INDEX AS A MAGNETIC PROXY FOR THE SOLAR CYCLE STUDIES

The Sun has a polar magnetic field which oscillates with the 11 yr sunspot cycle. This polar magnetic field is an important component of the dynamo process which operates in the solar convection zone and produces the sunspot cycle. We have direct systematic measurements of the Sun's polar magnetic field only from about the mid-1970s. There are, however, indirect proxies which give us information about this field at earlier times. The Ca-K spectroheliograms taken at the Kodaikanal Solar Observatory during 1904-2007 have now been digitized with 4k x 4k CCD and have higher resolution (similar to 0.86 arcsec) than the other available historical data sets. From these Ca-K spectroheliograms, we have developed a completely new proxy (polar network index, hereafter PNI) for the Sun's polar magnetic field. We calculate PNI from the digitized images using an automated algorithm and calibrate our measured PNI against the polar field as measured by the Wilcox Solar Observatory for the period 1976-1990. This calibration allows us to estimate the polar fields for the earlier period up to 1904. The dynamo calculations performed with this proxy as input data reproduce reasonably well the Sun's magnetic behavior for the past century.

Interference Alignment With Diversity for the 2 x 2 X-Network With Four Antennas

A transmission scheme based on the Alamouti code, which we call the Li-Jafarkhani-Jafar (LJJ) scheme, was recently proposed for the 2 x 2 X-network i.e., two-transmitter (Tx) two-receiver X-network] with two antennas at each node. This scheme was claimed to achieve a sum degrees of freedom (DoF) of 8/3 and also a diversity gain of two when fixed finite constellations are employed at each Tx. Furthermore, each Tx required the knowledge of only its own channel unlike the Jafar-Shamai scheme which required global CSIT to achieve the maximum possible sum DoF of 8/3. In this paper, we extend the LJJ scheme to the 2 x 2 X-network with four antennas at each node. The proposed scheme also assumes only local channel knowledge at each Tx. We prove that the proposed scheme achieves the maximum possible sum DoF of 16/3. In addition, we also prove that, using any fixed finite constellation with appropriate rotation at each Tx, the proposed scheme achieves a diversity gain of at least four.