Matching Items (6)
Filtering by

Clear all filters

153915-Thumbnail Image.png
Description
Modern measurement schemes for linear dynamical systems are typically designed so that different sensors can be scheduled to be used at each time step. To determine which sensors to use, various metrics have been suggested. One possible such metric is the observability of the system. Observability is a binary condition

Modern measurement schemes for linear dynamical systems are typically designed so that different sensors can be scheduled to be used at each time step. To determine which sensors to use, various metrics have been suggested. One possible such metric is the observability of the system. Observability is a binary condition determining whether a finite number of measurements suffice to recover the initial state. However to employ observability for sensor scheduling, the binary definition needs to be expanded so that one can measure how observable a system is with a particular measurement scheme, i.e. one needs a metric of observability. Most methods utilizing an observability metric are about sensor selection and not for sensor scheduling. In this dissertation we present a new approach to utilize the observability for sensor scheduling by employing the condition number of the observability matrix as the metric and using column subset selection to create an algorithm to choose which sensors to use at each time step. To this end we use a rank revealing QR factorization algorithm to select sensors. Several numerical experiments are used to demonstrate the performance of the proposed scheme.
ContributorsIlkturk, Utku (Author) / Gelb, Anne (Thesis advisor) / Platte, Rodrigo (Thesis advisor) / Cochran, Douglas (Committee member) / Renaut, Rosemary (Committee member) / Armbruster, Dieter (Committee member) / Arizona State University (Publisher)
Created2015
155969-Thumbnail Image.png
Description
Scattering from random rough surface has been of interest for decades. Several

methods were proposed to solve this problem, and Kirchho approximation (KA)

and small perturbation method (SMP) are among the most popular. Both methods

provide accurate results on rst order scattering, and the range of validity is limited

and cross-polarization scattering coecient is

Scattering from random rough surface has been of interest for decades. Several

methods were proposed to solve this problem, and Kirchho approximation (KA)

and small perturbation method (SMP) are among the most popular. Both methods

provide accurate results on rst order scattering, and the range of validity is limited

and cross-polarization scattering coecient is zero for these two methods unless these

two methods are carried out for higher orders. Furthermore, it is complicated for

higher order formulation and multiple scattering and shadowing are neglected in these

classic methods.

Extension of these two methods has been made in order to x these problems.

However, it is usually complicated and problem specic. While small slope approximation

is one of the most widely used methods to bridge KA and SMP, it is not easy

to implement in a general form. Two scale model can be employed to solve scattering

problems for a tilted perturbation plane, the range of validity is limited.

A new model is proposed in this thesis to deal with cross-polarization scattering

phenomenon on perfect electric conducting random surfaces. Integral equation

is adopted in this model. While integral equation method is often combined with

numerical method to solve the scattering coecient, the proposed model solves the

integral equation iteratively by analytic approximation. We utilize some approximations

on the randomness of the surface, and obtain an explicit expression. It is shown

that this expression achieves agreement with SMP method in second order.
ContributorsCao, Jiahao (Author) / Pan, George (Thesis advisor) / Balanis, Constantine A (Committee member) / Cochran, Douglas (Committee member) / Arizona State University (Publisher)
Created2017
136913-Thumbnail Image.png
Description
In recent years, networked systems have become prevalent in communications, computing, sensing, and many other areas. In a network composed of spatially distributed agents, network-wide synchronization of information about the physical environment and the network configuration must be maintained using measurements collected locally by the agents. Registration is a process

In recent years, networked systems have become prevalent in communications, computing, sensing, and many other areas. In a network composed of spatially distributed agents, network-wide synchronization of information about the physical environment and the network configuration must be maintained using measurements collected locally by the agents. Registration is a process for connecting the coordinate frames of multiple sets of data. This poses numerous challenges, particularly due to availability of direct communication only between neighboring agents in the network. These are exacerbated by uncertainty in the measurements and also by imperfect communication links. This research explored statistically based registration in a sensor network. The approach developed exploits measurements of offsets formed as differences of state values between pairs of agents that share a link in the network graph. It takes into account that the true offsets around any closed cycle in the network graph must sum to zero.
ContributorsPhuong, Shih-Ling (Author) / Cochran, Douglas (Thesis director) / Berman, Spring (Committee member) / Barrett, The Honors College (Contributor) / Mechanical and Aerospace Engineering Program (Contributor)
Created2014-05
155888-Thumbnail Image.png
Description
There is an ever-growing need for broadband conformal antennas to not only reduce the number of antennas utilized to cover a broad range of frequencies (VHF-UHF) but also to reduce visual and RF signatures associated with communication systems. In many applications antennas needs to be very close to low-impedance mediums

There is an ever-growing need for broadband conformal antennas to not only reduce the number of antennas utilized to cover a broad range of frequencies (VHF-UHF) but also to reduce visual and RF signatures associated with communication systems. In many applications antennas needs to be very close to low-impedance mediums or embedded inside low-impedance mediums. However, for conventional metal and dielectric antennas to operate efficiently in such environments either a very narrow bandwidth must be tolerated, or enough loss added to expand the bandwidth, or they must be placed one quarter of a wavelength above the conducting surface. The latter is not always possible since in the HF through low UHF bands, critical to Military and Security functions, this quarter-wavelength requirement would result in impractically large antennas.

Despite an error based on a false assumption in the 1950’s, which had severely underestimated the efficiency of magneto-dielectric antennas, recently demonstrated magnetic-antennas have been shown to exhibit extraordinary efficiency in conformal applications. Whereas conventional metal-and-dielectric antennas carrying radiating electric currents suffer a significant disadvantage when placed conformal to the conducting surface of a platform, because they induce opposing image currents in the surface, magnetic-antennas carrying magnetic radiating currents have no such limitation. Their magnetic currents produce co-linear image currents in electrically conducting surfaces.

However, the permeable antennas built to date have not yet attained the wide bandwidth expected because the magnetic-flux-channels carrying the wave have not been designed to guide the wave near the speed of light at all frequencies. Instead, they tend to lose the wave by a leaky fast-wave mechanism at low frequencies or they over-bind a slow-wave at high frequencies. In this dissertation, we have studied magnetic antennas in detail and presented the design approach and apparatus required to implement a flux-channel carrying the magnetic current wave near the speed of light over a very broad frequency range which also makes the design of a frequency independent antenna (spiral) possible. We will learn how to construct extremely thin conformal antennas, frequency-independent permeable antennas, and even micron-sized antennas that can be embedded inside the brain without damaging the tissue.
ContributorsYousefi, Tara (Author) / Diaz, Rodolfo E (Thesis advisor) / Cochran, Douglas (Committee member) / Goodnick, Stephen (Committee member) / Pan, George (Committee member) / Arizona State University (Publisher)
Created2017
155818-Thumbnail Image.png
Description
Electric field imaging allows for a low cost, compact, non-invasive, non-ionizing alternative to other methods of imaging. It has many promising industrial applications including security, safely imaging power lines at construction sites, finding sources of electromagnetic interference, geo-prospecting, and medical imaging. The work presented in this dissertation concerns

Electric field imaging allows for a low cost, compact, non-invasive, non-ionizing alternative to other methods of imaging. It has many promising industrial applications including security, safely imaging power lines at construction sites, finding sources of electromagnetic interference, geo-prospecting, and medical imaging. The work presented in this dissertation concerns low frequency electric field imaging: the physics, hardware, and various methods of achieving it.

Electric fields have historically been notoriously difficult to work with due to how intrinsically noisy the data is in electric field sensors. As a first contribution, an in-depth study demonstrates just how prevalent electric field noise is. In field tests, various cables were placed underneath power lines. Despite being shielded, the 60 Hz power line signal readily penetrated several types of cables.

The challenges of high noise levels were largely addressed by connecting the output of an electric field sensor to a lock-in amplifier. Using the more accurate means of collecting electric field data, D-dot sensors were arrayed in a compact grid to resolve electric field images as a second contribution. This imager has successfully captured electric field images of live concealed wires and electromagnetic interference.

An active method was developed as a third contribution. In this method, distortions created by objects when placed in a known electric field are read. This expands the domain of what can be imaged because the object does not need to be a time-varying electric field source. Images of dielectrics (e.g. bodies of water) and DC wires were captured using this new method.

The final contribution uses a collection of one-dimensional electric field images, i.e. projections, to reconstruct a two-dimensional image. This was achieved using algorithms based in computed tomography such as filtered backprojection. An algebraic approach was also used to enforce sparsity regularization with the L1 norm, further improving the quality of some images.
ContributorsChung, Hugh Emanuel (Author) / Allee, David R. (Thesis advisor) / Cochran, Douglas (Committee member) / Aberle, James T (Committee member) / Phillips, Stephen M (Committee member) / Arizona State University (Publisher)
Created2017
135725-Thumbnail Image.png
Description
A distributed sensor network (DSN) is a set of spatially scattered intelligent sensors designed to obtain data across an environment. DSNs are becoming a standard architecture for collecting data over a large area. We need registration of nodal data across the network in order to properly exploit having multiple sensors.

A distributed sensor network (DSN) is a set of spatially scattered intelligent sensors designed to obtain data across an environment. DSNs are becoming a standard architecture for collecting data over a large area. We need registration of nodal data across the network in order to properly exploit having multiple sensors. One major problem worth investigating is ensuring the integrity of the data received, such as time synchronization. Consider a group of match filter sensors. Each sensor is collecting the same data, and comparing the data collected to a known signal. In an ideal world, each sensor would be able to collect the data without offsets or noise in the system. Two models can be followed from this. First, each sensor could make a decision on its own, and then the decisions could be collected at a ``fusion center'' which could then decide if the signal is present or not. The fusion center can then decide if the signal is present or not based on the number true-or-false decisions that each sensor has made. Alternatively, each sensor could relay the data that it collects to the fusion center, and it could then make a decision based on all of the data that it then receives. Since the fusion center would have more information to base its decision on in the latter case--as opposed to the former case where it only receives a true or false from each sensor--one would expect the latter model to perform better. In fact, this would be the gold standard for detection across a DSN. However, there is random noise in the world that causes corruption of data collection, especially among sensors in a DSN. Each sensor does not collect the data in the exact same way or with the same precision. We classify these imperfections in data collections as offsets, specifically the offset present in the data collected by one sensor with respect to the rest of the sensors in the network. Therefore, reconsider the two models for a DSN described above. We can naively implement either of these models for data collection. Alternatively, we can attempt to estimate the offsets between the sensors and compensate. One could see how it would be expected that estimating the offsets within the DSN would provide better overall results than not finding estimators. This thesis will be structured as follows. First, there will be an extensive investigation into detection theory and the impact that different types of offsets have on sensor networks. Following the theory, an algorithm for estimating the data offsets will be proposed correct for the offsets. Next, we will look at Monte Carlo simulation results to see the impact on sensor performance of data offsets in comparison to a sensor network without offsets present. The algorithm is then implemented, and further experiments will demonstrate sensor performance with offset detection.
ContributorsMonardo, Vincent James (Author) / Cochran, Douglas (Thesis director) / Kierstead, Hal (Committee member) / Electrical Engineering Program (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2016-05