Concurrent and distributed projection through local interference for wireless sensor networks

No Thumbnail Available
Identifiers
URI: https://hdl.handle.net/11556/1832
ISSN: 1867-8211
ISBN: 9783642294785
DOI: 10.1007/978-3-642-29479-2_9
Publication date
2012
Authors
Advisors
Journal Title
Journal ISSN
Volume Title
Publisher
Citations
Google Scholar
Export
Research Projects
Organizational Units
Journal Issue
Abstract
In this paper we use a gossip algorithm to obtain the projection of the observed signal into a subspace of lower dimension. Gossip algorithms allow distributed, fast and efficient computations on a Wireless Sensor Network and they can be properly modified to evaluate the sought projection. By combining computation coding with gossip algorithms we proposed a novel strategy that leads to important saving on convergence time as well as exponentially decreasing energy consumption, as the size of the network increases.
Description
Keywords
Computational Codes , Neighborhood Gossip , Signal Subspace Projection , Wireless Sensor Networks , Computer Networks and Communications
Type
conference output
Citation
Insausti , X , Crespo , P M , Beferull , B & Del Ser , J 2012 , Concurrent and distributed projection through local interference for wireless sensor networks . in Mobile Lightweight Wireless Systems - Third International ICST Conference, MOBILIGHT 2011, Revised Selected Papers . Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering , vol. 81 LNICST , pp. 109-119 , 3rd International ICST Conference on Mobile Lightweight Wireless Systems, MOBILIGHT 2011 , Bilbao , Spain , 9/05/11 . https://doi.org/10.1007/978-3-642-29479-2_9
conference