Algorithms for Computer Networks (Sommer 2017)

News

• 28.06.2017: Block seminar times have been assigned
• 18.05.2017: Kickoff times have been assigned
• 10.05.2017: 10-12, room 051-00-031. Assignment of topics
• 26.04.2017: 10 am, room 051-00-031. First meeting and presentation of topics
• 20.04.2017: ILIAS-page is online
• 18.04.2017: Website online

Dates

• 26.04.2017: 10 am, room 051-00-031. First meeting and presentation of topics
• 31.05.2017 Kickoff presentations
• 14.06.2017 Kickoff presentations
• 21.06.2017 Kickoff presentations
• 12.07.2017 Deadline for report
• 31.07.2017 9:15-17:15 block seminar in 101-01-018
• 01.08.2017 9:15-12:15 block seminar in room 101-01-018

Contents

We discuss up-to-date topics of distributed algorithms, cryptography, coding theory, and wireless communication.

1. Multi-Robot-Exploration
   1. Pierre Fraigniaud, Leszek Gasieniec, Dariusz, R.Kowalski and Andrzej Pelc. Collective tree exploration. Netw., 48:166–177, October 2006.
   2. Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, and Przemyslaw Uznanski. Fast Collaborative Graph Exploration. In Automata, Languages, and Programming, volume 7966 of Lecture Notes in Computer Science, pages 520–532. Springer Berlin Heidelberg, 2013.
2. Localization
   1. Wan, Eric A., and Rudolph Van Der Merwe. "The unscented Kalman filter for nonlinear estimation." Adaptive Systems for Signal Processing, Communications, and Control Symposium 2000. AS-SPCC. The IEEE 2000.
   2. Rui Zhang, Fabian Höflinger, and Leonhard Reindl, Member, TDOA-Based Localization Using Interacting, Multiple Model Estimator and Ultrasonic Transmitter/Receiver, IEEE Trans. on Instrumentation and Measurement, VOL. 62, NO. 8, AUGUST 2013 2205
   3. Eren, Tolga, et al. "Rigidity, computation, and randomization in network localization." INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies. Vol. 4. IEEE, 2004.
   4. Dokmanić, Ivan, et al. “Acoustic Echoes Reveal Room Shape.” Proceedings of the National Academy of Sciences of the United States of America, vol. 110, no. 30, 2013, pp. 12186–12191., www.jstor.org/stable/42712566.
   5. Dokmanic, Ivan, et al. "Euclidean distance matrices: essential theory, algorithms, and applications." IEEE Signal Processing Magazine, 32.6 (2015): 12-30.
3. Cryptographic Protocols for Online Card Games
   
   1. A. Barnett and N.P. Smart. Mental Poker Revisited. In Cryptography and Coding 2003, Lecture Notes in Computer Science 2898, pp. 370–383, 2003. 
   2. Stamer, Heiko. "Efficient Electronic Gambling: An Extended Implementation of the Toolbox for Mental Card Games." WEWoRC 74 (2005): 1-12.
4. MIMO
   1. Asgeirsson, Eyjólfur I., Magnús M. Halldórsson, and Pradipta Mitra. "Maximum MIMO Flow in wireless networks under the SINR model." Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), 2014 12th International Symposium on. IEEE, 2014.
   2. M. Sharif and B. Hassibi, "On the capacity of MIMO broadcast channels with partial side information," in IEEE Transactions on Information Theory, vol. 51, no. 2, pp. 506-522, Feb. 2005.
   3. Shuguang Cui, A. J. Goldsmith and A. Bahai, "Energy-efficiency of MIMO and cooperative MIMO techniques in sensor networks," in IEEE Journal on Selected Areas in Communications, vol. 22, no. 6, pp. 1089-1098, Aug. 2004.
5. Social bots
   1. BESSI, Alessandro; FERRARA, Emilio. Social bots distort the 2016 U.S. Presidential election online discussion. First Monday, [S.l.], nov. 2016. ISSN 13960466.
   2. Varol, Onur, et al. "Online human-bot interactions: Detection, estimation, and characterization." arXiv preprint arXiv:1703.03107 (2017).
6. Distributed Gossip and Consensus
   1. Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006). Randomized gossip algorithms. IEEE/ACM Transactions on Networking (TON), 14(SI), 2508-2530.
   2. Kar, S., & Moura, J. M. (2009). Distributed consensus algorithms in sensor networks with imperfect communication: Link failures and channel noise. IEEE Transactions on Signal Processing, 57(1), 355-369.
7. Cryptographic protocols

   1. D. J. Bernstein. ChaCha, a variant of Salsa20. Document ID: 4027b5256e17b9796842e6d0f68b0b5e. URL: http://cr.yp.to/papers.html#chacha. Date: 2008.01.28.

   2. BLAKE2, https://blake2.net

   3. WireGuard: Next Generation Kernel Network Tunnel, Jason A. Donenfeld, White Paper, url: https://www.wireguard.io/papers/wireguard.pdf. 2017

   4. Young, Adam, and Moti Yung. "The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone?." Annual International Cryptology Conference. Springer Berlin Heidelberg, 1996.

Deliverables

For a successful participation you have to 

1. Give a 15 minute kickoff presentation (1/6)
2. Write a written (max) 5 page report until 12.07.2017 and upload it using ILIAS (1/6)
3. Give a 30 minute final presentation during the block seminar (1/2)
4. Survive the 15 minute discussion after your presentation (1/6)

All presentations will be recorded and will be made accessible to the participants. 

Organisation

Registration online with the University system before and after the presentation of topics. Please register also with ILIAS.

Seminar

• Registration and kickoff presentations, Wednesday, 10-12, 051-00-031
• Block seminar 31.07./01.08.2017 in 101-01-018.