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.

Rationalization and prediction of drug resistant mutations in targets for clinical anti-tubercular drugs

Resistance to therapy limits the effectiveness of drug treatment in many diseases. Drug resistance can be considered as a successful outcome of the bacterial struggle to survive in the hostile environment of a drug-exposed cell. An important mechanism by which bacteria acquire drug resistance is through mutations in the drug target. Drug resistant strains (multi-drug resistant and extensively drug resistant) of Mycobacterium tuberculosis are being identified at alarming rates, increasing the global burden of tuberculosis. An understanding of the nature of mutations in different drug targets and how they achieve resistance is therefore important. An objective of this study is to first decipher sequence as well as structural bases for the observed resistance in known drug resistant mutants and then to predict positions in each target that are more prone to acquiring drug resistant mutations. A curated database containing hundreds of mutations in the 38 drug targets of nine major clinical drugs, associated with resistance is studied here. Mutations have been classified into those that occur in the binding site itself, those that occur in residues interacting with the binding site and those that occur in outer zones. Structural models of the wild type and mutant forms of the target proteins have been analysed to seek explanations for reduction in drug binding. Stability analysis of an entire array of 19 mutations at each of the residues for each target has been computed using structural models. Conservation indices of individual residues, binding sites and whole proteins are computed based on sequence conservation analysis of the target proteins. The analyses lead to insights about which positions in the polypeptide chain have a higher propensity to acquire drug resistant mutations. Thus critical insights can be obtained about the effect of mutations on drug binding, in terms of which amino acid positions and therefore which interactions should not be heavily relied upon, which in turn can be translated into guidelines for modifying the existing drugs as well as for designing new drugs. The methodology can serve as a general framework to study drug resistant mutants in other micro-organisms as well.

From Molecular to Supramolecular: An Exploration into the Modes of Self-assembly in Conformationally Locked Polycyclitols

This brief account highlights the notable findings of our investigation into the supramolecular chemistry of conformationally locked polycyclitols in the solid state. The study was aimed at analyzing the crystal packing and unraveling the modalities of non-covalent interactions (particularly, intramolecular vis-a-vis intermolecular OH center dot center dot center dot O hydrogen bonds) in polyols. The know-how obtained thereof, was successfully utilized to engineer self-assemblies of designer polycyclitols, having hydrogen bond donors and acceptors fettered onto a trans-decalin scaffold. The results seek to draw particular attention to the intrinsic attribute of this rigid carbocyclic framework to lock functional groups into spatially invariant positions and bring potential intramolecular hydrogen bonding partners into favorable interaction geometry to engender predictability in the self-assembly patterns.

Relay Selection for Geographical Forwarding in Sleep-Wake Cycling Wireless Sensor Networks

Our work is motivated by geographical forwarding of sporadic alarm packets to a base station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling periodically and asynchronously. We seek to develop local forwarding algorithms that can be tuned so as to tradeoff the end-to-end delay against a total cost, such as the hop count or total energy. Our approach is to solve, at each forwarding node enroute to the sink, the local forwarding problem of minimizing one-hop waiting delay subject to a lower bound constraint on a suitable reward offered by the next-hop relay; the constraint serves to tune the tradeoff. The reward metric used for the local problem is based on the end-to-end total cost objective (for instance, when the total cost is hop count, we choose to use the progress toward sink made by a relay as the reward). The forwarding node, to begin with, is uncertain about the number of relays, their wake-up times, and the reward values, but knows the probability distributions of these quantities. At each relay wake-up instant, when a relay reveals its reward value, the forwarding node's problem is to forward the packet or to wait for further relays to wake-up. In terms of the operations research literature, our work can be considered as a variant of the asset selling problem. We formulate our local forwarding problem as a partially observable Markov decision process (POMDP) and obtain inner and outer bounds for the optimal policy. Motivated by the computational complexity involved in the policies derived out of these bounds, we formulate an alternate simplified model, the optimal policy for which is a simple threshold rule. We provide simulation results to compare the performance of the inner and outer bound policies against the simple policy, and also against the optimal policy when the source knows the exact number of relays. Observing the good performance and the ease of implementation of the simple policy, we apply it to our motivating problem, i.e., local geographical routing of sporadic alarm packets in a large WSN. We compare the end-to-end performance (i.e., average total delay and average total cost) obtained by the simple policy, when used for local geographical forwarding, against that obtained by the globally optimal forwarding algorithm proposed by Kim et al. 1].

Non-rotating beams isospectral to a given rotating uniform beam

In this paper, we seek to find non-rotating beams with continuous mass and flexural stiffness distributions, that are isospectral to a given uniform rotating beam. The Barcilon-Gottlieb transformation is used to convert the fourth order governing equation of a non-rotating beam, to a canonical fourth order eigenvalue problem. If the coefficients in this canonical equation match with the coefficients of the uniform rotating beam equation, then the non-rotating beam is isospectral to the given rotating beam. The conditions on matching the coefficients leads to a pair of coupled differential equations. We solve these coupled differential equations for a particular case, and thereby obtain a class of non-rotating beams that are isospectral to a uniform rotating beam. However, to obtain isospectral beams, the transformation must leave the boundary conditions invariant. We show that the clamped end boundary condition is always invariant, and for the free end boundary condition to be invariant, we impose certain conditions on the beam characteristics. We also verify numerically that the frequencies of the non-rotating beam obtained using the finite element method (FEM) are the exact frequencies of the uniform rotating beam. Finally, the example of beams having a rectangular cross-section is presented to show the application of our analysis. Since experimental determination of rotating beam frequencies is a difficult task, experiments can be easily conducted on these rectangular non-rotating beams, to calculate the frequencies of the rotating beam. (c) 2012 Elsevier Ltd. All rights reserved.

Mechanism design for time critical and cost critical task execution via crowdsourcing

An exciting application of crowdsourcing is to use social networks in complex task execution. In this paper, we address the problem of a planner who needs to incentivize agents within a network in order to seek their help in executing an atomic task as well as in recruiting other agents to execute the task. We study this mechanism design problem under two natural resource optimization settings: (1) cost critical tasks, where the planner's goal is to minimize the total cost, and (2) time critical tasks, where the goal is to minimize the total time elapsed before the task is executed. We identify a set of desirable properties that should ideally be satisfied by a crowdsourcing mechanism. In particular, sybil-proofness and collapse-proofness are two complementary properties in our desiderata. We prove that no mechanism can satisfy all the desirable properties simultaneously. This leads us naturally to explore approximate versions of the critical properties. We focus our attention on approximate sybil-proofness and our exploration leads to a parametrized family of payment mechanisms which satisfy collapse-proofness. We characterize the approximate versions of the desirable properties in cost critical and time critical domain.

Sustaining cooperation on networks: an analytical study based on evolutionary game theory

We analytically study the role played by the network topology in sustaining cooperation in a society of myopic agents in an evolutionary setting. In our model, each agent plays the Prisoner's Dilemma (PD) game with its neighbors, as specified by a network. Cooperation is the incumbent strategy, whereas defectors are the mutants. Starting with a population of cooperators, some agents are switched to defection. The agents then play the PD game with their neighbors and compute their fitness. After this, an evolutionary rule, or imitation dynamic is used to update the agent strategy. A defector switches back to cooperation if it has a cooperator neighbor with higher fitness. The network is said to sustain cooperation if almost all defectors switch to cooperation. Earlier work on the sustenance of cooperation has largely consisted of simulation studies, and we seek to complement this body of work by providing analytical insight for the same. We find that in order to sustain cooperation, a network should satisfy some properties such as small average diameter, densification, and irregularity. Real-world networks have been empirically shown to exhibit these properties, and are thus candidates for the sustenance of cooperation. We also analyze some specific graphs to determine whether or not they sustain cooperation. In particular, we find that scale-free graphs belonging to a certain family sustain cooperation, whereas Erdos-Renyi random graphs do not. To the best of our knowledge, ours is the first analytical attempt to determine which networks sustain cooperation in a population of myopic agents in an evolutionary setting.

Is The Burden of Medical Education Affecting Ethics of Medical Treatment?

A substantial number of medical students in India have to bear an enormous financial burden for earning a bachelor's degree in medicine referred to as MBBS (bachelor of medicine and bachelor of surgery). This degree program lasts for four and one-half years followed by one year of internship. A postgraduate degree, such as MD, has to be pursued separately on completion of a MBBS. Every medical college in India is part of a hospital where the medical students get clinical exposure during the course of their study. All or at least a number of medical colleges in a given state are affiliated to a university that mainly plays a role of an overseeing authority. The medical colleges usually have no official interaction with other disciplines of education such as science and engineering, perhaps because of their independent location and absence of emphasis on medical research. However, many of the medical colleges are adept in imparting high-quality and sound training in medical practices including diagnostics and treatment. The medical colleges in India are generally of two types, i.e., government owned and private. Since only a limited number of seats are available across India in the former category of colleges, only a small fraction of aspiring candidates can find admission in these colleges after performing competitively in the relevant entrance tests. A major advantage of studying in these colleges is the nominal tuition fees that have to be paid. On the other hand, a large majority of would-be medical graduates have to seek admission in the privately run medical institutes in which the tuition and other related fees can be mind boggling when compared to their public counterparts. Except for candidates of exceptionally affluent background, the only alternative for fulfilling the dream of becoming a doctor is by financing one's study through hefty bank loans that may take years to pay back. It is often heard from patients that they are asked by doctors to undergo a plethora of diagnostic tests for apparently minor illnesses, which may financially benefit those prescribing the tests. The present paper attempts to throw light on the extent of disparity in cost of a medical education between state-funded and privately managed medical colleges in India; the average salary of a new medical graduate, which is often ridiculously low when compared to what is offered in entry-level engineering and business jobs; and the possible repercussions of this apparently unjust economic situation regarding the exploitation of patients.

Codes With Local Regeneration and Erasure Correction

Regenerating codes and codes with locality are two coding schemes that have recently been proposed, which in addition to ensuring data collection and reliability, also enable efficient node repair. In a situation where one is attempting to repair a failed node, regenerating codes seek to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. This paper presents results in two directions. In one, this paper extends the notion of codes with locality so as to permit local recovery of an erased code symbol even in the presence of multiple erasures, by employing local codes having minimum distance >2. An upper bound on the minimum distance of such codes is presented and codes that are optimal with respect to this bound are constructed. The second direction seeks to build codes that combine the advantages of both codes with locality as well as regenerating codes. These codes, termed here as codes with local regeneration, are codes with locality over a vector alphabet, in which the local codes themselves are regenerating codes. We derive an upper bound on the minimum distance of vector-alphabet codes with locality for the case when their constituent local codes have a certain uniform rank accumulation property. This property is possessed by both minimum storage regeneration (MSR) and minimum bandwidth regeneration (MBR) codes. We provide several constructions of codes with local regeneration which achieve this bound, where the local codes are either MSR or MBR codes. Also included in this paper, is an upper bound on the minimum distance of a general vector code with locality as well as the performance comparison of various code constructions of fixed block length and minimum distance.

Secure Transmission in Cooperative Networks with Weak Eavesdroppers

In this letter, we propose a scheme to improve the secrecy rate of cooperative networks using Analog Network Coding (ANC). ANC mixes the signals in the air; the desired signal is then separated out, from the mixed signals, at the legitimate receiver using techniques like self interference subtraction and signal nulling, thereby achieving better secrecy rates. Assuming global channel state information, memoryless adversaries and the decode-and-forward strategy, we seek to maximize the average secrecy rate between the source and the destination, subject to an overall power budget. Then, exploiting the structure of the optimization problem, we compute its optimal solution. Finally, we use numerical evaluations to compare our scheme with the conventional approaches.

Relay Selection with Channel Probing in Sleep-Wake Cycling Wireless Sensor Networks

In geographical forwarding of packets in a large wireless sensor network (WSN) with sleep-wake cycling nodes, we are interested in the local decision problem faced by a node that has ``custody'' of a packet and has to choose one among a set of next-hop relay nodes to forward the packet toward the sink. Each relay is associated with a ``reward'' that summarizes the benefit of forwarding the packet through that relay. We seek a solution to this local problem, the idea being that such a solution, if adopted by every node, could provide a reasonable heuristic for the end-to-end forwarding problem. Toward this end, we propose a local relay selection problem consisting of a forwarding node and a collection of relay nodes, with the relays waking up sequentially at random times. At each relay wake-up instant, the forwarder can choose to probe a relay to learn its reward value, based on which the forwarder can then decide whether to stop (and forward its packet to the chosen relay) or to continue to wait for further relays to wake up. The forwarder's objective is to select a relay so as to minimize a combination of waiting delay, reward, and probing cost. The local decision problem can be considered as a variant of the asset selling problem studied in the operations research literature. We formulate the local problem as a Markov decision process (MDP) and characterize the solution in terms of stopping sets and probing sets. We provide results illustrating the structure of the stopping sets, namely, the (lower bound) threshold and the stage independence properties. Regarding the probing sets, we make an interesting conjecture that these sets are characterized by upper bounds. Through simulation experiments, we provide valuable insights into the performance of the optimal local forwarding and its use as an end-to-end forwarding heuristic.

Converses For Secret Key Agreement and Secure Computing

We consider information theoretic secret key (SK) agreement and secure function computation by multiple parties observing correlated data, with access to an interactive public communication channel. Our main result is an upper bound on the SK length, which is derived using a reduction of binary hypothesis testing to multiparty SK agreement. Building on this basic result, we derive new converses for multiparty SK agreement. Furthermore, we derive converse results for the oblivious transfer problem and the bit commitment problem by relating them to SK agreement. Finally, we derive a necessary condition for the feasibility of secure computation by trusted parties that seek to compute a function of their collective data, using an interactive public communication that by itself does not give away the value of the function. In many cases, we strengthen and improve upon previously known converse bounds. Our results are single-shot and use only the given joint distribution of the correlated observations. For the case when the correlated observations consist of independent and identically distributed (in time) sequences, we derive strong versions of previously known converses.

Nonrotating Beams Isospectral to Tapered Rotating Beams

In this paper, we seek to find nonrotating beams that are isospectral to a given tapered rotating beam. Isospectral structures have identical natural frequencies. We assume the mass and stiffness distributions of the tapered rotating beam to be polynomial functions of span. Such polynomial variations of mass and stiffness are typical of helicopter and wind turbine blades. We use the Barcilon-Gottlieb transformation to convert the fourth-order governing equations of the rotating and the nonrotating beams, from the (x, Y) frame of reference to a hypothetical (z, U) frame of reference. If the coefficients of both the equations in the (z, U) frame match with each other, then the nonrotating beam is isospectral to the given rotating beam. The conditions on matching the coefficients lead to a pair of coupled differential equations. Wesolve these coupled differential equations numerically using the fourth-order Runge-Kutta scheme. We also verify that the frequencies (given in the literature) of standard tapered rotating beams are the frequencies (obtained using the finite-element analysis) of the isospectral nonrotating beams. Finally, we present an example of beams having a rectangular cross-section to show the application of our analysis. Since experimental determination of rotating beam frequencies is a difficult task, experiments can be easily conducted on these isospectral nonrotating beams to calculate the frequencies of the rotating beam.