Summer
2011

Cross-layer Design in Wireless Mesh Networks


Computer Science Department
Systems Architecture Group

   
Abstract: The layered networking architecture has been instrumental in the proliferation of communication systems. The success of the layered architecture has been its ability to provide modularity and transparency. The established layered architecture is the result of the specific requirements and capabilities of wired networks that reach back to the 70ies. On the other hand, wireless ad-hoc and mesh networks enable many new and exciting applications, including entertainment networks, sensor networks, smart homes and buildings, and automated highways and factories. These emerging systems will have enormous variation in their device capabilities, network requirements, and application demands, giving rise to significant wireless network design challenges. However, optimizing within the conventional layers is generally insufficient to provide the optimal performance for next-generation wireless networks. Hence, it is imperative that network protocols and designs are engineered by jointly optimizing across the layers (cross-layer design), which usually results in a clean-slate protocol architecture. In particular, the objective of cross-layer design is not the elimination of the layered architecture itself. Instead, it is the foundation to understand, in a conceptually simple way, the complexities of network architectures: “who does what” and “how to connect them.” We will focus on several interesting cross-layer optimization schemes and algorithms like the cross-layer congestion control and scheduling problem in multi-hop wireless networks in order to shed light on open research problems and new approaches.

Synopsis:
  • Seminar, Praktische Informatik, Hauptstudium.
  • 2h each week, over one semester (2 SWS).

Credits:

  • Participants who want to obtain credits (Seminarschein) for this seminar are expected to work in groups of 1-2 students. Each group must:
  • Give a 5-10 minutes elevator speech of their 1st topic.
  • Give a 75 minutes presentation of their 1st topic, followed by up to 15 minutes discussion with the audience.
  • Give a 5-10 minutes elevator speech of a 2nd topic.
  • Give a 30 minutes conference-style presentations of the 2nd topic.
Topics:
 
1. Network Utility Maximization
  • Chen, Low, Doyle - 2011 - Cross-layer design in multihop wireless networks (pdf)
  • Srivastava, Motani - 2005 - Cross-layer design a survey and the road ahead (pdf)
  • Yi, Chiang - 2010 - Stochastic Network Utility Maximization and Wireless Scheduling (pdf)
  • Chiang et al. - 2007 - Layering as Optimization Decomposition (pdf)
 
2. Horizon Queueing
  • Radunović et al. - 2008 - Horizon (pdf)
  • Bui et al. - 2009 - Novel Architectures and Algorithms for Delay Reduction in Back-Pressure Scheduling and Routing (pdf)
  • Moeller et al. - 2010 - Routing without routes (pdf)
 
3. Carrier Sense Multiple Access
  • Liew et al. - 2010 - Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks (pdf)
  • Jiang, Walrand - 2010 - A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks (pdf)
  • Jiang, Walrand - 2010 - Approaching Throughput-Optimality in Distributed CSMA Scheduling Algorithms With Collisions (pdf)
  • Ni, Srikant - 2010 - Q-CSMA Queue-Length Based CSMACA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks (pdf)
  • Xu, Dousse, Thiran - 2010 - Self-synchronizing properties of CSMA wireless multi-hop networks (pdf)
  • Aziz et al. - 2009 - EZ-Flow (pdf)
  • Sridharan et al. - 2009 - Investigating Backpressure-based Rate Control Protocols for Wireless Sensor Networks (pdf)
  • Akyol et al. - 2008 - Joint Scheduling and Congestion Control in Mobile Ad-Hoc Networks (pdf)
  • Warrier et al. - 2009 - DiffQ Practical Differential Backlog Congestion Control for Wireless Networks (pdf)
 
4. Link Level Measurements in Wireless Mesh Networks
  • Aguayo et al. - 2004 - Link-level measurements from an 802.11b mesh network (pdf)
  • Chebrolu, Raman, Sen - 2006 - Long-distance 802.11b links (pdf)
  • Gokhale et al. - 2008 - On the Feasibility of the Link Abstraction in (Rural) Mesh Networks
  • (pdf)
  • Halperin et al. - 2010 - Predictable 802.11 packet delivery from wireless channel measurements
  • (pdf)
  • Lee et al. - 2008 - Understanding Interference and Carrier Sensing in Wireless Mesh Networks (pdf)
  • TINNIRELLO et al. - 2009 - On the side-effects of proprietary solutions for fading and interference mitigation in IEEE 802.11bg outdoor links (pdf)
 
5. Multi-User Diversity and Opportunistic Routing
  • Biswas, Morris - 2004 - Opportunistic routing in multi-hop wireless networks (pdf)
  • Chachulski et al. - 2007 - Trading structure for randomness in wireless opportunistic routing (pdf)
  • Gkantsidis et al. - 2007 - Multipath code casting for wireless mesh networks (pdf)
  • Radunovic et al. - 2007 - An optimization framework for practical multipath routing in wireless mesh networks (pdf)
  • Zhang, Li - 2008 - Dice (pdf)
 
6. Frequency Diversity and OFDMA
  • Chandra et al. - 2008 - A case for adapting channel width in wireless networks (pdf)
  • Rahul et al. - 2009 - Frequency-aware rate adaptation and MAC protocols (pdf)
  • Liew et al. - 2010 - Analysis of Frequency-Agile CSMA Wireless Networks (pdf)
  • Sen, Choudhury, Nelakuditi - 2010 - Listen (on the frequency domain) before you talk (pdf)
  • Tan et al. - 2010 - Fine-grained channel access in wireless LAN (pdf)
 
7. Binary Countdown
  • Roman et al. - 2011 - Scalable Cross-Layer Wireless Access Control Using Multi-Carrier Burst Contention (pdf)
  • Abichar, Chang - 2011 - A Medium Access Control Scheme for Wireless LANs with Constant-Time Contention (pdf)
  • Baccelli et al. - 2008 - An optimized relay self selection technique for opportunistic routing in mobile ad hoc networks (pdf)
 
8. Distributed Opportunistic Scheduling
  • Zheng, Ge, Zhang - 2007 - Distributed opportunistic scheduling for ad-hoc communications (pdf)
  • Zheng, Ge, Zhang - 2009 - Distributed Opportunistic Scheduling for Ad Hoc Networks With Random Access An Optimal Stopping Approach (pdf)
 
9. Full Duplex Communication
  • Radunovic et al. - 2009 - Effciency and Fairness in Distributed Wireless Networks Through Self-interference Cancellation and Scheduling (pdf)
  • Choi et al. - 2010 - Achieving single channel, full duplex wireless communication (pdf)
  • Sen, Roy Choudhury, Nelakuditi - 2010 - CSMA/CN (pdf)
  • Halperin, Anderson, Wetherall - 2008 - Taking the sting out of carrier sense (pdf)
 
0. Misc
  • Dutta et al. - 2009 - SMACK (pdf)
  • Jamieson, Balakrishnan - 2007 - PPR (pdf)
  • Rahul, Hassanieh, Katabi - 2010 - SourceSync (pdf)
  • Wu et al. - 2010 - Side channel (pdf)
  • Jose, Vishwanath - 2010 - Distributed Rate Allocation for Wireless Networks (pdf)
  • Le, Modiano, Shroff - 2010 - Optimal Control of Wireless Networks with Finite Buffers (pdf)
  • Shao et al. - 2010 - Cross-layer Optimization for Wireless Networks with Deterministic Channel Models (pdf)
  • Ying, Shakkottai, Reddy - 2009 - On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks (pdf)

Presentation assignments:

Date

Presenter 

Topic

Slides
       
       
       
       
       
       
       
       
       
       
       
       
       
       
       
       
 Links
Conference
MobiCom 2006
Conference
MobiHoc 2006
Conference
MobiSys 2006
Conference
OpComm 2006
Conference
SigComm/HotNets
Conference
IPTPS 2006
Conference
WCNC 2006
IETF
MANET
Project
Berlin Roof Net
Project
MIT RoofNet


Further (suggested) Readings:


Legal disclaimer. .  © 2024 Humboldt-Universität zu Berlin, Computer Science Department, Systems Architecture Group. Contact: sar@informatik.hu-berlin.de .