neuron inspired maintenance free distributed sensing
play

Neuron-inspired maintenance-free, distributed sensing Challenges - PowerPoint PPT Presentation

May 10, 2023 •245 likes •817 views

Neuron-inspired maintenance-free, distributed sensing Challenges and algorithms Stephan Sigg Department of Communications and Networking Aalto University, School of Electrical Engineering stephan.sigg@aalto.fi NII, 24.02.2017 Stephan

  1. Neuron-inspired maintenance-free, distributed sensing – Challenges and algorithms Stephan Sigg Department of Communications and Networking Aalto University, School of Electrical Engineering stephan.sigg@aalto.fi NII, 24.02.2017

  2. Stephan Sigg February 24, 2017 2 / 36

  3. Stephan Sigg February 24, 2017 2 / 36

  4. Stephan Sigg February 24, 2017 2 / 36

  5. Stephan Sigg February 24, 2017 3 / 36

  6. Stephan Sigg February 24, 2017 3 / 36

  7. Group members and recent related research RF-based activity recognition Maintenance-free, intelligent distributed sensing Sensor graphs for distributed mathematical operation Probabilistic superimposed mathematical operations Neuron-inspired communication between distributed nodes Artificial neural computation from implicit channel inputs Conclusion Stephan Sigg February 24, 2017 4 / 36

  8. Stephan Sigg February 24, 2017 5 / 36

  9. Exploiting the RF-channel for environmental preception ◮ Multi-path propagation ◮ Reflection ◮ Signal superimposition ◮ Blocking of signal paths ◮ Scattering ◮ Doppler Shift ◮ Signal Phase ◮ Fresnel effects Stephan Sigg February 24, 2017 6 / 36

  10. RF-based activity recognition Sensewaves Video Stephan Sigg February 24, 2017 7 / 36

  11. – Video – Stephan Sigg February 24, 2017 8 / 36

  12. RF-based device-free activity recognition g Crawling n g n i d i k n a l t a S W empty L y i n g Stephan Sigg February 24, 2017 9 / 36

  13. RF-based device-free activity recognition g Crawling n g n i d i k n a l t a S W empty L y i n g Stephan Sigg February 24, 2017 9 / 36

  14. Monitoring attention from RF Stephan Sigg February 24, 2017 10 / 36

  15. Monitoring attention from RF Stephan Sigg February 24, 2017 10 / 36

  16. Situation and gestures from passive RSSI-based DFAR 10cm 10cm Towards Away Hold over Open/close Take up Swipe Swipe Swipe Swipe Wipe No bottom top left right gesture Stephan Sigg February 24, 2017 11 / 36

  17. Situation and gestures from passive RSSI-based DFAR 10cm 10cm Towards Away Hold over Open/close Take up Swipe Swipe Swipe Swipe Wipe No bottom top left right gesture Stephan Sigg February 24, 2017 11 / 36

  18. Group members and recent related research RF-based activity recognition Maintenance-free, intelligent distributed sensing Sensor graphs for distributed mathematical operation Probabilistic superimposed mathematical operations Neuron-inspired communication between distributed nodes Artificial neural computation from implicit channel inputs Conclusion Stephan Sigg February 24, 2017 12 / 36

  19. Energy-harvesting from Ambient RF noise Efficiency: DC-conversion possible at about 70% efficiency 1 7cm · 7cm rectenna : transmissions at 0.2Hz for 3.4ms each 2 0.5m 2 rectenna : RF-activity at 20Hz for 300 µ s each 3 1Doan et al. ’Design and Fabrication of Rectifying Antenna Circuit for Wireless Power Transmission System Operating At ISM Band.’ International Journal of Electrical and Computer Engineering, 2016 2Nishimoto et al. ’Prototype implementation of ambient RF energy harvesting wireless sensor networks.’ IEEE Sensors, 2010. 3Song et al. ’On the use of the intermodulation communication towards zero power sensor nodes.’ EuMC 2013 Stephan Sigg February 24, 2017 13 / 36

  20. Maintenance-free intelligent distributed sensing Stephan Sigg February 24, 2017 14 / 36

  21. Group members and recent related research RF-based activity recognition Maintenance-free, intelligent distributed sensing Sensor graphs for distributed mathematical operation Probabilistic superimposed mathematical operations Neuron-inspired communication between distributed nodes Artificial neural computation from implicit channel inputs Conclusion Stephan Sigg February 24, 2017 15 / 36

  22. Calculation during transmission on the channel Envisioned paradigm shift in mobile computing Parasitic operation Communication comes virtually for free Miniaturisation Processing and storage capabilities limited (passive, parasitic, backscatter) Stephan Sigg February 24, 2017 16 / 36

  23. Calculation during transmission on the channel Envisioned paradigm shift in mobile computing Parasitic operation Communication comes virtually for free Miniaturisation Processing and storage capabilities limited (passive, parasitic, backscatter) Potential: Trade processing load for communication load ◮ Shift computation towards the wireless communication channel Stephan Sigg February 24, 2017 16 / 36

  24. Calculation during transmission on the channel Envisioned paradigm shift in mobile computing Parasitic operation Communication comes virtually for free Miniaturisation Processing and storage capabilities limited (passive, parasitic, backscatter) Potential: Trade processing load for communication load ◮ Shift computation towards the wireless communication channel ◮ Computation below computational complexity possible? Stephan Sigg February 24, 2017 16 / 36

  25. Calculation during transmission on the channel Motivation: Computation during transmission a ◮ Max. rate to compute & communicate functions ◮ Mention: Collisions might contain information a A. Giridhar and P . Kumar, Toward a theory of in-network computation in wireless sensor networks, IEEE Comm. Mag., vol. 44, no 4, pp. 98-107, april 2006 Calculation of by means of post- and pre-processing a ◮ Requires accurate channel state information ◮ Requires identical absolute transmit power a M. Goldenbaum, S. Stanczak, and M. Kaliszan, On function computation via wireless sensor multiple-access channels, IEEE Wireless Communications and Networking Conf., 2009 Stephan Sigg February 24, 2017 17 / 36

  26. Calculation during transmission on the channel Utilising Poisson-distributed burst-sequences transmit burst sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . burst . . . . . . . . . . . . . . . . . . time superimposed received burst sequence . . . . . . . . . . . . t K Stephan Sigg February 24, 2017 18 / 36

  27. Calculation during transmission on the channel Utilising Poisson-distributed burst-sequences transmit burst sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . burst . . . . . . . . . . . . . . . . . . time superimposed received burst sequence . . . . . . . . . . . . t K Basic operations Addition, subtraction, division and multiplication at the time of wireless data transmission via Poisson-distributed burst-sequences Stephan Sigg February 24, 2017 18 / 36

  28. Calculation during transmission on the channel Utilising Poisson-distributed burst-sequences transmit burst sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . burst . . . . . . . . . . . . . . . . . . time superimposed received burst sequence . . . . . . . . . . . . t K Addition Adding Poisson processes i with mean µ i will result in a Poisson process with mean � n i = 1 µ i . Stephan Sigg February 24, 2017 18 / 36

  29. Calculation during transmission on the channel Utilising Poisson-distributed burst-sequences transmit burst sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . burst . . . . . . . . . . . . . . . . . . time superimposed received burst sequence . . . . . . . . . . . . t K Multiplication Applying logarithm laws allows multiplication Stephan Sigg February 24, 2017 18 / 36

  30. Calculation during transmission on the channel Utilising Poisson-distributed burst-sequences transmit burst sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . burst . . . . . . . . . . . . . . . . . . time superimposed received burst sequence . . . . . . . . . . . . t K Division From two nodes, one transmits the Numerator and one the Denominator (fraction) Stephan Sigg February 24, 2017 18 / 36

  31. Calculation during transmission on the channel Utilising Poisson-distributed burst-sequences transmit burst sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . burst . . . . . . . . . . . . . . . . . . time superimposed received burst sequence . . . . . . . . . . . . t K Subtraction Combining division with logarithm laws allows subtraction (two nodes only) Stephan Sigg February 24, 2017 18 / 36

  32. Calculation during transmission on the channel Errors for calculating during transmission on the wireless channel t = 10 6 ; κ = 10 3 10 nodes 20 nodes 30 nodes 40 nodes 50 nodes mean err .0322 .0466 .0609 .051 .0719 std-dev. .0232 .0368 .0536 .0336 .0438 max N i 9 14 18.5 26 31 median T 2653.5 5161.5 7393 101816 124179 t = 10 7 ; κ = 10 3 10 nodes 20 nodes 30 nodes 40 nodes 50 nodes mean err .0049 .0176 .0402 .0475 .0781 std-dev. .0062 .0127 .0233 .0292 .0405 max N i 12 18 23 27 31 median T 25708.5 52617.5 78502 101381 114348 t = 10 7 ; κ = 10 2 10 nodes 20 nodes 30 nodes 40 nodes 50 nodes mean err .0190 .1337 .2619 .4903 .6597 std-dev. .0107 .0358 .0591 .0708 .1129 max N i 9.5 16 19 24 27 median T 24165 50037 71686.5 96829 114383 Stephan Sigg February 24, 2017 19 / 36

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Maintenance-free, distributed sensing Challenges and algorithms Stephan Sigg Department of

Maintenance-free, distributed sensing Challenges and algorithms Stephan Sigg Department of

Maintenance-free, distributed sensing Challenges and algorithms Stephan Sigg Department of Communications and Networking Aalto University, School of Electrical Engineering stephan.sigg@aalto.fi Siremti Workshop, 13.03.2017 Stephan Sigg

551 views • 43 slides
Challenges and tools for maintenance-free, intelligent distributed sensing Stephan Sigg

Challenges and tools for maintenance-free, intelligent distributed sensing Stephan Sigg

Challenges and tools for maintenance-free, intelligent distributed sensing Stephan Sigg Department of Communications and Networking Aalto University, School of Electrical Engineering stephan.sigg@aalto.fi CiNet, 22.02.2017 Stephan Sigg

751 views • 56 slides
Neuron inspired collaborative transmission in WSNs Mobiquitous 2011, 06.12.09.12., Copenhagen,

Neuron inspired collaborative transmission in WSNs Mobiquitous 2011, 06.12.09.12., Copenhagen,

Information Systems Architecture Science Research Division Neuron inspired collaborative transmission in WSNs Mobiquitous 2011, 06.12.09.12., Copenhagen, Denmark Stephan Sigg, Predrag Jakimovski, Florian Becker, Hedda R. Schmidtke,

482 views • 33 slides
PowerGen Maintenance-Free Electrical Power for the O&G Industry 1 Company Overview Decades

PowerGen Maintenance-Free Electrical Power for the O&G Industry 1 Company Overview Decades

PowerGen Maintenance-Free Electrical Power for the O&G Industry 1 Company Overview Decades of technology excellence led to a Maintenance Free Generator The emerging leader in Reliable Distributed Power for the 1-10 KW range, based on a

471 views • 27 slides
CNVLUTIN: Ineffectual-neuron-free DNN computing J. Albericio , P. Judd, T. Hetherington*, T.

CNVLUTIN: Ineffectual-neuron-free DNN computing J. Albericio , P. Judd, T. Hetherington*, T.

CNVLUTIN: Ineffectual-neuron-free DNN computing J. Albericio , P. Judd, T. Hetherington*, T. Aamodt*, N. E. Jerger, A. Moshovos * Please cite the original source. CNVLUTIN: Ineffectual-neuron-free DNN computing J. Albericio P. Judd T.

867 views • 70 slides
Bio-inspired computation: Clock-free, grid-free, scale-free, and symbol-free (FA2386-12-1-4050)

Bio-inspired computation: Clock-free, grid-free, scale-free, and symbol-free (FA2386-12-1-4050)

Bio-inspired computation: Clock-free, grid-free, scale-free, and symbol-free (FA2386-12-1-4050) PI: Janet Wiles (University of Queensland) AFOSR Program Review: Mathematical and Computational Cognition Program Computational and Machine

307 views • 29 slides
RaySense Fiber Optic Distributed Acoustic Sensing for Pipeline Security and Leak Detection 1 P

RaySense Fiber Optic Distributed Acoustic Sensing for Pipeline Security and Leak Detection 1 P

RaySense Fiber Optic Distributed Acoustic Sensing for Pipeline Security and Leak Detection 1 P IPELINE M ONITORING AND S ECURITY The oil & gas industry is currently facing a serious challenge in assuring spill and accident free operations

1.07k views • 18 slides
Myra Dioquino Ne Neuron Ne Neuron ons ons ~30x out ~30x in 20 000 20,000x out o t ~30x

Myra Dioquino Ne Neuron Ne Neuron ons ons ~30x out ~30x in 20 000 20,000x out o t ~30x

Myra Dioquino Ne Neuron Ne Neuron ons ons ~30x out ~30x in 20 000 20,000x out o t ~30x out Describes the equilibrium potential of the cell for a particular ion R Universal gas constant (8.314472 J K ) T

455 views • 9 slides
Nature-inspired Coordination for Complex Distributed Systems Andrea Omicini

Nature-inspired Coordination for Complex Distributed Systems Andrea Omicini

Nature-inspired Coordination for Complex Distributed Systems Andrea Omicini andrea.omicini@unibo.it Dipartimento di Informatica: Scienza e Ingegneria (DISI) Alma Mater Studiorum Universit` a di Bologna IDC 2012 Intelligent Distributed

703 views • 47 slides
DEFECT DETECTION IN A DEFECT DETECTION IN A DISTRIBUTED SOFTWARE DISTRIBUTED SOFTWARE

DEFECT DETECTION IN A DEFECT DETECTION IN A DISTRIBUTED SOFTWARE DISTRIBUTED SOFTWARE

DEFECT DETECTION IN A DEFECT DETECTION IN A DISTRIBUTED SOFTWARE DISTRIBUTED SOFTWARE MAINTENANCE PROJECT MAINTENANCE PROJECT Alessandro Bianchi, Danilo Caivano, Filippo Lanubile, Giuseppe Visaggio SER_Lab - Department of Informatics -

134 views • 12 slides
STEP 5. Slides of a neuron, nerve, and spinal cord #1 Neuron slide This step can wait until

STEP 5. Slides of a neuron, nerve, and spinal cord #1 Neuron slide This step can wait until

STEP 5. Slides of a neuron, nerve, and spinal cord #1 Neuron slide This step can wait until later, if youd like. But make sure you look at these Read images! Me First, we will look at the motor neuron. Note that it is difficult to

370 views • 3 slides
Distributed Sensing and Perception via Sparse Representation Allen Y. Yang yang@eecs.berkeley.edu

Distributed Sensing and Perception via Sparse Representation Allen Y. Yang yang@eecs.berkeley.edu

Introduction Face Recognition Fast 1 -Minimization Algorithms Distributed Object Recognition Conclusion Distributed Sensing and Perception via Sparse Representation Allen Y. Yang yang@eecs.berkeley.edu CIS Seminar, Johns Hopkins, 2010

659 views • 54 slides
Increasing Dam Safety and Integrity by using Distributed Fiber Optic Sensing ( DFOS) A company of

Increasing Dam Safety and Integrity by using Distributed Fiber Optic Sensing ( DFOS) A company of

Increasing Dam Safety and Integrity by using Distributed Fiber Optic Sensing ( DFOS) A company of the Brugg Group Motivation for Distributed Fiber Optic Sensors (DFOS) The demand to continuously measuring and diagnosing the structural health

306 views • 27 slides
Riak a distributed, web-inspired database NoSQLBerlin'09 Martin Scholl <ms@diskware.net>

Riak a distributed, web-inspired database NoSQLBerlin'09 Martin Scholl <ms@diskware.net>

Riak a distributed, web-inspired database NoSQLBerlin'09 Martin Scholl <ms@diskware.net> @zeit_geist Historical Notes Riak is Basho Incs brainchild Apache 2.0 licensed first public release 09/08/07

318 views • 21 slides
CS 472 - Perceptron 1 Basic Neuron CS 472 - Perceptron 2 Expanded Neuron CS 472 - Perceptron

CS 472 - Perceptron 1 Basic Neuron CS 472 - Perceptron 2 Expanded Neuron CS 472 - Perceptron

CS 472 - Perceptron 1 Basic Neuron CS 472 - Perceptron 2 Expanded Neuron CS 472 - Perceptron 3 Perceptron Learning Algorithm l First neural network learning model in the 1960s l Simple and limited (single layer models) l Basic concepts

571 views • 53 slides
Neuron Technologies Company Profile Dr. Ismayil Alakbarov Founder & CEO, Neuron Technologies

Neuron Technologies Company Profile Dr. Ismayil Alakbarov Founder & CEO, Neuron Technologies

Success Story of Neuron Technologies Company Profile Dr. Ismayil Alakbarov Founder & CEO, Neuron Technologies State of the Art Technologies Our solutions are developed at the latest technology platforms. We keep abreast of the

249 views • 22 slides
The ICSI Meeting Corpus Barbara Peskin [on behalf of ICSIs MeetingRecorder Team]

The ICSI Meeting Corpus Barbara Peskin [on behalf of ICSIs MeetingRecorder Team]

The ICSI Meeting Corpus Barbara Peskin [on behalf of ICSIs MeetingRecorder Team] International Computer Science Institute Berkeley, CA M4 Meeting, Sheffield 29-30 January 2003 1 Basic Facts 75 natural meetings collected at

443 views • 7 slides
Link capacity estimation in QOLSR Ignacy Gawdzki <i@lri.fr> Hakim Badis

Link capacity estimation in QOLSR Ignacy Gawdzki <i@lri.fr> Hakim Badis

Link capacity estimation in QOLSR Ignacy Gawdzki <i@lri.fr> Hakim Badis <badis@lri.fr> Khaldoun Al Agha <alagha@lri.fr> LRI laboratory July 29th, 2005 Introduction Link capacity in radio networks Clique constraints Clique

607 views • 34 slides
Big Data & Big Compute in Radio Astronomy Rob van Nieuwpoort Two simultaneous disruptive

Big Data & Big Compute in Radio Astronomy Rob van Nieuwpoort Two simultaneous disruptive

Big Data & Big Compute in Radio Astronomy Rob van Nieuwpoort Two simultaneous disruptive technologies Radio Telescopes New sensor types Distributed sensor networks Scale increase Software telescopes Computer

361 views • 35 slides
Presented by Thang N. Dinh PTAS for Max (Weighted) IS and Min DS for Wireless Networks

Presented by Thang N. Dinh PTAS for Max (Weighted) IS and Min DS for Wireless Networks

Tim Nieberg, Johann Hurink, Walter Kern Presented by Thang N. Dinh PTAS for Max (Weighted) IS and Min DS for Wireless Networks WITHOUT geometric information Work for various Wireless Models: Disk Graph , Quasi-Disk Graph, Fading,

325 views • 14 slides
Towards Fresh Re-Keying with Leakage-Resilient PRFs: Cipher Design Principles and Analysis d 1 ,

Towards Fresh Re-Keying with Leakage-Resilient PRFs: Cipher Design Principles and Analysis d 1 ,

Towards Fresh Re-Keying with Leakage-Resilient PRFs: Cipher Design Principles and Analysis d 1 , F. De Santis 2 , 3 , J. Heyszl 4 , S. Mangard 3 , S. Bela M. Medwed 5 , J.-M. Schmidt 6 , F.-X. Standaert 7 , S. Tillich 8 1 Ecole Normale Sup

754 views • 29 slides
Converting from E/R to relational model Introduction In the last segment, we learned how to

Converting from E/R to relational model Introduction In the last segment, we learned how to

Converting from E/R to relational model Introduction In the last segment, we learned how to create an Entity-relationship model. However, creating the model is only half the task; we still need to convert the model into a usable database. Doing

427 views • 9 slides
1111 + 1101 (3 pts) You are given a certain 32-bit binary number. Explain how to tell if this

1111 + 1101 (3 pts) You are given a certain 32-bit binary number. Explain how to tell if this

The 12 week exam will cover everything assigned or discussed in class from: 1. Chapter 3 2. Chapter 4 3. Chapter 5 4. Any extra material in the lecture notes 5. Earlier material not focus of this exam, but may need basic info (e.g. to write MIPS

454 views • 7 slides
Lecture 4 Machine Code 3. Hardware and Softw are 4. High Level Languages 5. Standard input

Lecture 4 Machine Code 3. Hardware and Softw are 4. High Level Languages 5. Standard input

1. Introduction 2. Binary Representation Lecture 4 Machine Code 3. Hardware and Softw are 4. High Level Languages 5. Standard input and output As we have seen, programs exist as binary 6. Operators, expression and statem ents

354 views • 4 slides

More recommend