ASU Electronic Theses and Dissertations
This collection includes most of the ASU Theses and Dissertations from 2011 to present. ASU Theses and Dissertations are available in downloadable PDF format; however, a small percentage of items are under embargo. Information about the dissertations/theses includes degree information, committee members, an abstract, supporting data or media.
In addition to the electronic theses found in the ASU Digital Repository, ASU Theses and Dissertations can be found in the ASU Library Catalog.
Dissertations and Theses granted by Arizona State University are archived and made available through a joint effort of the ASU Graduate College and the ASU Libraries. For more information or questions about this collection contact or visit the Digital Repository ETD Library Guide or contact the ASU Graduate College at gradformat@asu.edu.
Displaying 1 - 10 of 85
Description
Practical communication systems are subject to errors due to imperfect time alignment among the communicating nodes. Timing errors can occur in different forms depending on the underlying communication scenario. This doctoral study considers two different classes of asynchronous systems; point-to-point (P2P) communication systems with synchronization errors, and asynchronous cooperative systems. In particular, the focus is on an information theoretic analysis for P2P systems with synchronization errors and developing new signaling solutions for several asynchronous cooperative communication systems. The first part of the dissertation presents several bounds on the capacity of the P2P systems with synchronization errors. First, binary insertion and deletion channels are considered where lower bounds on the mutual information between the input and output sequences are computed for independent uniformly distributed (i.u.d.) inputs. Then, a channel suffering from both synchronization errors and additive noise is considered as a serial concatenation of a synchronization error-only channel and an additive noise channel. It is proved that the capacity of the original channel is lower bounded in terms of the synchronization error-only channel capacity and the parameters of both channels. On a different front, to better characterize the deletion channel capacity, the capacity of three independent deletion channels with different deletion probabilities are related through an inequality resulting in the tightest upper bound on the deletion channel capacity for deletion probabilities larger than 0.65. Furthermore, the first non-trivial upper bound on the 2K-ary input deletion channel capacity is provided by relating the 2K-ary input deletion channel capacity with the binary deletion channel capacity through an inequality. The second part of the dissertation develops two new relaying schemes to alleviate asynchronism issues in cooperative communications. The first one is a single carrier (SC)-based scheme providing a spectrally efficient Alamouti code structure at the receiver under flat fading channel conditions by reducing the overhead needed to overcome the asynchronism and obtain spatial diversity. The second one is an orthogonal frequency division multiplexing (OFDM)-based approach useful for asynchronous cooperative systems experiencing excessive relative delays among the relays under frequency-selective channel conditions to achieve a delay diversity structure at the receiver and extract spatial diversity.
ContributorsRahmati, Mojtaba (Author) / Duman, Tolga M. (Thesis advisor) / Zhang, Junshan (Committee member) / Tepedelenlioğlu, Cihan (Committee member) / Reisslein, Martin (Committee member) / Arizona State University (Publisher)
Created2013
Description
The rapid advancement of wireless technology has instigated the broad deployment of wireless networks. Different types of networks have been developed, including wireless sensor networks, mobile ad hoc networks, wireless local area networks, and cellular networks. These networks have different structures and applications, and require different control algorithms. The focus of this thesis is to design scheduling and power control algorithms in wireless networks, and analyze their performances. In this thesis, we first study the multicast capacity of wireless ad hoc networks. Gupta and Kumar studied the scaling law of the unicast capacity of wireless ad hoc networks. They derived the order of the unicast throughput, as the number of nodes in the network goes to infinity. In our work, we characterize the scaling of the multicast capacity of large-scale MANETs under a delay constraint D. We first derive an upper bound on the multicast throughput, and then propose a lower bound on the multicast capacity by proposing a joint coding-scheduling algorithm that achieves a throughput within logarithmic factor of the upper bound. We then study the power control problem in ad-hoc wireless networks. We propose a distributed power control algorithm based on the Gibbs sampler, and prove that the algorithm is throughput optimal. Finally, we consider the scheduling algorithm in collocated wireless networks with flow-level dynamics. Specifically, we study the delay performance of workload-based scheduling algorithm with SRPT as a tie-breaking rule. We demonstrate the superior flow-level delay performance of the proposed algorithm using simulations.
ContributorsZhou, Shan (Author) / Ying, Lei (Thesis advisor) / Zhang, Yanchao (Committee member) / Zhang, Junshan (Committee member) / Xue, Guoliang (Committee member) / Arizona State University (Publisher)
Created2013
Description
Autonomous vehicle control systems utilize real-time kinematic Global Navigation Satellite Systems (GNSS) receivers to provide a position within two-centimeter of truth. GNSS receivers utilize the satellite signal time of arrival estimates to solve for position; and multipath corrupts the time of arrival estimates with a time-varying bias. Time of arrival estimates are based upon accurate direct sequence spread spectrum (DSSS) code and carrier phase tracking. Current multipath mitigating GNSS solutions include fixed radiation pattern antennas and windowed delay-lock loop code phase discriminators. A new multipath mitigating code tracking algorithm is introduced that utilizes a non-symmetric correlation kernel to reject multipath. Independent parameters provide a means to trade-off code tracking discriminant gain against multipath mitigation performance. The algorithm performance is characterized in terms of multipath phase error bias, phase error estimation variance, tracking range, tracking ambiguity and implementation complexity. The algorithm is suitable for modernized GNSS signals including Binary Phase Shift Keyed (BPSK) and a variety of Binary Offset Keyed (BOC) signals. The algorithm compensates for unbalanced code sequences to ensure a code tracking bias does not result from the use of asymmetric correlation kernels. The algorithm does not require explicit knowledge of the propagation channel model. Design recommendations for selecting the algorithm parameters to mitigate precorrelation filter distortion are also provided.
ContributorsMiller, Steven (Author) / Spanias, Andreas (Thesis advisor) / Tepedelenlioğlu, Cihan (Committee member) / Tsakalis, Konstantinos (Committee member) / Zhang, Junshan (Committee member) / Arizona State University (Publisher)
Created2013
Description
In October, 2009, participants of the Arizona Special Supplemental Nutrition Program for Women, Infants and Children (WIC) began receiving monthly Cash Value Vouchers (CVV) worth between six and 10 dollars towards the purchase of fresh fruits and vegetables. Data from the Arizona Department of Health Services (ADHS) showed CVV redemption rates in the first two years of the program were lower than the national average of 77% redemption. In response, the ADHS WIC Food List was expanded to also include canned and frozen fruits and vegetables. More recent data from ADHS suggest that redemption rates are improving, but variably exist among different WIC sub-populations. The purpose of this project was to identify themes related to the ease or difficulty of WIC CVV use amongst different categories of low-redeeming WIC participants. A total of 8 focus groups were conducted, four at a clinic in each of two Valley cities: Surprise and Mesa. Each of the four focus groups comprised one of four targeted WIC participant categories: pregnant, postpartum, breastfeeding, and children with participation ranging from 3-9 participants per group. Using the general inductive approach, recordings of the focus groups were transcribed, hand-coded and uploaded into qualitative analysis software resulting in four emergent themes including: interactions and shopping strategies, maximizing WIC value, redemption issues, and effect of rule change. Researchers identified twelve different subthemes related to the emergent theme of interactions and strategies to improve their experience, including economic considerations during redemption. Barriers related to interactions existed that made their purchase difficult, most notably anger from the cashier and other shoppers. However, participants made use of a number of strategies to facilitate WIC purchases or extract more value out of WIC benefits, such as pooling their CVV. Finally, it appears that the fruit and vegetable rule change was well received by those who were aware of the change. These data suggest a number of important avenues for future research, including verifying these themes are important within a larger, representative sample of Arizona WIC participants, and exploring strategies to minimize barriers identified by participants, such as use of electronic benefits transfer-style cards (EBT).
ContributorsBertmann, Farryl M. W (Author) / Wharton, Christopher (Christopher Mack), 1977- (Thesis advisor) / Ohri-Vachaspati, Punam (Committee member) / Johnston, Carol (Committee member) / Hampl, Jeffrey (Committee member) / Dixit-Joshi, Sujata (Committee member) / Barroso, Cristina (Committee member) / Arizona State University (Publisher)
Created2013
Description
The rapid advances in wireless communications and networking have given rise to a number of emerging heterogeneous wireless and mobile networks along with novel networking paradigms, including wireless sensor networks, mobile crowdsourcing, and mobile social networking. While offering promising solutions to a wide range of new applications, their widespread adoption and large-scale deployment are often hindered by people's concerns about the security, user privacy, or both. In this dissertation, we aim to address a number of challenging security and privacy issues in heterogeneous wireless and mobile networks in an attempt to foster their widespread adoption. Our contributions are mainly fivefold. First, we introduce a novel secure and loss-resilient code dissemination scheme for wireless sensor networks deployed in hostile and harsh environments. Second, we devise a novel scheme to enable mobile users to detect any inauthentic or unsound location-based top-k query result returned by an untrusted location-based service providers. Third, we develop a novel verifiable privacy-preserving aggregation scheme for people-centric mobile sensing systems. Fourth, we present a suite of privacy-preserving profile matching protocols for proximity-based mobile social networking, which can support a wide range of matching metrics with different privacy levels. Last, we present a secure combination scheme for crowdsourcing-based cooperative spectrum sensing systems that can enable robust primary user detection even when malicious cognitive radio users constitute the majority.
ContributorsZhang, Rui (Author) / Zhang, Yanchao (Thesis advisor) / Duman, Tolga Mete (Committee member) / Xue, Guoliang (Committee member) / Zhang, Junshan (Committee member) / Arizona State University (Publisher)
Created2013
Description
Electrical neural activity detection and tracking have many applications in medical research and brain computer interface technologies. In this thesis, we focus on the development of advanced signal processing algorithms to track neural activity and on the mapping of these algorithms onto hardware to enable real-time tracking. At the heart of these algorithms is particle filtering (PF), a sequential Monte Carlo technique used to estimate the unknown parameters of dynamic systems. First, we analyze the bottlenecks in existing PF algorithms, and we propose a new parallel PF (PPF) algorithm based on the independent Metropolis-Hastings (IMH) algorithm. We show that the proposed PPF-IMH algorithm improves the root mean-squared error (RMSE) estimation performance, and we demonstrate that a parallel implementation of the algorithm results in significant reduction in inter-processor communication. We apply our implementation on a Xilinx Virtex-5 field programmable gate array (FPGA) platform to demonstrate that, for a one-dimensional problem, the PPF-IMH architecture with four processing elements and 1,000 particles can process input samples at 170 kHz by using less than 5% FPGA resources. We also apply the proposed PPF-IMH to waveform-agile sensing to achieve real-time tracking of dynamic targets with high RMSE tracking performance. We next integrate the PPF-IMH algorithm to track the dynamic parameters in neural sensing when the number of neural dipole sources is known. We analyze the computational complexity of a PF based method and propose the use of multiple particle filtering (MPF) to reduce the complexity. We demonstrate the improved performance of MPF using numerical simulations with both synthetic and real data. We also propose an FPGA implementation of the MPF algorithm and show that the implementation supports real-time tracking. For the more realistic scenario of automatically estimating an unknown number of time-varying neural dipole sources, we propose a new approach based on the probability hypothesis density filtering (PHDF) algorithm. The PHDF is implemented using particle filtering (PF-PHDF), and it is applied in a closed-loop to first estimate the number of dipole sources and then their corresponding amplitude, location and orientation parameters. We demonstrate the improved tracking performance of the proposed PF-PHDF algorithm and map it onto a Xilinx Virtex-5 FPGA platform to show its real-time implementation potential. Finally, we propose the use of sensor scheduling and compressive sensing techniques to reduce the number of active sensors, and thus overall power consumption, of electroencephalography (EEG) systems. We propose an efficient sensor scheduling algorithm which adaptively configures EEG sensors at each measurement time interval to reduce the number of sensors needed for accurate tracking. We combine the sensor scheduling method with PF-PHDF and implement the system on an FPGA platform to achieve real-time tracking. We also investigate the sparsity of EEG signals and integrate compressive sensing with PF to estimate neural activity. Simulation results show that both sensor scheduling and compressive sensing based methods achieve comparable tracking performance with significantly reduced number of sensors.
ContributorsMiao, Lifeng (Author) / Chakrabarti, Chaitali (Thesis advisor) / Papandreou-Suppappola, Antonia (Thesis advisor) / Zhang, Junshan (Committee member) / Bliss, Daniel (Committee member) / Kovvali, Narayan (Committee member) / Arizona State University (Publisher)
Created2013
Description
There are several visual dimensions of food that can affect food intake, example portion size, color, and variety. This dissertation elucidates the effect of number of pieces of food on preference and amount of food consumed in humans and motivation for food in animals. Chapter 2 Experiment 1 showed that rats preferred and also ran faster for multiple pieces (30, 10 mg pellets) than an equicaloric, single piece of food (300 mg) showing that multiple pieces of food are more rewarding than a single piece. Chapter 2 Experiment 2 showed that rats preferred a 30-pellet food portion clustered together rather than scattered. Preference and motivation for clustered food pieces may be interpreted based on the optimal foraging theory that animals prefer foods that can maximize energy gain and minimize the risk of predation. Chapter 3 Experiment 1 showed that college students preferred and ate less of a multiple-piece than a single-piece portion and also ate less in a test meal following the multiple-piece than single-piece portion. Chapter 3 Experiment 2 replicated the results in Experiment 1 and used a bagel instead of chicken. Chapter 4 showed that college students given a five-piece chicken portion scattered on a plate ate less in a meal and in a subsequent test meal than those given the same portion clustered together. This is consistent with the hypothesis that multiple pieces of food may appear like more food because they take up a larger surface area than a single-piece portion. All together, these studies show that number and surface area occupied by food pieces are important visual cues determining food choice in animals and both food choice and intake in humans.
ContributorsBajaj, Devina (Author) / Phillips, Elizabeth D. (Thesis advisor) / Cohen, Adam (Committee member) / Johnston, Carol (Committee member) / Bimonte-Nelson, Heather A. (Committee member) / Arizona State University (Publisher)
Created2013
Description
Health knowledge alone does not appear to lead to sustained healthy behavior, suggesting the need for alternative methods for improving diet. Recent research shows a possible role of moral contexts of food production on diet related behaviors; however no studies have been conducted to specifically explore the relationship between moral constructs and food consumption. This study examined the relationship between fast food consumption and two measures of morality, Moral Foundations Questionnaire (MFQ), specifically harm/care and purity/sanctity foundations, and the Ethical Concern in food choice (EC) questionnaire, which includes animal welfare, environment protection, political values, and religion subscales. The study also examined the association between the measures of morality. 739 participants, primarily female (71.4%) and non-Hispanic Whites (76.5%), completed an online survey that included the MFQ, the EC questionnaire, and a brief fast food screener. Participant's morality scores in relation to their fast food consumption were examined first using bivariate ANOVA analysis and then using logistic regression to control for covariates. The MFQ foundations were compared with the EC subscales using Pearson correlation coefficient. Significant bivariate relationships were seen between fast food consumption and the MFQ's purity/sanctity foundation and EC's religion subscales (p<0.05). However these significant bivariate relationships did not hold after controlling for gender, race, university education, and religion in the logistic regression analysis. The foundations of the MFQ were positively correlated with the subscales for the EC questionnaire (r values ranging from .233-.613 (p<0.01). MFQ's purity/sanctity foundation and EC's religion subscale were the two most highly correlated (r=.613, p<0.01) showing that moral intuitions may be associated with eating decision making. The study did not find significant associations between MFQ or EC scores and fast food consumption.
ContributorsMartinelli, Sarah (Author) / Ohri-Vachaspati, Punam (Thesis advisor) / Hekler, Eric B. (Committee member) / Wharton, Christopher (Christopher Mack), 1977- (Committee member) / Johnston, Carol (Committee member) / Arizona State University (Publisher)
Created2013
Description
Background: Previous research suggests a healthy eater schema (i.e., identifying yourself as a healthy eater) may be a useful concept to target in interventions. A "stealth" intervention that discussed the moral issues related to food worked better at promoting healthful eating than an intervention focused on the health benefits. No research has explored the relationship between moral foundations, a theoretical model focused on delineating core "foundations" for making a moral decision, and healthy eater self-identity or self-efficacy. Purpose: We explored the relationship between moral foundations (i.e., harm/care, fairness/reciprocity, in-group/loyalty, authority/respect, & purity/sanctity) and health eater self-identity and fruit and vegetable self-efficacy (FVSE). Methods: 542 participants completed an online cross-sectional survey, which included moral foundations (i.e., MFQ), political views, healthy eater self-identity (i.e., HESS), and FVSE measures. Logistic regression was used to assess the relationship between moral foundations between healthy eater self-identity after controlling for age, gender, major, BMI, and political beliefs. OLS regression was used to explore the relationship between self-efficacy and the moral foundations after controlling for the covariates. Results: 75.6% of the sample were college students, with a mean age of 25.27 (SD=8.61). 25.1% of students were nutrition majors. Harm/care, authority/respect, and ingroup/loyalty were significantly associated with healthy eater schema, (i.e., OR=1.7, p<.001, OR=1.5, p=.009, and OR=1.4, p=.027, respectively). Ingroup/loyalty, authority/respect, and purity/sanctity were related to FVSE (p=.006, p=.002, p=.04, respectively). Conclusion: Among college students, harm/care and authority/respect were associated with a healthy eater schema. Future research should explore possible uses of these moral foundations in interventions (e.g., a plant-based diet based on reduced harm to animals or eating fewer processed views based on "traditional" values).
ContributorsKiser, Sarah (Author) / Hekler, Eric B. (Thesis advisor) / Ohri-Vachaspati, Punam (Committee member) / Wharton, Christopher (Christopher Mack), 1977- (Committee member) / Johnston, Carol (Committee member) / Arizona State University (Publisher)
Created2013
Description
Asymptotic comparisons of ergodic channel capacity at high and low signal-to-noise ratios (SNRs) are provided for several adaptive transmission schemes over fading channels with general distributions, including optimal power and rate adaptation, rate adaptation only, channel inversion and its variants. Analysis of the high-SNR pre-log constants of the ergodic capacity reveals the existence of constant capacity difference gaps among the schemes with a pre-log constant of 1. Closed-form expressions for these high-SNR capacity difference gaps are derived, which are proportional to the SNR loss between these schemes in dB scale. The largest one of these gaps is found to be between the optimal power and rate adaptation scheme and the channel inversion scheme. Based on these expressions it is shown that the presence of space diversity or multi-user diversity makes channel inversion arbitrarily close to achieving optimal capacity at high SNR with sufficiently large number of antennas or users. A low-SNR analysis also reveals that the presence of fading provably always improves capacity at sufficiently low SNR, compared to the additive white Gaussian noise (AWGN) case. Numerical results are shown to corroborate our analytical results. This dissertation derives high-SNR asymptotic average error rates over fading channels by relating them to the outage probability, under mild assumptions. The analysis is based on the Tauberian theorem for Laplace-Stieltjes transforms which is grounded on the notion of regular variation, and applies to a wider range of channel distributions than existing approaches. The theory of regular variation is argued to be the proper mathematical framework for finding sufficient and necessary conditions for outage events to dominate high-SNR error rate performance. It is proved that the diversity order being d and the cumulative distribution function (CDF) of the channel power gain having variation exponent d at 0 imply each other, provided that the instantaneous error rate is upper-bounded by an exponential function of the instantaneous SNR. High-SNR asymptotic average error rates are derived for specific instantaneous error rates. Compared to existing approaches in the literature, the asymptotic expressions are related to the channel distribution in a much simpler manner herein, and related with outage more intuitively. The high-SNR asymptotic error rate is also characterized under diversity combining schemes with the channel power gain of each branch having a regularly varying CDF. Numerical results are shown to corroborate our theoretical analysis. This dissertation studies several problems concerning channel inclusion, which is a partial ordering between discrete memoryless channels (DMCs) proposed by Shannon. Specifically, majorization-based conditions are derived for channel inclusion between certain DMCs. Furthermore, under general conditions, channel equivalence defined through Shannon ordering is shown to be the same as permutation of input and output symbols. The determination of channel inclusion is considered as a convex optimization problem, and the sparsity of the weights related to the representation of the worse DMC in terms of the better one is revealed when channel inclusion holds between two DMCs. For the exploitation of this sparsity, an effective iterative algorithm is established based on modifying the orthogonal matching pursuit algorithm. The extension of channel inclusion to continuous channels and its application in ordering phase noises are briefly addressed.
ContributorsZhang, Yuan (Author) / Tepedelenlioğlu, Cihan (Thesis advisor) / Zhang, Junshan (Committee member) / Reisslein, Martin (Committee member) / Spanias, Andreas (Committee member) / Arizona State University (Publisher)
Created2013