CS547 Wireless Networking

Course Overview

Ubiquitous access to information, anywhere, anyplace, and anytime, will characterize whole new kinds of information systems in the 21st Century. These are being enabled by rapidly emerging wireless communications systems. These systems have the potential to dramatically change society as workers become "untethered" from their information sources and communications mechanisms. This course introduces cellular networks, ad hoc wireless networks, and wireless sensor networks. It explains in detail and depth the design and optimizations of these wireless communications networks. As an advanced graduate course, this one will combine extensive reading and discussion of the research literature with in-depth research. As prerequisites, the students should have basic knowledge of various wireless systems, fundamentals of graph theory, algorithm designs, geometry, and probability.

Instructor

Dr. Peng-Jun Wan, Email: wan@cs.iit.edu. Office hours: 4:25-6:25pm Tuesdays, Sturt Building 236F.

Teaching Assistant

Xiaohua Xu, Email: xxu23@iit.edu. Office hours: 9:00-11:00am Wedensdays, Sturt Building 019.

Grading

Homework: 50%, Midterm Exam: 20%, Final Exam: 30%.

Textbooks and Readings

There is no textbook for this course. The instructor will provide the lecture notes to the students. Related papers will also be posted on the web.

Outline

Signal-to-Interference Ratio

• Path Loss Model
• Cells and Voronoi Diagram
• Monotonic Property of SIR
• Extremes of SIR

Wireless Ad Hoc/Sensor Networks

• Connectivity and Range Assignment
• Energy-Efficient Routing
• Maximum-Life Power Scheduling
• Distributed Construction and Maintenance of Virtual Backbone
• Minimum-Latency Communication Scheduling

Cellular Networks

• Cellular Concept and Architecture
• Cellular Hexagonal Geometry
• Homogeneous Channel Assignment Subject to Co-channel Separation
• Tiling with Maximal Co-channel Separation
• Maximal Adj-Channel Separation subject to Co-Channel Separation
• Heterogeneous Channel Assignment

Lecture Notes and Paper Readings:

1. Lecture Note 1: Signal-to-Interference Ratio (slides)
• F. Aurenhammer, Voronoi diagrams-- a survey of a fundamental geometric data structure, ACM Computing Surveys, 1991, 345--405.
• Review the applications described in Eppstein's Voronoi Diagram's Page.
2. Lecture Note 2: Connectivities And Power Assignment (slides)
   • Readings on connectivity of graph theory: Chapters 1 anf 3 of the book Graph Theory, by Reinhard Diestel.
3. Lecture Note 3: Energy-Efficient Routing (slides)
• C. Ambuhl, An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks, , In Proceedings of 32th International Colloquium on Automata, Languages and Programming (ICALP), pages 1139-1150.
• P.-J. Wan, G. Calinescu, and C.-W. Yi, Minimum-Power Multicast Routing in Static Ad Hoc Wireless Networks, , IEEE/ACM Transactions on Networking, Volume 12 , Issue 3 (June 2004), pp. 507-514.
4. Lecture Note 4: Maximum-Life Power Scheduling (slides)
5. Lecture Note 5: Virtual Backbone: Connected Dominating Set (slides)
6. Lecture Note 6: Minimum-Latency Beaconing Scheduling (slides)
7. Lecture Note 7: Minimum-Latency Broadcast Scheduling (slides)
8. Lecture Note 8: Minimum-Latency Collection Scheduling (slides)
9. Lecture Note 9: Minimum-Latency Gossip Scheduling (slides)
10. Lecture Note 10: Cellular Networks (slides)
11. Review (slides)

Assignments

1. Assignment 1 sample solution
2. Assignment 2 sample solution
3. Assignment 3 sample solution

Final Exam

Final Exam (taken-home) (.pdf)