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.

Power and delay optimal policies for wireless systems

In this paper we consider a single discrete time queue with infinite buffer. The channel may experience fading. The transmission rate is a linear function of power used for transmission. In this scenario we explicitly obtain power control policies which minimize mean power and/or mean delay. There may also be peak power constraint.

Study on the Effect of Dead Time and its Compensation for Bus-Clamping PWM Techniques

Dead-time is provided in between the gating signals of the top and bottom semiconductor switches in an inverter leg to prevent the shorting of DC bus. Due to this dead time, there is a significant unwanted change in the output voltage of the inverter. The effect is different for different pulse width modulation (PWM) methodologies. The effect of dead-time on the output fundamental voltage is studied theoretically as well as experimentally for bus-clamping PWM methodologies. Further, experimental observations on the effectiveness of dead-time compensation are presented.

Universal binding energy relation for cleaved and structurally relaxed surfaces

The universal binding energy relation (UBER), derived earlier to describe the cohesion between two rigid atomic planes, does not accurately capture the cohesive properties when the cleaved surfaces are allowed to relax. We suggest a modified functional form of UBER that is analytical and at the same time accurately models the properties of surfaces relaxed during cleavage. We demonstrate the generality as well as the validity of this modified UBER through first-principles density functional theory calculations of cleavage in a number of crystal systems. Our results show that the total energies of all the relaxed surfaces lie on a single (universal) energy surface, that is given by the proposed functional form which contains an additional length-scale associated with structural relaxation. This functional form could be used in modelling the cohesive zones in crack growth simulation studies. We find that the cohesive law (stress-displacement relation) differs significantly in the case where cracked surfaces are allowed to relax, with lower peak stresses occurring at higher displacements.

Optimal Timer-Based Best Node Selection for Wireless Systems with Unknown Number of Nodes

The distributed, low-feedback, timer scheme is used in several wireless systems to select the best node from the available nodes. In it, each node sets a timer as a function of a local preference number called a metric, and transmits a packet when its timer expires. The scheme ensures that the timer of the best node, which has the highest metric, expires first. However, it fails to select the best node if another node transmits a packet within Delta s of the transmission by the best node. We derive the optimal metric-to-timer mappings for the practical scenario where the number of nodes is unknown. We consider two cases in which the probability distribution of the number of nodes is either known a priori or is unknown. In the first case, the optimal mapping maximizes the success probability averaged over the probability distribution. In the second case, a robust mapping maximizes the worst case average success probability over all possible probability distributions on the number of nodes. Results reveal that the proposed mappings deliver significant gains compared to the mappings considered in the literature.

Analysis of the modulation process in advanced bus-clamping PWM techniques

Advanced bus-clamping pulse width modulation (ABCPWM) techniques are advantageous in terms of line current distortion and inverter switching loss in voltage source inverter-fed applications. However, the PWM waveforms corresponding to these techniques are not amenable to carrier-based generation. The modulation process in ABCPWM methods is analyzed here from a “per-phase” perspective. It is shown that three sets of descendant modulating functions (or modified modulating functions) can be generated from the three-phase sinusoidal signals. Each set of the modified modulating functions can be used to produce the PWM waveform of a given phase in a computationally efficient manner. Theoretical results and experimental investigations on a 5hp motor drive are presented

`Universal' recession curves and their geomorphological interpretation

The study of recession flows offers fundamental insights into basin hydrological processes and, in particular, into the collective behavior of the governing dominant subsurface flows and properties. We use here an existing geomorphological interpretation of recession dynamics, which links the exponent in the classic recession curve -dQ/dt - kQ(alpha) to the geometric properties of the time-varying drainage network to study the general properties of recession curves across a wide variety of river basins. In particular, we show how the parameter k depends on the initial soil moisture state of the basin and can be made to explicitly depend on an index discharge, representative of initial sub-subsurface storage. Through this framework we obtain a non-dimensional, event-independent, recession curve. We subsequently quantify the variability of k across different basins on the basis of their geometry, and, by rescaling, collapse curves from different events and basins to obtain a generalized, or `universal', recession curve. Finally, we analyze the resulting normalized recession curves and explain their universal characteristics, lending further support to the notion that the statistical properties of observed recession curves bear the signature of the geomorphological structure of the networks producing them. (C) 2014 Elsevier Ltd. All rights reserved.

Universal Conductance Fluctuations as a direct probe to valley coherence and universality class of disordered graphene

We demonstrate that the universal conductance fluctuations (UCF) can be used as a direct probe to study the valley quantum states in disordered graphene. The UCF magnitude in graphene is suppressed by a factor of four at high carrier densities where the short-range disorder essentially breaks the valley degeneracy of the K and K' valleys, leading to a density dependent crossover of symmetry class from symplectic near the Dirac point to orthogonal at high densities.

Achieving universal rural energy access in india: A low carbon pathway

India's energy challenges are three pronged: presence of majority energy poor lacking access to modern energy; need for expanding energy system to bridge this access gap as well as to meet the requirements of fast-growing economy; and the desire to partner with global economies in mitigating the threat of climate change. The presence of 364 million people without access to electricity and 726 million relying on biomass for cooking out of a total rural population of 809 million indicate the seriousness of challenge. In this paper, we discuss an innovative approach to address this challenge, which intends to take advantage of recent global developments and untapped capabilities possessed by India. Intention is to use climate change mitigation imperative as a stimulus and adopt a public-private-partnership-driven ‘business model' with innovative institutional, regulatory, financing, and delivery mechanisms. Some of the innovations are: creation of rural energy access authorities within the government system as leadership institutions; establishment of energy access funds to enable transitions from the regime of "investment/fuel subsidies" to "incentive-linked" delivery of energy services; integration of business principles to facilitate affordable and equitable energy sales and carbon trade; and treatment of entrepreneurs as implementation targets. This proposal targets 100% access to modern energy carriers by 2030 through a judicious mix of conventional and biomass energy systems with an investment of US$35 billion over 20 years. The estimated annual cost of universal energy access is about US$9 billion for a GHG mitigation potential of 213Tg CO2e at an abatement cost of US$41/tCO2e. It is a win-win situation for all stakeholders. Households benefit from modern energy carriers at affordable cost; entrepreneurs run profitable energy enterprises; carbon markets have access to CERs; the government has the satisfaction of securing energy access to rural people; and globally, there is a benefit of climate change mitigation.

Raman spectroscopy explores molecular structural signatures of hidden materials in depth: Universal Multiple Angle Raman Spectroscopy

Non-invasive 3D imaging in materials and medical research involves methodologies such as X-ray imaging, MRI, fluorescence and optical coherence tomography, NIR absorption imaging, etc., providing global morphological/density/absorption changes of the hidden components. However, molecular information of such buried materials has been elusive. In this article we demonstrate observation of molecular structural information of materials hidden/buried in depth using Raman scattering. Typically, Raman spectroscopic observations are made at fixed collection angles, such as, 906, 1356, and 1806, except in spatially offset Raman scattering (SORS) (only back scattering based collection of photons) and transmission techniques. Such specific collection angles restrict the observations of Raman signals either from or near the surface of the materials. Universal Multiple Angle Raman Spectroscopy (UMARS) presented here employs the principle of (a) penetration depth of photons and then diffuse propagation through non-absorbing media by multiple scattering and (b) detection of signals from all the observable angles.

Performance Analysis of a Cooperative MAC Protocol of Wireless Ad Hoc Networks

Different medium access control (MAC) layer protocols, for example, IEEE 802.11 series and others are used in wireless local area networks. They have limitation in handling bulk data transfer applications, like video-on-demand, videoconference, etc. To avoid this problem a cooperative MAC protocol environment has been introduced, which enables the MAC protocol of a node to use its nearby nodes MAC protocol as and when required. We have found on various occasions that specified cooperative MAC establishes cooperative transmissions to send the specified data to the destination. In this paper we propose cooperative MAC priority (CoopMACPri) protocol which exploits the advantages of priority value given by the upper layers for selection of different paths to nodes running heterogeneous applications in a wireless ad hoc network environment. The CoopMACPri protocol improves the system throughput and minimizes energy consumption. Using a Markov chain model, we developed a model to analyse the performance of CoopMACPri protocol; and also derived closed-form expression of saturated system throughput and energy consumption. Performance evaluations validate the accuracy of the theoretical analysis, and also show that the performance of CoopMACPri protocol varies with the number of nodes. We observed that the simulation results and analysis reflects the effectiveness of the proposed protocol as per the specifications.

Optimal sequential wireless relay placement on a random lattice path

Our work is motivated by impromptu (or ``as-you-go'') deployment of wireless relay nodes along a path, a need that arises in many situations. In this paper, the path is modeled as starting at the origin (where there is the data sink, e.g., the control center), and evolving randomly over a lattice in the positive quadrant. A person walks along the path deploying relay nodes as he goes. At each step, the path can, randomly, either continue in the same direction or take a turn, or come to an end, at which point a data source (e.g., a sensor) has to be placed, that will send packets to the data sink. A decision has to be made at each step whether or not to place a wireless relay node. Assuming that the packet generation rate by the source is very low, and simple link-by-link scheduling, we consider the problem of sequential relay placement so as to minimize the expectation of an end-to-end cost metric (a linear combination of the sum of convex hop costs and the number of relays placed). This impromptu relay placement problem is formulated as a total cost Markov decision process. First, we derive the optimal policy in terms of an optimal placement set and show that this set is characterized by a boundary (with respect to the position of the last placed relay) beyond which it is optimal to place the next relay. Next, based on a simpler one-step-look-ahead characterization of the optimal policy, we propose an algorithm which is proved to converge to the optimal placement set in a finite number of steps and which is faster than value iteration. We show by simulations that the distance threshold based heuristic, usually assumed in the literature, is close to the optimal, provided that the threshold distance is carefully chosen. (C) 2014 Elsevier B.V. All rights reserved.

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.

Universal power law in crossover from integrability to quantum chaos

We study models of interacting fermions in one dimension to investigate the crossover from integrability to nonintegrability, i.e., quantum chaos, as a function of system size. Using exact diagonalization of finite-sized systems, we study this crossover by obtaining the energy level statistics and Drude weight associated with transport. Our results reinforce the idea that for system size L -> infinity nonintegrability sets in for an arbitrarily small integrability-breaking perturbation. The crossover value of the perturbation scales as a power law similar to L-eta when the integrable system is gapless. The exponent eta approximate to 3 appears to be robust to microscopic details and the precise form of the perturbation. We conjecture that the exponent in the power law is characteristic of the random matrix ensemble describing the nonintegrable system. For systems with a gap, the crossover scaling appears to be faster than a power law.

A media access and feedback protocol for reliable multicast over wireless channel

A link level reliable multicast requires a channel access protocol to resolve the collision of feedback messages sent by multicast data receivers. Several deterministic media access control protocols have been proposed to attain high reliability, but with large delay. Besides, there are also protocols which can only give probabilistic guarantee about reliability, but have the least delay. In this paper, we propose a virtual token-based channel access and feedback protocol (VTCAF) for link level reliable multicasting. The VTCAF protocol introduces a virtual (implicit) token passing mechanism based on carrier sensing to avoid the collision between feedback messages. The delay performance is improved in VTCAF protocol by reducing the number of feedback messages. Besides, the VTCAF protocol is parametric in nature and can easily trade off reliability with the delay as per the requirement of the underlying application. Such a cross layer design approach would be useful for a variety of multicast applications which require reliable communication with different levels of reliability and delay performance. We have analyzed our protocol to evaluate various performance parameters at different packet loss rate and compared its performance with those of others. Our protocol has also been simulated using Castalia network simulator to evaluate the same performance parameters. Simulation and analytical results together show that the VTCAF protocol is able to considerably reduce average access delay while ensuring very high reliability at the same time.