Algorithms for Routing and Centralized Scheduling in IEEE 802.16 Mesh Networks

IEEE 802.16 standards for Wireless Metropolitan Area Networks (WMANs) include a mesh mode of operation for improving the coverage and throughput of the network. In this paper, we consider the problem of routing and centralized scheduling for such networks. We first fix the routing, which reduces the network to a tree. We then present a finite horizon dynamic programming framework. Using it we obtain various scheduling algorithms depending upon the cost function. Next we consider simpler suboptimal algorithms and compare their performances.

Mobile Base Stations Placement and Energy Aware Routing in Wireless Sensor Networks

Increasing network lifetime is important in wireless sensor/ad-hoc networks. In this paper, we are concerned with algorithms to increase network lifetime and amount of data delivered during the lifetime by deploying multiple mobile base stations in the sensor network field. Specifically, we allow multiple mobile base stations to be deployed along the periphery of the sensor network field and develop algorithms to dynamically choose the locations of these base stations so as to improve network lifetime. We propose energy efficient low-complexity algorithms to determine the locations of the base stations; they include i) Top-K-max algorithm, ii) maximizing the minimum residual energy (Max-Min-RE) algorithm, and iii) minimizing the residual energy difference (MinDiff-RE) algorithm. We show that the proposed base stations placement algorithms provide increased network lifetimes and amount of data delivered during the network lifetime compared to single base station scenario as well as multiple static base stations scenario, and close to those obtained by solving an integer linear program (ILP) to determine the locations of the mobile base stations. We also investigate the lifetime gain when an energy aware routing protocol is employed along with multiple base stations.

A Multiuser Interference Cancellation Scheme for Uplink OFDMA

In uplink orthogonal frequency division multiple access (OFDMA) systems, multiuser interference (MUI) occurs due to different carrier frequency offsets (CFO) of different users at the receiver. In this paper, we present a multistage linear parallel interference cancellation (LPIC) approach to mitigate the effect of this MUI in uplink OFDMA. The proposed scheme first performs CFO compensation (in time domain), followed by K DFT operations (where K is the number of users) and multistage LPIC on these DFT outputs. We scale the MUI estimates by weights before cancellation and optimize these weights by maximizing the signal-to-interference ratio (SIR) at the output of the different stages of the LPIC. We derive closed-form expressions for these optimum weights. The proposed LPIC scheme is shown to effectively cancel the MUI caused by the other user CFOs in uplink OFDMA.

Efficient and Fair Scheduling of Uplink and Downlink in IEEE 802.16 OFDMA Networks

We develop new scheduling algorithms for the IEEE 802.16d OFDMA/TDD based broadband wireless access system, in which radio resources of both time and frequency slots are dynamically shared by all users. Our objective is to provide a fair and efficient allocation to all the users to satisfy their quality of service.

BER Analysis of Weighted Interference Cancellation in Multicarrier DS-CDMA Systems

In this paper, we present the design and bit error performance analysis of weighted linear parallel interference cancellers (LPIC) for multicarrier (MC) DS-CDMA systems. We propose an LPIC scheme where we estimate (and cancel) the multiple access interference (MAI) based on the soft outputs on individual subcarriers, and the interference cancelled outputs on different subcarriers are combined to form the final decision statistic. We scale the MAI estimate on individual subcarriers by a weight before cancellation; these weights are so chosen to maximize the signal-to-interference ratios at the individual subcarrier outputs. For this weighted LPIC scheme, using an approach involving the characteristic function of the decision variable, we derive exact bit error rate (BER) expressions for different cancellation stages. Using the same approach, we also derive exact BER expressions for the matched filter (MF) and decorrelating detectors for the considered MC DS-CDMA system. We show that the proposed weighted LPIC scheme performs better than the MF detector and the conventional LPIC (where the weights are taken to be unity), and close to the decorrelating detector.

Distributed Coding for Multiple Access Communication with Side Information

In a typical sensor network scenario a goal is to monitor a spatio-temporal process through a number of inexpensive sensing nodes, the key parameter being the fidelity at which the process has to be estimated at distant locations. We study such a scenario in which multiple encoders transmit their correlated data at finite rates to a distant, common decoder over a discrete time multiple access channel under various side information assumptions. In particular, we derive an achievable rate region for this communication problem.

The 'neighbour effect' and its role in shaping the positional pattern of seed development in fruits: An illustration from the pods of Erythrina suberosa

Plants exhibit certain intra-fruit positional patterns in the development of seeds. These patterns have been generally interpreted to be a consequence of resource and fertilization gradients. However, such positional patterns might also be shaped by the 'neighbour effect', wherein formation and development of a seed at any position might positively or negatively influence those of other seeds in the neighbourhood. In this article, we examine the role of such neighbour effect in shaping the positional pattern of seeds in the pods of Erythrina suberosa. The results suggest the existence of a positive neighbour effect leading to a higher frequency of seeds in contiguous positions.

Speedup Macroblock Mode Decision in H.264/SVC Encoding Using Cost-Sensitive Learning

In this paper we present a novel macroblock mode decision algorithm to speedup H.264/SVC Intra frame encoding. We replace the complex mode-decision calculations by a classifier which has been trained specifically to minimize the reduction in RD performance. This results in a significant speedup in encoding. The results show that machine learning has a great potential and can reduce the complexity substantially with negligible impact on quality. The results show that the proposed method reduces encoding time to about 70% in base layer and up to 50% in enhancement layer of the reference implementation with a negligible loss in quality.

Excision of uracil from the ends of double stranded DNA by uracil DNA glycosylase and its use in high efficiency cloning of PCR products

We show that uracil DNA glycosylase from E. coli excises uracil residues from the ends of double stranded oligos. This information has allowed us to develop an efficient method of cloning PCR amplified DNA. In this report, we describe use of this method in cloning of E. coli genes for lysyl- and methionyl-tRNA synthetases. Efficiency of cloning by this method was found to be the same as that of subcloning of DNA restriction fragments from one vector to the other vector. Possibilities of using other DNA glycosylases for such applications are discussed.

Inefficient excision of uracil from loop regions of DNA oligomers by E.coli uracil DNA glycosylase

Kinetic parameters for uracil DNA glycosylase (E.coli)-catalysed excision of uracil from DNA oligomers containing dUMP in different structural contexts were determined. Our results show that single-stranded oligonucleotides (unstructured) are used as somewhat better substrates than the double-stranded oligonucleotides. This is mainly because of the favourable V-max value of the enzyme for single-stranded substrates. More interestingly, however, we found that uracil release from loop regions of DNA hairpins is extremely inefficient. The poor efficiency with which uracil is excised from loop regions is a result of both increased K-m and lowered V-max values. This observation may have significant implications in uracil DNA glycosylase-directed repair of DNA segments that can be extruded as hairpins. In addition, these studies are useful in designing oligonucleotides for various applications in DNA research where the use of uracil DNA glycosylase is sought.

Long term monitering of vegetation in a tropical deciduous forest in Mudumalai,southern India

As part of an international network of large plots to study tropical vegetation dynamics on a long-term basis, a 50-hectare permanent plot was set up during 1988-89 in the deciduous forests of Mudumalai, southern India. Within this plot 25,929 living woody plants (71 species) above 1 cm DBH (diameter at breast height) were identified, measured, tagged and mapped. Species abundances corresponded to the characteristic log-normal distribution. The four most abundant species (Kydia calycina, Lagerstroemia microcarpa, Terminalia crenulata and Helicteres isora) constituted nearly 56% of total stems, while seven species were represented by only one individual each in the plot. Variance/mean ratios of density showed most species to have clumped distributions. The population declined overall by 14% during the first two years, largely due to elephant and fire-mediated damage to Kydia calycina and Helicteres isora. In this article we discuss the need for large plots to study vegetation dynamics.

Sibling rivalry between seeds within a fruit: Some population genetic models

Competition between seeds within a fruit for parental resources is described using one-locus-two-allele models. While a �normal� allele leads to an equitable distribution of resources between seeds (a situation which also corresponds to the parental optimum), the �selfish� allele is assumed to cause the seed carrying it to usurp a higher proportion of the resources. The outcome of competition between �selfish� alleles is also assumed to lead to an asymmetric distribution of resources, the �winner� being chosen randomly. Conditions for the spread of an initially rare selfish allele and the optimal resource allocation corresponding to the evolutionarily stable strategy, derived for species with n-seeded fruits, are in accordance with expectations based on Hamilton�s inclusive fitness criteria. Competition between seeds is seen to be most intense when there are only two seeds, and decreases with increasing number of seeds, suggesting that two-seeded fruits would be rarer than one-seeded or many-seeded ones. Available data from a large number of plant species are consistent with this prediction of the model.

Engineered dimer interface mutants of triosephosphate isomerase: the role of inter-subunit interactions in enzyme function and stability

The role of inter-subunit interactions in maintaining optimal catalytic activity in triosephosphate isomerase (TIM) has been probed, using the Plasmodium falciparum enzyme as a model. Examination of subunit interface contacts in the crystal structures suggests that residue 75 (Thr, conserved) and residue 13 (Cys, variable) make the largest number of inter-subunit contacts. The mutants Cys13Asp (C13D) and Cys13Glu (C13E) have been constructed and display significant reduction in catalytic activity when compared with wild-type (WT) enzyme (similar to 7.4-fold decrease in k(cat) for the C13D and similar to 3.3-fold for the C13E mutants). Analytical gel filtration demonstrates that the C13D mutant dissociates at concentrations < 1.25 mu M, whereas the WT and the C13E enzymes retain the dimeric structure. The order of stability of the mutants in the presence of chemical denaturants, like urea and guanidium chloride, is WT > Cys13Glu > Cys13Asp. Irreversible thermal precipitation temperatures follow the same order as well. Modeling studies establish that the Cys13Asp mutation is likely to cause a significantly greater structural perturbation than Cys13Glu. Analysis of sequence and structural data for TIMs from diverse sources suggests that residues 13 and 82 form a pair of proximal sites, in which a limited number of residue pairs may be accommodated.

Forecasting rain for groundnut farmers�how good is good enough

: We illustrate how climatological information about adverse weather events and meteorological forecasts (when available) can be used to decide between alternative strategies so as to maximize the long-term average returns for rainfed groundnut in semi-arid parts of Karnataka, We show that until the skill of the forecast, i.e. probability of an adverse event occurring when it is forecast, is above a certain threshold, the forecast has no impact on the optimum strategy, This threshold is determined by the loss in yield due to the adverse weather event and the cost of the mitigatory measures, For the specific case of groundnut, it is found that while for combating some pests/diseases, climatological information is adequate, for others a forecast of sufficient skill would have a significant impact on the productivity.