1. 1 Sensor Networks and Networked Societies of Artifacts Jose Rolim University of Geneva

2. PERAD 2007Jose Rolim2 Why sensor networks?  Invisible, everywhere computing  Invisible computing: Tiny Embedded Attached …  Everywhere computing: Wireless Dynamic Configurable Remote Access Adapting …  Sensor Networks seems to be the typical example

3. PERAD 2007Jose Rolim3 Definition  “Sensor networks are collections of wirelessly interconnected devices with sensing, computing and communication infrastructure that allow us to instrument, observe, and respond to phenomena in the natural environment and physical infrastructure.”

4. PERAD 2007Jose Rolim4 Some Goals of Pervasive Computing  Invisible technology  Integration of virtual and physical worlds throughout desks, rooms, building, life, society  Take the data out of the information, leaving just an enhanced ability to act

5. PERAD 2007Jose Rolim5 Situated Networking  Makes use of simple shared context:  Space  Time  Proximity  Participation in the context:  Physical  Out here with us  Many small and large places

6. PERAD 2007Jose Rolim6 Difficulties of Pervasive Networking  Network explosion  Impossibility of a centralized management  Network heterogeneity (not only sensors but also laptops, servers, etc..)  The use of adapted standard theoretical models, algorithms and protocols is impossible

7. PERAD 2007Jose Rolim7 Why the Standard Approaches Fail  At the modeling level (ex: limited energy)  At the networking level (ex: scalability)  At the management level (ex: radically distributed)  At the service level (ex: situated nature)

8. PERAD 2007Jose Rolim8 Our aim:  A communication system supporting millions of localized services in an networked society consisting of billions of heterogeneous nodes, intermittently connected and invisible

9. PERAD 2007Jose Rolim9 Issues for sensor networking -1  Technology independent models of sensor networking  Dynamic models of sensor distributed computing  Self-organization in sensor networks  Distributed cost sharing mechanisms  Energy management, balancing and complexity formulation  Models of collaboration and competition for resources

10. PERAD 2007Jose Rolim10 Issues for sensor networking -2  Nature inspired control and adaptation mechanisms  Global impact of the local sensor interactions  Models of ad-hoc deployment  Efficient approach to mobility

11. PERAD 2007Jose Rolim11 Issues for sensor networking -3  Energy aware algorithms and protocols for:  Self configuration, reconfiguration and localization of sensors  Long vs short range algorithms  Resilience and robustness mechanisms  Pervasive communication for routing, interference and congestion control  Achievement of global tasks via local, event driven interactions

12. PERAD 2007Jose Rolim12 How to tackle these issues?  Techniques from TCS  Techniques from Game Theory  Techniques from Natural Computing  Techniques from Networking Information Theory  Techniques from Distributed Computing  Most importantly: integration among those techniques

13. PERAD 2007Jose Rolim13 Techniques from TCS  Examples:  Extended Random Graphs Models  Geometric Approaches  Probabilistic Algorithms  Markov Chains

14. PERAD 2007Jose Rolim14 Techniques from Game Theory  Examples:  Nash Equilibrium  Game Theoretic Methods for Enforcing Cooperation  Security Issues  Evolutionary Game Theory  Reputation Systems

15. PERAD 2007Jose Rolim15 Techniques from Natural Computing  Examples:  Adaptation by evolution  Learning from experience  Evolutionary genetics  Biological networks  Complex ecosystems  Swarm intelligence

16. PERAD 2007Jose Rolim16 Techniques from Distributed Computing  Examples:  Approximate counting  Randomized methods with noisy information  Manets mechanisms- mobility  Obstacle avoidance  Power saving schemes

17. PERAD 2007Jose Rolim17 Example

18. PERAD 2007Jose Rolim18 Example 2

19. PERAD 2007Jose Rolim19 Ex

20. PERAD 2007Jose Rolim20

21. PERAD 2007Jose Rolim21

22. PERAD 2007Jose Rolim22

23. PERAD 2007Jose Rolim23  Energy cost:  Square of distance

24. PERAD 2007Jose Rolim24

25. PERAD 2007Jose Rolim25

26. PERAD 2007Jose Rolim26 The Problem

27. PERAD 2007Jose Rolim27 A distributed algorithm

28. PERAD 2007Jose Rolim28 Illustration

29. PERAD 2007Jose Rolim29 Stability  Markov Chain

30. PERAD 2007Jose Rolim30 Mix of techniques  Theory  Game  Natural computing  Network information  Distributed computing  Mix