Q uantitative E valuation of E mbedded S ystems.

Slides:



Advertisements
Similar presentations
What Is an Ad Hoc Network?
Advertisements

1 A Real-Time Communication Framework for Wireless Sensor-Actuator Networks Edith C.H. Ngai 1, Michael R. Lyu 1, and Jiangchuan Liu 2 1 Department of Computer.
Interconnection Networks: Flow Control and Microarchitecture.
1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
* Distributed Algorithms in Multi-channel Wireless Ad Hoc Networks under the SINR Model Dongxiao Yu Department of Computer Science The University of Hong.
Josh Alcorn Larry Brachfeld An in depth review of ad hoc mobile network & cloud security concerns.
A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks Hwee-Xian TAN and Mun Choon CHAN Department of Computer Science, School of Computing.
L OUISIANA T ECH U NIVERSITY Department of Electrical Engineering and Institute for Micromanufacturing INTRODUCTION PROBLEM FORMULATION STATE FEEDBACK.
Kai Li, Kien Hua Department of Computer Science University of Central Florida.
Geo – Routing in ad hoc nets References: Brad Karp and H.T. Kung “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”, Mobicom 2000 M. Zorzi,
Q uantitative E valuation of E mbedded S ystems Mutual introductions The context of the course: Model Based / Driven Design Organisation of the course.
Defending Against Traffic Analysis Attacks in Wireless Sensor Networks Security Team
The Stagecoach Problem
Researches in MACS Lab Prof. Xiaohua Jia Dept of Computer Science City University of Hong Kong.
Optical Ring Networks Research over MAC protocols for optical ring networks with packet switching. MAC protocols divide the ring bandwidth according to.
TiZo-MAC The TIME-ZONE PROTOCOL for mobile wireless sensor networks by Antonio G. Ruzzelli Supervisor : Paul Havinga This work is performed as part of.
Slotted Programming for Sensor Networks Roland Flury Roger Wattenhofer Distributed Computing Group ETH Zurich, Switzerland D ISTRIBUTED C OMPUTING.
The OSI Model and the TCP/IP Protocol Suite
Modeling Data-Centric Routing in Wireless Sensor Networks Bhaskar Krishnamachari, Deborah Estrin, Stephan Wicker.
Real-Time Scheduling for WirelessHART Networks by Abusayeed Saifullah, You Xu, Chenyang Lu, and Yixin Chen A Presentation of Findings for CSE5095 Joshua.
Q uantitative E valuation of E mbedded S ystems 1.Periodic schedules are linear programs 2.Latency analysis of a periodic source 3.Latency analysis of.
Q uantitative E valuation of E mbedded S ystems QUESTION DURING CLASS?
Fault Tolerant and Mobility Aware Routing Protocol for Mobile Wireless Sensor Network Name : Tahani Abid Aladwani ID :
K. Banerjee, P. Basuchaudhuri, D. Sadhukhan and N. Das
Distributed Computation in MANets Robot swarm developed by James Rice University.
Circuit & Packet Switching. ► Two ways of achieving the same goal. ► The transfer of data across networks. ► Both methods have advantages and disadvantages.
11.5 – Areas of Circles and Sectors. Area of a Circle: A=  r 2.
한국기술교육대학교 컴퓨터 공학 김홍연 Habitat Monitoring with Sensor Networks DKE.
Assignment 4 IP Network and Addressing CSIT 220 Assigned: 10/10/2006 Due: 10/19/2006.
Salah A. Aly,Moustafa Youssef, Hager S. Darwish,Mahmoud Zidan Distributed Flooding-based Storage Algorithms for Large-Scale Wireless Sensor Networks Communications,
Presenter: Abhishek Gupta Dept. of Electrical and Computer Engineering
Collision-free Time Slot Reuse in Multi-hop Wireless Sensor Networks
The 14 th IEEE Real-Time and Embedded Technology and Applications Symposium, April 2008 Real-Time Distributed Discrete-Event Execution with Fault Tolerance.
1 Delay Aware Link Scheduling for Multi- Hop TDMA Wireless Networks Petar Djukic * and Shahrokh Valaee + *University of California +University of Toronto,
1 Mitigate the Bottleneck of Underwater Acoustic Sensor Networks via Priority Scheduling Junjie Xiong, Michael R. Lyu, Kam-Wing Ng.
Q uantitative E valuation of E mbedded S ystems QUESTION DURING CLASS?
An Energy-Efficient and Low-Latency Routing Protocol for Wireless Sensor Networks Antonio G. Ruzzelli, Richard Tynan and G.M.P. O’Hare Adaptive Information.
By:David Cohen & Gadi Gilad Instructor: Boaz Mizrahi Project Midterm Presentation CAN Bus Logger Spring 2011.
Data and Computer Communications Chapter 10 – Circuit Switching and Packet Switching.
Network RS Codes for Efficient Network Adversary Localization Sidharth Jaggi Minghua Chen Hongyi Yao.
Hole Detection and Boundary Recognition in Wireless Sensor Networks Kun-Ying Hsieh ( 謝坤穎 ) Dept. of Computer Science and Information Engineering National.
Turkmen Canli ± and Ashfaq Khokhar* Electrical and Computer Engineering Department ± Computer Science Department* The University of Illinois at Chicago.
TOPICS INTRODUCTION CLASSIFICATION CHARACTERISTICS APPLICATION RELATED WORK PROBLEM STATEMENT OBJECTIVES PHASES.
OSI Model. Open Systems Interconnection (OSI) is a set of internationally recognized, non proprietary standards for networking and for operating system.
GholamHossein Ekbatanifard, Reza Monsefi, Mohammad H. Yaghmaee M., Seyed Amin Hosseini S. ELSEVIER Computer Networks 2012 Queen-MAC: A quorum-based energy-efficient.
DETECTION AND IGNORING BLACK HOLE ATTACK IN VANET NETWORKS BASED LATENCY TIME CH. BENSAID S.BOUKLI HACENE M.K.FAROUAN 1.
COMMUNICATING VIA FIREFLIES: GEOGRAPHIC ROUTING ON DUTY-CYCLED SENSORS S. NATH, P. B. GIBBONS IPSN 2007.
Cooperative Adaptive Partner Selection for Real-Time Services in IEEE j Multihop Relay Networks Cheng-Kuan Hsieh, Jyh-Cheng Chen, Jeng-Feng Weng.
Application Management Editor. Defining Node and Node Capabilities and Functions. MICA2 Monitor Interface Temperature Light Mic pressure Message Node.
親愛的吉姆舅舅: 今天吃完晚餐後,奶奶說,在家 裡情況變好以前,您要我搬到城裡跟 您住。奶奶有沒有跟您說,爸爸已經 好久沒有工作,也好久沒有人請媽媽 做衣服了? 我們聽完都哭了,連爸爸也哭了, 但是媽媽說了一個故事讓我們又笑了。 她說:您們小的時候,她曾經被您追 得爬到樹上去,真的嗎? 雖然我個子小,但是我很強壯,
Image from
Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu
Why does it need? [USN] ( 주 ) 한백전자 Background Wireless Sensor Network (WSN)  Relationship between Sensor and WSN Individual sensors are very limited.
Doc.: IEEE Submission, Slide 1 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [IEEE
9/30/2016 Distributed System Exploration Mirabilis Design Inc.
Configuration for routing example
Chap. 2 Network Models.
Diagnosing Wireless Sensor Networks through Wireless Mobile Nodes
Forwarding and Routing IP Packets
Jan 2017 report.
ADDRESSING Before you can send a message, you must know the destination address. It is extremely important to understand that each computer has several.
'. \s\s I. '.. '... · \ \ \,, I.
Coordination and computation over wireless networks
November 18 July 2008 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: Task Group 4e definitions Date.
Art of Reading Smoke
788.11J Presentation “Robot Navigation using a Sensor Network ”
Routing protocol in all three types of networks - Phase 1
Tarun Banka Department of Computer Science Colorado State University
' '· \ ·' ,,,,
Optimizing Energy Consumption in Wireless Sensor
Presentation transcript:

Q uantitative E valuation of E mbedded S ystems

TDMA in a cyber physical system: preparation for the SDF3 assignment

?

Period = P Slice = S Task = T P-S TP/S

Period = P Slice = S Task = T P-S q qT = rS S/q rr P-(S/q) 0 NEW!! Publication under submission... RTAS 2014 NEW!! Publication under submission... RTAS 2014

Comp. Inner control Physical World Comp. Emergency detection Comp. Image processing

Comp.1 Inner control Comp.2 Emergency detection Comp.3 Image processing

Comp.1 Inner control Comp.2 Emergency detection Comp.3 Image processing p2 p1 p3 p4 p5 p6 p7 p8 p9 p10 p11 p12 p13 p14 p15 p16 p17 p18

Comp. Inner control Comp. Emergency detection Comp. Image processing

Comp. Inner control Comp. Emergency detection Comp. Image processing

Comp.1 Inner control Comp.2 Emergency detection Comp.3 Image processing

Latency 1 L2 L3

Period = P Slice = S Task = T P-S q qT = rS S/q rr P-(S/q) 0

Period = P Slice = S Task = T qT = rS One packet per slice in the network, therefore T = S = 0.01 ms One slice per node in the network But... each node schedules its routing in a TDMA fashion as well... So for each hop P = (C+1)*N*S where C is the number of connections and N is the total number of nodes in the network.

Period = P Slice = S Task = T qT = rS Three computations = three slices, so P = S1 + S2 + S3 Task times may be bigger than slice times! T1 = 0.5 ms T2 = 3 ms T3 = 7 ms It is part of the assignment to figure out how P should be chosen and divided over S1,S2 and S3.

Sensor 1 and 2 produce 1 packet every 2 ms Sensor 3 produces 50 packets every 100 ms Sensor 4 produces 10 packets every 20 ms Computation 1 needs 1 packet from sensor 1 and 2, and produces 1 packet for computation 2 and one for actor 1 Computation 2 takes 50 packets from computation 1 and 1 packet from computation 3 and produces 1 for actors 2 and 3 and for computation 3. Computation 3 takes 50 packets from sensor 3, 50 from sensor 4 and 1 packet from compation 2 and produces 1 for computation 2.

Sensor1 Sensor2 Sensor3 Sensor4 Actuator1 Actuator2 Actuator3 hop1hop2 hop3 hop4 hop5 hop6 hop7 hop8 hop9 hop10 hop11hop12 hop13 hop14 hop15 Comp1 Comp2 Comp ms 100 ms 20 ms