1. UNIVERSITY OF SOUTHERN CALIFORNIA Embedded Networks Laboratory 1 Wireless Sensor Networks Ramesh Govindan ramesh@usc.edu Lab Home Page: http://enl.usc.edu/http://enl.usc.edu/ Personal Home Page: http://cs.usc.edu/~ramesh/http://cs.usc.edu/~ramesh/

2. UNIVERSITY OF SOUTHERN CALIFORNIA Embedded Networks Laboratory 2 The Progress of Technology Platforms with –Processors –Memory (flash, RAM) –Low-power radios –Sensors! »Temperature »Light »Humidity »Acceleration Battery operated

3. UNIVERSITY OF SOUTHERN CALIFORNIA Embedded Networks Laboratory 3 Networked Embedded Sensing Put many of these nodes close to phenomena Network them –Wireless, multi-hop »Deployment becomes easy! Computation and processing is necessarily distributed –Nodes are battery-powered –… and communication requires energy … and likely to stay that way

4. UNIVERSITY OF SOUTHERN CALIFORNIA Embedded Networks Laboratory 4 Application Areas Seismic Structure response Contaminant Transport Marine Microorganisms Ecosystems, Biocomplexity Structural Condition Assessment Computers in the Physical World!

5. UNIVERSITY OF SOUTHERN CALIFORNIA Embedded Networks Laboratory 5 Where are we today?

6. UNIVERSITY OF SOUTHERN CALIFORNIA Embedded Networks Laboratory 6

7. UNIVERSITY OF SOUTHERN CALIFORNIA Embedded Networks Laboratory 7 Sensor Data Logger

8. UNIVERSITY OF SOUTHERN CALIFORNIA Embedded Networks Laboratory 8

9. UNIVERSITY OF SOUTHERN CALIFORNIA Embedded Networks Laboratory 9 Where’s the Computer Science in this? To build a software infrastructure for developing networked embedded sensing applications

10. UNIVERSITY OF SOUTHERN CALIFORNIA Embedded Networks Laboratory 10 An Example Treat a sensor network as a database and use in-network storage. Provide an efficient solution for multi-dimensional range queries. –e.g. List all events whose temperature lies between 70 and 80 and whose light levels are between 10 and 15. Useful for searching and correlating events of interests with multiple attributes. –Drill-down searching, trigger and action, … Fascinating example of the confluence between databases and networking!

11. UNIVERSITY OF SOUTHERN CALIFORNIA Embedded Networks Laboratory 11 Distributed Index for Multi-Dimensional Data (DIM) Functionality –Efficient range query for multidimensional data. Approaches –Divide sensor field into bins. –Locality preserving mapping from m-d space to geographic locations. –Use geographic routing such as GPSR. Assumptions –Nodes know their locations and network boundary –No node mobility E 2 = E 1 = Q 1 =

12. UNIVERSITY OF SOUTHERN CALIFORNIA Embedded Networks Laboratory 12 Building Zones Divide network into zones. Each node mapped to one zone. Encode zones based on division. Each zone has a unique code. Map m-d space to zones. Zones organized into a virtual binary tree. 6 5 1110 1111 4 3 2 1 7 8 10 9 1100111 0110 010 0001 0000 001 10 L  [1/2, 1)L  [0, 1/2) T  [1/2, 1) T  [0, 1/2) L  [0, 1/4) L  [1/4, 1/2)L  [1/2, 3/4) L  [3/4, 1) T  [3/4, 1) T  [1/2, 3/4) T  [1/4, 1/2) T  [0, 1/4) L: Light, T: Temperature

13. UNIVERSITY OF SOUTHERN CALIFORNIA Embedded Networks Laboratory 13 8 6 Virtual Binary Tree 0 1 9 1 0 6 5 1 0 4 1 0 1 0 1 1 0 2 3 1 0 8 1 0 10 7 1 0 1110 1111 L  [1/2, 1) L  [0, 1/4) 110 L  [0, 1/2) 0111 0110 010 T  [1/2, 1) 0001 0000 001 10 T  [0, 1/2) L  [1/4, 1/2)L  [1/2, 3/4) L  [3/4, 1) T  [3/4, 1) T  [1/2, 3/4) T  [1/4, 1/2) T  [0, 1/4) 5 10 4 3 2 9 7 1

14. UNIVERSITY OF SOUTHERN CALIFORNIA Embedded Networks Laboratory 14 Data Insertion Encode events Compute geographic destination Hand to GPSR Intermediate nodes can refine the destination estimation 1110 1111 L  [1/2, 1) L  [0, 1/4) 1 110 L  [0, 1/2) 0111 0110 010 T  [1/2, 1) 0001 0000 001 10 T  [0, 1/2) L  [1/4, 1/2)L  [1/2, 3/4) L  [3/4, 1) T  [3/4, 1) T  [1/2, 3/4) T  [1/4, 1/2) T  [0, 1/4) 2 3 4 5 6 9 8 7 10 E 1 =   Store E 1 L: Light, T: Temperature

15. UNIVERSITY OF SOUTHERN CALIFORNIA Embedded Networks Laboratory 15 Query Split a large query into smaller subqueries. Encode each subquery. Process subqueries separately, resolving locally or forwarding to other nodes based on their codes. 1110 1111 L  [1/2, 1) L  [0, 1/4) 1 110 L  [0, 1/2) 0111 0110 010 T  [1/2, 1) 0001 0000 001 10 T  [0, 1/2) L  [1/4, 1/2)L  [1/2, 3/4) L  [3/4, 1) T  [3/4, 1) T  [1/2, 3/4) T  [1/4, 1/2) T  [0, 1/4) 2 3 4 5 6 9 8 7 10   Q 10 = Q 1 = Q 12 = Q 11 = L: Light, T: Temperature

16. UNIVERSITY OF SOUTHERN CALIFORNIA Embedded Networks Laboratory 16 Implementation on the Motes Use TinyDB Schema Tuple Storage on Flash/RAM –Insertion, deletion, search GPSR implemented with priority-based hop-by-hop reliability –Favor query and reply messages different over other messages. DIM’s components –Zone, Query, Insertion, –Dispatcher ZoneQueryInsertion GPSR Protocol- Independent Routing Shim Flash/ RAM Tuple Storage TinyDB Schema DIM Dispatcher

17. UNIVERSITY OF SOUTHERN CALIFORNIA Embedded Networks Laboratory 17 Some Screenshots