3526 Introduction to Algorithmic Wireless Communications - Technion

3526 Introduction to Algorithmic Wireless Communications Dudu Amzallag∗ Winter Semester 2006-7

This introductory course covers fundamental theory and design of cellular networks. The course has been designed for computer science students and emphasizes algorithms as well as problem solving techniques. Topics include 2G through 3G wireless standards, basic elements of cellular network design, short introduction to propagation, WCDMA systems, and many planning and optimization aspects of cellular networks. A state-of-the-art practical view will be presented, in a special guest lecture, by an industry leader. This special lecture will be on the second half of the course. Further details will be given later. This course is for graduate as well as good 3rd year-undergraduate students. Undergraduate courses in algorithms, probability, and a course on the theory of NP-completeness should suffice as a prerequisite information for this course. There is no official textbook in this course; However, four excellent books on wireless communication and optimization of cellular networks are of Rappaport [3], Tse & Viswanath [4], Laiho, Wacker & Novosad [2], and of Holma & Toskala [1]. Most of the practical topics presented in this course is covered by these books. The final grade will be comprised of 3 homework assignments (each is 15% of the final grade and may submitted in pairs) and a final exam (55%). A minimal grade of 56% in the final exam is necessary for getting an over in the course.

Syllabus The general tentative syllabus of the course will be as follows: 1. Introduction to wireless communication systems. Cellular telephone systems. The concept of frequency reuse. How a cellular telephone call is made? Multiple access techniques. Evolutions of wireless communication systems 1 . 2. Coping with NP-hard optimization problems in practice. Ways and techniques for coping with the NP-hardness of optimization problems in practice: easy special ∗

Time: Fridays, 11:15-13:45, L102. Email: [email protected]. Phone: 04-8294959. Among others are 2G cellular networks, evolution to 2.5G networks (TDMA standards, HSCSD for GSM, GPRS for GSM and IS-136, EDGE for GSM and IS-136, IS-95B for CDMA), and 3G networks (WCDMA (UMTS), CDMA2000, and TD-SCDMA). 1

1

cases, approximation algorithms, somewhat efficient exponential algorithms, and heuristics. Introduction to covering problems: Minimum-weight set cover the the budgeted maximum coverage problems. Access network design of B3G/4G cellular networks: Background and technological problems towards 4G; The bounded-degree minimum routing cost spanning tree problem (BDRT); An O(log n)-approximation algorithm for BDRT in compare to a family of greedy heuristics. 3. Fundamentals of cellular system design. Introduction. Frequency reuse. Channel assignment. Handover strategies: prioritizing Handovers and practical Handover considerations. Interference and system capacity: co-channel interference and system capacity, channel planning for wireless systems, adjacent channel interference, power control for reducing interferences. Improving the capacity of a network. Trunking and grade of service. 4. Frequency assignment and resource allocation problems. Introduction. Frequency assignment/channel allocation strategies. Basic tools in graph coloring: Algorithms for graph coloring (family of greedy algorithms and DSATUR), List coloring and choosability (in particular in trees and planar graphs), T-coloring, set coloring, and their extensions. Channel assignment in reuse-2 hexagonal graphs. 5. Introduction to mobile radio propagation. Introduction to radio wave propagation. Free space propagation model. Selected mechanisms for basic propagation. Reflection. Ground reflection (two-ray) model. Diffraction. Scattering. Practical link budget design using path loss models. Outdoor propagation models. Indoor propagation models. Ray tracing and site specific modeling. 6. Introduction to WCDMA (UMTS). Introduction and overview. Spreading and despreading. Multipath radio channels and Rake reception. Power control. Softer and soft handoff. 7. Radio network planning & optimization. Introduction to radio network planning and optimization. Dimensioning: radio link budgets, load factors, capacity upgrade paths, soft capacity. Capacity and coverage planning and optimization. Capacity versus coverage. Cell planning problems. The minimum-cost cell planning problem. Cell planning under budget limitation. Approximating cell planning problems. Special session: optimization towards fourth generation (4G). 8. Selected topics in radio resource management (RRM) † .

References [1] H. Holma and A. Toskala (editors). WCDMA for UMTS. John Wiley & Sons, Ltd, third edition, 2004. †

This subject will be taught as time will permit.

2

[2] J. Laiho, A. Wacker, and T. Novosad. Radio Network Planning and Optimisation for UMTS. John Wiley & Sons, 2001. [3] T. Rappaport. Wireless Communication: Principles and Practice. Prentice-Hall, 2nd edition, 2002. [4] D. Tse and P. Viswanath. Fundamentals of Wireless Communications. Cambridge University Press, 2005.

3