An asynchronous channel assignment scheme: performance evaluation

Due to its popularity, dense deployments of wireless local area networks (WLANs) are becoming a common feature of many cities around the world. However, with only a limited number of channels available, the problem of increased interference can severely degrade the performance of WLANs if an effective channel assignment scheme is not employed. In an earlier work, we proposed an improved asynchronous distributed and dynamic channel assignment scheme that (1) is simple to implement, (2) does not require any knowledge of the throughput function, and (3) allows asynchronous channel switching by each access point (AP). In this paper, we present extensive performance evaluation of the proposed scheme in practical scenarios found in densely populated WLAN deployments. Specifically, we investigate the convergence behaviour of the scheme and how its performance gains vary with different number of available channels and in different deployment densities. We also prove that our scheme is guaranteed to converge in a single iteration when the number of channels is greater than the number of neighbouring APs.

Effectiveness of asynchronous channel assignment scheme in heterogeneous WLANs

Due to their popularity, dense deployments of wireless local area networks (WLANs) are becoming a common feature of many cities around the world. However, with only a limited number of channels available, the problem of increased interference can severely degrade the performance of WLANs if an effective channel assignment scheme is not employed. Previous studies on channel assignment in WLANs almost always assume that all access points (AP) employ the same channel assignment scheme which is clearly unrealistic. On the other hand, to the best of our knowledge, the interaction between different channel assignment schemes has also not been studied before. Therefore, in this paper, we investigate the effectiveness of our earlier proposed asynchronous channel assignment scheme in these heterogeneous WLANs scenarios. Simulation results show that our proposed scheme is still able to provide robust performance gains even in these scenarios.

An asynchronous distributed dynamic channel assignment scheme for dense WLANs

Wireless local area networks (WLANs) have changed the way many of us communicate, work, play and live. Due to its popularity, dense deployments are becoming a norm in many cities around the world. However, increased interference and traffic demands can severely limit the aggregate throughput achievable if an effective channel assignment scheme is not used. In this paper, we propose an enhanced asynchronous distributed and dynamic channel assignment scheme that is simple to implement, does not require any knowledge of the throughput function, allows asynchronous channel switching by each access point (AP) and is superior in performance. Simulation results show that our proposed scheme converges much faster than previously reported synchronous schemes, with a reduction in convergence time and channel switches by tip to 73.8% and 30.0% respectively.

e-learning in project management using simulation models: a case study based on the replication of an experiment

Current e-learning systems are increasing their importance in higher education. However, the state of the art of e-learning applications, besides the state of the practice, does not achieve the level of interactivity that current learning theories advocate. In this paper, the possibility of enhancing e-learning systems to achieve deep learning has been studied by replicating an experiment in which students had to learn basic software engineering principles. One group learned these principles using a static approach, while the other group learned the same principles using a system-dynamics-based approach, which provided interactivity and feedback. The results show that, quantitatively, the latter group achieved a better understanding of the principles; furthermore, qualitatively, they enjoyed the learning experience

Coupling cancellation based multiuser detector for asynchronous DS/CDMA

A three-shot multiuser detector is proposed for the reverse link of asynchronous DS/CDMA systems. By taking advantage of the preceding (already reconstructed) bit and the matched filter output for the following two bits, the coupling between temporally adjacent bits (TABs, which always exists for asynchronous systems) is cancelled in a three step fashion. The obtained detector has several useful advantages over existing schemes.

Synchronisation error resistant multiuser detection for asynchronous CDMA

Linear CDMA detectors have emerged as a promising solution to multiple access interference (MAI) suppression. Unfortunately, most existing linear detectors suffer from high sensitivity to synchronisation errors (also termed parameter estimation error), and synchronisation error resistant detectors have so far not been as widely investigated as they should have. This paper extends the minimum variance distortionless response (MVDR) detector, proposed previously by this author (Zheng 2000) for synchronous systems, to asynchronous systems. It has been shown that the MVDR structure is equally effective for asynchronous systems, especially for the weaker users.

Time diversity decorrelator (TDD); a near-far resistant detector for asynchronous CDMA system

Greater attention has been focused on the use of CDMA for future cellular mobile communications. CA near-far resistant detector for asynchronous code-division multiple-access (CDMA) systems operating in additive white Gaussian noise (AWGN) channels is presented. The multiuser interference caused by K users transmitting simultaneously, each with a specific signature sequence, is completely removed at the receiver. The complexity of this detector grows only linearly with the number of users, as compared to the optimum multiuser detector which requires exponential complexity in the number of users. A modified algorithm based on time diversity is described. It performs detection on a bit-by-bit basis and overcomes the complexity of using a sequence detector. The performance of this detector is shown to be superior to that of the conventional receiver.

Replication enhancer elements within the open reading frame of tick-borne encephalitis virus and their evolution within the Flavivirus genus

We provide experimental evidence of a replication enhancer element (REE) within the capsid gene of tick-borne encephalitis virus (TBEV, genus Flavivirus). Thermodynamic and phylogenetic analyses predicted that the REE folds as a long stable stem–loop (designated SL6), conserved among all tick-borne flaviviruses (TBFV). Homologous sequences and potential base pairing were found in the corresponding regions of mosquito-borne flaviviruses, but not in more genetically distant flaviviruses. To investigate the role of SL6, nucleotide substitutions were introduced which changed a conserved hexanucleotide motif, the conformation of the terminal loop and the base-paired dsRNA stacking. Substitutions were made within a TBEV reverse genetic system and recovered mutants were compared for plaque morphology, single-step replication kinetics and cytopathic effect. The greatest phenotypic changes were observed in mutants with a destabilized stem. Point mutations in the conserved hexanucleotide motif of the terminal loop caused moderate virus attenuation. However, all mutants eventually reached the titre of wild-type virus late post-infection. Thus, although not essential for growth in tissue culture, the SL6 REE acts to up-regulate virus replication. We hypothesize that this modulatory role may be important for TBEV survival in nature, where the virus circulates by non-viraemic transmission between infected and non-infected ticks, during co-feeding on local rodents.

Asynchronous flowering and within-plant flowering diversity in wheat and the implications for crop resilience to heat

Self-pollination dominates in wheat , with a small level of out-crossing due to flowering asynchrony and male sterility. However, the timing and synchrony of male and female flowering in wheat is a crucial determinant of seed set and may be an important factor affecting gene flow and resilience to climate change. Here, a methodology is presented for assessing the timing and synchrony of flowering in wheat. From the onset of flowering until the end of anthesis, the anther and stigma activity of each floret was assessed on the first five developing ears in potted plants grown under ambient conditions and originating from cv Paragon or cvs Spark-Rialto backgrounds. At harvest maturity, seed presence, size and weight was recorded for each floret scored. The synchrony between pollen dehiscence and stigma collapse within a flower was dependent on its relative position in a spike and within a floret. Determined on the basis of synchrony within each flower, the level of pollination by pollen originating from other flowers reached approximately 30% and did not change throughout the duration of flowering. A modelling exercise parameterised by flowering observations indicated that the temporal and spatial variability of anther activity within and between spikes may influence the relative resilience of wheat to sudden, extreme climatic events which has direct relevance to predicted future climate scenarios in the UK.

Fault tolerant decentralised K-Means clustering for asynchronous large-scale networks

The K-Means algorithm for cluster analysis is one of the most influential and popular data mining methods. Its straightforward parallel formulation is well suited for distributed memory systems with reliable interconnection networks, such as massively parallel processors and clusters of workstations. However, in large-scale geographically distributed systems the straightforward parallel algorithm can be rendered useless by a single communication failure or high latency in communication paths. The lack of scalable and fault tolerant global communication and synchronisation methods in large-scale systems has hindered the adoption of the K-Means algorithm for applications in large networked systems such as wireless sensor networks, peer-to-peer systems and mobile ad hoc networks. This work proposes a fully distributed K-Means algorithm (EpidemicK-Means) which does not require global communication and is intrinsically fault tolerant. The proposed distributed K-Means algorithm provides a clustering solution which can approximate the solution of an ideal centralised algorithm over the aggregated data as closely as desired. A comparative performance analysis is carried out against the state of the art sampling methods and shows that the proposed method overcomes the limitations of the sampling-based approaches for skewed clusters distributions. The experimental analysis confirms that the proposed algorithm is very accurate and fault tolerant under unreliable network conditions (message loss and node failures) and is suitable for asynchronous networks of very large and extreme scale.

Enhanced hepatitis C virus genome replication and lipid accumulation mediated by inhibition of AMP-activated protein kinase

Hepatitis C virus (HCV) infection is associated with dysregulation of both lipid and glucose metabolism. As well as contributing to viral replication, these perturbations influence the pathogenesis associated with the virus, including steatosis, insulin resistance, and type 2 diabetes. AMP-activated protein kinase (AMPK) plays a key role in regulation of both lipid and glucose metabolism. We show here that, in cells either infected with HCV or harboring an HCV subgenomic replicon, phosphorylation of AMPK at threonine 172 and concomitant AMPK activity are dramatically reduced. We demonstrate that this effect is mediated by activation of the serine/threonine kinase, protein kinase B, which inhibits AMPK by phosphorylating serine 485. The physiological significance of this inhibition is demonstrated by the observation that pharmacological restoration of AMPK activity not only abrogates the lipid accumulation observed in virus-infected and subgenomic replicon-harboring cells but also efficiently inhibits viral replication. These data demonstrate that inhibition of AMPK is required for HCV replication and that the restoration of AMPK activity may present a target for much needed anti-HCV therapies.