The reliable internet stream transport (RIST) protocol is used for streaming video over the internet and requires time synchronisation to ensure that each frame is played out at the correct time. One method to ensure time synchronisation today in RIST productions is by utilizing the network time protocol (NTP). NTP has several issues and requirements that makes it a not ideal time synchronisation method in RIST productions and this thesis proposes a dynamic average time synchronisation (DATS) method as an option for using NTP in RIST productions. The DATS method uses a two-way synchronisation scheme to estimate the time offset between a video sender node and a video receiver node which is added to an average used as the time offset value. Additionally, it is explored whether or not a Kalman filter can further increase performance in DATS. Furthermore, the Kalman filter parameters were attempted to be optimized with a genetic algorithm. With a simulated \textit{testsrc FFmpeg} stream, the performance of DATS is evaluated and compared with the NTP implementation \textit{Chrony}. The metrics used in the evaluation was the playout delay and the error in time synchronisation which were calculated by periodical messages between a sender and receiver node. The results reveal that DATS performs slightly better without a Kalman filter but is slightly less robust without it. The results also indicated that DATS is comparable to NTP in an unloaded network, but is outperformed by NTP in a congested network.

The demand for access to information when and where you need has motivated the transition of wireless communications from a fixed infrastructure based cellular communications technology to a more pervasive adhoc wireless networking technology. Challenges still remain in wireless adhoc networks in terms of meeting higher capacity demands, improved reliability and longer connectivity before it becomes a viable widespread commercial technology. Present day wireless mesh networking uses node-to-node serial multi-hop communication to convey information from source to destination in the network. The performance of such a network depends on finding the best possible route between the source and destination nodes. However the end-to-end performance can only be as good as the weakest link within a chosen route. Unlike wired networks, the quality of point-to-point links in a wireless mesh network is subject to random fluctuations. This adversely affects the performance resulting in poor throughput and poor energy efficiency. In recent years, a new paradigm for communication called cooperative communications has been proposed for which initial information theoretic studies have shown the potential for improvements in capacity over traditional multi-hop wireless networks. Cooperative communication involves exploiting the broadcast nature of the wireless medium to form virtual antenna arrays out of independent single-antenna network nodes for transmission. In this research we explore the fundamental performance limits of cooperative communication under more practical operating scenarios. Specifically we provide a framework for computing the outage and ergodic capacities of non identical distributed MIMO links, study the effect of time synchronization error on system performance, analyze the end-to-end average bit error rate (ABER) performance under imperfect relaying, and study range extension and energy efficiency offered by the system when compared to a traditional system. / Ph. D.

In recent years, the subject of wide-area synchronized measurements has gained a significant amount of attention from the power system researchers. All of this started with the introduction of the Phasor Measurement Unit (PMU), which added a new perspective in the field of wide-area measurement systems (WAMS). With the ever evolving technologies over the years and the need for a more cost effective solution for synchronized frequency measurements, the Frequency Monitoring Network (FNET) was developed and introduced by the Power IT laboratory at Virginia Tech. The FNET is comprised of many Frequency Disturbance Recorders (FDR) geographically distributed throughout the United States. The FDR is a dedicated data acquisition device deployed at the distribution level, which allows for a lower cost and easily deployable WAMS solution. With Internet connectivity and GPS timing synchronization, the FDR provides high accuracy frequency, voltage magnitude and voltage angle data to the remote servers. Although the current FDR design is up to the standard in terms of the measurement accuracy and portability, it is of interest to further the research into alternative architectures and leverage the ever advancing technologies in high speed computing. One of the purposes of this dissertation is to present novel design options for a new generation of FDR hardware design. These design options will allow for more flexibility and to lower reliance on some vendor specific components. More importantly, the designs seek to allow for more computation processing capabilities so that more accurate frequency and angle measurements may be obtained. Besides the fact that the accuracy of frequency and angle measurement is highly dependent on the hardware and the algorithm, much can be said about the role of timing synchronization and its effects on accurate measurements. Most importantly, the accuracy of the frequency and angle estimation is highly dependent on the sampling time of local voltage angles. The challenges to accurate synchronized sampling are two folds. One challenge has to do with the inherent fallbacks of the GPS receiver, which is relatively high cost and limited in availability when the satellite signal is degraded. The other challenge is related to the timing inaccuracies of the sampling pulses, which is attributed to the remainder that results from the imperfect division of the processor counter. This dissertation addresses these issues by introducing the implementation of the high sensitivity (indoor) GPS and network timing synchronization, which aims to increase the availability of frequency measurements in locations that would not have been possible before. Furthermore, a high accuracy timing measurement system is introduced to characterize the accuracy and stability of the conventional crystal oscillator. To this end, a new method is introduced in close association with some prior work in generating accurate sampling time for FDR. Finally, a new method is introduced for modeling the FDR based on the sampling time measurements and some results are presented in order to motivate for more research in this area. / Ph. D.

No description available.

ITC/USA 2008 Conference Proceedings / The Forty-Fourth Annual International Telemetering Conference and Technical Exhibition / October 27-30, 2008 / Town and Country Resort & Convention Center, San Diego, California / Network-centric architectures continue to gain acceptance in data acquisition and telemetry systems. Though networks by nature impose non-deterministic transit time of data through a given link, the IEEE 1588 standard provides a means to remove this jitter by distributing time messages to the data acquisition units themselves. But like all standards, they evolve over time. The same is true with IEEE 1588, which is releasing its second version later this year. This paper discusses the challenges of the first version of the IEEE 1588 standard that Version 2 set out to address, potential challenges with Version 2, and interoperability issues that may arise when incorporating a mixture of Version 1 and Version 2 devices.

International Telemetering Conference Proceedings / October 23-26, 2000 / Town & Country Hotel and Conference Center, San Diego, California / A recurring problem in flight testing navigation systems is the need for an accurate, common time reference for the system under test and for the truth source to which it is compared. Lockheed Martin Aeronautics Company and Computer Sciences Corporation have developed software that utilizes all available timing information to reference the times of validity for each navigation measurement to Coordinated Universal Time. This permits accurate comparison and correlation of data necessary for statistical error analysis of the navigation system.

Today the area of high-cost and high-performance navigation for vehicles is a well-developed field. The challenge now is to develop high-performance navigation systems using low-cost sensortechnology. This development involves problems spanning from signal processing of the dirty measurements produced by low-costsensors via fusion and synchronization of information produced by a large set of diverse sensors, to reducing the size and energyconsumption of the systems. This thesis examines and proposessolutions to four of these problems. The first problem examined is the time synchronizing of the sensordata in a global positioning system aided inertial navigationsystem in which no hardware clock synchronization is possible. A poor time synchronization results in an increased mean squareerror of the navigation solution and expressions for calculating this mean square error are presented. A method to solve the timesynchronization issue in the data integration software is proposed. The potential of the method is illustrated with tests onreal-world data that are subjected to timing errors. The second problem examined is the achievable clocksynchronization accuracy in a sensor network employing a two-waymessage exchange model. The Cramer-Rao bound for the estimation of the clock parameters is derived and transformed in to a lower bound on the mean square error of the clock offset.Further, an approximate maximum likelihood estimator for the clockparameters is proposed. The estimator is shown to be of low complexity and to have a mean square error in the vicinity of the Cramer-Rao bound. The third problem examined is the detection of the time epochswhen zero-velocity updates can be applied in a foot-mountedpedestrian navigation system. Four general likelihood ratio testsfor detecting when the navigation system is stationary based onthe inertial measurement data are studied. The performance of thefour detectors is evaluated using levelled ground, forward-gaitdata. The results show that the signals from the gyroscopes holdthe most reliable information for the zero-velocity detection. The fourth problem examined is the calibration of a low-costinertial measurement unit. A calibration procedure that relaxesthe accuracy requirements of the orientation angles the inertialmeasurement unit must be placed in during the calibration isstudied. The proposed calibration method is compared with theCramer-Rao bound for the case when the inertial measurementunit is rotated into precisely controlled orientations. Simulationresults show that the mean square error of the estimated sensormodel parameters reaches the Cramer-Rao bound within fewdecibels. Thus, the proposed method may be acceptable for a widerange of low-cost applications. / QC 20100810

Context represents any knowledge obtained from Wireless Sensor Networks (WSNs) about the object being monitored (such as time and location of the sensed events). Time and location are important constituents of context as the information about the events sensed in WSNs is comprehensive when it includes spatio-temporal knowledge. In this thesis, we first concentrate on the development of a suite of lightweight algorithms on temporal event ordering and time synchronization as well as localization for WSNs. Then, we propose an energy-efficient clustering routing protocol for WSNs that is used for message delivery in the former algorithm. The two problems - temporal event ordering and synchronization - are dealt with together as both are concerned with preserving temporal relationships of events in WSNs. The messages needed for synchronization are piggybacked onto the messages exchanged in underlying algorithms. The synchronization algorithm is tailored to the clustered topology in order to reduce the overhead of keeping WSNs synchronized. The proposed localization algorithm has an objective of lowering the overhead of DV-hop based algorithms by reducing the number of floods in the initial position estimation phase. It also randomizes iterative refinement phase to overcome the synchronicity of DV-hop based algorithms. The position estimates with higher confidences are emphasized to reduce the impact of erroneous estimates on the neighbouring nodes. The proposed clustering routing protocol is used for message delivery in the proposed temporal algorithm. Nearest neighbour nodes are employed for inter-cluster communication. The algorithm provides Quality of Service by forwarding high priority messages via the paths with the least cost. The algorithm is also extended for multiple Sink scenario. The suite of algorithms proposed in this thesis provides the necessary tool for providing spatio-temporal context for context-aware WSNs. The algorithms are lightweight as they aim at satisfying WSN's requirements primarily in terms of energy-efficiency, low latency and fault tolerance. This makes them suitable for emergency response applications and ubiquitous computing.

Wireless sensor networks (WSNs) consist of a large number of sensor nodes, capable of on-board sensing and data processing, that are employed to observe some phenomenon of interest. With their desirable properties of flexible deployment, resistance to harsh environment and lower implementation cost, WSNs envisage a plethora of applications in diverse areas such as industrial process control, battle- field surveillance, health monitoring, and target localization and tracking. Much of the sensing and communication paradigm in WSNs involves ensuring power efficient transmission and finding scalable algorithms that can deliver the desired performance objectives while minimizing overall energy utilization. Since power is primarily consumed in radio transmissions delivering timing information, clock synchronization represents an indispensable requirement to boost network lifetime. This dissertation focuses on deriving efficient estimators and performance bounds for the clock parameters in a classical frequentist inference approach as well as in a Bayesian estimation framework. A unified approach to the maximum likelihood (ML) estimation of clock offset is presented for different network delay distributions. This constitutes an analytical alternative to prior works which rely on a graphical maximization of the likelihood function. In order to capture the imperfections in node oscillators, which may render a time-varying nature to the clock offset, a novel Bayesian approach to the clock offset estimation is proposed by using factor graphs. Message passing using the max-product algorithm yields an exact expression for the Bayesian inference problem. This extends the current literature to cases where the clock offset is not deterministic, but is in fact a random process. A natural extension of pairwise synchronization is to develop algorithms for the more challenging case of network-wide synchronization. Assuming exponentially distributed random delays, a network-wide clock synchronization algorithm is proposed using a factor graph representation of the network. Message passing using the max- product algorithm is adopted to derive the update rules for the proposed iterative procedure. A closed form solution is obtained for each node's belief about its clock offset at each iteration. Identifying the close connections between the problems of node localization and clock synchronization, we also address in this dissertation the problem of joint estimation of an unknown node's location and clock parameters by incorporating the effect of imperfections in node oscillators. In order to alleviate the computational complexity associated with the optimal maximum a-posteriori estimator, two iterative approaches are proposed as simpler alternatives. The first approach utilizes an Expectation-Maximization (EM) based algorithm which iteratively estimates the clock parameters and the location of the unknown node. The EM algorithm is further simplified by a non-linear processing of the data to obtain a closed form solution of the location estimation problem using the least squares (LS) approach. The performance of the estimation algorithms is benchmarked by deriving the Hybrid Cramer-Rao lower bound (HCRB) on the mean square error (MSE) of the estimators. We also derive theoretical lower bounds on the MSE of an estimator in a classical frequentist inference approach as well as in a Bayesian estimation framework when the likelihood function is an arbitrary member of the exponential family. The lower bounds not only serve to compare various estimators in our work, but can also be useful in their own right in parameter estimation theory.

Context represents any knowledge obtained from Wireless Sensor Networks (WSNs) about the object being monitored (such as time and location of the sensed events). Time and location are important constituents of context as the information about the events sensed in WSNs is comprehensive when it includes spatio-temporal knowledge. In this thesis, we first concentrate on the development of a suite of lightweight algorithms on temporal event ordering and time synchronization as well as localization for WSNs. Then, we propose an energy-efficient clustering routing protocol for WSNs that is used for message delivery in the former algorithm. The two problems - temporal event ordering and synchronization - are dealt with together as both are concerned with preserving temporal relationships of events in WSNs. The messages needed for synchronization are piggybacked onto the messages exchanged in underlying algorithms. The synchronization algorithm is tailored to the clustered topology in order to reduce the overhead of keeping WSNs synchronized. The proposed localization algorithm has an objective of lowering the overhead of DV-hop based algorithms by reducing the number of floods in the initial position estimation phase. It also randomizes iterative refinement phase to overcome the synchronicity of DV-hop based algorithms. The position estimates with higher confidences are emphasized to reduce the impact of erroneous estimates on the neighbouring nodes. The proposed clustering routing protocol is used for message delivery in the proposed temporal algorithm. Nearest neighbour nodes are employed for inter-cluster communication. The algorithm provides Quality of Service by forwarding high priority messages via the paths with the least cost. The algorithm is also extended for multiple Sink scenario. The suite of algorithms proposed in this thesis provides the necessary tool for providing spatio-temporal context for context-aware WSNs. The algorithms are lightweight as they aim at satisfying WSN's requirements primarily in terms of energy-efficiency, low latency and fault tolerance. This makes them suitable for emergency response applications and ubiquitous computing.