Accession Number:

ADA505322

Title:

Globally Optimal Decentralized Spatial Smoothing for Wireless Sensor Networks With Local Interactions

Descriptive Note:

Conference paper

Corporate Author:

UNIVERSITA DEGLI STUDI LA SAPIENZA ROME (ITALY) DEPT INFOCOM

Personal Author(s):

• Barbarossa, S.
• Battisti, T.
• Swami, A.

Report Date:

2008-01-01

Pagination or Media Count:

5.0

Abstract:

In most sensor network applications, the vector containing the observations gathered by the sensors lies in a space of dimension equal to the number of nodes, typically because of observation noise, even though the useful signal belongs to a subspace of much smaller dimension. This motivates smoothing or rank reduction. We formulate a convex optimization problem, where we incorporate a fidelity constraint that prevents the final smoothed estimate from diverging too far from the observations. This leads to a distributed algorithm in which nodes exchange updates only with neighboring nodes. We show that the widely studied consensus algorithm is indeed only a very specific case of our more general formulation. Finally, we study the convergence rate and propose some approaches to maximize it.

Descriptors:

• *SMOOTHING(MATHEMATICS)
• *ALGORITHMS
• *WIRELESS LINKS
• *OPTIMIZATION
• *COMMUNICATIONS NETWORKS
• INTERACTIONS
• FORMULATIONS
• OBSERVATION
• SIGNAL TO NOISE RATIO
• RATES
• NODES
• REDUCTION
• CONVERGENCE
• VECTOR ANALYSIS
• ITALY
• RADIO LINKS
• EXCHANGE
• MARKOV PROCESSES
• NOISE(ELECTRICAL AND ELECTROMAGNETIC)
• RANK ORDER STATISTICS
• LAPLACE TRANSFORMATION
• CONVEX BODIES
• RADIOTELEPHONES
• DISTRIBUTION
• NETWORKS
• SIZES(DIMENSIONS)
• DETECTORS
• SYMPOSIA
• REPRINTS

Subject Categories:

• Numerical Mathematics
• Cybernetics
• Miscellaneous Detection and Detectors
• Command, Control and Communications Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE