Aggressive Synchronous Transmissions with In-network Processing

Slides:



Advertisements
Similar presentations
SoNIC: Classifying Interference in Sensor Networks Frederik Hermans et al. Uppsala University, Sweden IPSN 2013 Presenter: Jeffrey.
Advertisements

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.
Chapter 11 Data Link Control
1 Computer Networks Local Area Networks. 2 A LAN is a network: –provides Connectivity of computers, mainframes, storage devices, etc. –spans limited geographical.
Mac Support for Broadcast-based Ad hoc Forwarding Scheme Ashikur Rahman and Pawel Gburzynski Department of Computing Science University of Alberta
Eric Rozner - ETX.ppt1 A High-Throughput Path Metric for Multi-Hop Wireless Routing Douglas S.J. Couto Daniel Aguayo John Bicket Robert Morris Presented.
Presentation on Osi & TCP/IP MODEL
Enabling Dependable Communication in Cyber-Physical Systems with a Wireless Bus Federico Ferrari PhD Defense October 18, 2013 — Zurich, Switzerland Computer.
Voice over the Dins: Improving Wireless Channel Utilization with Collision Tolerance Xiaoyu Ji Xiaoyu Ji, Yuan He, Jiliang Wang, Kaishun Wu, Ke Yi, Yunhao.
Link Estimation, CTP and MultiHopLQI. Motivation Data Collection needs to estimate the link quality –To select a good link.
Wireless Sensor Networks COE 499 Energy Aware Routing
Influence of Transmission Power on the Performance of Ad Hoc Networks Crystal Jackson SURE 2004.
DEVICES AND COMMUNICATION BUSES FOR DEVICES NETWORK
1 Transport Layer for Mobile Ad Hoc Networks (MANETs) Cyrus Minwalla Maan Musleh COSC 6590.
TOBB ETÜ ELE46/ELE563 Communications Networks Lecture 01 May 6, 2014 Fall 2011 Tuesday 10:30 – 12:20 (310) Thursday 15:30 – 17:20 (372) İsrafil Bahçeci.
1/30 Energy-Efficient Forwarding Strategies for Geographic Routing in Lossy Wireless Sensor Networks Wireless and Sensor Network Seminar Dec 01, 2004.
Link Estimation, CTP and MultiHopLQI. Learning Objectives Understand the motivation of link estimation protocols – the time varying nature of a wireless.
Data and Computer Communications Ninth Edition by William Stallings Data and Computer Communications, Ninth Edition by William Stallings, (c) Pearson Education.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 14.
Decoding Collisions Shyamnath Gollakota Dina Katabi.
Power Control in Wireless Ad Hoc Networks Background An ad hoc network is a group of self configuring wireless nodes that lack infrastructure. Motivation—Power.
Improving Link Quality by Exploiting Channel Diversity in Wireless Sensor Networks Manjunath D, Mun Choon Chan, and Ben Leong National University of Singapore.
Versatile Low Power Media Access for Wireless Sensor Networks Sarat Chandra Subramaniam.
Department of Computer Science and Engineering UESTC 1 RxLayer: Adaptive Retransmission Layer for Low Power Wireless Daibo Liu 1, Zhichao Cao 2, Jiliang.
An Adaptive Energy-Efficient and Low- Latency MAC for Data Gathering in Wireless Sensor Networks Gang Lu, Bhaskar Krishnamachari, and Cauligi S. Raghavendra.
Eighth Edition by William Stallings Chapter 7 – Data Link Control Protocols Data Link Control Protocols need layer of logic above Physical to manage exchange.
Low Power, Low Delay: Opportunistic Routing meets Duty Cycling Olaf Landsiedel 1, Euhanna Ghadimi 2, Simon Duquennoy 3, Mikael Johansson 2 1 Chalmers University.
Cross-Layer Approach to Wireless Collisions Dina Katabi.
Ubiquitous Networks Wakeup Scheduling Lynn Choi Korea University.
TCP OVER ADHOC NETWORK. TCP Basics TCP (Transmission Control Protocol) was designed to provide reliable end-to-end delivery of data over unreliable networks.
Optimization Problems in Wireless Coding Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
Energy-Efficient Protocol for Cooperative Networks.
Wireless and Mobile Networks (ELEC6219) Session 4: Efficiency of a link. Data Link Protocols. Adriana Wilde and Jeff Reeve 22 January 2015.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
Performance Evaluation of Multiple IEEE b WLAN Stations in the Presence of Bluetooth Radio.
DATA LINK CONTROL. DATA LINK LAYER RESPONSIBILTIES  FRAMING  ERROR CONTROL  FLOW CONTROL.
NETWORKING CONCEPTS. STOP AND WAIT FLOW CONTROL simplest form of flow control, After the destination entity receives the frame, it indicates its willingness.
1 Ad-hoc Transport Layer Protocol (ATCP) EECS 4215.
Data Link Layer.
PROJECT DOMAIN : NETWORK SECURITY Project Members : M.Ananda Vadivelan & E.Kalaivanan Department of Computer Science.
Network Models. 2.1 what is the Protocol? A protocol defines the rules that both the sender and receiver and all intermediate devices need to follow,
Network Models. 2.1 what is the Protocol? A protocol defines the rules that both the sender and receiver and all intermediate devices need to follow,
July 12, 2008 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [Increasing Broadcast Reliability] Date.
Distributed Systems CS
Lab 7 – CSMA/CD (Data Link Layer Layer)
Bandwidth Utilization: Multiplexing and Spreading
An Enhancement of WirelessHART Protocol
Data Communications and Networking Pipelined reliable data transfer
One Problem of Reliability In Collaborative Communication System
Ad-hoc Transport Layer Protocol (ATCP)
IOS Network Model 2nd semester
January 2018 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: Time-Split Multiple-Access for interference.
Figure 12.1 Data link layer divided into two functionality-oriented sublayers Networks can be divided into two categories: those using point-to-point.
Hidden Terminal Decoding and Mesh Network Capacity
TCP in Mobile Ad-hoc Networks
A short lesson on wireless connectivity…
TCP in Wireless Ad-hoc Networks
Submission Title: [Reliable Multicast for PAC]
doc.: IEEE <doc#>
CS294-1 Joe Polastre September 9, 2003
Capacity of Ad Hoc Networks
Chapter 11 Data Link Control
CSMA/CN: Carrier Sense Multiple Access with Collision Notification
July 12, 2008 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [Increasing Broadcast Reliability] Date.
Decoding Collisions Shyamnath Gollakota Dina Katabi.
ExOR: Opportunistic Multi-hop routing for Wireless Networks
doc.: IEEE <doc#>
Hongchao Zhou, Xiaohong Guan, Chengjie Wu
doc.: IEEE yy/xxxxr0 Date:
Presentation transcript:

Aggressive Synchronous Transmissions with In-network Processing Beshr Al Nahas Olaf Landsiedel

Goals Try a strategy other than Glossy Capture-based in-network processing Top 3 solutions in 2017, and top 2 this year Low-power wireless communication Flexible: self-forming networks without planning Fault Tolerant: cope with node and link failures Agnostic to communication patterns: One-to-one, one-to-many, many-to-one, many-to-many

Concurrent Wireless Transmissions (of different data) B A C ✔ ✖ Timing: 160us, 3dB Receive stronger signal of concurrent transmissions Preambles overlap: 802.15.4 @2.4GHz: 5 bytes = 160 µs Threshold: roughly 3dB Known as: Capture Effect

Concept Nodes transmit concurrently On receive Capture effect: rx with high probability On receive Process & merge local & received data Transmit if new Feedback: assists convergence All: progress flags to support flow Sinks: ACK flags to ensure delivery Aggressive: retransmit until all sinks acknowledge reception All-to-all communication Synchronous transmissions + in-network processing + capture-effect F D S2 S1 Introduce each figure, axis To CTP and LWB on Twist (90 nodes) Sources Destination Relay F S2 S1 D

Example Scenario F D S2 S1 Network: four nodes Packet: Progress Ack S1 Two sources S1, S2 Forwarder F Destination D Packet: Four progress bits: one for each node Two ACK bits: A1, A2 one for each source Set by the destination Progress Ack S1 F D S2 A1 A2

Example Scenario Progress Ack S1 F D S2 A1 A2 X - X X S1 F D S2 Slot 1 Flag not set TX Success TX Failure X Flag set Flag changed Progress Ack S1 F D S2 A1 A2   X - X  X   S1 F D S2 Slot 1 Slot 2 Slot 3 Slot 4 Slot 5 Slot 6 Slot 7 Slot 8 Node merges flags Destination ack S1

Example Scenario Progress Ack S1 F D S2 A1 A2 X - X X S1 F D S2 Slot 1 Flag not set TX Success TX Failure X Flag set Flag changed Progress Ack S1 F D S2 A1 A2   X - X  X   S1 F D S2 Slot 1 Slot 2 Slot 3 Slot 4 Slot 5 Slot 6 Slot 7 Slot 8 S1 F D S2 Progress flags only: Risk missing data

Reflections: Capture-based vs. Glossy Glossy-based solutions outperform Short slots (0.7 ms) Rx-tx-tx-tx policy  more retransmissions Constructive interference Top 3 solutions in 2017, and top 2 this year

Reflections: Capture-based vs. Glossy Capture-based solution penalizes weak links Longer slots to fit flags & processing (2.6 ms)  less retransmissions RX iff RSSI > noise-sum + 3dB High interference  weak / border-line links Multiple senders with different data  add to noise  break weak links Unlike constructive interference

Questions?? F D S2 S1 Progress Ack S1 F D S2 A1 A2 Beshr Al Nahas Introduce each figure, axis To CTP and LWB on Twist (90 nodes) Beshr Al Nahas Olaf Landsiedel

Low level details Save power: fine-grain duty-cycling Combat interference: hop channel [1] A2: Network-wide Consensus Utilizing the Capture Effect in Low-power Wireless Networks, Beshr Al Nahas, et al, In SenSys’17.