NSF Workshop on Low-Latency Wireless Random-Access
Thursday, November 2 + Friday, November 3, 2017
Grier Room, 50 Vassar Street, Building 34-401
Thursday, November 2, 2017
8:00-9:00 AM Registration + Pastries
IOT: INDUSTRY AND SYSTEMS
9:00-9:25 AM Christophe Fourtet (SigFox)
SDR cognitive networks – The future of massive IoT
9:25-9:50 AM Mérouane Debbah (Huawei)
Cellular IoT: Opportunities and Challenges
9:50-10:15 AM Swarun Kumar (Carnegie Mellon University)
Enabling City-Scale Communication and Services for Low-Power Devices
10:15-10:40 AM Piyush Gupta (Qualcomm)
Massive Wide-Area Internet of Things: Some Design and Performance Aspects
10:40-11:05 AM DISCUSSION
11:00 AM – 12:30 PM Break and Lunch
RELIABILITY IN MULTIPLE-ACCESS COMMUNICATION
12:30-12:55 PM Dariush Divsalar (NASA JPL)
Low Rate LDPC Codes
12:55-1:20 PM Slawomir Stanczak (Fraunhofer HHI)
Harnessing Channel Collisions for Enabling Low-Latency Wireless Random Access: From Theory to Practice
1:20-1:45 PM Petar Popovski (Aalborg University)
Revising the Problem of Access Protocols in Ultra-Reliable Wireless Communications
1:45-2:10 PM Gianluigi Liva (German Aerospace Center)
Advances in Random Access Protocols for Satellite Communications
2:10-2:30 PM DISCUSSION
2:30-3:00 PM Afternoon Coffee Break
INFORMATION THEORY I
3:00-3:25 PM Dongning Guo (Northwestern)
Wireless node identification: Fundamental limits and practical design
3:25-3:50 PM Yury Polyanskiy (MIT)
Energy-per-bit in wireless multiple-access
3:50-4:15 PM Or Ordentlich (Hebrew University)
Low Complexity Schemes for the Random-Access Channel via Structured Codes
4:15-4:40 PM Krishna Narayanan (Texas A&M)
Coding Schemes for the Uncoordinated Unsourced Multiple Access Gaussian Channel
4:40-5:00 PM DISCUSSION
5:00-6:00 PM RECEPTION and light snacks, LIDS Lounge 32-D 6th floor
Friday, November 3, 2017
8:00-8:30 AM Pastries
LOW-LATENCY COMMUNICATION
8:30-8:55 AM Vincent Tan (National University of Singapore)
An Exact Spectrum Formula for the Maximum Size of Finite Length Block Codes
8:55-9:20 AM Albert Guillén i Fàbregas (ICREA and Universitat Pompeu Fabra)
The Meta-Converse and Perfect Codes
9:20-9:45 AM Gonzalo Vazquez Vilar (Universidad Carlos III de Madrid)
Computing the Meta-Converse Bound: A Saddlepoint Approximation of Hypothesis Testing
9:45-10:10 AM Tobias Koch (Universidad Carlos III de Madrid)
Normal approximations for fading channels
10:10-10:30 AM DISCUSSION
10:30 AM – 11:00 AM Morning Coffee Break
INFORMATION THEORY II
11:00-11:25 AM Victoria Kostina (CalTech)
An information-theoretic approach to random access
11:25-11:50 AM Uri Erez (Tel Aviv University)
Probability that the equal-rate capacity and sum-capacity of a MAC coincide
(or nearly so): non-asymptotic bounds
11:50-12:15 AM Ayfer Özgür (Stanford University)
Sparse Group Testing Codes for Low-Energy Massive Multiple Access
12:15-12:30 PM DISCUSSION
12:30-1:30 PM Lunch
MASSIVE MULTIPLE-ACCESS
1:30-1:55 PM Giuseppe Caire (TU Berlin)
Fog massive MIMO with on-the-fly pilot contamination control
1:55-2:20 PM Giuseppe Durisi (Chalmers University)
Short packets over fading channels: pilot-assisted or noncoherent transmission?
2:20-2:45 PM Wei Yu (Univerity of Toronto)
Massive Device Connectivity with Massive MIMO
2:45-3:10 PM Wei Yang (Qualcomm)
Privacy amplification for low-latency physical-layer security
3:10-3:30 PM DISCUSSION
