• Aucun résultat trouvé

samedi 28 janvier 2012 Architecture

N/A
N/A
Protected

Academic year: 2022

Partager "samedi 28 janvier 2012 Architecture"

Copied!
171
0
0

Texte intégral

(1)

Architecture

samedi 28 janvier 2012

(2)

Sensor Node Architecture

Battery

DC-DC

Sensor

ADC MCU

Memory

Radio

(3)

Available Devices

• MicaZ (Crossbow)

• 2.94 GHz IEEE 802.15.4 Zigbee radio

• 128 KB program memory

• 512 KB data memory

8 mA draw

samedi 28 janvier 2012

(4)

Available Devices

• Tmote Sky/invent (Moteiv)

• 2.94 GHz IEEE 802.15.4 Zigbee radio

• 8MHz processor

10 KB RAM

• 48 KB Flash

(5)

Available Devices

• Stargate (Crossbow)

• Wired Ethernet

• Wifi/Cellular via PCMCIA

• INTEL PXA 255

• Linux Kernel

Environmental Monitoring Application Note

Data Interval (minutes)

Average MICA2 or MICA2DOT Current

(µA)

1 677

3 315

6 196

The XMesh network has been extensively tested both at indoor and outdoor locations. In a typical indoor test, nodes were placed at every 300 sq ft. to cover a 10,000 sq ft facility. To simulate larger distance between nodes, the radio transmit power was turned down to -6dBm. In outdoor tests nodes were spread across several acres of rugged terrain with an average density of 1 mote per 10,000 sq ft and at full radio power. Statistical analysis across many deployments shows on average greater than 90% of all traffic generated at any node will be collected at the base station without the use of end-end acknowledgements.

Stargate Base Station

Figure 4. Stargate gateway as a base station

The Crossbow Stargate gateway and microserver is an embedded Linux computer designed to be the primary access point for wireless sensor networks. The Stargate’s small form factor,

reliability, and optional communication interfaces makes it ideal for remote, environmental monitoring. A base station mote (MICA2) is connected to the 51-pin connector on the Stargate.

A resident program, XListen, takes an input stream of wireless sensor data from the base station mote and stores it in a local Postgres database.

The Crossbow Stagate can be connected to a wide-area or back-haul network in one of the following ways:

! Wired Ethernet connection

! WiFi, using a Compact Flash card (Netgear MA701, AmbicomWL1100C-CF, etc.)

! Long Range WiFi using PCMCIA card (ZComax or SMC Wireless SMC2532W-B).

! Cell phone modem card (Sierra Wireless Aircard 555D) for remote cellular access.

Page 7

samedi 28 janvier 2012

(6)

Sensors

Exterioceptors: information about the surroundings

Proprioceptors: information about the

internal workings

(7)

Sensors

Measurand Transduction

Physical Pressure Piezoresistive, capacitive

Temperature Thermistor,

thermomechanical, thermocouple

Humidity Resistive, capacitive

Flow Pressure change, thermistor

samedi 28 janvier 2012

(8)

Sensors

Measurand Transduction

Motion Position E-mag, GPS, contact

Velocity Doppler, Hall effect, optoelectronic

Angular velocity Optical encoder

(9)

Sensors

Measurand Transduction

Contact Strain Piezoresistive

Force Piezoelectric, piezoresistive

Torque Piezoresistive, optoelectronic

Vibration Piezoresistive, piezoelectric, optical fiber, sound,

ultrasound

samedi 28 janvier 2012

(10)

Sensors

Measurand Transduction

Presence Tactile Contact switch, capacitive

Proximity Hall effect, capacitive, magnetic, seismic, acoustic,

RF

Distance E-mag (sonar, radar, lidar),

magnetic, tunelling

(11)

Sensors

Measurand Transduction

Biochemical Agents biochemical transduction

Identification Personal

features Vision

Personal ID Fingerprints, retinal scan, voice, heat plume, vision,

motion analysis

samedi 28 janvier 2012

(12)

Sensor Node

Operating System

TinyOS concepts

• Scheduler + Graph of components

Component

• Constrained storage model

• Very Lean multithreading

• Efficient Layering

(13)

TinyOS Component

Commands

Events

Task State

Provides

Uses

samedi 28 janvier 2012

(14)

TinyOS Application

Route Map Router Sensor Application

Active Messages

Radio Packet

Serial

Packet Temp Photo

Radio Byte

Application

Packet

Byte

(15)

Programming TinyOS

TinyOS is written in NesC

• Applications are written as system components

Syntax for concurrency and storage model

Compositional support

• Separation of definition and linkage

samedi 28 janvier 2012

(16)

Simulating TinyOS

Target platform: TOSSIM

• Native instruction set

• Event driven execution mapped to event drivent simulator

• Storage model mapped to virtual nodes

• Radio and environmental models

(17)

Overview

samedi 28 janvier 2012

(18)

Issues and Solutions

• Localization

Routing

• Medium Access Control

• Applications

(19)

Localization

samedi 28 janvier 2012

(20)

Localization

Fine-grained

Timing

• Signal strength

• Signal pattern matching

• Directionality

Coarse-grained

(21)

Triangulation

samedi 28 janvier 2012

(22)

Triangulation

C

(23)

Triangulation

A B

C

distance

a b

distance

samedi 28 janvier 2012

(24)

Trilateration

(25)

Trilateration

r 1

samedi 28 janvier 2012

(26)

Trilateration

r 1

r 2

(27)

Trilateration

r 1

r 2

r 3

samedi 28 janvier 2012

(28)

Trilateration

r 1

r 2

r 3

d

(29)

Trilateration

r 1

r 2

r 3

d j

samedi 28 janvier 2012

(30)

Trilateration

r 1

r 2

r 3

d j

i

(31)

Trilateration

r 1

r 2

r 3

d j

i

r 1 2 = x 2 + y 2 + z 2

samedi 28 janvier 2012

(32)

Trilateration

r 1

r 2

r 3

d j

i

r 1 2 = x 2 + y 2 + z 2

r 2 2 = (x − d) 2 + y 2 + z 2

(33)

Trilateration

r 1

r 2

r 3

d j

i

r 1 2 = x 2 + y 2 + z 2

r 3 2 = (x − i) 2 + (y − j ) 2 + z 2 r 2 2 = (x − d) 2 + y 2 + z 2

samedi 28 janvier 2012

(34)

Trilateration

r 1

r 2

r 3

d j

i

(35)

Trilateration

r 1

r 2

r 3

d j

i

x = r 1 2 − r 2 2 + d 2 2d

samedi 28 janvier 2012

(36)

Trilateration

r 1

r 2

r 3

d j

i

x = r 1 2 − r 2 2 + d 2 2d

y = r 1 2 − r 3 2 + (x − i) 2

2j + j

2 + x 2

2j

(37)

Trilateration

r 1

r 2

r 3

d j

i

x = r 1 2 − r 2 2 + d 2 2d

y = r 1 2 − r 3 2 + (x − i) 2

2j + j

2 + x 2 2j z = �

r 1 2 − x 2 − y 2

samedi 28 janvier 2012

(38)

Centroid

(39)

Centroid

samedi 28 janvier 2012

(40)

Centroid

(41)

Routing

samedi 28 janvier 2012

(42)

Routing

Classical flooding

Implosion

Resource management

Negociation based protocols

SPIN

Directed Diffusion

(43)

Negociation Based Protocols

SPIN: Sensor Protocols for Information via Negociation

• Information descriptors for negociation prior to data transmission

• Negociation relates to available energy

samedi 28 janvier 2012

(44)

SPIN

ADV: advertize that new data is available and described

REQ: request to receive data

DATA: actual data

(45)

SPIN-PP

S R

samedi 28 janvier 2012

(46)

SPIN-PP

S R

ADV

(47)

SPIN-PP

S R

ADV

REQ

samedi 28 janvier 2012

(48)

SPIN-PP

S R

ADV

REQ

DATA

(49)

SPIN-EC

S R

samedi 28 janvier 2012

(50)

SPIN-EC

S R

ADV

(51)

SPIN-EC

S R

ADV

REQ

samedi 28 janvier 2012

(52)

SPIN-EC

S R

ADV

REQ

DATA

(53)

SPIN-EC

S R

samedi 28 janvier 2012

(54)

SPIN-EC

S R

ADV

(55)

SPIN-EC

S R

ADV

R

samedi 28 janvier 2012

(56)

SPIN-BC

S

R

R

R

(57)

SPIN-BC

S

R

R R

ADV

ADV

ADV

samedi 28 janvier 2012

(58)

SPIN-BC

S

R

R

R

(59)

SPIN-BC

S

R

R R

REQ REQ

samedi 28 janvier 2012

(60)

SPIN-BC

S

R

R

R

(61)

SPIN-BC

S

R

R R

DATA

DATA DATA

samedi 28 janvier 2012

(62)

SPIN-BC

S

R

R

R

(63)

Directed Diffusion

• Destination-initiated (sink) reactive routing technique

• Tasks are described by attribute-value pairs (interests)

• All nodes maintain interest cache for each requested interest

samedi 28 janvier 2012

(64)

Interests

item name value

type four-legged animal

interval 20 ms

duration 10 s

rect [-100, 100, 200, 400]

(65)

Returned Data

item name value

type four-legged animal instance [125, 220]

intensity 0.6

confidence 0.85

timestamp 01:20:40

samedi 28 janvier 2012

(66)

Directed Diffusion

N

N

N

N N

(67)

Directed Diffusion

S N

N

N

N N

N

samedi 28 janvier 2012

(68)

Directed Diffusion

N

N

N

N N

(69)

Directed Diffusion

S N

N

N

N N

N

samedi 28 janvier 2012

(70)

Directed Diffusion

N

N

N

N N

(71)

Directed Diffusion

S N

N

N

N N

N

samedi 28 janvier 2012

(72)

Directed Diffusion

N

N

N

N N

(73)

Directed Diffusion

S N

N

N

N N

N

samedi 28 janvier 2012

(74)

Interest Cache

• Periodically purged

• No information about sink

• Gradient table

rate per neighbor

timestamp

expiration

(75)

Interest Forwarding

• When new received, add to cache

• Simplest policy: rebroadcast interest

• No way of distinguishing new interests from repeated ones

• Set up (very low rate) gradients between all neighbors

• Must distinguish between neighbors

samedi 28 janvier 2012

(76)

Message propagation

• A node matching an interest generates replies at desired rate

• When receiving a reply, lookup interest cache

• Forward along given route(s) if found, drop otherwise

• Loop prevention

(77)

Directed Diffusion

S E

N

N

N N

N

samedi 28 janvier 2012

(78)

Directed Diffusion

E

N

N

N N

(79)

Directed Diffusion

S E

N

N

N N

N

samedi 28 janvier 2012

(80)

Directed Diffusion

E

N

N

N N

(81)

Directed Diffusion

S E

N

N

N N

N

samedi 28 janvier 2012

(82)

Directed Diffusion

E

N

N

N Reinforcement N

request

(83)

Directed Diffusion

S E

N

N

N N

N

Reinforcement request

samedi 28 janvier 2012

(84)

Directed Diffusion

E

N

N

N Reinforcement N

request

(85)

Directed Diffusion

S E

N

N

N N

N

Reinforcement request

samedi 28 janvier 2012

(86)

Directed Diffusion

E

N

N

N Reinforcement N

request

(87)

Reinforcement

• Sink can reissue the same request with a higher rate

• “Draw down” higher quality data from a particular neighbor

• Other nodes react when receiving

• “Outflow” increased, must reinforce another node to increase “inflow”

samedi 28 janvier 2012

(88)

Directed Diffusion

E

N

N

N S

(89)

Directed Diffusion

S E

N

N

N S

N

samedi 28 janvier 2012

(90)

Directed Diffusion

E

N

N

N S

(91)

Directed Diffusion

S E

N

E

N N

N

samedi 28 janvier 2012

(92)

Directed Diffusion

E

N

E

N N

(93)

Directed Diffusion

S E

N

E

N N

N

samedi 28 janvier 2012

(94)

Directed Diffusion

E

N

N

N N

(95)

Directed Diffusion

S E

N

N

N N

N

samedi 28 janvier 2012

(96)

Directed Diffusion

E

N

N

N N

(97)

Directed Diffusion

S E

N

N

N N

N

samedi 28 janvier 2012

(98)

Directed Diffusion

E

N

N

N N

(99)

Directed Diffusion

S E

N

N

N N

N

samedi 28 janvier 2012

(100)

Directed Diffusion

Local algorithm policies

Propagating interests

• flood, cache information, GPS

Setting up gradients

• first heard neighbor, highest energy

neighbor

(101)

Directed Diffusion

Local algorithm policies

Data transmission

• single path, striped multi-path, multiple sources, etc.

Reinforcement

• observer losses, resources levels, etc.

samedi 28 janvier 2012

(102)

Energy Aware Routing

• Similar to Directed Diffusion

• destination initiated

• initial flooding to discover routes

• several sub-optimal paths can be used

(with a probabilistic distribution)

(103)

Energy Aware Routing

S E

N

N

N N

N

samedi 28 janvier 2012

(104)

Energy Aware Routing

E

N

N

N N

(105)

Energy Aware Routing

S E

N

N

N N

N

0.3 0.3 0.4

1 1

1

1

1

samedi 28 janvier 2012

(106)

Medium Access

Control

(107)

Classical Approaches

FDMA: Frequency division multiple access

TDMA: Time division multiple access

CDMA: Code division multiple access

CSMA: Carrier sense multiple access

CD: Collision detection

CA: Collision avoidance

samedi 28 janvier 2012

(108)

Classical Approaches

FDMA: Frequency division multiple access

TDMA: Time division multiple access

CDMA: Code division multiple access

CSMA: Carrier sense multiple access

CD: Collision detection

CA: Collision avoidance

One frequency available

(109)

Classical Approaches

FDMA: Frequency division multiple access

TDMA: Time division multiple access

CDMA: Code division multiple access

CSMA: Carrier sense multiple access

CD: Collision detection

CA: Collision avoidance

One frequency available

One code available

samedi 28 janvier 2012

(110)

Classical Approaches

FDMA: Frequency division multiple access

TDMA: Time division multiple access

CDMA: Code division multiple access

CSMA: Carrier sense multiple access

CD: Collision detection

CA: Collision avoidance

One frequency available

One code available

Can’t listen while transmitting

(111)

Hidden Terminal problem

S1 R S2

samedi 28 janvier 2012

(112)

Hidden Terminal problem

S1 R S2

(113)

Hidden Terminal problem

S1 R S2

samedi 28 janvier 2012

(114)

Hidden Terminal problem

S1 R S2

(115)

Hidden Terminal problem

S1 R S2

samedi 28 janvier 2012

(116)

Exposed Terminal Problem

R1 S1 S2 R2

(117)

Exposed Terminal Problem

R1 S1 S2 R2

samedi 28 janvier 2012

(118)

Exposed Terminal Problem

R1 S1 S2 R2

(119)

Exposed Terminal Problem

R1 S1 S2 R2

samedi 28 janvier 2012

(120)

Exposed Terminal Problem

R1 S1 S2 R2

(121)

IEEE 802.11 RTS/CTS

S R

samedi 28 janvier 2012

(122)

IEEE 802.11 RTS/CTS

S R

ADV RTS

(123)

IEEE 802.11 RTS/CTS

S R

ADV

REQ

RTS

CTS

samedi 28 janvier 2012

(124)

IEEE 802.11 RTS/CTS

S R

ADV

REQ

DATA

RTS

CTS

(125)

IEEE 802.11 RTS/CTS

S1 R S2

samedi 28 janvier 2012

(126)

IEEE 802.11 RTS/CTS

S1 R S2

(127)

IEEE 802.11 RTS/CTS

S1 R S2

samedi 28 janvier 2012

(128)

IEEE 802.11 RTS/CTS

S1 R S2

(129)

IEEE 802.11 RTS/CTS

S1 R S2

samedi 28 janvier 2012

(130)

IEEE 802.11 RTS/CTS

S1 R S2

(131)

IEEE 802.11 RTS/CTS

S1 R S2

samedi 28 janvier 2012

(132)

IEEE 802.11 RTS/CTS

S1 R S2

(133)

IEEE 802.11 RTS/CTS

S1 R S2

samedi 28 janvier 2012

(134)

IEEE 802.11 RTS/CTS

R1 S1 S2 R2

(135)

IEEE 802.11 RTS/CTS

R1 S1 S2 R2

samedi 28 janvier 2012

(136)

IEEE 802.11 RTS/CTS

R1 S1 S2 R2

(137)

IEEE 802.11 RTS/CTS

R1 S1 S2 R2

samedi 28 janvier 2012

(138)

IEEE 802.11 RTS/CTS

R1 S1 S2 R2

(139)

IEEE 802.11 RTS/CTS

R1 S1 S2 R2

samedi 28 janvier 2012

(140)

IEEE 802.11 RTS/CTS

R1 S1 S2 R2

(141)

Energy Consumption

Idle Receive Transmit

[1] 1 1.05 1.4

[2] 1 2 2.5

[1] LAN MAN Standards Committee of the IEEE Computer Society, Wireless LAN medium access control (MAC) and

physical layer (PHY) specification.

[2]Mark Stemm and Randy H. Katz, “Measuring and

Reducing Energy Consumption of Network Interfaces in Hand-held Devices”

samedi 28 janvier 2012

(142)

Duty Cycling

Reduces idle listening time

• Sensors switch between sleep and active mode

Suits low traffic networks

• If data rate is very low, it is not necessary to keep sensors listening all the time

(143)

Duty Cycling

Sleeping Listening 1 second

samedi 28 janvier 2012

(144)

Duty Cycling

Sleeping Listening 1 second

Data sampling

(145)

Duty Cycling

Sleeping Listening 1 second

Data sampling

Extra Latency

samedi 28 janvier 2012

(146)

Duty Cycling

Sleeping Listening

Sleeping Listening

A

B

(147)

Duty Cycling

Sleeping Listening

Sleeping Listening

A

B

Message Sending

samedi 28 janvier 2012

(148)

Duty Cycling

Sleeping Listening

Sleeping Listening

A

B

Message Sending Extra Latency

(149)

Duty Cycling

Sleeping Listening

Sleeping Listening

A

B

Sleeping Listening

Listening Sleeping

samedi 28 janvier 2012

(150)

Duty Cycling

Sleeping Listening

A Sleeping Listening

Sleeping Listening

B Sleeping Listening

(151)

Duty Cycling

Sleeping Listening

A Sleeping Listening

Sleeping Listening

B Sleeping Listening

long period

(duty period * #of hops)

samedi 28 janvier 2012

(152)

Time Synchronization

(153)

Time synchronization

Definition: providing a common time scale for local clocks of nodes in the

network

• Stamp event, duration between events, order events

• No global clock of shared memory

samedi 28 janvier 2012

(154)

Time Synchronization

C p (t) = a p t + d p a p : clock frequency

d p : offset

(155)

Remote Clock Reading

B

A T 0 T 1

T B

samedi 28 janvier 2012

(156)

Remote Clock Reading

B

A T 0 T 1

T B

T B (T 1 ) = T B + T 1 − T 0

2

(157)

Time Transmission

B

A

T 1

T 1 T 2

T 2

T n

T n R 1 R 2 R n

samedi 28 janvier 2012

(158)

Time Transmission

B

A

T 1

T 1 T 2

T 2

T n

T n R 1 R 2 R n

T B (R n ) = R n

� 1 n

� n

R i − 1 n

� n

T i

+ d

(159)

Offset Delay Estimation

B

A T 0

T 0

T 1 T 2

T 3

T 0 , T 1 , T 2

samedi 28 janvier 2012

(160)

Offset Delay Estimation

B

A T 0

T 0

T 1 T 2

T 3

T 0 , T 1 , T 2

∆ = (T 1 − T 0 ) − (T 3 − T 2 )

2

(161)

Offset Delay Estimation

B

A T 0

T 0

T 1 T 2

T 3

T 0 , T 1 , T 2

∆ = (T 1 − T 0 ) − (T 3 − T 2 )

2 d = (T 1 − T 0 ) + (T 3 − T 2 ) 2

Drift Offset

samedi 28 janvier 2012

(162)

Set Valued Estimation

B

A T 0

T B

T r

(163)

Set Valued Estimation

B

A T 0

T B

T r

C A (t) = a AB C B (t) + d AB

samedi 28 janvier 2012

(164)

Set Valued Estimation

B

A T 0

T B

T r

(t) = (t) +

T 0 < a AB T B + d AB T r > a AB T B + d AB

(165)

Set Valued Estimation

C A (t)

C B (t)

samedi 28 janvier 2012

(166)

Set Valued Estimation

T 0 1 T r 1

C A (t)

(167)

Set Valued Estimation

T 0 1 T r 1 d AB

d AB

C A (t)

C B (t)

samedi 28 janvier 2012

(168)

Set Valued Estimation

T 0 1 T r 1 d AB

d AB d AB

C A (t)

(169)

Time Synchronization

samedi 28 janvier 2012

(170)

Conclusion

(171)

Sensor Networks

• Driven by applications

• Connexion between Computer Science and Biology, Environment, Rescue, etc.

• Hard problems yet to be solved

samedi 28 janvier 2012

Références

Documents relatifs

the present paper is to prepare binder-free FWCNTs monoliths by spark plasma sintering and to investi- gate the density, presence of defects and porosity.. Materials

We start with data harvesting in sensor networks, where a data ferry (e.g., robot, vehicle) travels across the sensor field and harvests data from sensor nodes while they are

The study attempts to confirm that the students of English Department, Mentouri University of Constantine are not aware of the strategies suggested by the theorists such as

de nœuds, avec un taux d’activité de 0.5 % (à gauche) et un taux d’activité de 1 % (à droite) lorsque la période de génération de trafic est de 5 s, pour les protocoles de

communicating with the Building Information Modelling) which aspires to provide a communicating reinforced concretes, thus, addresses the design and an implementation of

«Su proposta dell’Ufficio studi dei servizi tecnici, nel febbraio 1939, la Nervi &amp; Bartoli è incaricata della costruzione del modello in scala dell’arco e dell’esecuzione

Bagherinia, “A new approach for area coverage problem in Wireless Sensor Networks with hybrid particle swarm optimization and differential evolution algorithms,”

We establish three types of keys for each sensor node according to each type of communication patterns: an individual key shared with the base station, a cluster key shared