1 Post Lunch Session Cooperative Strategies and Optimal Scheduling for Tree Networks Alexandre de Baynast †, Omer Gurewitz ‡, Edward W. Knightly ‡ † RWTH.

Slides:



Advertisements
Similar presentations
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 10 User.
Advertisements

February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Interference.
University At Buffalo Capacity Of Ad-Hoc Networks Ajay Kumar.
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Delay Analysis and Optimality of Scheduling Policies for Multihop Wireless Networks Gagan Raj Gupta Post-Doctoral Research Associate with the Parallel.
Analog Network Coding Sachin Katti Shyamnath Gollakota and Dina Katabi.
A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
Madhavi W. SubbaraoWCTG - NIST Dynamic Power-Conscious Routing for Mobile Ad-Hoc Networks Madhavi W. Subbarao Wireless Communications Technology Group.
Peering in Infrastructure Ad hoc Networks Mentor : Linhai He Group : Matulya Bansal Sanjeev Kohli EE 228a Course Project.
NCKU CSIE CIAL1 Principles and Protocols for Power Control in Wireless Ad Hoc Networks Authors: Vikas Kawadia and P. R. Kumar Publisher: IEEE JOURNAL ON.
MIMO-CAST: A CROSS-LAYER AD HOC MULTICAST PROTOCOL USING MIMO RADIOS Soon Y. Oh*, Mario Gerla*, Pengkai Zhao**, Babak Daneshrad** *Computer Science Dept.,
The Impact of Multihop Wireless Channel on TCP Throughput and Loss Presented by Scott McLaren Zhenghua Fu, Petros Zerfos, Haiyun Luo, Songwu Lu, Lixia.
Mobility Increases Capacity In Ad-Hoc Wireless Networks Lecture 17 October 28, 2004 EENG 460a / CPSC 436 / ENAS 960 Networked Embedded Systems & Sensor.
DAC: Distributed Asynchronous Cooperation for Wireless Relay Networks 1 Xinyu Zhang, Kang G. Shin University of Michigan.
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.
Mobility Increases The Capacity of Ad-hoc Wireless Networks By Grossglauser and Tse Gautam Pohare Heli Mehta Computer Science University of Southern California.
Mobile Ad hoc Networks COE 549 Delay and Capacity Tradeoffs II Tarek Sheltami KFUPM CCSE COE 8/6/20151.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Yanyan Yang, Yunhuai Liu, and Lionel M. Ni Department of Computer Science and Engineering, Hong Kong University of Science and Technology IEEE MASS 2009.
Capacity of Ad Hoc Networks Quality of Wireless links Physical Layer Issues The Channel Capacity Path Loss Model and Signal Degradation MAC for.
Elec 599 Report: Modeling Media Access in Embedded Two-Flow Topologies of Multi-hop Wireless Networks Jingpu Shi Advisor: Dr. Edward Knightly Department.
A Fair Scheduling for Wireless Mesh Networks Naouel Ben Salem and Jean-Pierre Hubaux Laboratory of Computer Communications and Applications (LCA) EPFL.
CRANE Project Wireless Networking Demonstration. a)Single-hop transmission b)Multi-hop transmission with a mobile relay node.
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
Efficient Network-Coding-Based Opportunistic Routing Through Cumulative Coded Acknowledgments Dimitrios Koutsonikolas, Chih-Chun Wang and Y. Charlie Hu.
Multihop wireless networks Geographical Routing Karp, B. and Kung, H.T., Greedy Perimeter Stateless Routing for Wireless Networks, in MobiCom Using.
A Fair Scheduling for Wireless Mesh Networks Naouel Ben Salem and Jean-Pierre Hubaux Laboratory of Computer Communications and Applications (LCA) EPFL.
Capacity Scaling with Multiple Radios and Multiple Channels in Wireless Mesh Networks Oguz GOKER.
1 Optimal Power Allocation and AP Deployment in Green Wireless Cooperative Communications Xiaoxia Zhang Department of Electrical.
EE360 PRESENTATION On “Mobility Increases the Capacity of Ad-hoc Wireless Networks” By Matthias Grossglauser, David Tse IEEE INFOCOM 2001 Chris Lee 02/07/2014.
1 11 Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks Gautam Kulkarni, Sachin Adlakha, Mani Srivastava UCLA IEEE Transactions.
Improving Capacity and Flexibility of Wireless Mesh Networks by Interface Switching Yunxia Feng, Minglu Li and Min-You Wu Presented by: Yunxia Feng Dept.
Wireless Network Coding Martin Xu. Outline Introduction New Solutions – COPE – ANC Conclusions.
1 Mobility Increases the Capacity of Ad-hoc Wireless Networks Matthias Grossglauser, David Tse IEEE Infocom 2001 (Best paper award) Oct 21, 2004 Som C.
MARCH : A Medium Access Control Protocol For Multihop Wireless Ad Hoc Networks 성 백 동
1 A Novel Capacity Analysis for Wireless Backhaul Mesh Networks Tein-Yaw David Chung, Kung-Chun Lee, and Hsiao-Chih George Lee Department of Computer Science.
CSE 6590 Fall 2009 Routing Metrics for Wireless Mesh Networks 1 12 November, 2015.
SIMPLE: Stable Increased Throughput Multi-hop Link Efficient Protocol For WBANs Qaisar Nadeem Department of Electrical Engineering Comsats Institute of.
Providing End-to-End Delay Guarantees for Multi-hop Wireless Sensor Networks I-Hong Hou.
Interference in MANETs: Friend or Foe? Andrea Goldsmith
Hangguan Shan, Member, IEEE, Ho Ting Cheng, Student Member, IEEE, and Weihua Zhuang, Fellow, IEEE Cross-Layer Cooperative MAC Protocol in Distributed Wireless.
Exploiting Spectral Reuse in Resource Allocation, Scheduling,and Routing for IEEE Mesh Networks Lien-Wu Chen, Yu-Chee Tseng Department of Computer.
A new Cooperative Strategy for Deafness Prevention in Directional Ad Hoc Networks Andrea Munari, Francesco Rossetto, and Michele Zorzi University of Padova,
CSR: Cooperative Source Routing Using Virtual MISO in Wireless Ad hoc Networks IEEE WCNC 2011 Yang Guan, Yao Xiao, Chien-Chung Shen and Leonard Cimini.
A Multi-Channel Cooperative MIMO MAC Protocol for Wireless Sensor Networks(MCCMIMO) MASS 2010.
Hongkun Li, Yu Cheng, Chi Zhou Illinois Institute of Technology, Chicago, IL, USA IEEE GLOBECOM 2008.
Cooperative Diversity Using Distributed Turbo Codes Bin Zhao and Matthew C. Valenti Lane Dept. of Comp. Sci. & Elect. Eng. West Virginia.
1 M. H. Ahmed and Salama Ikki Memorial University Newfoundland, Canada Chapter 3 To Cooperate or Not to Cooperate? That Is the Question!
Multicast Scaling Laws with Hierarchical Cooperation Chenhui Hu, Xinbing Wang, Ding Nie, Jun Zhao Shanghai Jiao Tong University, China.
Heterogeneous Wireless Access in Large Mesh Networks Haiping Liu, Xin Liu, Chen-Nee Chuah, Prasant Mohapatra University of California, Davis IEEE MASS.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.
Trading Structure for Randomness in Wireless Opportunistic Routing Szymon Chachulski, Michael Jennings, Sachin Katti and Dina Katabi MIT CSAIL SIGCOMM.
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
ComNets, RWTH Aachen University Relays in CDMA2000 Martha Clavijo Chair of Communication Networks RWTH Aachen University, Germany FFV 2007, ,
5/12/2005doc.: IEEE /0334 Submission Ripple: A Distributed Medium Access Protocol for Wireless Mesh Network Presented at the IEEE802.11, ,
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
1 A Coordinate-Based Approach for Exploiting Temporal-Spatial Diversity in Wireless Mesh Networks Hyuk Lim Chaegwon Lim Jennifer C. Hou MobiCom 2006 Modified.
Performance Evaluation of Scheduling in IEEE based Wireless Mesh Networks Bo Han, Weijia Jia,and Lidong Lin Computer Communications, 2007 Mei-zhen.
Routing Metrics for Wireless Mesh Networks
Abdul Kader Kabbani (Stanford University)
The Impact of Multihop Wireless Channel on TCP Performance
Pradeep Kyasanur Nitin H. Vaidya Presented by Chen, Chun-cheng
Multi hop connections using
Multi hop connections using
Multi hop connections using
Presentation transcript:

1 Post Lunch Session Cooperative Strategies and Optimal Scheduling for Tree Networks Alexandre de Baynast †, Omer Gurewitz ‡, Edward W. Knightly ‡ † RWTH Aachen, Germany ‡ Rice University, Houston, TX

2 To develop and analyze a low-complexity cooperative protocol for wireless tree networks that significantly increases the average throughput for any user independently of its position in the tree. Objective

3 Motivation Network approach In a conventional multi-hop routing, each node relays (forwards) its neighbors’ traffic in addition to its own traffic In an upstream traffic each node forwards its successors’ (children’s) traffic along with its own traffic to its predecessor (parent in the tree) e.g., N. Ben Salem and J.P. Hubaux, “A Fair Scheduling for Wireless Mesh Networks”, Proceedings of WiMesh 2005 C. Jaeweon and Z.J. Haas, “On the throughput enhancement of the downstream channel in cellular radio networks through multihop relaying”, IEEE Journal on Selected Areas in Communications, 2004 SD

4 Motivation Information Theory approach Each node broadcasts its traffic, any other node collects the data from all transmissions, decodes it and rebroadcasts it (decodes and forwards). e.g., P. Gupta and P.R. Kumar, “Towards an information theory of large networks: an achievable rate region", IEEE Transactions on Information Theory, 2003 SD

5 Our Solution “Cheap” cooperative strategy When node S is transmitting, nodes R1 AND R2 are listening though R1 only can decode the message. In order to exploit the overheard information, our protocol is designed such that R1 transmits only some extra information to help R2 to decode the message. At least 50% throughput gain! S R1 D R2

6 The Model Network Model m-ary Regular Tree Topology Single Gateway L Layers S-TDMA (block synchronization) All nodes are fully backlogged Interference Model Spatial Reuse Factor F Collision Free

7 The Model Physical Model Half Duplex (Single Radio) Fix Channel Gain for all links No sample synchronization No multi-user detection Decode threshold Interference threshold OSI Model L 2-3 L 1 Channel attenuation vs. distance 6 dB 4 dB

8 Flow Achievable Rate A flow achievable rate is measured by the rate granted to the flow on its bottleneck link S D

9 Flow Achievable Rate A flow achievable rate is measured by the rate granted to the flow on its bottleneck link S D

10 Achievable Rate vs Fairness The achievable rate is determined by the flow that gets the lowest rate S S S D

11 Parking Lot (m=1): Non Cooperative Case Achievable Rate: Single Link Capacity: F hops apart = optimal spatial reuse First F=4 layers fully utilized = Optimal Schedule FN time slots

12 Parking Lot (m=1): Optimal Power Allocation For a given fixed total power P, higher rate can be achieved if the closer nodes transmit with higher power than the farther nodes Achievable Rate: Gain < 25% for any chain size

13 Parking Lot (m=1): Cooperative Case 1 α 1 α 1 1 RELAY (TRP)  =rate of two-hop link / rate of one-hop link < 1 F-1 F F+1

14 Turbo Relay Protocol (TRP) ~ Hop by Hop

15 TRP vs. Conventional Hop by Hop Relaying TRP Parking Lot (m=1): Cooperative Case Achievable Rate: At least 50% throughput gain with TRP

16 m-ary Tree (m>1): Cooperative Case TRP Hop-by-Hop

17 m-ary Tree (m>1): Cooperative Case TRP vs. Conventional Hop by Hop Relaying SNR (dB) Throughput gain (%) m=5 m=4 m=3 m=2 Pathloss exponent = 2; Spatial Reuse = 5 4-QAM Gaussian throughput gain > 90% throughput gain > 60%  100% throughput gain with TRP

18 Conclusion We proposed the Turbo-Relaying Protocol (TRP) to increase each node’s throughput of upstream transmission in tree topologies. We showed that our approach can achieve up to 100% throughput gain over the basic multihop hop-by-hop transmission, for any regular tree with any connectivity degree.

19 Questions

20

21 Turbo Relay Protocol (TRP) ~ Hop by Hop In turbocharged engines, the combustion air is already pre-compressed before being supplied to the engine. The engine aspirates the same volume of air, but due to the higher pressure, more air mass is supplied into the combustion chamber. Consequently, more fuel can be burnt, so that the engine’s power output increases related to the same speed and swept volume