Geometric methods for optimal resource allocation in wireless network localization

Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2014.

Bibliographic Details
Main Author: Dai, Wenhan
Other Authors: Moe Z. Win.
Format: Thesis
Language:eng
Published: Massachusetts Institute of Technology 2014
Subjects:
Online Access:http://hdl.handle.net/1721.1/90733
_version_ 1826200467463471104
author Dai, Wenhan
author2 Moe Z. Win.
author_facet Moe Z. Win.
Dai, Wenhan
author_sort Dai, Wenhan
collection MIT
description Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2014.
first_indexed 2024-09-23T11:36:57Z
format Thesis
id mit-1721.1/90733
institution Massachusetts Institute of Technology
language eng
last_indexed 2024-09-23T11:36:57Z
publishDate 2014
publisher Massachusetts Institute of Technology
record_format dspace
spelling mit-1721.1/907332019-04-11T11:35:11Z Geometric methods for optimal resource allocation in wireless network localization Dai, Wenhan Moe Z. Win. Massachusetts Institute of Technology. Department of Aeronautics and Astronautics. Massachusetts Institute of Technology. Department of Aeronautics and Astronautics. Aeronautics and Astronautics. Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2014. Cataloged from PDF version of thesis. Includes bibliographical references (pages 81-84). Wireless network localization (WNL) is an emerging paradigm for providing high-accuracy positional information in GPS-challenged environments. The localization performance of a node in WNL is determined by the allocation of transmit resources among its neighboring nodes. To achieve the best localization performance, we develop a computational geometry framework for optimal resource allocation in WNL. We first determine an affine map that transforms each resource allocation strategy into a point in 3-D Euclidian space. By exploiting geometric properties of these image points, we prove the sparsity property of the optimal resource allocation vector, i.e., the optimal localization performance can be achieved by allocating resources to only a small subset of neighboring nodes. Moreover, these geometric properties enable the reduction of the search space for optimal solutions, based on which we design efficient resource allocation strategies. Numerical results show that the proposed strategies can achieve significant improvements in both localization performance and computation efficiency. Our approach provides a new methodology for resource allocation in network localization, yielding exact optimal solutions rather than e-approximate solutions. by Wenhan Dai. S.M. 2014-10-08T15:25:51Z 2014-10-08T15:25:51Z 2014 2014 Thesis http://hdl.handle.net/1721.1/90733 891144468 eng 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 84 pages application/pdf Massachusetts Institute of Technology
spellingShingle Aeronautics and Astronautics.
Dai, Wenhan
Geometric methods for optimal resource allocation in wireless network localization
title Geometric methods for optimal resource allocation in wireless network localization
title_full Geometric methods for optimal resource allocation in wireless network localization
title_fullStr Geometric methods for optimal resource allocation in wireless network localization
title_full_unstemmed Geometric methods for optimal resource allocation in wireless network localization
title_short Geometric methods for optimal resource allocation in wireless network localization
title_sort geometric methods for optimal resource allocation in wireless network localization
topic Aeronautics and Astronautics.
url http://hdl.handle.net/1721.1/90733
work_keys_str_mv AT daiwenhan geometricmethodsforoptimalresourceallocationinwirelessnetworklocalization