Instructions/Lectures

1. Introduction: Problem and problem solving, Algorithms, complexity analysis etc.
2. How to write algorithms: pseudocodes (using elementary addition algorithm)
3. Sorting algorithms
4. Complexity Analysis of Insertion Sort.
5. Asymptotic Behavior of Algorithms
6. Asymptotic Efficiency of Algorithms: Formal and mathematical definitions and properties.
7. Methods for asymptotic analysis: tight bound, upper bound, lower bound etc.
8. Comments on growth functions, bounding summations, recurrences, graphs, trees, etc.
9. Introduction to Wireless Communication
10. Ad Hoc Networks: definition, application scenarios, challenges (energy conservation, scalability, etc.)
11. Wireless Sensor Networks: definition, application scenarios, challenges, comparison of Ad hoc and WSN, etc.
12. Introduction to Wireless Computational Models
13. Modeling Wireless Channels
14. Free Space Propagation and Two-ray Ground Models
15. Log-Distance Path Model
16. Comments on: Large and Small Scale Variations, probabilistic models, multipath fading models, etc.
17. Communication Graphs: location of nodes, functions, etc. in d-dimensional space.
18. Range assignments and maximum transmitting ranges.
19. Radio coverage in one-, two-, and three-dimensional Networks.
20. Energy Consumption Model, energy costs, etc.
21. Some Comments on Mobility Computational Models: Brownian motion, Map-like motion etc.
22. Building Graphs for wireless networks, energy conservation technique, Direct path or Mulihop path (Lemma).
23. Communication Graph and Network Capacity
24. Interference regions and ranges. [Gupta and Kumar 2000]
25. Introduction to Graph Theory: Advanced perceptive.
26. The Range Assignment Problem: background, problem definition etc.
27. Range assignment problem in one-dimensional network [Kirousis et al. 2000]
28. Range assignment Incremental Cost.
29. Recursive Assumption, algorithm, complexity.
30. Range Assignment Problem in Two-dimensional network.
31. RA is NP-hard in 2- and 3-dimensions, approximation algorithm for two-dimensional network.
32. A 2-approximation of the optimal solution: Lemma ? of Kirousis et al. [Not Included in the tests or final]
33. Conclusion: Some more comments on problem and problem solving, Comments on inductive reasoning, problem or statement formulation, two working examples.

1. Thomas Cormen,  Charles Leiserson,  Ronald Rivest, and  Cliff Stein,  Introduction to Algorithms, McGraw Hill Publishing Company and MIT Press, 2001 (2nd Edition).
2. Theodore Rappaport, Wireless Communications: Principles and Practice, Prentice Hall, 2002 (2nd Edition). ISBN: 0130422320.
3. Lefteris M. Kirousis , Evangelos Kranakis , Danny Krizanc , Andrzej Pelc, "Power consumption in packet radio networks", Theoretical Computer Science, Vol. 243, No. 1-2, pp. 289-305, July 28, 2000.