Concurrent and distributed projection through local interference for wireless sensor networks

Xabier Insausti, Pedro M. Crespo, Baltasar Beferull, Javier Del Ser

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationMobile Lightweight Wireless Systems - Third International ICST Conference, MOBILIGHT 2011, Revised Selected Papers
Pages109-119
Number of pages11
DOIs
Publication statusPublished - 2012
Event3rd International ICST Conference on Mobile Lightweight Wireless Systems, MOBILIGHT 2011 - Bilbao, Spain
Duration: 9 May 201110 May 2011

Publication series

NameLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
Volume81 LNICST
ISSN (Print)1867-8211

Conference

Conference3rd International ICST Conference on Mobile Lightweight Wireless Systems, MOBILIGHT 2011
Country/TerritorySpain
CityBilbao
Period9/05/1110/05/11

Keywords

  • Computational Codes
  • Neighborhood Gossip
  • Signal Subspace Projection
  • Wireless Sensor Networks

Fingerprint

Dive into the research topics of 'Concurrent and distributed projection through local interference for wireless sensor networks'. Together they form a unique fingerprint.

Cite this