AMR (Automatic Measurement Reading) applications usually require measurement data to be collected from separate locations. In order to combine the data retrieved from separate sources into a meaningful result, all sources should share a common time sense. Therefore, it is necessary to implement a synchronization scheme in measurement networks. In this thesis, a synchronization scheme which combines GPS (Global Positioning System) and two high accuracy WSN (Wireless Sensor Network) time synchronization algorithms will be proposed and evaluated. The synchronization accuracy of the proposed method is compared to the accuracy of NTP (Network Time Protocol) by simulation. This research work is fully supported by the Public Research Grant Committee (KAMAG) of TUBiTAK within the scope of National Power Quality Project of Turkey with the project No: 105G129.

In this thesis, the synchronization in the arrays of identical and non-identical coupled harmonic oscillators is studied. Both linear and nonlinear coupling is considered. The study consists of two main parts. The first part concentrates on theoretical analysis and the second part contains the simulation results. The first part begins with introducing the harmonic oscillators and the basics of synchronization. Then some theoretical aspects of synchronization of linearly and nonlinearly coupled harmonic oscillators are presented. The theoretical results say that linearly coupled identical harmonic oscillators synchronize for any frequency of oscillation. For nonlinearly coupled identical harmonic oscillators, synchronization is shown to occur at large enough frequency values. In the second part, the simulator and simulation results are presented. A GUI is designed in MATLAB to run the simulations. In the simulations, synchronization of coupled harmonic oscillators are studied according to different coupling strength values, different frequency values, different coupling graph types (e.g. all-to-all, ring, tree) and different coupling function types (e.g. linear, saturation, cubic). The simulation results do not only support the theoretical part of the thesis but also give some idea about the part of the synchronization of coupled harmonic oscillators uncovered by theory.

Two peaks of eclosion dates, about 15 days apart, occur in the same batch of fertilized eggs in the marine midge, Pontomyia oceana. Two hypotheses, the variable adaptive peaks and the bet-hedging hypotheses, were proposed as the ultimate factor of the polymorphic phenomenon. They were tested by experiments controlling feeding amount and photoperiod, as well as selective breeding experiments. The offspring eclosing in the two peaks do not differ in fecundities, egg diameters, thorax and head lengths of males; this is not compatible with the variable adaptive peaks hypothesis. Both peaks exist under various feeding and photoperiods, although peak ratios differed in the former. The results in the first peak lineage did not support there is genetic component in peak ratio determination. The experiments in the second peak lineage had much lower success rates, although the results seemed to suggest a genetic component. The results in a more extreme selection experiment did not support that there is genetic component either. The present results are more compatible with the bet-hedging hypothesis. Wind velocity may be a factor hard to predict by the midges, and it may cause reproductive failure of them. Whereas high emergence synchronization, a prominent feature of the marine midge, may have advantages in many aspects, it also concentrates the risk of total reproductive failure. Spreading offspring to more than one suitable eclosion peak, the midge may have sacrificed short-term reproductive rate for long-term fitness.

The technique of direct sequence spread spectrum (DS/SS) has been widely used in commercial mobile communication systems. The efficiency of DS/SS system is highly dependent on the accurate and fast synchronization between the incoming and locally generated PN (pseudo-noise) codes. The code synchronization is processed in two steps, acquisition (coarse alignment) and tracking (fine alignment), to bring the delay offset between the two codes. Conventionally, for code synchronization, most of techniques were proposed based on the correlation property of PN codes. Recently, the different approach, by using the adaptive LMS filtering scheme, has been proposed to reduce the hardware complexity and to improve the performance of code synchronization, especially for a long PN code. In this thesis, a new coherent adaptive code synchronization scheme is proposed, where the adaptive constrained LMS (CLMS) algorithm with the maximum tap-weight (MTW) test method is devised for code acquisition. The statistics of weight vector of the proposed CLMS scheme are derived to evaluate the performance, in terms of mean acquisition time (MAT). Analytical and simulation results verify that the proposed scheme for code acquisition outperforms the one using the conventional LMS filtering schemes, under the integer and non-integer time delay cases. Moreover, the setting of threshold value is derived for code acquisition, which is independent of the values of signal-to-noise ratio (SNR) and time delay. Next, the CLMS scheme is proposed associated with the direct delay estimation (DDE) formula for code tracking. This approach does achieve a good delay-tracking performance, which is verified via computer simulation. Simultaneously, the hardware complexity can further be reduced due to that a code-tracking loop implemented by the interpolation method is not required.

A mobile ad hoc network consists of certain nodes that communicate only through wireless medium and can move arbitrarily. The key feature of a mobile ad hoc network is the mobility of the nodes. Because of the mobility, communication links form and disappear as nodes come into and go out of each other's communica- tion range. Mobile ad hoc networks are particularly useful in situations like disaster recovery and search, military operations, etc. Research on mobile ad hoc networks has drawn a huge amount of attention recently. The main challenges for mobile ad hoc networks are the sparse resources and frequent mobility. Most of the research work has been focused on the MAC and routing layer. In this work, we focus on distributed services for mobile ad hoc networks. These services will provide some fundamental functions in developing various applications for mobile ad hoc networks. In particular, we focus on the clock synchronization, connected dominating set, and k-mutual exclusion problems in mobile ad hoc networks.

In this dissertation, the problem of symbol timing synchronization for the following three different communication systems is studied: 1) conventional single-carrier transmissions with single antenna in both transmitter and receiver; 2) single-carrier transmissions with multiple antennas at both transmitter and receiver; and 3) orthogonal frequency division multiplexing (OFDM) based IEEE 802.11a wireless local area networks (WLANs). For conventional single-carrier, single-antenna systems, a general feedforward symbol-timing estimation framework is developed based on the conditional maximum likelihood principle. The proposed algorithm is applied to linear modulations and two commonly used continuous phase modulations: MSK and GMSK. The performance of the proposed estimator is analyzed analytically and via simulations. Moreover, using the newly developed general estimation framework, all the previously proposed digital blind feedforward symbol timing estimators employing second-order statistics are cast into a unified framework. The finite sample mean-square error expression for this class of estimators is established and the best estimators are determined. Simulation results are presented to corroborate the analytical results. Moving on to single-carrier, multiple-antenna systems, we present two algorithms. The first algorithm is based on a heuristic argument and it improves the optimum sample selection algorithm by Naguib et al. so that accurate timing estimates can be obtained even if the oversampling ratio is small. The performance of the proposed algorithm is analyzed both analytically and via simulations. The second algorithm is based on the maximum likelihood principle. The data aided (DA) and non-data aided (NDA) ML symbol timing estimators and their cor- responding CCRB and MCRB in MIMO correlated ??at-fading channels are derived. It is shown that the improved algorithm developed based on the heuristic argument is just a special case of the DA ML estimator. Simulation results under different operating conditions are given to assess and compare the performances of the DA and NDA ML estimators with respect to their corresponding CCRBs and MCRBs. In the last part of this dissertation, the ML timing synchronizer for IEEE 802.11a WLANs on frequency-selective fading channels is developed. The proposed algorithm is compared with four of the most representative timing synchronization algorithms, one specically designed for IEEE 802.11a WLANs and three other algorithms designed for general OFDM frame synchronization.

Multi-core architectures are becoming more common and core counts continue to increase. There are six- and eight-core chips currently in production, such as Intel Gulftown, and many-core chips with dozens of cores, such as the Intel Teraflops 80-core chip, are projected in the next five years. However, adding more cores often does not improve the performance of applications. It would be desirable to take advantage of the multi-core environment to speed up parallel discrete event simulation. The current bottleneck for many parallel simulations is time synchronization. This is especially true for simulations of wireless networks and on-chip networks, which have low lookahead. Message passing is also a common simulation bottleneck. In order to address the issue of time synchronization, we have designed hardware at a functional level that performs the time synchronization for parallel discrete event simulation asynchronously and in just a few clock cycles, eliminating the need for global communication with message passing or lock contention for shared memory. This hardware, the Global Synchronization Unit, consists of 3 register files, each the size of the number of cores, and is accessed using 5 new atomic instructions. In order to reduce the simulation overhead from message passing, we have also designed two independent pieces of hardware at a functional level, the Atomic Shared Heap and Atomic Message Passing, which can be used to perform lock-free, zero-copy message passing on a multi-core system. The impact of these specialized hardware units on the performance of parallel discrete event simulation is assessed and compared to traditional shared-memory techniques.

Software systems are ubiquitous in today's world and yet, remain vulnerable to the fallibility of human programmers as well as the unpredictability of their operating environments. The overarching goal of this dissertation is to develop algorithms to enable automated and efficient design and analysis of reliable programs. In the first and second parts of this dissertation, we focus on the development of programs that are free from programming errors. The intent is not to eliminate the human programmer, but instead to complement his or her expertise, with sound and efficient computational techniques, when possible. To this end, we make contributions in two specific domains. Program debugging --- the process of fault localization and error elimination from a program found to be incorrect --- typically relies on expert human intuition and experience, and is often a lengthy, expensive part of the program development cycle. In the first part of the dissertation, we target automated debugging of sequential programs. A broad and informal statement of the (automated) program debugging problem is to suitably modify an erroneous program, say P, to obtain a correct program, say P'. This problem is undecidable in general; it is hard to formalize; moreover, it is particularly challenging to assimilate and mechanize the customized, expert programmer intuition involved in the choices made in manual program debugging. Our first contribution in this domain is a methodical formalization of the program debugging problem, that enables automation, while incorporating expert programmer intuition and intent. Our second contribution is a solution framework that can debug infinite-state, imperative, sequential programs written in higher-level programming languages such as C. Boolean programs, which are smaller, finite-state abstractions of infinite-state or large, finite-state programs, have been found to be tractable for program verification. In this dissertation, we utilize Boolean programs for program debugging. Our solution framework involves two main steps: (a) automated debugging of a Boolean program, corresponding to an erroneous program P, and (b) translation of the corrected Boolean program into a correct program P'. Shared-memory concurrent programs are notoriously difficult to write, verify and debug; this makes them excellent targets for automated program completion, in particular, for synthesis of synchronization code. Extant work in this domain has focused on either propositional temporal logic specifications with simplistic models of concurrent programs, or more refined program models with the specifications limited to just safety properties. Moreover, there has been limited effort in developing adaptable and fully-automatic synthesis frameworks that are capable of generating synchronization at different levels of abstraction and granularity. In the second part of this dissertation, we present a framework for synthesis of synchronization for shared-memory concurrent programs with respect to temporal logic specifications. In particular, given a concurrent program composed of synchronization-free processes, and a temporal logic specification describing their expected concurrent behaviour, we generate synchronized processes such that the resulting concurrent program satisfies the specification. We provide the ability to synthesize readily-implementable synchronization code based on lower-level primitives such as locks and condition variables. We enable synchronization synthesis of finite-state concurrent programs composed of processes that may have local and shared variables, may be straight-line or branching programs, may be ongoing or terminating, and may have program-initialized or user-initialized variables. We also facilitate expression of safety and liveness properties over both control and data variables by proposing an extension of propositional computation tree logic. Most program analyses, verification, debugging and synthesis methodologies target traditional correctness properties such as safety and liveness. These techniques typically do not provide a quantitative measure of the sensitivity of a computational system's behaviour to unpredictability in the operating environment. We propose that the core property of interest in reasoning in the presence of such uncertainty is robustness --- small perturbations to the operating environment do not change the system's observable behavior substantially. In well-established areas such as control theory, robustness has always been a fundamental concern; however, the techniques and results therein are not directly applicable to computational systems with large amounts of discretized, discontinuous behavior. Hence, robustness analysis of software programs used in heterogeneous settings necessitates development of new theoretical frameworks and algorithms. In the third part of this dissertation, we target robustness analysis of two important classes of discrete systems --- string transducers and networked systems of Mealy machines. For each system, we formally define robustness of the system with respect to a specific source of uncertainty. In particular, we analyze the behaviour of transducers in the presence of input perturbations, and the behaviour of networked systems in the presence of channel perturbations. Our overall approach is automata-theoretic, and necessitates the use of specialized distance-tracking automata for tracking various distance metrics between two strings. We present constructions for such automata and use them to develop decision procedures based on reducing the problem of robustness verification of our systems to the problem of checking the emptiness of certain automata. Thus, the system under consideration is robust if and only if the languages of particular automata are empty. / text

M. Tech. Electrical Engineering. / This dissertation presents encryption and decryption of digital message signal and image data based on Qi hyper chaos system. The field of telecommunication has grown rapidly especially with the introduction of mobile phone and internet networks. Associated with this growth, there is a vital need to have a secure communication of information.

In this paper we examine the extent of international trade synchronization during periods of international trade collapses and US recessions. Using dynamic correlations based on monthly trade data for the G7 economies over the period 1961-2011, our results suggest rather idiosyncratic patterns of international trade synchronization during collapses of international trade and US recessions. During the great recession of 2007-2009, however, international trade experienced the most sudden, severe and globally synchronized collapse. (author's abstract)