Communications and Networking Research Group Eytan Modiano Slide 1 Using collision-free scheduling: dream or reality? Eytan Modiano Massachusetts Institute.

Slides:



Advertisements
Similar presentations
A DISTRIBUTED CSMA ALGORITHM FOR THROUGHPUT AND UTILITY MAXIMIZATION IN WIRELESS NETWORKS.
Advertisements

Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 9 Fundamentals.
* Distributed Algorithms in Multi-channel Wireless Ad Hoc Networks under the SINR Model Dongxiao Yu Department of Computer Science The University of Hong.
Successive Interference Cancellation: A Back of the Envelope Perspective Souvik Sen, Naveen Santhapuri, Romit Roy Choudhury, Srihari Nelakuditi.
Special Topics in Wireless Networking: MAC design and cross-layer issues.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
TDMA Scheduling in Wireless Sensor Networks
12.1 Chapter 12 Multiple Access Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Multiple access What if multiple machines are sharing the same link?
SUCCESSIVE INTERFERENCE CANCELLATION IN VEHICULAR NETWORKS TO RELIEVE THE NEGATIVE IMPACT OF THE HIDDEN NODE PROBLEM Carlos Miguel Silva Couto Pereira.
Topology Control for Effective Interference Cancellation in Multi-User MIMO Networks E. Gelal, K. Pelechrinis, T.S. Kim, I. Broustis Srikanth V. Krishnamurthy,
12.1 Chapter 12 Multiple Access Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
1 Crosslayer Design for Distributed MAC and Network Coding in Wireless Ad Hoc Networks Yalin E. Sagduyu Anthony Ephremides University of Maryland at College.
Computer Communication1 Computer Communications Summary.
Panel 1 - Using collision- free scheduling: dream or reality? Tara Javidi USC Invited Workshop on Theory & Practice in Wireless Networks Los Angeles, CA,
CS541 Advanced Networking 1 Wireless Mesh Networks Neil Tang 1/26/2009.
Wireless Communication Networks Tzu-Chieh Tsai Department of Computer Science National Cheng-Chi University.
Wireless Network Design for Distributed Control Liu and Goldsmith - Appeared at CDC 2004 Presented by Vinod Namboodiri.
CS541 Advanced Networking 1 Basics of Wireless Networking Neil Tang 1/21/2009.
Wireless & Mobile Networking: Multiple Radio Access Azizol Bin Abdullah (A2.04) Rujukan: Text Book Chapter 6.
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.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 7th Lecture Christian Schindelhauer.
Optical CDMA  Electrical  EE566: Optical Communication Optical CDMA Presented by: George Partasides
Researches in MACS Lab Prof. Xiaohua Jia Dept of Computer Science City University of Hong Kong.
1 TDMA Scheduling in Competitive Wireless Networks Mario CagaljHai Zhan EPFL - I&C - LCA February 9, 2005.
Computer Communication1 Computer Communications Summary.
Adaptive Instantiation of the Protocol Interference Model in Mission-Critical Wireless Networks Xin Che, Xiaohui Liu, Xi Ju, Hongwei Zhang Computer Science.
Medium Access Control Sublayer
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
Fikret Sivrikaya Contention-Free MAC Protocols for Wireless Sensor Networks 1 Presented by Fikret Sivrikaya Joint work with Costas Busch, Malik Magdon-Ismail,
A Cooperative Diversity- Based Robust MAC Protocol in wireless Ad Hoc Networks Sangman Moh, Chansu Yu Chosun University, Cleveland State University Korea,
: Data Communication and Computer Networks
جلسه دهم شبکه های کامپیوتری به نــــــــــــام خدا.
DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad- Hoc Networks Injong Rhee (with Ajit Warrier, Jeongki Min, Lisong Xu) Department of Computer.
Power Save Mechanisms for Multi-Hop Wireless Networks Matthew J. Miller and Nitin H. Vaidya University of Illinois at Urbana-Champaign BROADNETS October.
The Case for Addressing the Limiting Impact of Interference on Wireless Scheduling Xin Che, Xi Ju, Hongwei Zhang {chexin, xiju,
Layer 2 Technologies At layer 2 we create and transmit frames over communications channels Format of frames and layer 2 transmission protocols are dependent.
Covilhã, 30 June Atílio Gameiro Page 1 The information in this document is provided as is and no guarantee or warranty is given that the information is.
4: DataLink Layer1 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single wire, e.g. PPP, SLIP) r broadcast (shared wire.
Advanced Communication Network Joint Throughput Optimization for Wireless Mesh Networks R 戴智斌 R 蔡永斌 Xiang-Yang.
Data Communications, Kwangwoon University12-1 Chapter 12. Multiple Access 1.Random Access 2.Controlled Access 3.Channelization.
X. Li, W. LiuICC May 11, 2003A Joint Layer Design Smart Contention Resolution Random Access Wireless Networks With Unknown Multiple Users: A Joint.
IEEE Communications Magazine February 2006 Stefan Parkvall, Eva Englund, Magnus Lundevall, and Johan Torsner, Ericsson Research 2015/12/31.
Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.
Medium Access Control protocols for ad hoc wireless networks: A survey 指導教授 : 許子衡 報告者 : 黃群凱.
CS3502: Data and Computer Networks Local Area Networks - 1 introduction and early broadcast protocols.
5: DataLink Layer 5a-1 Multiple Access protocol. 5: DataLink Layer 5a-2 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single.
1 Decentralized Power Control for Random Access with Multi-User Detection Department of Electronic Engineering City University of Hong Kong December 27,
A Multi-Channel CSMA MAC Protocol with Receiver Based Channel Selection for Multihop Wireless Networks Nitin Jain, Samir R. Das Department of Electrical.
A Perspective on Network Interference and Multiple Access Control Michael J. Neely University of Southern California May 2008 Capacity Region 
Wireless Mesh Networks Myungchul Kim
Cooperative Communication
Multicast Scaling Laws with Hierarchical Cooperation Chenhui Hu, Xinbing Wang, Ding Nie, Jun Zhao Shanghai Jiao Tong University, China.
DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad-Hoc Networks Injong Rhee (with Ajit Warrier, Jeongki Min, Lisong Xu) Department of Computer.
Predictable Wireless Networking for Real-Time Sensing and Control Hongwei Zhang  Hongwei Zhang, October.
Discovering Sensor Networks: Applications in Structural Health Monitoring Summary Lecture Wireless Communications.
WOMEN Project W ireless 8 O 2.16 M ulti-antenna m E sh N etworks University of Roma “La Sapienza” + University of Roma “Tor Vergata” University of Napoli.
Medium access in “new” contexts: Are we reinventing the wheel? Koushik Kar ECSE Department Rensselaer Polytechnic Institute, Troy, NY
UNIT 3 MULTIPLE ACCESS Adapted from lecture slides by Behrouz A. Forouzan © The McGraw-Hill Companies, Inc. All rights reserved.
2. Data Link Layer: Medium Access Control. Scheduling.
Bridging the Gap: A Deterministic Model for Wireless Links David Tse Wireless Foundations U.C. Berkeley NSF Wireless Networks Workshop Aug 27, 2007 TexPoint.
Contention-based protocols with Reservation Mechanisms
Channel Allocation (MAC)
Communication Networks NETW 501
Chapter 13 Multiple Access
Chapter 13 Multiple Access
Multiple Access Control (MAC) Protocols
Is Random Access Fundamentally Inefficient?
Chapter 12 Media Access Control (MAC)
Satellite Packet Communications A UNIT -V Satellite Packet Communications.
Presentation transcript:

Communications and Networking Research Group Eytan Modiano Slide 1 Using collision-free scheduling: dream or reality? Eytan Modiano Massachusetts Institute of Technology

Communications and Networking Research Group Eytan Modiano Slide 2 Some thoughts… 1) A bit of history 2) What do we mean by “collision free”? 3) Impact of new physical layer models 4) Issues with “collision free” scheduling 5) Issues with random access approaches

Communications and Networking Research Group Eytan Modiano Slide 3 History (from a practical perspective) Early work on wireless networks focused on random access and its variants –Packet radio ’s, aloha, CSMA, etc. Most systems in practice did not use random access –Military wireless system: EPLRS, SINCGARS, JTRS are TDMA based Most commercial wireless data systems are “collision free” –CDMA or TDMA systems –Random access often used for control channel signaling … and then of course there is

Communications and Networking Research Group Eytan Modiano Slide 4 What is collision free? Simple model: simultaneous transmissions interfere and fail –Provides the basis for Aloha, CSMA, etc. –Much of the work on “collision free” scheduling assumes simple interference models Primary interference, secondary interference, interference sets, etc. Goal to activate a set of links that do not “interfere” In reality interference can be a “soft” notion –Power and data rate can be controller to deal with interference –No such thing as a collision –No such thing as “collision free” –Need to consider SINR based models Communicate in the presence of interference Simple “collision” and “collision-free” models are useful for developing guiding principles, intuition, algorithms, etc.

Communications and Networking Research Group Eytan Modiano Slide 5 Impact of new (more sophisticated) physical layer models SINR-based models –“soft” notion of a link –Power and rate control Multi-user decoding –Reduce or eliminate interference Multi-channel and multi-radio capabilities –How would a random access protocol work in this context? MIMO systems Sophisticated physical layer techniques can significantly increase system capacity - but will also be more complex to implement –Added cost of “scheduling” may be relatively small

Communications and Networking Research Group Eytan Modiano Slide 6 Collision-free scheduling E.g., TDMA-based systems –“non-interfering” links are activated according to some scheduling algorithm –Max-weight scheduling (Tassiulas/Ephremides) –Rate-based scheduling (e.g., Hajek and Sasaki) Issues: –What does it mean for two links to be non-interfering? –How do we determine which links do not interfere? –How do we deal with time-varying channels? mobility? –Complexity of scheduling algorithms? –Distributed implementations? Finding an optimal scheduling scheme may be impractical - but very simple suboptimal schemes exist that may outperform random access –Especially for multi-hop networks

Communications and Networking Research Group Eytan Modiano Slide 7 Random Access Random access is relatively simple is out there Issues: –Performance in multi-hop setting –How to provide QoS guarantees Hybrid Schemes –Schedule at high loads –Random access at Low loads –Random access for control signaling