4 research outputs found

    An Exploratory Analysis Of A Time Synchronization Protocol For UAS

    Get PDF
    This dissertation provides a numerical analysis of a Receiver Only Synchronization (ROS) protocol which is proposed for use by Unmanned Aircraft Systems (UAS) in Beyond Visual Line of Sight (BVLOS) operations. The use of ROS protocols could reinforce current technologies that enable transmission over 5G cell networks, decreasing latency issues and enabling the incorporation of an increased number of UAS to the network, without loss of accuracy. A minimum squared error (MSE)-based accuracy of clock offset and clock skew estimations was obtained using the number of iterations and number of observations as independent parameters. Although the model converged after only four iterations, the number of observations needed was considerably large, of no less than about 250. The noise, introduced in the system through the first residual, the correlation parameter and the disturbance terms, was assumed to be autocorrelated. Previous studies suggested that correlated noise might be typical in multipath scenarios, or in case of damaged antennas. Four noise distributions: gaussian, exponential, gamma and Weibull were considered. Each of them is adapted to different noise sources in the OSI model. Dispersion of results in the first case, the only case with zero mean, was checked against the Cramér-Rao Bound (CRB) limit. Results confirmed that the scheme proposed was fully efficient. Moreover, results with the other three cases were less promising, thus demonstrating that only zero mean distributions could deliver good results. This fact would limit the proposed scheme application in multipath scenarios, where echoes of previous signals may reach the receiver at delayed times. In the second part, a wake/sleep scheme was imposed on the model, concluding that for wake/sleep ratios below 92/08 results were not accurate at p=.05 level. The study also evaluated the impact of noise levels in the time domain and showed that above -2dB in time a substantial contribution of error terms disturbed the initial estimations significantly. The tests were performed in Matlab®. Based on the results, three venues confirming the assumptions made were proposed for future work. Some final reflections on the use of 5G in aviation brought the present dissertation to a close

    Timing Synchronization and Node Localization in Wireless Sensor Networks: Efficient Estimation Approaches and Performance Bounds

    Get PDF
    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
    corecore