University of Zagreb, Croatia Synchronization inspired by fireflies Iva Bojić University of Zagreb, Croatia Faculty of Electrical Engineering and Computing.

Slides:



Advertisements
Similar presentations
IEEE INFOCOM 2004 MultiNet: Connecting to Multiple IEEE Networks Using a Single Wireless Card.
Advertisements

高度情報化社会を支えるネットワーキング技術 (大阪大学 工学部説明会資料)
* Distributed Algorithms in Multi-channel Wireless Ad Hoc Networks under the SINR Model Dongxiao Yu Department of Computer Science The University of Hong.
Coordination of Multi-Agent Systems Mark W. Spong Donald Biggar Willett Professor Department of Electrical and Computer Engineering and The Coordinated.
Secure Location Verification with Hidden and Mobile Base Stations -TMC Apr, 2008 Srdjan Capkun, Kasper Bonne Rasmussen, Mario Cagalj, Mani Srivastava.
Synchronization.
TDMA Scheduling in Wireless Sensor Networks
Synchronization Chapter clock synchronization * 5.2 logical clocks * 5.3 global state * 5.4 election algorithm * 5.5 mutual exclusion * 5.6 distributed.
1 Sensor Networks and Networked Societies of Artifacts Jose Rolim University of Geneva.
Time Synchronization (RBS, Elson et al.) Presenter: Peter Sibley.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering On-line Alert Systems for Production Plants A Conflict Based Approach.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 15th Lecture Christian Schindelhauer.
Synchronization Clock Synchronization Logical Clocks Global State Election Algorithms Mutual Exclusion.
Topology Control and Mobility Management in Mobile Ad Hoc Networks Fei Dai and JIe Wu Department of Electrical and Computer Engineering North Dakota State.
Performance Comparison of Existing Leader Election Algorithms for Dynamic Networks Mobile Ad Hoc (Dynamic) Networks: Collection of potentially mobile computing.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 13th Lecture Christian Schindelhauer.
August 7, 2003 Sensor Network Modeling and Simulation in Ptolemy II Philip Baldwin University of Virginia Motivation With.
Wireless Sensor Network Security Anuj Nagar CS 590.
EEC-681/781 Distributed Computing Systems Lecture 10 Wenbing Zhao Cleveland State University.
Election Algorithms and Distributed Processing Section 6.5.
Engineering 1040: Mechanisms & Electric Circuits Fall 2011 Introduction to Embedded Systems.
“SDJS: Efficient Statistics in Wireless Networks” Albert Krohn, Michael Beigl, Sabin Wendhack TecO (Telecooperation Office) Institut für Telematik Universität.
1 Physical Clocks need for time in distributed systems physical clocks and their problems synchronizing physical clocks u coordinated universal time (UTC)
Security Considerations for Wireless Sensor Networks Prabal Dutta (614) Security Considerations for Wireless Sensor Networks.
E 2 DTS: An energy efficiency distributed time synchronization algorithm for underwater acoustic mobile sensor networks Zhengbao Li, Zhongwen Guo, Feng.
Wireless Sensor Networks CS 4501 Professor Jack Stankovic Department of Computer Science Fall 2010.
© Oxford University Press 2011 Computer Networks Bhushan Trivedi, Director, MCA Programme, at the GLS Institute of Computer Technology, Ahmadabad.
On Probabilistic Snap-Stabilization Karine Altisen Stéphane Devismes University of Grenoble.
DISTRIBUTED ALGORITHMS Luc Onana Seif Haridi. DISTRIBUTED SYSTEMS Collection of autonomous computers, processes, or processors (nodes) interconnected.
1 System Models. 2 Outline Introduction Architectural models Fundamental models Guideline.
[1] B. Hull, K. Jamieson and H. Balakrishnan, “Mitigating Congestion in Wireless Sensor Networks,” Proceedings of the 2nd International Conference on Embedded.
1 Adaptive QoS Framework for Wireless Sensor Networks Lucy He Honeywell Technology & Solutions Lab No. 430 Guo Li Bin Road, Pudong New Area, Shanghai,
An affinity-driven clustering approach for service discovery and composition for pervasive computing J. Gaber and M.Bakhouya Laboratoire SeT Université.
On Probabilistic Snap-Stabilization Karine Altisen Stéphane Devismes University of Grenoble.
Presented BY:- S.KOTESWARA RAO 09511A0528. INTRODUCTION Bluetooth is wireless high speed data transfer technology over a short range ( meters).
Optimal Power Control, Rate Adaptation and Scheduling for UWB-Based Wireless Networked Control Systems Sinem Coleri Ergen (joint with Yalcin Sadi) Wireless.
Basic logical operations Operation Mechanism Through the combination of circuits that perform these three operations, a wide range of logical circuits.
Tufts Wireless Laboratory School Of Engineering Tufts University “Verifying Noninterference in a Cyber-Physical System – The Advanced Electric Power Grid”
Computer Science Lecture 10, page 1 CS677: Distributed OS Last Class: Naming Name distribution: use hierarchies DNS X.500 and LDAP.
Chapter 17 Challenges & The Future The Future Technologies - what we can do Desires - what we want Emerging Technologies - what we think we can.
Advanced Computer Networks Topic 2: Characterization of Distributed Systems.
CONTI'20041 Event Management in Distributed Control Systems Gheorghe Sebestyen Technical University of Cluj-Napoca Computers Department.
1 Distributed Process Management Chapter Distributed Global States Operating system cannot know the current state of all process in the distributed.
1 Clock Synchronization for Wireless Sensor Networks: A Survey Bharath Sundararaman, Ugo Buy, and Ajay D. Kshemkalyani Department of Computer Science University.
Global Time in Distributed Real-Time Systems Dr. Konstantinos Tatas.
Agenda Fail Stop Processors –Problem Definition –Implementation with reliable stable storage –Implementation without reliable stable storage Failure Detection.
College of Engineering Anchor Nodes Placement for Effective Passive Localization Karthikeyan Pasupathy Major Advisor: Dr. Robert Akl Department of Computer.
Time synchronization for UWSN. Outline Time synchronization knowledge Typical time sync protocol Time sync in UWSN Discussion.
Mohamed Elhawary Computer Science Department Cornell University PERCOM 2008 Zygmunt J. Haas Electrical and Computer Engineering Department Cornell University.
Time This powerpoint presentation has been adapted from: 1) sApr20.ppt.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Security in Wireless Ad Hoc Networks. 2 Outline  wireless ad hoc networks  security challenges  research directions  two selected topics – rational.
Synchronization CSCI 4900/6900. Importance of Clocks & Synchronization Avoiding simultaneous access of resources –Cooperate to grant exclusive access.
A Wakeup Scheme for Sensor Networks: Achieving Balance between Energy Saving and End-to-end Delay Xue Yang, Nitin H.Vaidya Department of Electrical and.
Variable Bandwidth Allocation Scheme for Energy Efficient Wireless Sensor Network SeongHwan Cho, Kee-Eung Kim Korea Advanced Institute of Science and Technology.
CS 3471 CS 347: Parallel and Distributed Data Management Notes13: Time and Clocks.
CS 347Notes 121 CS 347: Parallel and Distributed Data Management Notes12: Time and Clocks Hector Garcia-Molina.
The Sybil attack “One can have, some claim, as many electronic persons as one has time and energy to create.” – Judith S. Donath.
Global Clock Synchronization in Sensor Networks Qun Li, Member, IEEE, and Daniela Rus, Member, IEEE IEEE Transactions on Computers 2006 Chien-Ku Lai.
Ordering of Events in Distributed Systems UNIVERSITY of WISCONSIN-MADISON Computer Sciences Department CS 739 Distributed Systems Andrea C. Arpaci-Dusseau.
A Protocol for Tracking Mobile Targets using Sensor Networks H. Yang and B. Sikdar Department of Electrical, Computer and Systems Engineering Rensselaer.
Time Synchronization in Ad Hoc Networks Kay R¨omer MobiHOC 2001 Speaker : hsiwei.
Distributed Systems Lecture 6 Global states and snapshots 1.
The Biologically Inspired Distributed File System: An Emergent Thinker Instantiation Presented by Dr. Ying Lu.
Ad Hoc Radio Networks Radio Network is a collection of transmitter-receiver devices (denoted as notes). Each node can transmit data to nodes which exist.
Distributed Computing
Distributed Snapshots & Termination detection
Towards Next Generation Panel at SAINT 2002
Connected Sensor Cover Problem
Last Class: Naming Name distribution: use hierarchies DNS
Presentation transcript:

University of Zagreb, Croatia Synchronization inspired by fireflies Iva Bojić University of Zagreb, Croatia Faculty of Electrical Engineering and Computing Department of Telecommunications Summer School of Science 2012 August 7, 2012, Višnjan, Croatia

University of Zagreb, Croatia Round of applause use your hands and move your body 31 October 2015S of 19

University of Zagreb, Croatia Group of people same rhythmus 31 October 2015S of 19

University of Zagreb, Croatia Heterogeneous Machine-to-Machine Systems same time 31 October 2015S of 19

University of Zagreb, Croatia Logical questions can we go home? 31 October How hard it is to synchronize different clocks? 2. Why do we need time synchronization? 3. How can we achieve time synchronization? S of 19

University of Zagreb, Croatia Outline try to give logical answers… Research motivation Biologically-inspired computing Firefly-inspired synchronization Results from the laboratory setting Conclusion 31 October 2015S of 19

University of Zagreb, Croatia Computer clock how does it work?  How is this possible? 31 October 2015 Quartz crystals are manufactured for frequencies from a few tens of kHz to tens of MHz A clock is an electronic device that counts oscillations in a crystal at a particular frequency S of 19

University of Zagreb, Croatia Problem no global notion of time  In distributed systems each node has its own clock and its own notion of time  In practice these clocks drift apart accumulating errors over time (1 second every 11 days) 31 October 2015S of 19

University of Zagreb, Croatia  Global notion of time is prerequisite for:  common resource sharing (e.g. channel)  depend events tracking (e.g. consistency of distributed databases)  simultaneous events detection (e.g. data collection) Need for (speed?) time 31 October 2015 Frequency division multiple accessTime division multiple access S of 19

University of Zagreb, Croatia Time synchronization different algorithms  Time synchronization provides a common time scale for local clocks of nodes in distributed systems B. Sundararaman, U. Buy and A. D. Kshemkalyani: Clock synchronization for wireless sensor networks: A Survey, Ad Hoc Networks 3, pp (2005) 31 October 2015S of 19

University of Zagreb, Croatia Biologically-inspired computing biology applied in distributed systems  Nature is a enormous and a highly complex system  processes are done without any centralized control  processes are self-sustainable and self-organized  Self-organization is a process where some form of global order arises out of the local interactions between the components of an initially disordered system 31 October 2015S of 19

University of Zagreb, Croatia Self-synchronization in nature 31 October 2015S of 19

University of Zagreb, Croatia S Self-synchronization in humans 31 October of 19

University of Zagreb, Croatia  If oscillators are not coupled, their state variables change following only their own excitations  x i denotes state variable x i (t) = f i (t)  t i * denotes a moment when i-th oscillator flashes R. E. Mirollo and S. H. Strogatz. Synchronization of pulse-coupled biological oscillators. SIAM J. Appl. Math. 50: pp (1990) Pulse coupled oscillators model one firefly 31 October 2015S of 19

University of Zagreb, Croatia  If oscillators are coupled  state variable x i is adjusted upon the reception of flashes from the others  x i (t) = f i (t) + ϵ ij g ij (t)  ϵ ij is a coupling constant  g ij (t) is a coupling function between i-th and j-th oscillators R. E. Mirollo and S. H. Strogatz. Synchronization of pulse-coupled biological oscillators. SIAM J. Appl. Math. 50: pp (1990) Pulse coupled oscillators model two fireflies 31 October 2015S of 19

University of Zagreb, Croatia  Pulse coupled oscillators model assumptions faulty  no oscillators with a faulty behavior that desynchronizes the network fully-connected network  oscillators are connected in a fully-connected network mobility  oscillators cannot join or leave the network nor change their positions in the network (i.e. no mobility) same frequencies  oscillators are the same (i.e. have same frequencies) delays  no delays in the message exchange among oscillators Pulse coupled oscillators model limitations 31 October 2015S of 19

University of Zagreb, Croatia  We embedded a cryptographic mechanism in the pulse coupled oscillators model to ensure robustness  We used the logical operation exclusive disjunction (i.e. XOR)  provides protection from an attack  does not have a negative effect on the time needed for synchronization Robustness with oscillators with faulty behavior 31 October 2015S of 19

University of Zagreb, Croatia Results robustness 31 October 2015S of 19

University of Zagreb, Croatia Conclusions can we go home? NOW WE CAN!!!!!!!!!!!!!!!!!!! 31 October How hard it is to synchronize different clocks? 2. Why do we need time synchronization? 3. How can we achieve time synchronization? S of 19

University of Zagreb, Croatia Questions? 31 October 2015S of 19

University of Zagreb, Croatia Summation exclusive disjunction InputOutput AB October 2015S of 19