AnyBody: a Self-organization Protocol for Body Area Networks · 2013. 5. 22. · AnyBody @ BodyNets / 11.06.07 / Thomas Watteyne 45 Analysis • extract the radio time of each variant

AnyBody: a Self-organization Protocol for Body Area NetworksThomas Watteyne, Isabelle Augé-Blum,Mischa Dohler, Dominique Barthel

BodyNets conference, 11 June 2007

AnyBody @ BodyNets / 11.06.07 / Thomas Watteyne 2

• Introducing WSNs/BANs

• Related Work

• AnyBody

• Performances


Wireless Sensor Networks

- measuring a physical value

- processing

- wireless communication

• no fixed

infrastructure

• changing topology

• multi-hop

� Application domains military, surveillance, Health, intelligent homes …

Embedded systemEmbedded system

• processing power

• memory

• embedded energy


Sensors …

Telos (2004)

www.moteiv.com

Mica2 (2002)

www.xbow.com Mica2dot (2003)

Smart Dust (???)Cognichip (2007)


…and Applications.

Natural habitat monitoringGreat Duck Island, USA

(Berkeley, 2003)

Area mapping by flying with a R/C helicopter

(Stanford, 2003)

Car tracking, sensors deployed from a R/C plane

(Berkeley, 2001)

Automated meter reading at Sables-d'Olonne

(www.coronis.com, 2006)


Self-Organization: a definition

"Self-organization can be defined as the

emergence of system-wide adaptive structure

and functionality from simple local interactions

between individual entities"

C. Bettstetter


?

Size of a communication range


1. Neighbor discovery

2. Randomly electing clusterheads

3. Forming clusters

4. …

Overview of LEACH


?

Size of a communication range



Connectivity graph


?


7

3

3

9

1

3

5

9

1

4

3

7

3

1 0 8

53

5

7

2. Randomly electing clusterheads

5

• Random number between 0 and 9

• CH if >4


7

3

3

9

1

3

5

9

1

4

3

7

3

1 0 8

53

5

7

5

2. Forming clusters



2. Density calculation

3. Contacting clusterhead

4. Setting up the backbone

5. Setting up the routing paths

Overview of AnyBody



Connectivity graph


?


1

1

1

1

1

1.33

1.5

1

1

1

1

1

1.33

1.5

1.5 1 1

11

1

1.33

Nathalie Mitton, LIFL, France.

2. Density calculation

Number links

Number nodes


1

1

1

1

1

1.33

1.5

1

1

1

1

1

1.33

1.5

1.5 1 1

11

1

1.33

Nathalie Mitton, LIFL, France.

3. Contacting clusterhead

Number links

Number nodes


?



…

…

neighbors

gateway


virtual backbone

Fabrice Théoleyre, LSR, France.



?


5. Setting up the routing paths

Height = 0

Height = 1


Using the network

S

D

D

1. S � CHS

2. CHS � CHX

(gradient)3. CHD � D

Height = 0

Height = 1


��


Performances ?

• Obtained by simulation

• Customized GTSNetS

• IEEE802.11 MAC


AnyBody: setup cost


AnyBody: cluster size


AnyBody: run-time cost


AnyBody vs. LEACH

Number of clusters

Communication range: 150m Communication range: 250m


• AnyBody is a complete self-organization and routing

protocol for Wireless Body Area Networks

• Building clusters and interconnecting them

• Constant number of clusters, unlike LEACH

Conclusion


• Adapting to changes: periodical ? Event-driven ?

• Network capacity, comparing with flat routing protocols

• Cross-layered design for energy-efficiency

• Adapting 1-hopMAC to this work

Open questions and future work

Thanks to Balázs Tirpák, Budapest Tech Polytechnical Institution, Hungary.


Thomas Watteyne

[email protected]

http://perso.citi.insa-lyon.fr/twatteyn/


CC2420

antenna

push

buttonsslide

buttons

cognichip

light

sensor


Planar Graph

No edges cross.

… for example using Gabriel Graph


Planar Graph

(a) Gabriel Graph (b) relative

neighborhood graph

Properties

• no edges cross

• preserves connectivity


Energy consumption radios on/off

• Micax family (www.xbow.com)

• Telos mote, rev. A (www.moteiv.com)

• Telos mote, rev. B a.k.a. t-mote sky (www.moteiv.com)

x104

x16

x10


Berkeley Motes Family


Chipcon CC2500

• hardware preamble sampling support


Right hand rule without planarity

D

H

G F

E


D

H

G F

E

Right hand rule with planarity


1-hopMACvar1

S

A

B

C

REQ

ACK

ACK

ACK

DATA

1.∆t

3.∆t

2.∆t

(fmax-fmin).∆t+TACK

S

A

B

C

REQ

ACK

ACK

ACK

DATA

1.∆t

3.∆t

2.∆t



1-hopMACvar2

S

A

B

C

REQ

ACK

DATA

1.∆t

3.∆t

2.∆t

(fmax-fmin).∆t+d+TACK

S

A

B

C

REQ

ACK

ACK

ACK

DATA

1.∆t

3.∆t

2.∆t



1-hopMACvar3

S

A

B

C

REQ

ACK

DATA

1.∆t

3.∆t

2.∆t


S

A

B

C

REQ

ACK1.∆t

3.∆t

2.∆t


DATA


Analysis

• extract the radio time of each variant

• compare them two-by-two

1. 1-hopMACvar1 always better than 1-hopMACbasic

2. 1-hopMACvar2 better than 1-hopMACvar1 iff first ACK

received before tthresh = fmax.∆t+(2-N)TACK+2d

3. 1-hopMACvar3 always better than 1-hopMACvar2

� 1-hopMACvar3 if first ACK before tthresh

� 1-hopMACvar1 if first ACK after tthresh

Documents

AnyBody: a Self-organization Protocol for Body Area Networks · 2013. 5. 22. · AnyBody @ BodyNets / 11.06.07 / Thomas Watteyne 45 Analysis • extract the radio time of each variant