Capacity Optimizing Hop Distance in a Mobile Ad Hoc Network with Power Control

In a dense multi-hop network of mobile nodes capable of applying adaptive power control, we consider the problem of finding the optimal hop distance that maximizes a certain throughput measure in bit-metres/sec, subject to average network power constraints. The mobility of nodes is restricted to a circular periphery area centered at the nominal location of nodes. We incorporate only randomly varying path-loss characteristics of channel gain due to the random motion of nodes, excluding any multi-path fading or shadowing effects. Computation of the throughput metric in such a scenario leads us to compute the probability density function of random distance between points in two circles. Using numerical analysis we discover that choosing the nearest node as next hop is not always optimal. Optimal throughput performance is also attained at non-trivial hop distances depending on the available average network power.

Influence of surge impedance of the connecting lead in response time measurement of u.h.v. damped capacitive voltage dividers

In the determination of the response time of u.h.v. damped capacitive impulse voltage dividers using the CIGRE IMR-1MS group (1) method and the arrangement suggested by the International Electrotechnical Commission (the I EC square loop),the surge impedance of the connecting lead has been found to influence the accuracy of determination. To avoid this difficulty,a new graphical procedure is proposed. As this method uses only those data points which can be determined with good accuracy, errors in response-time area evaluation do not influence the result.

Chromium Nanowires Grown Inside Lithographically Fabricated U-Trench Templates

Chromium nanowires of diameter 40-120 nm have been grown inside lithographically fabricated U-trench templates on oxidized silicon substrate by RF sputtering deposition technique. Under favourable experimental conditions, very long nanowires can be grown which depends on the trench length and surface homogeneity along the axis. Surface wettability control by the restricted supply of metal vapour is the key for the formation of nanowires. Diameter/depth ratio for the trench template is demonstrated to be crucial for the growth of nanowires.

Optimal Hop Distance and Power Control for a Single Cell, Dense, Ad Hoc Wireless Network

We consider a dense, ad hoc wireless network, confined to a small region. The wireless network is operated as a single cell, i.e., only one successful transmission is supported at a time. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organize into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention-based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first motivate that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc wireless network (described above) as a single cell, we study the hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Theta(opt) bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form d(opt)((P) over bar (t)) x Theta(opt) with d(opt) scaling as (P) over bar (t) (1/eta), where (P) over bar (t) is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then provide a simple characterization of the optimal operating point. Simulation results are provided comparing the performance of the optimal strategy derived here with some simple strategies for operating the network.

Theory and Algorithms for Hop-Count-Based Localization with Random Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes in a region of Euclidean space. Following deployment, the nodes self-organize into a mesh topology with a key aspect being self-localization. Having obtained a mesh topology in a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this work, we analyze this approximation through two complementary analyses. We assume that the mesh topology is a random geometric graph on the nodes; and that some nodes are designated as anchors with known locations. First, we obtain high probability bounds on the Euclidean distances of all nodes that are h hops away from a fixed anchor node. In the second analysis, we provide a heuristic argument that leads to a direct approximation for the density function of the Euclidean distance between two nodes that are separated by a hop distance h. This approximation is shown, through simulation, to very closely match the true density function. Localization algorithms that draw upon the preceding analyses are then proposed and shown to perform better than some of the well-known algorithms present in the literature. Belief-propagation-based message-passing is then used to further enhance the performance of the proposed localization algorithms. To our knowledge, this is the first usage of message-passing for hop-count-based self-localization.

Optimal capacity relay node placement in a multi-hop network on a line

We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of optimal placement of relay nodes along the straight line joining a source node and a destination node. The achievable rate formulas that we utilize are for full-duplex radios at the relays and decode-and-forward relaying. For the single relay case, and individual power constraints at the source node and the relay node, we provide explicit formulas for the optimal relay location and the optimal power allocation to the source-relay channel, for the exponential and the power-law path-loss channel models. For the multiple relay case, we consider exponential path-loss and a total power constraint over the source and the relays, and derive an optimization problem, the solution of which provides the optimal relay locations. Numerical results suggest that at low attenuation the relays are mostly clustered close to the source in order to be able to cooperate among themselves, whereas at high attenuation they are uniformly placed and work as repeaters. We also prove that a constant rate independent of the attenuation in the network can be achieved by placing a large enough number of relay nodes uniformly between the source and the destination, under the exponential path-loss model with total power constraint.

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.

Performance analysis of beacon-less IEEE 802.15.4 multi-hop networks

We develop an approximate analytical technique for evaluating the performance of multi-hop networks based on beacon-less CSMA/CA as standardised in IEEE 802.15.4, a popular standard for wireless sensor networks. The network comprises sensor nodes, which generate measurement packets, and relay nodes which only forward packets. We consider a detailed stochastic process at each node, and analyse this process taking into account the interaction with neighbouring nodes via certain unknown variables (e.g., channel sensing rates, collision probabilities, etc.). By coupling these analyses of the various nodes, we obtain fixed point equations that can be solved numerically to obtain the unknown variables, thereby yielding approximations of time average performance measures, such as packet discard probabilities and average queueing delays. Different analyses arise for networks with no hidden nodes and networks with hidden nodes. We apply this approach to the performance analysis of tree networks rooted at a data sink. Finally, we provide a validation of our analysis technique against simulations.

Valence band electronic structure of Nd1-xYxMnO3 using X-ray absorption, photoemission and GGA plus U calculations

The electronic structures of Nd1-xYxMnO3 (x=0-0.5) were studied using X-ray absorption near-edge structure (XANES) at the Mn L-3,L-2- and O K-edge along with valence-band photoemission spectroscopy (VB-PES). The systematic increase in white-line intensity of the Mn L-3,L-2-edge with doping, suggests a decrease in the occupancy of Mn 3d orbitals. The O K-edge XANES shows a depletion of unoccupied states above the Fermi energy. The changes in the O K-edge spectra due to doping reflects an increase in the Jahn-Teller distortion. The VB-PES shows broadening of the features associated with Mn 3d and O 2p hybridized states and the shift of these features to a slightly higher binding energy in agreement with our GGA + U calculations. The system shows a net shift of the occupied and unoccupied states away from the Fermi energy with doping. The shift in theoretical site-projected density of states of x=0.5 composition with respect to x=0 suggest a subtle change from a charge transfer to Mott-Hubbard type insulator. (C) 2013 Elsevier B.V. All rights reserved.

BER Analysis of Space Shift Keying in Cooperative Multi-hop Multi-branch DF Relaying

Space shift keying (SSK) is an attractive modulation technique for multi-antenna communications. In SSK, only one among the available transmit antennas is activated during one channel use, and the index of the chosen transmit antenna conveys information. In this paper, we analyze the performance of SSK in multi-hop, multi-branch cooperative relaying systems. We consider the decode-and-forward relaying protocol, where a relay forwards the decoded symbol if it decodes the symbol correctly from the received signal. We derive closed-form expressions for the end-to-end bit error rate of SSK in this system. Analytical and simulation results match very well.

Monopoles, Dirac operator, and index theory for fuzzy SU(3) / (U(1) x U(1))

The intersection of the ten-dimensional fuzzy conifold Y-F(10) with S-F(5) x S-F(5) is the compact eight-dimensional fuzzy space X-F(8). We show that X-F(8) is (the analogue of) a principal U(1) x U(1) bundle over fuzzy SU(3) / U(1) x U(1)) ( M-F(6)). We construct M-F(6) using the Gell-Mann matrices by adapting Schwinger's construction. The space M-F(6) is of relevance in higher dimensional quantum Hall effect and matrix models of D-branes. Further we show that the sections of the monopole bundle can be expressed in the basis of SU(3) eigenvectors. We construct the Dirac operator on M-F(6) from the Ginsparg-Wilson algebra on this space. Finally, we show that the index of the Dirac operator correctly reproduces the known results in the continuum.

Cybernetic Modeling Revisited: A Method for Inferring the Cybernetic Variables u(i) from Experimental Data

The cybernetic modeling framework for the growth of microorganisms provides for an elegant methodology to account for the unknown regulatory phenomena through the use of cybernetic variables for enzyme induction and activity. In this paper, we revisit the assumption of limited resources for enzyme induction (Sigma u(i) = 1) used in the cybernetic modeling framework by presenting a methodology for inferring the individual cybernetic variables u(i) from experimental data. We use this methodology to infer u(i) during the simultaneous consumption of glycerol and lactose by Escherichia coli and then model the fitness trade-offs involved in the recently discovered predictive regulation strategy of microorganisms.

A fast and accurate performance analysis of beaconless IEEE 802.15.4 multi-hop networks

We develop an approximate analytical technique for evaluating the performance of multi-hop networks based on beaconless IEEE 802.15.4 ( the ``ZigBee'' PHY and MAC), a popular standard for wireless sensor networks. The network comprises sensor nodes, which generate measurement packets, relay nodes which only forward packets, and a data sink (base station). We consider a detailed stochastic process at each node, and analyse this process taking into account the interaction with neighbouring nodes via certain time averaged unknown variables (e.g., channel sensing rates, collision probabilities, etc.). By coupling the analyses at various nodes, we obtain fixed point equations that can be solved numerically to obtain the unknown variables, thereby yielding approximations of time average performance measures, such as packet discard probabilities and average queueing delays. The model incorporates packet generation at the sensor nodes and queues at the sensor nodes and relay nodes. We demonstrate the accuracy of our model by an extensive comparison with simulations. As an additional assessment of the accuracy of the model, we utilize it in an algorithm for sensor network design with quality-of-service (QoS) objectives, and show that designs obtained using our model actually satisfy the QoS constraints (as validated by simulating the networks), and the predictions are accurate to well within 10% as compared to the simulation results in a regime where the packet discard probability is low. (C) 2015 Elsevier B.V. All rights reserved.