Recent Changes - Search:

HomePage

Menu

Site Map

Fall 2015

Lectures.Fall2015 History

Hide minor edits - Show changes to markup

Changed line 63 from:
  • [December 8] Paper presentation by students (cont'd)
to:
  • [December 8] Paper presentation by students (cont'd) (Class begins at 1 pm)
Changed line 61 from:
  • [December 1] No class
to:
  • [December 1] No class (Visit from IITP to check the progress of Resilient CPS Research Center)
Changed lines 61-62 from:
  • [December 1] Routing in wireless networks
  • [December 3] Paper presentation by students
to:
  • [December 1] No class
  • [December 3] Routing in wireless networks and paper presentation by students (Class begins at 1 pm)
Changed line 61 from:
  • [December 1] Routing in wireless networks (cont'd)
to:
  • [December 1] Routing in wireless networks
Changed lines 59-60 from:
  • [November 24] Fixed point analysis of IEEE 802.11 DCF (cont'd)
  • [November 26] Routing in wireless networks
to:
  • [November 24] Fixed point analysis of IEEE 802.11 DCF (cont'd) and routing in wireless networks
  • [November 26] No class (Civil Defense)
Changed lines 26-27 from:
  • Reading assignment 2: Summarize the key differences between the single-hop model in "On the capacity of wireless CSMA/CA multihop networks" and that in the paper by G. Bianchi (December 3).
  • Homework: Submit your summary why two-hop relay is better than direct communication in mobile ad hoc networks (December 3).
to:
  • Reading assignment 2: Summarize the key differences between the single-hop model in "On the capacity of wireless CSMA/CA multihop networks" and that in the paper by G. Bianchi (December 10).
  • Homework: Submit your summary why two-hop relay is better than direct communication in mobile ad hoc networks (December 10).
Changed lines 26-27 from:
  • Reading assignment 2: Summarize the key differences between the single-hop model in "On the capacity of wireless CSMA/CA multihop networks" and that in the paper by G. Bianchi (December 3).
  • Homework: Submit your summary why two-hop relay is better than direct communication in mobile ad hoc networks (December 3).
to:
  • Reading assignment 2: Summarize the key differences between the single-hop model in "On the capacity of wireless CSMA/CA multihop networks" and that in the paper by G. Bianchi (December 3).
  • Homework: Submit your summary why two-hop relay is better than direct communication in mobile ad hoc networks (December 3).
Added lines 26-29:
  • Reading assignment 2: Summarize the key differences between the single-hop model in "On the capacity of wireless CSMA/CA multihop networks" and that in the paper by G. Bianchi (December 3).
  • Homework: Submit your summary why two-hop relay is better than direct communication in mobile ad hoc networks (December 3).
    • Hint: Find "interference-limited" and "distance-limited" in this paper
  • Homework: Carry out simulation of the Bianchi's model when m = 1 with small numbers of the backoff window size (due: Before the final exam).
Changed lines 49-50 from:
  • [November 5] Switch architecture and switching algorithms
  • [November 6] Wireless scheduling (makeup class)
to:
  • [November 5] No class
  • [November 6] Switch architecture and switching algorithms (makeup class)
Changed lines 52-57 from:
  • [November 12]
  • [November 17]
  • [November 19]
  • [November 24]
  • [November 26]
  • [December 1]
to:
  • [November 12] Wireless scheduling
  • [November 17] Wireless scheduling (cont'd) and performance analysis of IEEE 802.11 DCF
  • [November 19] Fixed point analysis of IEEE 802.11 DCF
  • [November 24] Fixed point analysis of IEEE 802.11 DCF (cont'd)
  • [November 26] Routing in wireless networks
  • [December 1] Routing in wireless networks (cont'd)
Changed lines 58-60 from:
  • [December 3]
  • [December 8]
  • [December 10]
to:
  • [December 3] Paper presentation by students
  • [December 8] Paper presentation by students (cont'd)
  • [December 10] Paper presentation by students (cont'd)
Changed lines 51-52 from:
  • [November 3] No class (2015 MathWorks Asian Research Faculty Summit)
to:
  • [November 10] No class (2015 MathWorks Asian Research Faculty Summit)
  • [November 12]
  • [November 17]
  • [November 19]
  • [November 24]
  • [November 26]
  • [December 1]
  • [December 3]
  • [December 8]
  • [December 10]
  • [December 15] Final exam
Added line 51:
  • [November 3] No class (2015 MathWorks Asian Research Faculty Summit)
Added line 50:
  • [November 6] Wireless scheduling (makeup class)
Changed lines 46-47 from:
to:
  • [October 27] Capacity of wireless networks
  • [October 29] Understanding the capacity-delay tradeoff in wireless networks
  • [November 3] No class (ACM SenSys 2015)
  • [November 5] Switch architecture and switching algorithms
Changed line 66 from:
  • Ye Tian, Kai Xu, and Nirwan Ansari, "TCP in wireless environments: Problems and solutions," IEEE Communications Magazine, vol. 43, no. 3, March 2005.
to:
  • Ye Tian, Kai Xu, and Nirwan Ansari, "TCP in wireless environments: Problems and solutions," IEEE Communications Magazine, vol. 43, no. 3, March 2005.
Changed line 38 from:
  • [September 29] No class (Chuseok (민족최대의 명절인 추석))
to:
  • [September 29] No class (Chuseok (민족최대의 명절인 추석 연휴))
Added lines 44-46:
  • [October 15] Rate control and power control
  • [October 20] Midterm exam
Changed line 40 from:
  • [October 5] Special lecture on battery management of smart devices by [https://sites.google.com/site/khanleepage/| Prof. Kyunghan Lee at UNIST]
to:
  • [October 5] Special lecture on battery management of smart devices by Prof. Kyunghan Lee at UNIST
Changed line 40 from:
  • [October 5] Special lecture on battery management of smart devices by Prof. Kyunghan Lee at UNIST
to:
  • [October 5] Special lecture on battery management of smart devices by [https://sites.google.com/site/khanleepage/| Prof. Kyunghan Lee at UNIST]
Changed lines 38-43 from:
to:
  • [September 29] No class (Chuseok (민족최대의 명절인 추석))
  • [October 1] Transmission opportunity and throughput with carrier sensing
  • [October 5] Special lecture on battery management of smart devices by Prof. Kyunghan Lee at UNIST
  • [October 6] Medium access control - Backoff mechanism
  • [October 8] No class
  • [October 13] Backoff mechanism and fairness issues
Added lines 37-38:
  • [September 24] Medium access control - Virtual CS
Changed line 36 from:
to:
  • [September 22] No class
Changed line 25 from:
  • Homework: In each case of the slotted and unslotted basic MAC protocols, calculate the optimal value of n (number of hosts) that attains the maximum throughput when the channel access probability p is fixed (due: September 29).
to:
  • Homework: In each case of the slotted and unslotted basic MAC protocols, calculate the optimal value of n (number of hosts) that attains the maximum throughput when the channel access probability p is fixed (due: October 1).
Added lines 25-26:
  • Homework: In each case of the slotted and unslotted basic MAC protocols, calculate the optimal value of n (number of hosts) that attains the maximum throughput when the channel access probability p is fixed (due: September 29).
Changed line 33 from:
  • [September 18] Collision avoidance ( makeup class)
to:
  • [September 18] Collision avoidance (makeup class)
Changed lines 31-33 from:
to:
  • [September 15] Carrier sense
  • [September 17] Tradeoff between carrier sense and transmit power
  • [September 18] Collision avoidance ( makeup class)
Changed line 24 from:
to:
  • Reading assignment 1: Compare the key idea in "No time to countdown: Migrating backoff to the frequency domain" with the basic backoff mechanism in the Bianchi's paper. Please submit an one-page summary (due: September 24).
Changed lines 27-29 from:
to:
  • [September 1] Introduction to physical layer issues
  • [September 3] Introduction to physical layer issues (cont'd)
  • [September 8] Medium access control - Basic MAC protocol
  • [September 10] Medium access control - Slotted and unslotted accesses, slot size selection
Added lines 35-48:

CSMA

  • S. Sen, R. R. Choudhury, and S. Nelakuditi, "No time to countdown: Migrating backoff to the frequency domain," ACM MobiCom 2011, Las Vegas, Nevada, USA, September 2011.

Network capacity

  • P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. on Information Theory, vol. 46, no. 2, March 2000.
  • A. E. Gamal, J. Mammen, B. Prabhakar, and D. Shah, "Throughput-delay trade-off in wireless networks," IEEE INFOCOM 2004.
  • P. Kyasanur and N. Vaidya, "Capacity of multi-channel wireless networks: Impact of number of channels and interfaces," ACM MobiCom 2005.

Performance analysis of IEEE 802.11 DCF

  • G. Bianchi, "Performance analysis of the IEEE 802.11 distributed coordination function," IEEE J. Select. Areas. Commun., vol. 18, pp. 535-547, Mar. 2000.
  • E. Ziouva and T. Antonakopoulos, "CSMA/CA performance under high traffic conditions: throughput and delay analysis," Computer Communications, vol. 25, pp.313-321, 2002.
  • K. Duffy, D. Malone, and D. J. Leith, "Modeling the 802.11 distributed coordination function in non-saturated conditions," IEEE Communications Letters, vol. 9, no. 8, Aug 2005.
  • Rafael Laufer and Leonard Kleinrock, "On the capacity of wireless CSMA/CA multihop networks," IEEE INFOCOM 2013, Turin, Italy, April 2013.

TCP

  • A. Afanasyev, N. Tilley, P. Reiher, and L. Kleinrock, "Host-to-host congestion control for TCP," IEEE Communications Surveys & Tutorials, vol. 12, no. 3, 2010.
  • Ye Tian, Kai Xu, and Nirwan Ansari, "TCP in wireless environments: Problems and solutions," IEEE Communications Magazine, vol. 43, no. 3, March 2005.
Added lines 1-30:
History - Print - Recent Changes - Search
Page last modified on December 03, 2015, at 07:49 PM EST