國立高雄大學圖資館 |

Language: English

Back

Distributed Estimation, Coding, and ...

University of Rochester.

Distributed Estimation, Coding, and Scheduling in Wireless Visual Sensor Networks.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Distributed Estimation, Coding, and Scheduling in Wireless Visual Sensor Networks.
Author:	Yu, Chao.
Description:	159 p.
Notes:	Source: Dissertation Abstracts International, Volume: 75-02(E), Section: B.
Notes:	Adviser: Gaurav Sharma.
Contained By:	Dissertation Abstracts International75-02B(E).
Subject:	Electrical engineering.
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3600478
ISBN:	9781303505843

Distributed Estimation, Coding, and Scheduling in Wireless Visual Sensor Networks.
Yu, Chao.

Distributed Estimation, Coding, and Scheduling in Wireless Visual Sensor Networks. - 159 p.

Source: Dissertation Abstracts International, Volume: 75-02(E), Section: B.

Thesis (Ph.D.)--University of Rochester, 2013.

This item must not be sold to any third party vendors.

In this thesis, we consider estimation, coding, and sensor scheduling for energy efficient operation of wireless visual sensor networks (VSN), which consist of battery-powered wireless sensors with sensing (imaging), computation, and communication capabilities. The competing requirements for applications of these wireless sensor networks (WSN) (e.g., smart environmental surveillance) include long duration of unattended operation and limited energy supply, which motivate our investigation into energy-efficient estimation, coding, and sensor scheduling to prolong the lifetime of these wireless networked systems. Motivated by a telepresence setting in visual sensor networks, we first consider an abstract setting for investigating efficient distributed estimation and coding in wireless sensor networks where the captured data is jointly Gaussian. The sensors are geographically dispersed, and acquire indirect, noisy observations pertaining to a desired signal. A central processor (CP) communicates with these sensors via a rate-constrained channel and estimates the desired signal. In a simplified scenario where information from one sensor is to be sent to the CP that already has information regarding the desired signal, we establish a decomposed structure for the optimal encoding of the local observation: a first pre-processing step to extract elevant information from the indirect observation with consideration of the side information, followed by a second step of side-informed encoding of the pre-processed output. In the general scenario consisting of multiple sensors, we present a sequential framework to recursively utilize the separation. Simulation results demonstrate that constructions obtained using the proposed decomposition offer very good performance, closely matching nonconstructive information theoretic bounds for the problem. We next propose a novel code construction and design method for low-density parity-check accumulate (LDPCA) codes used for rate-adaptive distributed source coding. We propose a code construction using non-uniform splitting, in contrast to the uniform splitting used in prior literature. We also develop methods to analyze the proposed LDPCA codes using density evolution, based on which code search strategies are developed to find good LDPCA codes. Simulation results show the proposed code design outperforms the conventional LDPCA code design, and provides state-of-the-art performance. The final part of the thesis addresses the networking aspect of VSNs, considering sensor scheduling and energy allocation in a telepresence wireless VSN application, where visual coverage over a monitored region is obtained by deploying image sensors (cameras). Each camera provides coverage over a part of the monitored region, and a CP coordinates these cameras in order to gather required visual data. We model the network lifetime as a stochastic random variable that depends upon the coverage geometry for the cameras and the distribution of data requests over the monitored region, two key characteristics that distinguish our problem from other WSN applications. By suitably abstracting this model of network lifetime and utilizing asymptotic analysis, we propose lifetime-maximizing camera scheduling and energy allocation strategies. The effectiveness of the proposed strategies is validated through simulations.

ISBN: 9781303505843Subjects--Topical Terms:

454503
Electrical engineering.

Distributed Estimation, Coding, and Scheduling in Wireless Visual Sensor Networks.
LDR:04327nmm a2200289 4500 001 457644
005 20150805065213.5
008 150916s2013 ||||||||||||||||| ||eng d
020 $a 9781303505843
035 $a (MiAaPQ)AAI3600478
035 $a AAI3600478
040 $a MiAaPQ $c MiAaPQ
100 1 $a Yu, Chao. $3 708625
245 1 0 $a Distributed Estimation, Coding, and Scheduling in Wireless Visual Sensor Networks.
300 $a 159 p.
500 $a Source: Dissertation Abstracts International, Volume: 75-02(E), Section: B.
500 $a Adviser: Gaurav Sharma.
502 $a Thesis (Ph.D.)--University of Rochester, 2013.
506 $a This item must not be sold to any third party vendors.
520 $a In this thesis, we consider estimation, coding, and sensor scheduling for energy efficient operation of wireless visual sensor networks (VSN), which consist of battery-powered wireless sensors with sensing (imaging), computation, and communication capabilities. The competing requirements for applications of these wireless sensor networks (WSN) (e.g., smart environmental surveillance) include long duration of unattended operation and limited energy supply, which motivate our investigation into energy-efficient estimation, coding, and sensor scheduling to prolong the lifetime of these wireless networked systems. Motivated by a telepresence setting in visual sensor networks, we first consider an abstract setting for investigating efficient distributed estimation and coding in wireless sensor networks where the captured data is jointly Gaussian. The sensors are geographically dispersed, and acquire indirect, noisy observations pertaining to a desired signal. A central processor (CP) communicates with these sensors via a rate-constrained channel and estimates the desired signal. In a simplified scenario where information from one sensor is to be sent to the CP that already has information regarding the desired signal, we establish a decomposed structure for the optimal encoding of the local observation: a first pre-processing step to extract elevant information from the indirect observation with consideration of the side information, followed by a second step of side-informed encoding of the pre-processed output. In the general scenario consisting of multiple sensors, we present a sequential framework to recursively utilize the separation. Simulation results demonstrate that constructions obtained using the proposed decomposition offer very good performance, closely matching nonconstructive information theoretic bounds for the problem. We next propose a novel code construction and design method for low-density parity-check accumulate (LDPCA) codes used for rate-adaptive distributed source coding. We propose a code construction using non-uniform splitting, in contrast to the uniform splitting used in prior literature. We also develop methods to analyze the proposed LDPCA codes using density evolution, based on which code search strategies are developed to find good LDPCA codes. Simulation results show the proposed code design outperforms the conventional LDPCA code design, and provides state-of-the-art performance. The final part of the thesis addresses the networking aspect of VSNs, considering sensor scheduling and energy allocation in a telepresence wireless VSN application, where visual coverage over a monitored region is obtained by deploying image sensors (cameras). Each camera provides coverage over a part of the monitored region, and a CP coordinates these cameras in order to gather required visual data. We model the network lifetime as a stochastic random variable that depends upon the coverage geometry for the cameras and the distribution of data requests over the monitored region, two key characteristics that distinguish our problem from other WSN applications. By suitably abstracting this model of network lifetime and utilizing asymptotic analysis, we propose lifetime-maximizing camera scheduling and energy allocation strategies. The effectiveness of the proposed strategies is validated through simulations.
590 $a School code: 0188.
650 4 $a Electrical engineering. $3 454503
650 4 $a Information science. $3 190425
690 $a 0544
690 $a 0723
710 2 $a University of Rochester. $b Hajim School of Engineering and Applied Sciences. $3 708626
773 0 $t Dissertation Abstracts International $g 75-02B(E).
790 $a 0188
791 $a Ph.D.
792 $a 2013
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3600478