Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014. / This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. / Cataloged from student-submitted PDF version of thesis. / Includes bibliographical references (pages 221-231). / Reliable and accurate localization of mobile network nodes is a key enabler for numerous emerging applications in the commercial, public safety, and military sectors. Achieving such location awareness by conventional techniques is challenging in harsh environments with limited infrastructures, e.g., indoors, in urban canyons, and on battlefields. This thesis proposes network localization and navigation (NLN), a new paradigm in which mobile nodes exploit both spatial and temporal cooperation for positional inference. To fully understand the cooperation benefits and associated costs, and then to efficiently harness the benefits with minimum costs in practical networks, we have developed a foundation for NLN with contributions in the following three areas. In the first part, we establish a theoretical framework for NLN and characterize the localization performance by spatiotemporal cooperation, showing that NLN significantly improves the reliability and accuracy of location awareness. We introduce the notion of localization information, and demonstrate by Fisher information analysis that such information can be decomposed into the sum of basic building blocks, each associated with a spatial or temporal cooperation link. We also develop a geometric method to illustrate the evolution and coupling of localization information induced by spatiotemporal cooperation. In the second part, we develop robust resource allocation techniques that guarantee the localization accuracy in the presence of parameter uncertainty with minimum energy consumption. We first discover important functional properties of the localization accuracy metrics, based on which the accuracy constraints are transformed into conic forms. We then design an asymptotically optimal second-order cone program (SOCP)-based algorithm for robust resource allocation with a proven convergence rat, as well as near-optimal but more efficient SOCP-based algorithms using relaxation methods. In the third part, we develop an information-theoretic framework for secret-key generation (SKG) using noisy observations of common sources, and as a case study determine the secret-key rate that can be generated from wideband signals in multipath channels. Since the probability distribution of source parameters may be unavailable in many scenarios, we consider the problem from a non-Bayesian perspective and model the parameters as deterministic but unknown. We then propose a new metric called intrinsic information to characterize the secret-key rate, and derive the intrinsic information for wideband channels as a function of network parameters, such as transmission bandwidth and node mobility. The contributions of this work provide insights into the essence of NLN, yielding theoretical benchmarks and practical guidelines valuable for the design and operation of high-accuracy location-aware networks. / by Yuan Shen. / Ph. D.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/89845 |
| Date | January 2014 |
| Creators | Shen, Yuan, Ph. D. Massachusetts Institute of Technology |
| Contributors | Moe Z. Win., Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science., Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. |
| Publisher | Massachusetts Institute of Technology |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | English |
| Detected Language | English |
| Type | Thesis |
| Format | 231 pages, application/pdf |
| Rights | M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission., http://dspace.mit.edu/handle/1721.1/7582 |
Page generated in 0.0014 seconds