Pouya Ostovari, Jie Wu, and Abdallah Khreishah

Slides:

Advertisements

Similar presentations

* Distributed Algorithms in Multi-channel Wireless Ad Hoc Networks under the SINR Model Dongxiao Yu Department of Computer Science The University of Hong.

Advertisements

Delay Analysis and Optimality of Scheduling Policies for Multihop Wireless Networks Gagan Raj Gupta Post-Doctoral Research Associate with the Parallel.

Pouya Ostovari and Jie Wu Computer and Information Sciences

Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.

Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.

Tufts Wireless Laboratory Tufts University School Of Engineering Energy-Efficient Structuralized Clustering for Sensor-based Cyber Physical Systems Jierui.

Fair Real-time Traffic Scheduling over A Wireless Local Area Network Maria Adamou, Sanjeev Khanna, Insup Lee, Insik Shin, and Shiyu Zhou Dept. of Computer.

QoS Routing using Clustering with Interference Considerations Admission Control Motivation Simulation  We study QoS Routing using clustering with interference.

1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 21st Lecture Christian Schindelhauer.

Deployment of Surface Gateways for Underwater Wireless Sensor Networks Saleh Ibrahim Advising Committee Prof. Reda Ammar Prof. Jun-Hong Cui Prof. Sanguthevar.

LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.

A Preferred Link Based Multicast Protocol for Wireless Mobile Ad hoc Networks R. S. Sisodia, Karthigeyan. I, B. S. Manoj, and C. Siva Ram Murthy ICC 2003.

Mario Čagalj supervised by prof. Jean-Pierre Hubaux (EPFL-DSC-ICA) and prof. Christian Enz (EPFL-DE-LEG, CSEM) Wireless Sensor Networks:

1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:

Election Algorithms and Distributed Processing Section 6.5.

Efficient and Reliable Broadcast in ZigBee Networks Purdue University, Mitsubishi Electric Lab. To appear in SECON 2005.

Steady and Fair Rate Allocation for Rechargeable Sensors in Perpetual Sensor Networks Zizhan Zheng Authors: Kai-Wei Fan, Zizhan Zheng and Prasun Sinha.

SOS: A Safe, Ordered, and Speedy Emergency Navigation Algorithm in Wireless Sensor Networks Andong Zhan ∗ †, Fan Wu ∗, Guihai Chen ∗ ∗ Shanghai Key Laboratory.

2008/2/191 Customizing a Geographical Routing Protocol for Wireless Sensor Networks Proceedings of the th International Conference on Information.

A Study of Live Video Streaming over Highway Vehicular Ad hoc Networks Meenakshi Mittal ©2010 International Journal of Computer Applications ( )Volume.

June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.

Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.

RELAX : An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks Bashir Yahya, Jalel Ben-Othman University of Versailles, France ICC.

On Reducing Broadcast Redundancy in Wireless Ad Hoc Network Author: Wei Lou, Student Member, IEEE, and Jie Wu, Senior Member, IEEE From IEEE transactions.

A Low-Latency and Energy-Efficient Algorithm for Convergecast in Wireless Sensor Networks Authors Sarma Upadhyayula, Valliappan Annamalai, Sandeep Gupta.

Broadcast Scheduling in Mobile Ad Hoc Networks ——Related work and our proposed approach By Group 4: Yan Qiao, Yilin Shen, Bharat C. and Zheng Li Presenter:

An Energy-Efficient Voting-Based Clustering Algorithm for Sensor Networks Min Qin and Roger Zimmermann Computer Science Department, Integrated Media Systems.

4 Introduction Broadcasting Tree and Coloring System Model and Problem Definition Broadcast Scheduling Simulation 6 Conclusion and Future Work.

Chih-Min Chao and Yao-Zong Wang Department of Computer Science and Engineering National Taiwan Ocean University, Taiwan IEEE WCNC 2010 A Multiple Rendezvous.

Rate-Based Channel Assignment Algorithm for Multi-Channel Multi- Rate Wireless Mesh Networks Sok-Hyong Kim and Young-Joo Suh Department of Computer Science.

Delivery ratio-maximized wakeup scheduling for ultra-low duty-cycled WSNs under real-time constraints Fei Yang, Isabelle Augé-Blum National Institute of.

Aggregation and Secure Aggregation. Learning Objectives Understand why we need aggregation in WSNs Understand aggregation protocols in WSNs Understand.

Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +

A Pseudo Random Coordinated Scheduling Algorithm for Bluetooth Scatternets MobiHoc 2001.

A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.

TreeCast: A Stateless Addressing and Routing Architecture for Sensor Networks Santashil PalChaudhuri, Shu Du, Ami K. Saha, and David B. Johnson Department.

Mobility Increases the Connectivity of K-hop Clustered Wireless Networks Qingsi Wang, Xinbing Wang and Xiaojun Lin.

Connected Point Coverage in Wireless Sensor Networks using Robust Spanning Trees IEEE ICDCSW, 2011 Pouya Ostovari Department of Computer and Information.

1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),

Aggregation and Secure Aggregation. [Aggre_1] Section 12 Why do we need Aggregation? Sensor networks – Event-based Systems Example Query: –What is the.

Introduction Wireless Ad-Hoc Network  Set of transceivers communicating by radio.

Reliable Mobicast via Face- Aware Routing Qingfeng Huang,Chenyang Lu and Gruia-Catalin Roman Department of Computer Science and Engineering Washington.

1 Along & across algorithm for routing events and queries in wireless sensor networks Tat Wing Chim Department of Electrical and Electronic Engineering.

Hiding Contextual Information in WSNs Alejandro Proaño and Loukas Lazos Dept. of Electrical and Computer Engineering University of Arizona.

Pouya Ostovari and Jie Wu Computer & Information Sciences

PROJECT DOMAIN : NETWORK SECURITY Project Members : M.Ananda Vadivelan & E.Kalaivanan Department of Computer Science.

Towards Optimal Sleep Scheduling in Sensor Networks for Rare-Event Detection Qing Cao, Tarek Abdelzaher, Tian He, John Stankovic Department of Computer.

Sensor Networks Katia Obraczka Winter 2005 MAC II

Universal Opportunistic Routing Scheme using Network Coding

Computing and Compressive Sensing in Wireless Sensor Networks

MMLAB NETWORK SEMINAR Tree-Based Data Broadcast in IEEE and ZigBee Networks Written by Gang Ding(Purdue Univ.), Zafer Sahinoglu(MERL), Philip.

Switching and Forwarding Bridges and Extended LANs

Jan 2017 report.

任課教授：陳朝鈞教授學生：王志嘉、馬敏修

FlowMap Algorithm Perform clustering on the following 2-bounded network Intra-cluster and node delay = 0, inter-cluster = 1 Pin constraint = 3 Practical.

En Wang 1,2 , Yongjian Yang 1 , and Jie Wu 2

Research: algorithmic solutions for networking

Multi-hop Coflow Routing and Scheduling in Data Centers

A Survey on Routing Protocols for Wireless Sensor Networks

Topology Control and Its Effects in Wireless Networks

Localized Scheduling for End-to-End Delay

Throughput-Optimal Broadcast in Dynamic Wireless Networks

Introduction Wireless Ad-Hoc Network

Memory Management Algorithms Huan Liu, Damon Mosk-Aoyama

ADVISOR : Professor Yeong-Sung Lin STUDENT : Hung-Shi Wang

Javad Ghaderi, Tianxiong Ji and R. Srikant

Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks

Guaranteed Services for Mesh

On Constructing k-Connected k-Dominating Set in Wireless Networks

Presentation transcript:

Deadline-aware Broadcasting in Wireless Networks with Local Network Coding Pouya Ostovari, Jie Wu, and Abdallah Khreishah Computer & Information Sciences Department, Temple University, USA

Alice and Bob (No coding) X Y Alice R Bob Y X 4 transmissions

Alice and Bob (Coding) X Y Alice R Bob X+Y 3 transmissions

Deadline-Aware Broadcasting X: Generation : slot 1 Deadline: 6 Y: Generation: slot 3 Deadline: 6 Z: Generation: slot 5 Deadline: 7 X Y 1 2 3 4 5 Z

Deadline-Aware Broadcasting X: Generation : slot 1 Deadline: 6 Y: Generation: slot 3 Deadline: 6 Z: Generation: slot 5 Deadline: 7 X Y X 1 2 Z X Y Z Y 3 3 transmissions by the relay node No deadline misses Without waiting Z X Y X Y 4 5 Z Z Time slot 4 Time slot 6 Time slot 1 Time slot 2 Time slot 3 Time slot 7 Time slot 5

Deadline-Aware Broadcasting X: Generation : slot 1 Deadline: 6 Y: Generation: slot 3 Deadline: 6 Z: Generation: slot 5 Deadline: 7 X Y X 1 X+Y+Z 2 Z X Y 1 transmissions by the relay node Deadline misses 3 Waiting time=4 Z X X+Y+Z Y 4 5 Z Z Time slot 7 Time slot 2 Time slot 1 Time slot 3 Time slot 4 Time slot 5 Time slot 6

Deadline-Aware Broadcasting X: Generation : slot 1 Deadline: 6 Y: Generation: slot 3 Deadline: 6 Z: Generation: slot 5 Deadline: 7 X Y Z 1 X 2 X+Y X+Y X Y Z 3 2 transmissions by the relay node No deadline misses Waiting time=2 Z X Y 4 5 X+Y X+Y Z Z Time slot 6 Time slot 4 Time slot 1 Time slot 2 Time slot 3 Time slot 5 Time slot 7

Setting All-to-all broadcast Perfect links MIMO capability Two-hop local information Objective: minimizing the number of transmissions Constraint: Each packet has a deadline to be received by all nodes.

High Level Approach Selecting forwarder nodes Any deterministic forwarding method Partial Dominant Pruning Calculating waiting time of each packet at relay nodes Velocity based waiting time Proportional distribution of waiting time Random waiting time

Partial Dominant Pruning (PDP) (W. Lou and J. Wu, 2002) The source node selects a subset of its neighbors such that they cover two-hop neighbors of the source. Two-hop local information The source add the forwarder list to the packets. Each forwarder node performs the same instruction.

Velocity-Based Waiting Time Current time Remaining time of packet i at node j Deadline of packet i Extra time of packet i at node j Maximum remaining hop of packet i at node j Waiting time of packet i at node j 𝑆 1 =1 4 Time slot=2 Time slot=1 𝐷 1 =7 3 5 6 1 2 7 𝑊 1,2 =0 𝑅 1,3 =7−2=5 𝑆 4 =3 𝐸 1,3 =5−1=4 𝐷 4 =8 𝑊 1,3 =4

Velocity-Based Waiting Time Current time Remaining time of packet i at node j Deadline of packet i Extra time of packet i at node j Maximum remaining hop of packet i at node j Waiting time of packet i at node j 𝑆 1 =1 4 Time slot=3 Time slot=4 𝐷 1 =7 3 5 6 1 2 7 𝑊 1,7 = 7−3 −1 1 𝑊 4,5 =0 𝑆 4 =3 𝑊 4,3 = 8−4 −1 1 =3 𝐷 4 =8

Velocity-Based Waiting Time Current time Remaining time of packet i at node j Deadline of packet i Extra time of packet i at node j Maximum remaining hop of packet i at node j Waiting time of packet i at node j 𝑆 1 =1 4 Time slot=6 Time slot=5 𝐷 1 =7 3 5 6 1 2 7 𝑊 4,6 =0 𝑆 4 =3 𝑊 4,7 = 8−6 −1 1 =1 𝐷 4 =8

Velocity-Based Waiting Time Current time Remaining time of packet i at node j Deadline of packet i Extra time of packet i at node j Maximum remaining hop of packet i at node j Waiting time of packet i at node j 4 3 5 6 1 2 7

Velocity-Based Waiting Time Algorithm

Coding

Proportional Distribution of Waiting Time More Crossing flows more coding chance Number of flows that pass from node j Average number of passing flows from children nodes of node j in i-th tree

PDWT (Initializing Phase)

PDWT (Running Phase)

Random Waiting Time The deadline should be less than to ensure meeting the deadline. Lower bound: Upper bound: The computed waiting time using the proportional method The extra time of packet i at node j

Random Waiting Time

Simulations VWT: Velocity based Waiting Time PDWT: Proportional Distribution of Waiting Time RWT: Random Waiting Time

Simulations VWT: Velocity based Waiting Time PDWT: Proportional Distribution of Waiting Time RWT: Random Waiting Time M=30, G=60 M=30, G=30

Simulations VWT: Velocity based Waiting Time PDWT: Proportional Distribution of Waiting Time RWT: Random Waiting Time M=30, G=60 M=30, G=30

Summary Deterministic forwarding approach Local network coding PDP Local network coding Delaying forwarding to increase coding opportunities Velocity based waiting time Proportional distribution of waiting time Random waiting time

Questions