Localization in wireless sensor networks

154319-Thumbnail Image.png
Description
In many applications, measured sensor data is meaningful only when the location of sensors is accurately known. Therefore, the localization accuracy is crucial. In this dissertation, both location estimation and location detection problems are considered.

In location estimation problems, sensor

In many applications, measured sensor data is meaningful only when the location of sensors is accurately known. Therefore, the localization accuracy is crucial. In this dissertation, both location estimation and location detection problems are considered.

In location estimation problems, sensor nodes at known locations, called anchors, transmit signals to sensor nodes at unknown locations, called nodes, and use these transmissions to estimate the location of the nodes. Specifically, the location estimation in the presence of fading channels using time of arrival (TOA) measurements with narrowband communication signals is considered. Meanwhile, the Cramer-Rao lower bound (CRLB) for localization error under different assumptions is derived. Also, maximum likelihood estimators (MLEs) under these assumptions are derived.

In large WSNs, distributed location estimation algorithms are more efficient than centralized algorithms. A sequential localization scheme, which is one of distributed location estimation algorithms, is considered. Also, different localization methods, such as TOA, received signal strength (RSS), time difference of arrival (TDOA), direction of arrival (DOA), and large aperture array (LAA) are compared under different signal-to-noise ratio (SNR) conditions. Simulation results show that DOA is the preferred scheme at the low SNR regime and the LAA localization algorithm provides better performance for network discovery at high SNRs. Meanwhile, the CRLB for the localization error using the TOA method is also derived.

A distributed location detection scheme, which allows each anchor to make a decision as to whether a node is active or not is proposed. Once an anchor makes a decision, a bit is transmitted to a fusion center (FC). The fusion center combines all the decisions and uses a design parameter $K$ to make the final decision. Three scenarios are considered in this dissertation. Firstly, location detection at a known location is considered. Secondly, detecting a node in a known region is considered. Thirdly, location detection in the presence of fading is considered. The optimal thresholds are derived and the total probability of false alarm and detection under different scenarios are derived.
Date Created
2016
Agent

The incremental effects of ethnically matching animated agents in restructuring the irrational career beliefs of Chinese American young women

151829-Thumbnail Image.png
Description
Believe It! is an animated interactive computer program that delivers cognitive restructuring to adolescent females' irrational career beliefs. It challenges the irrational belief and offers more reasonable alternatives. The current study investigated the potentially differential effects of Asian versus Caucasian

Believe It! is an animated interactive computer program that delivers cognitive restructuring to adolescent females' irrational career beliefs. It challenges the irrational belief and offers more reasonable alternatives. The current study investigated the potentially differential effects of Asian versus Caucasian animated agents in delivering the treatment to young Chinese American women. The results suggested that the Asian animated agent was not significantly superior to the Caucasian animated agent. Nor was there a significant interaction between level of acculturation and the effects of the animated agents. Ways to modify the Believe It! program for Chinese American users were recommended.
Date Created
2013
Agent