Distributed algorithms for beamforming in wirless [sic] sensor networks
Loading...
Authors
Papalexidis, Nikolaos
Subjects
Advisors
Tummala, Murali
McEachen, John C.
Date of Issue
2007-06
Date
Publisher
Monterey, California. Naval Postgraduate School
Language
Abstract
Sensor nodes in a wireless sensor network (WSN) can establish a link with a UAV by using beamforming techniques to form a random array with position errors. The position errors' effect in the array performance is examined using a MATLAB-based simulation model. In order to spread the processing and communication load among the nodes, two new distributed algorithms for beamforming in WSN, based on the least squares (LS) approximation of the desired array response, are proposed. The first is a distributed implementation of the QR decomposition, and the second is an iterative method for solving the LS problem. Results indicate that the processing load is effectively shared among the nodes. Especially, in the second approach, the processing load can be lower than that of the centralized approach, depending on the algorithm's convergence. For both algorithms, the tradeoff for the ability to spread the processing load is the increased communication cost, which could cause an overall increase in the total power consumption in the network. However, the average power per participating sensor node is still lower than that required by the cluster head in the centralized approach. Consequently, the network's susceptibility to failures due to excessive power consumption is greatly reduced.
Type
Thesis
Description
Series/Report No
Department
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
xviii, 116 p. : ill. ;
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.