Course program
Resource Allocation Policies (e.g., frequency management)
• Partitioning vs. Sharing: Whether resources are divided or shared among users.
• Open vs. Closed Systems: Accessibility of systems to multiple users or networks.
• Coexistence and Cooperation Between Systems: Techniques to allow multiple systems to function simultaneously.
• Orthogonal, Quasi-Orthogonal, and Non-Orthogonal Resource Sharing: Different levels of separation in resource allocation to reduce interference.
Multi-User Communication Systems (MU)
• Orthogonal Multiplexing Techniques across:
o Time: TDMA (Time Division Multiple Access)
o Frequency: FDMA (Frequency Division Multiple Access)
o Code: CDMA (Code Division Multiple Access)
o Space: SDMA (Spatial Division Multiple Access)
o Single-carrier and multi-carrier systems: e.g., OFDMA (Orthogonal Frequency Division Multiple Access)
• Impulse Radio Systems:
o DS-IR (Direct Sequence)
o TH-IR (Time Hopping)
• Access and Synchronization Linkage
• Communication Architectures:
o Traditional FDD (Frequency Division Duplexing)
o TDD (Time Division Duplexing)
o Full-Duplex systems
• Interference Models and Performance Analysis:
o Standard Gaussian Approximation
o Pulse Collision Models
o Theoretical Performance: Channel capacity in MU systems
• Interference Management and Cancellation
• Non-Orthogonal Multiple Access (NOMA) Techniques
The Wireless Channel
• Characterization of Time-Varying and Frequency-Selective Channels:
o Coherence time, coherence bandwidth
o Mobility and Doppler effect
• Statistical Models:
o Path loss and fading
• Power Delay Profile
• Channel State Information (CSI): Acquisition and Management
• Channel-Based User Selection
• Multi-User Channel: Spatial Coherence
Statistical Models for Access Systems
• Birth and Death Processes:
o Pure birth, pure death processes
o Poisson processes (constant and variable rates)
o First and second-order moments, inter-arrival time distribution
• Markov Processes and Chains:
o Definitions and characteristics
o State probabilities, state transition probabilities, diagrams
o Homogeneous and stationary chains
o Periodic/aperiodic, null/non-null recurrent, ergodic chains
• Queueing Theory:
o Queue system definition and classification
o Steady-state probabilities and conditions
o Examples: M/M/1, M/M/1/k queues
Resource Allocation
• Random Access:
o ALOHA, Slotted ALOHA and its stabilization
o Capture effect, CSMA (Carrier Sense Multiple Access)
o Hidden and exposed terminal problems
o Handshaking, MACA (Multiple Access with Collision Avoidance)
• Scheduled Access (Scheduling):
o Centralized and distributed polling
o Average system and queue time
o Average number of packets in system and queue
o Impact of service and arrival time statistics on performance
Resource Management in Open Systems: Coexistence and Cognitive Networks
• Individual and Cooperative Spectrum Sensing
• Pilot Channels and Inter-System Communication
• Cognitive Routing
• AI and Machine Learning in Radio Emission Classification
MAC Standards for Wireless Networks:
o IEEE 802.11 (Wi-Fi), 802.15.1 (Bluetooth), 802.15.3, 802.15.4 (Zigbee)
o 3GPP standards (4G, 5G, 6G)
Prerequisites
Fundamentals of signal theory, signal processing, and communication theory
Books
Lecture notes prepared by the instructors as part of the monograph "Wireless Access in Communication Networks".
Scientific articles for further study selected by the instructors.
Teaching mode
The course is structured in lectures that treat course topics, combining an accurate analytical description of each topic with examples of use of studied techniques and protocols in both existing networks and new networks currently being developed. Lectures introducing each topic are complemented by lectures in which the topic is analyzed as part of design and dimensioning of a wireless network. Active participation by students to such lectures is highly encouraged, and intended as a mean for them to verify their comprehension of course topics.
Based on the directives provided by Sapienza during the semester, classes are held either in presence or remotely on Zoom at the link https://uniroma1.zoom.us/j/88345130247?pwd=cTViNUtaZGtDTFdBR3FrcmVsMVBiUT09
Frequency
Class attendance is optional, but highly recommended.
Exam mode
The exam consists of a written test, which involves developing a project using the simulation tools taught during the course (Matlab, Octave), and an oral exam focused on the content of the lectures and exercises conducted in class. Both parts have equal weight in determining the final grade.
Bibliography
REFERENCES
Dimitri P. Bertsekas and Robert G. Gallager, "Data Networks," (2nd edition) Prentice Hall, 1992, ISBN 0132009161
Lesson mode
The course includes traditional lectures that present the topics covered, combining an in-depth treatment of analytical aspects with examples of how the studied techniques and protocols are applied in existing and emerging wireless networks.
Each topic is introduced through theoretical lectures, followed by sessions where the topic is analyzed in the context of one or more problems related to the analysis and dimensioning of a wireless network.
Active student participation in these sessions is strongly encouraged, as it allows them to test and consolidate their understanding of the subjects covered in the course.