Optimisation Problems in Wireless Sensor Networks : Local Algorithms and Local Graphs

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.

Service-based Requirements for Future Mobile Networks

The mobile phone has, as a device, taken the world by storm in the past decade; from only 136 million phones globally in 1996, it is now estimated that by the end of 2008 roughly half of the worlds population will own a mobile phone. Over the years, the capabilities of the phones as well as the networks have increased tremendously, reaching the point where the devices are better called miniature computers rather than simply mobile phones. The mobile industry is currently undertaking several initiatives of developing new generations of mobile network technologies; technologies that to a large extent focus at offering ever-increasing data rates. This thesis seeks to answer the question of whether the future mobile networks in development and the future mobile services are in sync; taking a forward-looking timeframe of five to eight years into the future, will there be services that will need the high-performance new networks being planned? The question is seen to be especially pertinent in light of slower-than-expected takeoff of 3G data services. Current and future mobile services are analyzed from two viewpoints; first, looking at the gradual, evolutionary development of the services and second, through seeking to identify potential revolutionary new mobile services. With information on both current and future mobile networks as well as services, a network capability - service requirements mapping is performed to identify which services will work in which networks. Based on the analysis, it is far from certain whether the new mobile networks, especially those planned for deployment after HSPA, will be needed as soon as they are being currently roadmapped. The true service-based demand for the "beyond HSPA" technologies may be many years into the future - or, indeed, may never materialize thanks to the increasing deployment of local area wireless broadband technologies.

Two forms of methionyl-transfer RNA synthetase from Mycobacterium Smegmatis

Two methionyl-transfer RNA synthetases (A and B forms) have been isolated from Image . The homogeneous preparations of the enzymes showed 1500 fold increase in specific activity in aminoacylation of methionine specific tRNA. The A and B forms differed in their specificity of aminoacylation of tRNAmMet and tRNAfMet; enzyme B exhibited much higher specificity for tRNAfMet. The molecular activities of A and B enzymes for aminoacid and tRNA were identical. The turnover number for aminoacid was 27 fold greater than that for tRNA, while the Km values for tRNA were lower by a factor of 106 as compared to the aminoacid. Both the enzymes catalysed ATP-pyrophosphate exchange reaction to the same extent.

The Linker Region in Receptor Guanylyl Cyclases Is a Key Regulatory Module MUTATIONAL ANALYSIS OF GUANYLYL CYCLASE C

Receptor guanylyl cyclases are multidomain proteins, and ligand binding to the extracellular domain increases the levels of intracellular cGMP. The intracellular domain of these receptors is composed of a kinase homology domain (KHD), a linker of similar to 70 amino acids, followed by the C-terminal guanylyl cyclase domain. Mechanisms by which these receptors are allosterically regulated by ligand binding to the extracellular domain and ATP binding to the KHD are not completely understood. Here we examine the role of the linker region in receptor guanylyl cyclases by a series of point mutations in receptor guanylyl cyclase C. The linker region is predicted to adopt a coiled coil structure and aid in dimerization, but we find that the effects of mutations neither follow a pattern predicted for a coiled coil peptide nor abrogate dimerization. Importantly, this region is critical for repressing the guanylyl cyclase activity of the receptor in the absence of ligand and permitting ligand-mediated activation of the cyclase domain. Mutant receptors with high basal guanylyl cyclase activity show no further activation in the presence of non-ionic detergents, suggesting that hydrophobic interactions in the basal and inactive conformation of the guanylyl cyclase domain are disrupted by mutation. Equivalent mutations in the linker region of guanylyl cyclase A also elevated the basal activity and abolished ligand-and detergent-mediated activation. We, therefore, have defined a key regulatory role for the linker region of receptor guanylyl cyclases which serves as a transducer of information from the extracellular domain via the KHD to the catalytic domain.

Nucleotide sequence of the 3' terminal region of belladonna mottle virus-Iowa (renamed Physalis mottle virus) RNA and an analysis of the relationships of tymoviral coat proteins

The 3prime terminal 1255nt sequence of Physalis mottle virus (PhMV) genomic RNA has been determined from a set of overlapping cDNA clones. The open reading frame (ORF) at the 3prime terminus corresponds to the amino acid sequence of the coat protein (CP) determined earlier except for the absence of the dipeptide, Lys-Leu, at position 110-111. In addition, the sequence upstream of the CP gene contains the message coding for 178 amino acid residues of the C-terminus of the putative replicase protein (RP). The sequence downstream of the CP gene contains an untranslated region whose terminal 80 nucleotides can be folded into a characteristic tRNA-like structure. A phylogenetic tree constructed after aligning separately the sequence of the CP, the replicase protein (RP) and the tRNA-like structure determined in this study with the corresponding sequences of other tymoviruses shows that PhMV wrongly named belladonna mottle virus [BDMV(I)] is a separate tymovirus and not another strain of BDMV(E) as originally envisaged. The phylogenetic tree in all the three cases is identical showing that any subset of genomic sequence of sufficient length can be used for establishing evolutionary relationships among tymoviruses.

Specific polyadenylation and purification of total messenger RNA from Escherichia coli

Obtaining pure mRNA preparations from prokaryotes has been difficult, if not impossible, for want of a poly(A) tail on these messages, We have used poly(A) polymerase from yeast to effect specific polyadenylation of Escherichia coli polysomal mRNA in the presence of magnesium and manganese, The polyadenylated total mRNA, which could be subsequently purified by binding to and elution from oligo(dT) beads, had a size range of 0.4-4.0 kb. We have used hybridization to a specific plasmid-encoded gene to further confirm that the polyadenylated species represented mRNA, Withdrawal of Mg2+ from the polyadenylation reaction rRNA despite the presence of Mn2+, indicating the vital role of Mg2+ in maintaining the native structure of polysomes, Complete dissociation of polysomes into ribosomal subunits resulted in quantitative polyadenylation of both 16S and 23S rRNA species, Chromosomal lacZ gene-derived messages were quantitatively recovered in the oligo(dT)-bound fraction, as demonstrated by RT-PCR analysis, Potential advantages that accrue from the availability of pure total mRNA from prokaryotes is discussed.

Effect of amplifier imperfections on active networks

The deviation in the performance of active networks due to practical operational amplifiers (OA) is mainly because of the finite gain bandwidth productBand nonzero output resistanceR_0. The effect ofBandR_0on two OA impedances and single and multi-OA filters are discussed. In filters, the effect ofR_0is to add zeros to the transfer function often making it nonminimum phase. A simple method of analysis has been suggested for 3-OA biquad and coupled biquad circuits. A general method of noise minimization of the generalized impedance converter (GIC), while operating OA's within the prescribed voltage and current limits, is also discussed. The 3-OA biquadratic sections analyzed also exhibit noise behavior and signal handling capacity similar to the GIC. The GIC based structures are found to be better than other configurations both in biquadratic sections and direct realizations of higher order transfer functions.

Knowledge networks and Australian Football League coach development: People of influence

Australian Football League (AFL) generally recognised as the ‘national game’ in Australia has a well established program of coach development. However, research examining AFL coaches’ work and how they learn to perform that work has hitherto not been conducted. The effective preparation of coaches is of prime concern to the AFL and should be informed by an examination of how coaches within the code come to know how to do their coaching work. Therefore, the purpose of this AFL-funded research was to inform coach development programs for current and aspiring AFL coaches.

Multifunctional RNA silencing pathway polymerase QDE-1 of Neurospora crassa

Double-stranded RNA and associated proteins are known to regulate the gene expression of most eukaryotic organisms. These regulation pathways have different components, outcomes and distinct nomenclature depending on the model system, and often they are referred to collectively as RNA silencing. In many cases, RNA-dependent RNA polymerases (RdRPs) are found to be involved in the RNA silencing, but their targets, activities, interaction partners and reaction products remain enigmatic. In the filamentous fungus Neurospora crassa, the RdRP QDE-1 is critical for silencing of transgenes a phenomenon known as quelling. In this thesis the structure, biochemical activities and biological functions of QDE-1 were extensively studied. This dimeric RdRP was shown to possess five distinct catalytic in vitro activities that could be dissected by mutagenesis and by altering reaction conditions. The biochemical characterization implied that QDE-1 is actually an active DNA-dependent RNA polymerase that has additional RdRP activity. It also provided a structural explanation for the dimerization and suggested a biological framework for the functions of QDE-1 in vivo. (I) QDE-1 was also studied in a broader context along with the other components of the quelling pathway. It was shown that DNA damage in Neurospora causes a dramatic increase in the expression level of the Argonaute protein QDE-2 as well as the synthesis of a novel class of small RNAs known as qiRNAs. The accumulation of qiRNAs was shown to be dependent on several quelling components, and particularly to be derived from an aberrant ssRNA (aRNA) molecule that is synthesized by QDE-1 in the nucleus. The genomic distribution of qiRNA targets was analyzed and the possible biological significance of qiRNAs was studied. Importantly, qiRNAs are the first class of small RNAs that are induced by DNA damage. (II) After establishing that QDE-1 is a multifunctional RNA polymerase with several activities, template specificities and subcellular locations, the focus was turned onto its interaction partners. It had been previously known that QDE-1 associates with Replication Protein A (RPA), but the RecQ helicase QDE-3 was now shown to regulate this interaction. RPA was also observed to promote QDE-1 dependent dsRNA synthesis in vitro. By characterizing the interplay between QDE-1, QDE-3 and RPA, a working model of quelling and qiRNA pathways in Neurospora was presented. (III) This work sheds light on the complexity of the various RNA silencing pathways of a fungal model system. It shows how an RdRP can regulate gene expression on many levels, and suggests novel lines of research in other eukaryotic organisms.

Using enterprise social networks as innovation platforms

Do enterprise social network platforms in an organization make the company more innovative? In theory, through communication, collaboration, and knowledge exchange, innovation ideas can easily be expressed, shared, and discussed with many partners in the organization. Yet, whether this guarantees innovation success remains to be seen. The authors studied how innovation ideas moved--or not--from an enterprise social network platform to regular innovation processes at a large Australian retailer. They found that the success of innovation ideas depends on how easily understandable the idea is on the platform, how long it has been discussed, and how powerful the social network participants are in the organization. These findings inform management strategies for the governance of enterprise social network use and the organizational innovation process.