Wireless Sensor Networks - PDF Free Download

Wireless Sensor Networks c.buratti@unibo.it +9 051 20 9147 Office Hours: Tuesday 5 pm @ Main Building, third fllor Credits: 6

Protocol Stack Time Synchronization Energy Efficiency Distributed Processing Application Layer Network Layer MAC Layer PHY Layer

Outline 1. Zigbee Upper Layers 2. Zigbee Tree-based Topology. Zigbee Mesh Topology

Outline 1. Zigbee Upper Layers 2. Zigbee Tree-based Topology. Zigbee Mesh Topology 1. AODV-based Mesh 2. Many-to-One Routing. Performance

Mesh Topologies Nodes work in non Beacon-Enabled mode Need of defining a Routing Protocol Zigbee Coordinator ZigBee Router ZigBee End Device Communication links

Zigbee Mesh Topology Based on AODV or Many-to-One The path, P, minimising the total path cost, C(P), is selected C( l) 7, 1 min 4 p s 1 C(P 1 )= 2 Generally, p s =p CON 1 1 C( P) L 1 i 1 C( l i ) 2 C(P 2 )=4

Zigbee Mesh Topology Cost of a generic link: C(l) 7 C( l) 7, 1 min 4 p s 6 5 4 2 Generally, p s =p CON = Prob{P r >= P rmin } 1 105 100 95 90 85 80 P r [dbm]

Zigbee Mesh Topology: AODV

Zigbee Mesh Topology: AODV - RREQ Network Command frame format Route Request Command frame format

Zigbee Mesh Topology: AODV Route Discovery Table Route-Discovery Table entry

Zigbee Mesh Topology: AODV - RREP Route Reply Command frame format

Zigbee Mesh Topology: AODV Routing Table Routing Table Entry

Zigbee: AODV an example ZC 14

Zigbee: AODV an example ZC 15

Zigbee: AODV an example C Route Request Broadcast Packet, sent in an instant randomly and uniformly distributed within a given interval A 0 C C: path cost 7 5 B 2 ZC 16

Zigbee: AODV an example C Route Request Broadcast Packet C: path cost A: PC = 0 + B: PC = 0 + 2 7 A 5 B 0 2 C ZC 17

Zigbee: AODV an example C Route Request Broadcast Packet C: path cost A: PC = 0 + B: PC = 0 + 2 7 A 5 B 2 2 C ZC 18

Zigbee: AODV an example C Route Request Broadcast Packet C: path cost A: PC = 0 + B: PC = 0 + 2 ZC: PC = min 7 + (from A) + 2 (from B) 7 A 5 B 2 C ZC 2 19

Zigbee: AODV an example Route Reply Unicast Packet on the selected path, sent through CSMA/CA C: path cost A: PC = + 7 B: PC = 2 + ZC: PC = min 7 + (from A) + 2 (from B) 7 A 5 B 2 C ZC 20

Outline 1. Zigbee Upper Layers 2. Zigbee Tree-based Topology. Zigbee Mesh Topology 1. AODV-based Mesh 2. Many-to-One Routing. Performance

Zigbee: Many-to-One routing 22

Zigbee: Many-to-One an example ZC 2

Zigbee: Many-to-One an example ZC 24

Zigbee: Many-to-One an example C Many-To-One Route Request. Broadcast Packet C: path cost A C 5 2 7 B 0 ZC 25

Zigbee: Many-to-One an example C Many-To-One Route Request. Broadcast Packet C: path cost A C 5 2 7 B 0 ZC 26

Zigbee: Many-to-One an example C Many-To-One Route Request. Broadcast Packet C: path cost A C 5 2 7 B ZC Each node selects the next-hop toward the ZC 27

Zigbee: Many-to-One an example C C: path cost Many-To-One Route Request. Broadcast Packet A: PC = 0 + 7 B: PC = 0 + 7 7 A 5 B 2 C ZC Each node selects the next-hop toward the ZC 28

Zigbee: Many-to-One an example C Many-To-One Route Request. Broadcast Packet C: path cost A: PC = 0 + 7 B: PC = 0 + C: PC = min 7 + (from A) + 2 (from B) 7 A 5 B 2 C 5 ZC Each node selects the next-hop toward the ZC 29

Zigbee: Many-to-One an example C Many-To-One Route Request. Broadcast Packet C: path cost A: PC = 0 + 7 B: PC = 0 + C: PC = min 7 + (from A) + 2 (from B) 7 A 2 B 2 C 5 ZC Each node selects the next-hop toward the ZC 0

Zigbee: Many-to-One an example ZC sends RREQ If B retransmits RREQ before A A selects B as next hop A C ZC RREQ received by A and B B RREQ A RREQ If A retransmits RREQ before B A selects ZC as next hop 7 2 B 2 Instant of transmission randomly distributed t Selected Paths are affected by MAC randomness ZC 1

Zigbee: Many-to-One source routing If the ZC has to send data to specific nodes in the network Nodes reply to the RREQ with a Route Record packet, where each node in the path includes its network address A 5 2 C 7 B ZC generates a Relay List (Source Routing) ZC

Zigbee: Many-to-One an example Each node finds the path at minimum cost toward the ZC

Zigbee: two options comparison AODV-based routing Limited memory routing tables are an issue Many nodes many broadcasts (route request / route reply) Many-to-One routing Only one route request from Concentrator No routing tables at routers 4

Outline 1. Zigbee Upper Layers 2. Zigbee Tree-based Topology. Zigbee Mesh Topology 1. AODV-based Mesh 2. Many-to-One Routing. Performance

Throughput: Multi-Hop Network Source Destination Source Relay Destination S R1 R2 R D

Throughput: Non BE mode Header = 17 bytes

PER: Non BE mode Header = 17 bytes

Delay: Mesh topology Nodes generate a packet every T q Query-Based (QB) and non QB applications are considered: QB nodes start the CSMA/CA protocol at the same time, that is when they receive the query Non QB nodes generate the packet in an instant that is uniformed and randomly distributed in Tq retransmissions are allowed Node 1 Node 2 Node 1 Node 2 t T q T q

Delay: Scenario

Delay: Data Transfer- from ZC to ZED 0 Sleeping ZED 0 ZED 0 polls ZR every 200 ms Data from ZC to ZED 0 18 bytes; Ack=11 bytes. (1) Data () Data Request ZC ZR 0 ZED 0 (2) Ack (4) Ack (5) Data (6) Ack

Delay: Data Transfer- from ZED 0 to ZC Data from ZED 0 to ZC 45 bytes; Ack=11 bytes. () Data (1) Data ZC ZR 0 ZED 0 (4) Ack (2) Ack

Delay: Results PER QB application No QB application Data from ZC to ZED0 0 0 Data from ZED0 to ZC 8 % 0

Topologies: Scenario 1 - Indoor 48 devices deployed at UNIBO Average number of hops 25 m 25 m

Topologies: Scenario 2 - Warehouse

Topologies: Aims To measure the WiFi coverage Energy detection function: measures the peack of energy received on the channel Frequencies used by the 5 Zigbee networks 4 channels spatially reused 1 6 11 11 12 1 14 15 16 17 18 19 20 21 22 2 24 25 26 f 2412 2425 247 2450 2462 2475 2480 [MHz] 802.11b 802.15.4

Topologies: Scenario 2 - Warehouse 5 Zigbee Mesh Networks using Many-to-One Routing: 4 networks with 48 nodes 1 network with 6 nodes

11 1 6 11 ZC ZC ZC 1 80 m ZC ZC 1 6 11 1 6

Topologies: Scenario 2 - Warehouse

probabilità probabilità Wireless Sensor Networks Topologies: Results Statistics achieved from 5158 samples in 24 hours Statistics path cost Statistics number of hops 0.0 0.50 0.25 0.20 0.15 0.10 0.40 0.0 0.20 0.05 0.10 0.00 6 7 10 1 14 16 17 20 21 2 24 27 28 1 path cost 0.00 1 2 4 5 6 Number of hops

Topologies: Scenario Smart City 24 lamp posts One G gateway Custom TI CC250-based solution 25 m 52

Topologies: Zigbee network IEEE 802.15.4 PHY and MAC Pt = 14 dbm Prmin = -96 dbm Zigbee Many-to-One routing Tree topologies 5

Topologies: Application Data transmitted every 60 s Commands are sent every 60 s 54

Topologies: Results Mean Number of hops 2.500 2.000 1.500 1.000 500 0 1 2 4 5 6 7 8 9 10 11 12 1 14 15 16 17 18 19 20 21 22 2 24 Node ID 55

Topologies: Results 56

Topologies: Results Quasi-stationary environment Are topologies always the same? 57

Numerical Results: distance among topologies Considering each topology as a graph, the distance is defined as the number of basic operations (insert or remove a link, change a node position) needed for a topology to became equal to the other under examination. 1 1 2 2 4 4 58

Numerical Results: topologies 60

Numerical Results: topologies ZC sends RREQ If B retransmits RREQ before A A selects B as next hop A C ZC RREQ received by A and B B RREQ A RREQ If A retransmits RREQ before B A selects ZC as next hop 7 2 B 2 Instant of transmission randomly distributed t Selected Paths are affected by MAC randomness ZC 61

Summing-Up Mesh topologies are more flexible and robust to link failures The average delay is approx. 5 ms per hop Non QB applications (generating asynchronous traffic) perform better than QB applications in terms of packet error rate and delays Topologies are affected by the environment and by MAC randomness

Wireless Sensor Networks www.chiaraburatti.org c.buratti@unibo.it