Mobile Computing for IEEE 802

The third assignment is due on December 07. Note that we will test all algorithms agains each other and the best performing algorithm will win a nice price!

category: course, HS2011    

Hi – I just uploaded the final assignment, number 3. Also, the material for the rest of the class, chapter 3…6 are now available. All documents can be downloaded from the class webpage. I will send the material later today via email to those of us who do not have the nethz account.

category: course, HS2011    

I just published assignment #02 at the course webpage. It can be downloaded from here. This second assignment will be due Nov.-15. It is much more complex than the first assignment. Students should start early and work in groups of two to solve the assignment.

category: course, HS2011    

I just uploaded an updated appendix 02: http://www.lst.inf.ethz.ch/teaching/lectures/hs11/293/material/Appendix%2002%20-%20MobileComputingForIEEE802WirelessNetworks.pdf . I am planning to discuss it today.

category: HS2011    

Hi – When talking about the first assignment, I asked all of you to later submit individual results, one homework per student. Please do this independently of each other. However, before creating the submission you have to go through some pain of installing and understanding the tools. For this initial phase, please feel free to work together and help each other. I didn’t mean to request that you do all the installation work without sharing hints and tips with each other. I will emphasize this also on Monday. Enjoy working with tool!!!

category: HS2011, tool    

I just posted the chapter 1 and 2, the three appendices, and the first assignment to the class URL. Please check here for the downloads and here for the class assignment. The first assignment will be due on Oct-17.

category: course, HS2011    

Dear students, welcome to another exciting round of mobile computing. We will start our class on Monday, Sep-26. More details can be found on the course homepage (2011). Please consider subscribing to this blog for latest news. The class material (PDF files) will be populated on the course homepage.

category: course, HS2011    

Dear students – we are entering now the tournament round! Its great to see thirteen excellent candidates. One will be the winner soon! Please check and review the algorithm names in the list below. In case you think I am missing one, please let me know immediately. I gave all algorithms a number for easier setup in the XML Scenario file. Other than that the numbers do not mean anything for the final ranking.

01_PrisonBreak
02_HansMoleman
03_Porsche
04_Phyona
05_RandHyp
06_MaxHavelaar
07_dot11k
08_Buzzy
09_MWWUMAFMNW
10_SILVIA
11_MAC
12_SpeedyGonzales
13_YAMACA

category: course, HS2010    

We will discuss the concept of confidence in scientific results on Monday. Unfortunately so far we did not ind time to discuss it. For those of you who will need more time to finish this part of the final assignment #03, I can offer to submit it a few days later (Thursday afternoon would be great). For Monday, at the minimum your current implementation of the algorithm should be submitted so that I can prepare the comparison and tournament. Also, please do not forget to provide a meaningful name that can be used in the XML scenario description.

category: course, HS2010    

note that for assignment #03, when simulating with “saturation”, the queue size cannot be used as indicator for the current congestion. This parameter is never larger than 1 with this traffic generator. Use “data” instead and improve gradually, or other control parameters (throughput, delay, collision number).

category: course, HS2010