Melatonin and IP(3)-induced Ca(2+) Release from Intracellular Stores in the Malaria Parasite Plasmodium falciparum within Infected Red Blood Cells

IP(3)-dependent Ca(2+) signaling controls a myriad of cellular processes in higher eukaryotes and similar signaling pathways are evolutionarily conserved in Plasmodium, the intracellular parasite that causes malaria. We have reported that isolated, permeabilized Plasmodium chabaudi, releases Ca(2+) upon addition of exogenous IP(3). In the present study, we investigated whether the IP(3) signaling pathway operates in intact Plasmodium falciparum, the major disease-causing human malaria parasite. P. falciparum-infected red blood cells (RBCs) in the trophozoite stage were simultaneously loaded with the Ca(2+) indicator Fluo-4/AM and caged-IP(3). Photolytic release of IP(3) elicited a transient Ca(2+) increase in the cytosol of the intact parasite within the RBC. The intracellular Ca(2+) pools of the parasite were selectively discharged, using thapsigargin to deplete endoplasmic reticulum (ER) Ca(2+) and the antimalarial chloroquine to deplete Ca(2+) from acidocalcisomes. These data show that the ER is the major IP(3)-sensitive Ca(2+) store. Previous work has shown that the human host hormone melatonin regulates P. falciparum cell cycle via a Ca(2+)-dependent pathway. In the present study, we demonstrate that melatonin increases inositol-polyphosphate production in intact intraerythrocytic parasite. Moreover, the Ca(2+) responses to melatonin and uncaging of IP(3) were mutually exclusive in infected RBCs. Taken together these data provide evidence that melatonin activates PLC to generate IP(3) and open ER-localized IP(3)-sensitive Ca(2+) channels in P. falciparum. This receptor signaling pathway is likely to be involved in the regulation and synchronization of parasite cell cycle progression.

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks` dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model-the evolving graphs-was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad hoc routing protocols (AODV, DSR, OLSR and DSDV). Interestingly, our experiments show that evolving graphs have the potential to be an effective and powerful tool in the development and analysis of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive algorithms. We also discuss such issues in this paper, as a result of our experience.