Intelligent Random Access for Next-Generation IoT Networks
How analytical theory and learning-based methods can work together to shape distributed access for future IoT networks.
View slides →Talks
Ideas become clearer in conversation.
Invited lectures, webinars, and research talks offer an accessible route into the questions, analytical frameworks, and design principles behind our work.
Featured talks
Where to begin.
Three recent perspectives on random access—from a unified analytical theory to intelligent design and machine-type communications.
A Unified Theory of Random Access
A common analytical foundation for understanding and optimizing random-access schemes across performance metrics.
View slides →Random Access for Machine-to-Machine Communications
Challenges, analytical foundations, and prospects for massive distributed access · IEEE Distinguished IoT Webinar.
View slides →Talk archive
Earlier perspectives.
Explore the progression of ideas across random access, network decomposition, distributed antennas, and cooperative wireless networks. Open an abstract for a concise overview.
Random Access: Packet-Based or Connection-Based?
When is connection establishment worth its additional overhead?
Read abstract
Random access may operate packet by packet or establish a connection before data transmission. Connection establishment reduces the duration of failed transmissions but introduces additional overhead. This talk examines the critical packet-transmission-time threshold above which a connection becomes beneficial and discusses its implications for machine-to-machine access design.
Optimal Network Decomposition for Next-Generation Mobile Communication Systems
A bipartite graph perspective on forming parallel wireless subnetworks.
Read abstract
Cellular networks decompose a large network according to base-station coverage, but this structure can create severe inter-cell interference as infrastructure becomes denser. The talk introduces a bipartite graph representation and formulates optimal network decomposition as a graph-partitioning problem that maximizes the number of subnetworks while bounding interference within the decomposition.
Massive Random Access: Fundamental Limits, Optimal Design, and Applications to M2M Communications
Performance limits and access optimization when massive numbers of devices contend.
Read abstract
Fixed access parameters can cause substantial degradation as the number of contending devices grows. This talk presents a node-centric model and a unified framework for characterizing the fundamental limits of random-access networks, then shows how the theory can guide access design for machine-to-machine communications.
Asymptotic Rate Analysis of Large-Scale Distributed Antenna Systems
From cellular distributed antennas to user-centric virtual cells.
Read abstract
This talk studies how downlink rates scale with large numbers of distributed base-station antennas. It compares distributed and co-located layouts, examines the cell-edge problem in multi-cell systems, and introduces user-centric virtual cells for more uniform performance.
A Coherent Theory of Random-Access Networks
Modeling service-time distributions to understand stability and performance.
Read abstract
The performance of a random-access network depends critically on the service process of each node’s queue. This talk develops a systematic framework for characterizing fundamental limits, evaluating key parameters across performance metrics, and guiding practical Wi-Fi access design.
On the Capacity of Distributed Antenna Systems
Capacity, antenna layouts, cell-edge performance, and virtual cells.
Read abstract
This talk examines uplink capacity in large-scale distributed antenna systems, including the effects of antenna layout, channel-state information, and antenna density. It shows how cellular structure can exacerbate performance disparity and how user-centric virtual cells offer a scalable alternative.
Toward a Unified Theory of Random Access
A common framework for throughput, delay, and stability in Aloha and CSMA.
Read abstract
This talk develops a common analytical framework for representative sensing-free and sensing-based protocols. By characterizing steady-state operating points as functions of network and backoff parameters, the framework supports stability analysis, performance optimization, and practical network design.
Resource Allocation in Energy-Constrained Cooperative Wireless Networks
Cross-layer resource allocation when energy changes the efficiency–fairness tradeoff.
Read abstract
Wireless networks must allocate limited power and bandwidth while meeting diverse quality-of-service requirements. This talk introduces a cross-layer framework for energy-constrained cooperative networks and shows that fairness can produce substantial throughput gains.
For publications associated with these talks, visit the complete publication list.