A Simple Distributed Method for Control over Wireless Networks Authors: Miroslav Pajic, Shereyas Sundaram, George J. Pappas and Rahul Mangharam Presented.

Slides:



Advertisements
Similar presentations
Path Splicing with Network Slicing
Advertisements

Design of a reliable communication system for grid-style traffic light networks Junghoon Lee Dept. of Computer science and statistics Jeju National University.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Tradeoffs between performance guarantee and complexity for distributed scheduling in wireless networks Saswati Sarkar University of Pennsylvania Communication.
Towards a Sensor Network Architecture: Lowering the Waistline Culler et.al. UCB.
Gossip Scheduling for Periodic Streams in Ad-hoc WSNs Ercan Ucan, Nathanael Thompson, Indranil Gupta Department of Computer Science University of Illinois.
A Novel Cluster-based Routing Protocol with Extending Lifetime for Wireless Sensor Networks Slides by Alex Papadimitriou.
1/14 Ad Hoc Networking, Eli M. Gafni and Dimitri P. Bertsekas Distributed Algorithm for Generating Loop-free Routes in Networks With Frequently.
1 ENERGY: THE ROOT OF ALL PERVASIVENESS Anthony Ephremides University of Maryland April 29, 2004.
1 Sensor Networks and Networked Societies of Artifacts Jose Rolim University of Geneva.
Lightweight Key Establishment and Management Protocol (KEMP) in Dynamic Sensor Networks draft-qiu-6lowpan-secure-router-01 Ying QIU, Jianying ZHOU, Feng.
Probabilistic Data Aggregation Ling Huang, Ben Zhao, Anthony Joseph Sahara Retreat January, 2004.
Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks.
Scalable Information-Driven Sensor Querying and Routing for ad hoc Heterogeneous Sensor Networks Maurice Chu, Horst Haussecker and Feng Zhao Xerox Palo.
Sensor Node Architecture Issues Stefan Dulman
Interfaces for Control Components Rajeev Alur University of Pennsylvania Joint work with Gera Weiss (and many others)
7th Biennial Ptolemy Miniconference Berkeley, CA February 13, 2007 PTIDES: A Programming Model for Time- Synchronized Distributed Real-time Systems Yang.
Spring Routing & Switching Umar Kalim Dept. of Communication Systems Engineering 06/04/2007.
1 Distributed Algorithms for Guiding Navigation across a Sensor Network Qun Li, Michael De Rosa, and Daniela Rus Department of Computer Science Dartmouth.
Annarita Giani, UC Berkeley Bruno Sinopoli & Aakash Shah, Carnegie Mellon University Gabor Karsai & Jon Wiley, Vanderbilt University TRUST 2008 Autumn.
1 Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment Infocom /12/20.
Special Topics on Algorithmic Aspects of Wireless Networking Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central.
A Distributed Scheduling Algorithm for Real-time (D-SAR) Industrial Wireless Sensor and Actuator Networks By Kiana Karimpour.
A Cooperative Diversity- Based Robust MAC Protocol in wireless Ad Hoc Networks Sangman Moh, Chansu Yu Chosun University, Cleveland State University Korea,
Clustering in Mobile Ad hoc Networks. Why Clustering? –Cluster-based control structures provides more efficient use of resources for large dynamic networks.
WAN technologies and routing Packet switches and store and forward Hierarchical addresses, routing and routing tables Routing table computation Example.
1 11 Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks Gautam Kulkarni, Sachin Adlakha, Mani Srivastava UCLA IEEE Transactions.
By Avinash Sridrahan, Scott Moeller and Bhaskar Krishnamachari.
RT-Link: A Time-Synchronized Link Protocol for Energy-Constrained Multi- hop Wireless Networks Anthony Rowe, Rahul Mangharam and Raj Rajkumar CMU SECON.
Optimal Power Control, Rate Adaptation and Scheduling for UWB-Based Wireless Networked Control Systems Sinem Coleri Ergen (joint with Yalcin Sadi) Wireless.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
A Distributed Clustering Framework for MANETS Mohit Garg, IIT Bombay RK Shyamasundar School of Tech. & Computer Science Tata Institute of Fundamental Research.
June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.
Message-Passing for Wireless Scheduling: an Experimental Study Paolo Giaccone (Politecnico di Torino) Devavrat Shah (MIT) ICCCN 2010 – Zurich August 2.
© Oxford University Press 2011 DISTRIBUTED COMPUTING Sunita Mahajan Sunita Mahajan, Principal, Institute of Computer Science, MET League of Colleges, Mumbai.
Data and Computer Communications Ninth Edition by William Stallings Data and Computer Communications, Ninth Edition by William Stallings, (c) Pearson Education.
1 A Distributed Architecture for Multimedia in Dynamic Wireless Networks By UCLA C.R. Lin and M. Gerla IEEE GLOBECOM'95.
1 SmartGossip: An Adaptive Broadcast Service for Wireless Sensor Networks Presented By Thomas H. Hand Duke University Adapted from: “ SmartGossip: An Adaptive.
Communication Paradigm for Sensor Networks Sensor Networks Sensor Networks Directed Diffusion Directed Diffusion SPIN SPIN Ishan Banerjee
Rendezvous Regions: A Scalable Architecture for Service Location and Data-Centric Storage in Large-Scale Wireless Sensor Networks Karim Seada, Ahmed Helmy.
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.
1 Computer Communication & Networks Lecture 21 Network Layer: Delivery, Forwarding, Routing Waleed.
By Naeem Amjad 1.  Challenges  Introduction  Motivation  First Order Radio Model  Proposed Scheme  Simulations And Results  Conclusion 2.
Joint Power and Channel Minimization in Topology Control: A Cognitive Network Approach J ORGE M ORI A LEXANDER Y AKOBOVICH M ICHAEL S AHAI L EV F AYNSHTEYN.
Using Structured System Theory to Identify Malicious Behavior in Distributed Systems Shreyas Sundaram Department of Electrical and Computer Engineering.
Copyright © 2007 OPNET Technologies, Inc. CONFIDENTIAL - RESTRICTED ACCESS: This information may not be disclosed, copied, or transmitted in any format.
PRIN WOMEN PROJECT Research Unit: University of Naples Federico II G. Ferraiuolo
Review of key networking techniques: –Reliable communication over unreliable channels –Error detection and correction –Medium access control –routing –Congestion.
TDMA scheduling algorithms for WSN Speaker: Chan-Yu Tsai Advisor: Dr. Ho-Ting Wu Date: 2015/5/6.
A Framework for Reliable Routing in Mobile Ad Hoc Networks Zhenqiang Ye Srikanth V. Krishnamurthy Satish K. Tripathi.
UNIT IV INFRASTRUCTURE ESTABLISHMENT. INTRODUCTION When a sensor network is first activated, various tasks must be performed to establish the necessary.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad-Hoc Networks Injong Rhee (with Ajit Warrier, Jeongki Min, Lisong Xu) Department of Computer.
Ben Miller.   A distributed algorithm is a type of parallel algorithm  They are designed to run on multiple interconnected processors  Separate parts.
Superstabilizing Protocols for Dynamic Distributed Systems Authors: Shlomi Dolev, Ted Herman Presented by: Vikas Motwani CSE 291: Wireless Sensor Networks.
18-WAN Technologies and Dynamic routing Dr. John P. Abraham Professor UTPA.
Movement-Based Check-pointing and Logging for Recovery in Mobile Computing Systems Sapna E. George, Ing-Ray Chen, Ying Jin Dept. of Computer Science Virginia.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
Structure-Free Data Aggregation in Sensor Networks.
Distributed cooperation and coordination using the Max-Sum algorithm
Network Dynamics and Simulation Science Laboratory Structural Analysis of Electrical Networks Jiangzhuo Chen Joint work with Karla Atkins, V. S. Anil Kumar,
1 Minimum Interference Algorithm for Integrated Topology Control and Routing in Wireless Optical Backbone Networks Fangting Sun Mark Shayman University.
KAIS T Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks Harshavardhan Sabbineni and Krishnendu Chakrabarty.
Max do Val Machado Raquel A. F. Mini Antonio A. F. Loureiro DCC/UFMG DCC/PUC Minas DCC/UFMG IEEE ICC 2009 proceedings Advisor : Han-Chieh Chao Student.
Optimization-based Cross-Layer Design in Networked Control Systems Jia Bai, Emeka P. Eyisi Yuan Xue and Xenofon D. Koutsoukos.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Why does it need? [USN] ( 주 ) 한백전자 Background Wireless Sensor Network (WSN)  Relationship between Sensor and WSN Individual sensors are very limited.
COMPUTER NETWORKS CS610 Lecture-17 Hammad Khalid Khan.
Tarun Banka Department of Computer Science Colorado State University
Presentation transcript:

A Simple Distributed Method for Control over Wireless Networks Authors: Miroslav Pajic, Shereyas Sundaram, George J. Pappas and Rahul Mangharam Presented by: Raquel Guerreiro Machado

Wireless Networked Control Systems – Distributive – Wireless: dynamics can change operating point and physical dynamics of the closed loops system – Mean Square Stability Wireless Control Network (WCN) – Network as controller – Increases robustness to link failure – Enables system compositionality and scalability Important Concepts

Control Systems PLANT CONTROLLER Sensors Actuators

Networked Control Systems Sensors Actuators Routing Controllers

Wireless Control Networks

No centralized controller Each node maintain a state States stored in nodes are obtained through linear combination of its previous state and neighbors information –Sensors: Plant’s state information –Control nodes: Node’s state Plant’s inputs are computed from the Control node states that are neighbors of the actuators Wireless Control Networks

Plant’s update procedure: Node’s update procedure: Closed-loop system: Wireless Control Networks

Stable Configuration

More realistic system model Link quality modeled as probability of dropping packets Unreliable link modeled as memoryless, discrete, independent and identically distributed random process Robustness to link failures

State update procedure Robustness to link failures

State update procedure Robustness to link failures

The Wireless Control Network: Synthesis and Robustness A simple Distributed Method for Control over Wireless Networks Robustness to link failures

Extract the maximal probability if message drops (p m ) for which there exists a configuration that guarantees MSS Robustness to link failures

Precompute different stabilizing configurations that correspond to all possible choices of k or fewer nodes failing –Each node N k different sets of weights for all neighbors –Should maintain d*N k scalar weights, d = # of neighbors Design WCN so if some nodes fail it remains stable –Stability condition: –So far, can deal with a single node failure Robustness to node failures

Each node transmits exactly once per frame Possible to schedule more than one node per time slot Graph coloring techniques d i is the maximal degree of interference graph Minimum of d i time slots. Communication schedule is static Scheduling Communication

New control loops

Industrial Application

Firefly embedded wireless nodes. –Based on Atmel ATmega bit microcontroller –Chipcon CC2420 IEEE standard-compliant radio transciever Linear iterative procedure implemented as a simple task on top of the nano-RK RTOS Period of WCN task is 80ms The plant was implemented in Simulink For the interface between Simulink and real hardware: National Instruments PCI-6229 Experimental Platform

Experimental Results

WCN robustness to link failures analysis assume independent link failures. Scheme to handle node failures can be applied only if the network topology the requirements for which there exists a stabilizing configuration Assumes the topology of the WCM is specified a priori Limitations and Future Work