Optimal forwarding in delay tolerant networks with multiple destinations

We study the trade-off between delivery delay and energy consumption in a delay tolerant network in which a message (or a file) has to be delivered to each of several destinations by epidemic relaying. In addition to the destinations, there are several other nodes in the network that can assist in relaying the message. We first assume that, at every instant, all the nodes know the number of relays carrying the packet and the number of destinations that have received the packet. We formulate the problem as a controlled continuous time Markov chain and derive the optimal closed loop control (i.e., forwarding policy). However, in practice, the intermittent connectivity in the network implies that the nodes may not have the required perfect knowledge of the system state. To address this issue, we obtain an ODE (i.e., fluid) approximation for the optimally controlled Markov chain. This fluid approximation also yields an asymptotically optimal open loop policy. Finally, we evaluate the performance of the deterministic policy over finite networks. Numerical results show that this policy performs close to the optimal closed loop policy.

Fault-tolerant secret key generation

Mobile nodes observing correlated data communicate using an insecure bidirectional switch to generate a secret key, which must remain concealed from the switch. We are interested in fault-tolerant secret key rates, i.e., the rates of secret key generated even if a subset of nodes drop out before the completion of the communication protocol. We formulate a new notion of fault-tolerant secret key capacity, and present an upper bound on it. This upper bound is shown to be tight when the random variables corresponding to the observations of nodes are exchangeable. Further, it is shown that one round of interaction achieves the fault-tolerant secret key capacity in this case. The upper bound is also tight for the case of a pairwise independent network model consisting of a complete graph, and can be attained by a noninteractive protocol.

Conflict-tolerant specifications for hybrid systems

We propose a framework for developing and reasoning about hybrid systems that are comprised of a plant with multiple controllers, each of which controls the plant intermittently. The framework is based on the notion of a ``conflict tolerant'' specification for a controller, and provides a modular way of developing and reasoning about such systems. We propose a novel mechanism of defining conflict-tolerant specifications for general hybrid systems, using ``acceptor'' and ``advisor'' components. We also give a decision procedure for verifying whether a controller satisfies its conflict-tolerant specification, in the special case when the components are modeled using initialized rectangular hybrid automata.

Optimal Forwarding in Delay-Tolerant Networks With Multiple Destinations

We study the tradeoff between delivery delay and energy consumption in a delay-tolerant network in which a message (or a file) has to be delivered to each of several destinations by epidemic relaying. In addition to the destinations, there are several other nodes in the network that can assist in relaying the message. We first assume that, at every instant, all the nodes know the number of relays carrying the message and the number of destinations that have received the message. We formulate the problem as a controlled continuous-time Markov chain and derive the optimal closed-loop control (i.e., forwarding policy). However, in practice, the intermittent connectivity in the network implies that the nodes may not have the required perfect knowledge of the system state. To address this issue, we obtain an ordinary differential equation (ODE) (i.e., a deterministic fluid) approximation for the optimally controlled Markov chain. This fluid approximation also yields an asymptotically optimal open-loop policy. Finally, we evaluate the performance of the deterministic policy over finite networks. Numerical results show that this policy performs close to the optimal closed-loop policy.

Making risk minimization tolerant to label noise

In many applications, the training data, from which one needs to learn a classifier, is corrupted with label noise. Many standard algorithms such as SVM perform poorly in the presence of label noise. In this paper we investigate the robustness of risk minimization to label noise. We prove a sufficient condition on a loss function for the risk minimization under that loss to be tolerant to uniform label noise. We show that the 0-1 loss, sigmoid loss, ramp loss and probit loss satisfy this condition though none of the standard convex loss functions satisfy it. We also prove that, by choosing a sufficiently large value of a parameter in the loss function, the sigmoid loss, ramp loss and probit loss can be made tolerant to nonuniform label noise also if we can assume the classes to be separable under noise-free data distribution. Through extensive empirical studies, we show that risk minimization under the 0-1 loss, the sigmoid loss and the ramp loss has much better robustness to label noise when compared to the SVM algorithm. (C) 2015 Elsevier B.V. All rights reserved.

A Fast and Fault-Tolerant Distributed Algorithm for Near-Optimal TDMA Scheduling in WSNs

The time division multiple access (TDMA) based channel access mechanisms perform better than the contention based channel access mechanisms, in terms of channel utilization, reliability and power consumption, specially for high data rate applications in wireless sensor networks (WSNs). Most of the existing distributed TDMA scheduling techniques can be classified as either static or dynamic. The primary purpose of static TDMA scheduling algorithms is to improve the channel utilization by generating a schedule of smaller length. But, they usually take longer time to schedule, and hence, are not suitable for WSNs, in which the network topology changes dynamically. On the other hand, dynamic TDMA scheduling algorithms generate a schedule quickly, but they are not efficient in terms of generated schedule length. In this paper, we propose a novel scheme for TDMA scheduling in WSNs, which can generate a compact schedule similar to static scheduling algorithms, while its runtime performance can be matched with those of dynamic scheduling algorithms. Furthermore, the proposed distributed TDMA scheduling algorithm has the capability to trade-off schedule length with the time required to generate the schedule. This would allow the developers of WSNs, to tune the performance, as per the requirement of prevalent WSN applications, and the requirement to perform re-scheduling. Finally, the proposed TDMA scheduling is fault-tolerant to packet loss due to erroneous wireless channel. The algorithm has been simulated using the Castalia simulator to compare its performance with those of others in terms of generated schedule length and the time required to generate the TDMA schedule. Simulation results show that the proposed algorithm generates a compact schedule in a very less time.

Activation of violaxanthin cycle in darkness is a common response to different abiotic stresses : a case study in Pelvetia canaliculata

Background: In the violaxanthin (V) cycle, V is de-epoxidized to zeaxanthin (Z) when strong light or light combined with other stressors lead to an overexcitation of photosystems. However, plants can also suffer stress in darkness and recent reports have shown that dehydration triggers V-de-epoxidation in the absence of light. In this study, we used the highly stress-tolerant brown alga Pelvetia canaliculata as a model organism, due to its lack of lutein and its non-photochemical quenching independent of the transthylakoidal-ΔpH, to study the triggering of the V-cycle in darkness induced by abiotic stressors. Results: We have shown that besides desiccation, other factors such as immersion, anoxia and high temperature also induced V-de-epoxidation in darkness. This process was reversible once the treatments had ceased (with the exception of heat, which caused lethal damage). Irrespective of the stressor applied, the resulting de-epoxidised xanthophylls correlated with a decrease in Fv/Fm, suggesting a common function in the down-regulation of photosynthetical efficiency. The implication of the redox-state of the plastoquinone-pool and of the differential activity of V-cycle enzymes on V-de-epoxidation in darkness was also examined. Current results suggest that both violaxanthin de-epoxidase (VDE) and zeaxanthin-epoxidase (ZE) have a basal constitutive activity even in darkness, being ZE inhibited under stress. This inhibition leads to Z accumulation. Conclusion: This study demonstrates that V-cycle activity is triggered by several abiotic stressors even when they occur in an absolute absence of light, leading to a decrease in Fv/Fm. This finding provides new insights into an understanding of the regulation mechanism of the V-cycle and of its ecophysiological roles.

Regeneration of Giant Salvinia from Apical and Axillary Buds following Desiccation or Physical Damage

Can a new giant salvinia infestation occur even if most of the mat is destroyed except for the protected buds? From this study, we are able to conclude that buds can produce new growth under certain stressful conditions. They must be greater than 0.2 cm in length and they must possess greater than 30% moisture content to survive.

Respuesta a la sequía de Pinus radiata D. Don y su implicación en los procesos de tolerancia

160 p. (Bibliogr. 141-160)