A Decentralized Session Management Framework for Heterogeneous Ad-Hoc and Fixed Networks

Wireless technologies are continuously evolving. Second generation cellular networks have gained worldwide acceptance. Wireless LANs are commonly deployed in corporations or university campuses, and their diffusion in public hotspots is growing. Third generation cellular systems are yet to affirm everywhere; still, there is an impressive amount of research ongoing for deploying beyond 3G systems. These new wireless technologies combine the characteristics of WLAN based and cellular networks to provide increased bandwidth. The common direction where all the efforts in wireless technologies are headed is towards an IP-based communication. Telephony services have been the killer application for cellular systems; their evolution to packet-switched networks is a natural path. Effective IP telephony signaling protocols, such as the Session Initiation Protocol (SIP) and the H 323 protocol are needed to establish IP-based telephony sessions. However, IP telephony is just one service example of IP-based communication. IP-based multimedia sessions are expected to become popular and offer a wider range of communication capabilities than pure telephony. In order to conjoin the advances of the future wireless technologies with the potential of IP-based multimedia communication, the next step would be to obtain ubiquitous communication capabilities. According to this vision, people must be able to communicate also when no support from an infrastructured network is available, needed or desired. In order to achieve ubiquitous communication, end devices must integrate all the capabilities necessary for IP-based distributed and decentralized communication. Such capabilities are currently missing. For example, it is not possible to utilize native IP telephony signaling protocols in a totally decentralized way. This dissertation presents a solution for deploying the SIP protocol in a decentralized fashion without support of infrastructure servers. The proposed solution is mainly designed to fit the needs of decentralized mobile environments, and can be applied to small scale ad-hoc networks or also bigger networks with hundreds of nodes. A framework allowing discovery of SIP users in ad-hoc networks and the establishment of SIP sessions among them, in a fully distributed and secure way, is described and evaluated. Security support allows ad-hoc users to authenticate the sender of a message, and to verify the integrity of a received message. The distributed session management framework has been extended in order to achieve interoperability with the Internet, and the native Internet applications. With limited extensions to the SIP protocol, we have designed and experimentally validated a SIP gateway allowing SIP signaling between ad-hoc networks with private addressing space and native SIP applications in the Internet. The design is completed by an application level relay that permits instant messaging sessions to be established in heterogeneous environments. The resulting framework constitutes a flexible and effective approach for the pervasive deployment of real time applications.

Purification and Regulatory Properties of Mung Bean (Vigna Radiata L.) Serine Hydroxymethyltransferase 1

Serine hydroxymethyltransferase, the first enzyme in the pathway for interconversion of C1 fragments, was purified to homogeneity for the first time from any plant source. The enzyme from 72-h mung bean (Vigna radiata L.) seedlings was isolated using Blue Sepharose CL-6B and folate-AH-Sepharose-4B affinity matrices and had the highest specific activity (1.33 micromoles of HCHO formed per minute per milligram protein) reported hitherto. The enzyme preparation was extremely stable in the presence of folate or L-serine. Pyridoxal 5'-phosphate, ethylenediaminetetraacetate and 2-mercaptoethanol prevented the inactivation of the enzyme during purification. The enzyme functioned optimally at pH 8.5 and had two temperature maxima at 35 and 55°C. The Km values for serine were 1.25 and 68 millimolar, corresponding to Vmax values of 1.8 and 5.4 micromoles of HCHO formed per minute per milligram protein, respectively. The K0.5 value for L-tetrahydrofolate (H4folate) was 0.98 millimolar. Glycine, the product of the reaction and D-cycloserine, a structural analog of D-alanine, were linear competitive inhibitors with respect to L-serine with Ki values of 2.30 and 2.02 millimolar, respectively. Dichloromethotrexate, a substrate analog of H4folate was a competitive inhibitor when H4folate was the varied substrate. Results presented in this paper suggested that pyridoxal 5'-phosphate may not be essential for catalysis.The sigmoid saturation pattern of H4folate (nH = 2.0), one of the substrates, the abolition of sigmoidicity by NADH, an allosteric positive effector (nH = 1.0) and the increase in sigmoidicity by NAD+ and adenine nucleotides, negative allosteric effectors (nH = 2.4) clearly established that this key enzyme in the folate metabolism was an allosteric protein. Further support for this conclusion were the observations that (a) serine saturation exhibited an intermediary plateau region; (b) partial inhibition by methotrexate, aminopterin, O-phosphoserine, DL-{alpha}-methylserine and DL-O-methylserine; (c) subunit nature of the enzyme; and (d) decrease in the nH value from 2.0 for H4folate to 1.5 in presence of L-serine. These results highlight the regulatory nature of mung bean serine hydroxymethyltransferase and its possible involvement in the modulation of the interconversion of folate coenzymes.

TCP Performance in Heterogeneous Wireless Networks

The TCP protocol is used by most Internet applications today, including the recent mobile wireless terminals that use TCP for their World-Wide Web, E-mail and other traffic. The recent wireless network technologies, such as GPRS, are known to cause delay spikes in packet transfer. This causes unnecessary TCP retransmission timeouts. This dissertation proposes a mechanism, Forward RTO-Recovery (F-RTO) for detecting the unnecessary TCP retransmission timeouts and thus allow TCP to take appropriate follow-up actions. We analyze a Linux F-RTO implementation in various network scenarios and investigate different alternatives to the basic algorithm. The second part of this dissertation is focused on quickly adapting the TCP's transmission rate when the underlying link characteristics change suddenly. This can happen, for example, due to vertical hand-offs between GPRS and WLAN wireless technologies. We investigate the Quick-Start algorithm that, in collaboration with the network routers, aims to quickly probe the available bandwidth on a network path, and allow TCP's congestion control algorithms to use that information. By extensive simulations we study the different router algorithms and parameters for Quick-Start, and discuss the challenges Quick-Start faces in the current Internet. We also study the performance of Quick-Start when applied to vertical hand-offs between different wireless link technologies.

Computational Methods for Locating and Analyzing Conserved Gene Regulatory DNA Elements

This thesis presents methods for locating and analyzing cis-regulatory DNA elements involved with the regulation of gene expression in multicellular organisms. The regulation of gene expression is carried out by the combined effort of several transcription factor proteins collectively binding the DNA on the cis-regulatory elements. Only sparse knowledge of the 'genetic code' of these elements exists today. An automatic tool for discovery of putative cis-regulatory elements could help their experimental analysis, which would result in a more detailed view of the cis-regulatory element structure and function. We have developed a computational model for the evolutionary conservation of cis-regulatory elements. The elements are modeled as evolutionarily conserved clusters of sequence-specific transcription factor binding sites. We give an efficient dynamic programming algorithm that locates the putative cis-regulatory elements and scores them according to the conservation model. A notable proportion of the high-scoring DNA sequences show transcriptional enhancer activity in transgenic mouse embryos. The conservation model includes four parameters whose optimal values are estimated with simulated annealing. With good parameter values the model discriminates well between the DNA sequences with evolutionarily conserved cis-regulatory elements and the DNA sequences that have evolved neutrally. In further inquiry, the set of highest scoring putative cis-regulatory elements were found to be sensitive to small variations in the parameter values. The statistical significance of the putative cis-regulatory elements is estimated with the Two Component Extreme Value Distribution. The p-values grade the conservation of the cis-regulatory elements above the neutral expectation. The parameter values for the distribution are estimated by simulating the neutral DNA evolution. The conservation of the transcription factor binding sites can be used in the upstream analysis of regulatory interactions. This approach may provide mechanistic insight to the transcription level data from, e.g., microarray experiments. Here we give a method to predict shared transcriptional regulators for a set of co-expressed genes. The EEL (Enhancer Element Locator) software implements the method for locating putative cis-regulatory elements. The software facilitates both interactive use and distributed batch processing. We have used it to analyze the non-coding regions around all human genes with respect to the orthologous regions in various other species including mouse. The data from these genome-wide analyzes is stored in a relational database which is used in the publicly available web services for upstream analysis and visualization of the putative cis-regulatory elements in the human genome.

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.

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.

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.